New Data Structures for Orthogonal Range Queries
- 1 February 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (1), 232-253
- https://doi.org/10.1137/0214019
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Optimal Retrieval Algorithms for Small Region QueriesSIAM Journal on Computing, 1981
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Lower Bounds on the Complexity of Some Optimal Data StructuresSIAM Journal on Computing, 1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad treesActa Informatica, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974