Transforming unbalanced multiway trees into a practical external data structure

DOI10.1007/BF00299632MaRDI QIDQ1822941zbMATH OpenOpenAlexFDO

Authors Walter Cunto, Patricio V. Poblete

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)

Recommendations

• Unbalanced multiway trees improved by partial expansions
• Multidimensional balanced binary trees
• scientific article; zbMATH DE number 1754613
• scientific article; zbMATH DE number 3845065
• A new approach to operating with undirected trees
• Load balanced tree embeddings
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
• On balanced versus unbalanced computation trees

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• The analysis of a fringe heuristic for binary search trees

Cited in

(3)

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

This page was built for publication: Transforming unbalanced multiway trees into a practical external data structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822941)