Transforming unbalanced multiway trees into a practical external data structure

DOI10.1007/BF00299632zbMath0679.68032OpenAlexW1981500574MaRDI QIDQ1822941

Patricio V. Poblete, Walter Cunto

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00299632

zbMATH Keywords

space complexityunbalanced multiway treesexternal data structuresearch time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

Fringe analysis for extquick: An in situ distributive external sorting algorithm ⋮ Page usage in a quadtree index ⋮ Unbalanced multiway trees improved by partial expansions

Cites Work

• Unnamed Item
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• The analysis of a fringe heuristic for binary search trees