Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization

DOI10.1007/3-540-55706-7_17zbMath1502.68092OpenAlexW1872142962MaRDI QIDQ5056141

Walter Cunto, Vicente Yriarte

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55706-7_17

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization

Cites Work

• Improving time and space efficiency in generalized binary search trees
• Organization and maintenance of large ordered indexes
• The analysis of a fringe heuristic for binary search trees
• Multidimensional binary search trees used for associative searching
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
• Partial match retrieval of multidimensional data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization