Transforming unbalanced multiway trees into a practical external data structure
type: Item
instance of: scholarly article
title: Transforming unbalanced multiway trees into a practical external data structure
zbMATH Open document ID: 0679.68032
DOI: 10.1007/BF00299632
author: Walter Cunto
author: Patricio V. Poblete
published in: Acta Informatica
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4113958
zbMATH Keywords: unbalanced multiway trees
zbMATH Keywords: external data structure
zbMATH Keywords: space complexity
zbMATH Keywords: search time complexity
MaRDI profile type: Publication
cites work: Organization and maintenance of large ordered indexes
cites work: Q4057549
cites work: The analysis of a fringe heuristic for binary search trees
cites work: On random 2-3 trees
full work available at URL: https://doi.org/10.1007/bf00299632
OpenAlex ID: W1981500574
Recommended article: Unbalanced multiway trees improved by partial expansions
Recommended article: Multidimensional balanced binary trees
Recommended article: Q4535040
Recommended article: Q3315006
Recommended article: A new approach to operating with undirected trees
Recommended article: Load balanced tree embeddings
Recommended article: A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
Recommended article: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
Recommended article: On balanced versus unbalanced computation trees
description: scientific article; zbMATH DE number 4113958