Optimal Retrieval Algorithms for Small Region Queries
- 1 November 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (4) , 721-741
- https://doi.org/10.1137/0210056
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Quintary treesACM Transactions on Database Systems, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Optimal partial-match retrieval when fields are independently specifiedACM Transactions on Database Systems, 1979
- Decomposable searching problemsInformation Processing Letters, 1979
- Optimality Properties of Multiple-Key Hashing FunctionsJournal of the ACM, 1979
- 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
- Hashing functionsThe Computer Journal, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974