A class of data structures for associative searching

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 1984, Pages 181-190

  Orenstein, J A ^a   Merrett, T H ^b  

^a The University of Massachusettts   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS;

B TREES; BINARY REPRESENTATIONS; EFFICIENT IMPLEMENTATION; K-D TREE; MULTIDIMENSIONAL DATA; RANGE QUERY; RANGE SEARCH; SET OPERATION;

TREES (MATHEMATICS);

EID: 85029917402     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/588011.588037     Document Type: Conference Paper

References (22)

1. [Baye72] R. Bayer, E. McCreight. Organization and maintenance of large ordered indexes. Acta Irformatka 1, 3 (1972), 173-189.
2. [Bent75a] J.L. Bentley. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9 (1975), 509-517.
3. [Bent79a] J.L. Bentley. Multidimensional binary search trees in database applications. IEEE Transactions on Software Engineering SE-5, 4 (1979), 333-340.
4. [Bent79b] J.L. Bentley, JH. Friedman. Data structures for range searching. ACM Camp. Surv. 11, 4 (1979), 397-410.
5. [Burk83] WA. Burkhard. Interpolation-based index maintenance. Proc. 2nd ACM SIGACT-SIGMOD Symposium on Principlet of Database Systems, (1983), 76-89.
6. [Come79] D. Comer. The ubiquitous B-tree. ACM Comp. Surv. 11, 2 (1979), 121-138.
7. [Fagi79] R. Fagin, J. Nievergelt, N. Pippenger, H.R Strong. Extendible hashing a fast access method for dynamic files. ACM Trans, on Database Systems 4, 3 (1979), 315-344.
8. [Fred60] EH. Fredkin. Trie memory. Comm. ACM 3, 9 (1960), 490-499.
9. [Gopa80] V. Gopalakrishna, C.E.V. Madhavan. Performance evaluation of an attribute based tree organization. ACM Trans, on Database Systems 5, 1 (1980), 69-87.
10. [IBM66] IBM66 Corp. OS ISAM logic. GY28-6618, IBM66 Corp. White Plains, N.Y. (1966).
11. [Kash77] R.L Kashyap, S.K.C. Subas, S.B. Yao. Analysis of the multiple-attribute-tree based organization. IEEE Trans, on Soft. Eng. SE-3, 6 (1977), 451-456.
12. [Knut73] DE. Knuth. The Art of Computer Programming, vol. 3: Sorting and Searching, Addison-Wesley, Reading Mass., (1973).
13. [Litw80] W. Litwin. Linear hashing: A new tool for file and table addressing. Proc. VLDB 6, (1980), 212-223.
14. [Oren82] JA. Orenstein. Multidimensional tries used for associative searching. Information Processing Letters 14, 4 (1982), 150-157.
15. [Oren83a] JA. Orenstein. - Data Structures and Algorithms for the Implementation of a Relational Database System, PhD. thesis, McGill University (1983). Also available as Technical Report SOCS-82-17.
16. [Oren83b] JA. Orenstein. A dynamic hash file for random and sequential accessing. Proc. VLDB 9, (1983), 132-141.
17. [Ouks83] M. Ouksel, P. Scheuermann. Storage mappings for multidimensional linear dynamic hashing. Proc. 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, (1983), 90-105.
18. [Robi81] J.T. Robinson. The K-D-B tree: A search structure for large multidimensional dynamic indexes. Proc. ACM SIGMOD, (1981), 10-18.
19. [Sche82] P. Scheuermann, M. Ouksel. Multidimensional B-trees for associative searching in database systems. Information Systems 7, 2 (1982), 123-137.
20. [Suss63] EH. Sussenguth. The use of tree structures for processing files. Comm. ACM 6, 5 (1963), 272-279.
21. [Tamm81] M. Tamminen. Order preserving extendible hashing and bucket tries. BIT 21, 4 (1981), 419-435.
22. [Yao78] A.C.C. Yao. On random 2-3 trees. Acta Informatica 9, (1978), 159-170.