Quintary trees

DOI10.1145/320613.320618MaRDI QIDQ3883576zbMATH OpenOpenAlexWikidataFDO

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

binary search treedatabase systemfile maintenancematch queriesmultidimensional spacequintary trees

Mathematics Subject Classification ID

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

Cited in

(9)

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

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)