Quintary trees
From MaRDI portal
Publication:3883576
DOI10.1145/320613.320618zbMath0441.68122OpenAlexW2085603093WikidataQ56573280 ScholiaQ56573280MaRDI QIDQ3883576
No author found.
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
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (9)
Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems ⋮ Unnamed Item ⋮ Multidimensional B-trees: Analysis of dynamic behavior ⋮ Online recognition of dictionary with one gap ⋮ Operation-specific locking in balanced structures ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems ⋮ A data structure for dynamic range queries ⋮ Multivariate analysis of orthogonal range searching and graph distances ⋮ Efficient maximum matching algorithms for trapezoid graphs
This page was built for publication: Quintary trees
