Quintary trees

DOI10.1145/320613.320618zbMATH Open0441.68122OpenAlexW2085603093WikidataQ56573280 ScholiaQ56573280MaRDI QIDQ3883576FDOQ3883576

Authors:

Publication date: 1980

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/320613.320618

zbMATH Keywords

multidimensional spacebinary search treedatabase systemmatch queriesfile maintenancequintary trees

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10)

Cited In (9)

• Multivariate analysis of orthogonal range searching and graph distances
• An application of $m$-ary trees to the design of data structures for geometric searching problems
• Online recognition of dictionary with one gap
• Multidimensional B-trees: Analysis of dynamic behavior
• A data structure for dynamic range queries
• Operation-specific locking in balanced structures
• Multivariate analysis of orthogonal range searching and graph distances
• Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
• Efficient maximum matching algorithms for trapezoid graphs

This page was built for publication: Quintary trees

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