The hBΠ-tree: A multi-attribute index supporting concurrency, recovery and node consolidation

VLDB Journal

Volumn 6, Issue 1, 1997, Pages 1-25

  Evangelidis, Georgios ^a   Lomet, David ^b   Salzberg, Betty ^c  

^a ALEXANDER TECHNOLOGICAL EDUCATIONAL INSTITUTE OF THESSALONIKI   (Greece)

^b MICROSOFT   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Concurrency; Multi attribute index; Node consolidation; Recovery

Indexed keywords

EID: 0002852733     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s007780050030     Document Type: Article

References (27)

1. Bentley JL (1979) Multidimensional binary search trees in database applications. IEEE Trans Software Eng SE-5:333-340
2. Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pp 322-331
3. Bayer R, McCreight E (1972) Organization and maintenance of large ordered indexes. Acta Informatica 1:173-189
4. Bayer R, Schkolnick M (1977) Concurrency of operations on B-trees. Acta Informatica 9:1-21
5. Comer D (1979) The Ubiquitous B-tree. ACM Comput Surv 11:121-137
6. Evangelidis G, Salzberg B (1993) Using the holey brick tree for spatial data in general-purpose DBMSs. IEEE Database Eng Bull 16:34-39
7. +94] Gray J, Sundaresan P, Englert S, Baclawski K, Weinberger P (1994) Quickly generating billion-record synthetic databases. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, Minneapolis, Minn., pp 243-252
8. Guenther O (1989) The design of the cell tree: an object-oriented index structure for geometric databases. In: Proceedings of IEEE Data Engineering Conference. Los Angeles, Calif., pp 598-605
9. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, Boston, Mass., pp 47-57
10. Hinrichs KH (1985) The grid file: implementation and case studies of applications. PhD thesis, Swiss Federal Institute of Technology, Zurich, Switzerland
11. Knuth DE (1968) The art of computer programming volume 3. Addison-Wesley, Reading, Mass.
12. Lomet DB (1977) Process structuring, synchronization, and recovery using atomic actions. SIGPLAN Not 12:128-137
13. Lomet DB (1983) Bounded index exponential hashing. ACM Trans Database Syst 8:136-165
14. Lomet D, Salzberg B (1990) The hB-tree: a multiattribute indexing method with good guaranteed performance. ACM Trans Database Syst 15:625-658
15. Lomet D, Salzberg B (1992) Access method concurrency with recovery. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, San Diego, Calif., pp 351-360
16. Lehman P, Yao SB (1981) Efficient locking for concurrent operations on B-trees. ACM Trans Database Syst 6:650-670
17. Mohan C, Levine F (1989) ARIES/IM: an efficient and high-concurrency index management method using write-ahead logging. IBM Research Report RJ 6846, IBM Almaden Research Center, San Jose, Calif.
18. Nievergelt J, Hinterberger H, Sevcik KC (1984) The Grid File: an adaptable, symmetric, multikey file structure. ACM Trans Database Syst 9:38-71
19. Orenstein JA, Merrett T (1984) A class of data structures for associative searching. In: Proceedings of SIGART-SIGMOD 3rd Symposium on Principles of Database Systems, Waterloo, Canada, pp 181-190
20. Robinson JT (1981) The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, New York, N.Y., pp 10-18
21. Sagiv Y (1986) Concurrent operations on b*-trees with overtaking. J Comput Syst Sci 33:275-296
22. Salzberg B (1985) Restructuring the Lehman-Yao tree. Technical Report NU-CCS-85-21, College of Computer Science, Northeastern University, Boston, Mass.
23. Salzberg B (1991) Practical spatial database access methods. In: Proceedings of the Symposium on Applied Computing, Kansas City, Mich., pp 82-90
24. Srinivasan V, Carey M (1991) Performance of B-tree concurrency control algorithms. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, Denver, Colo., pp 416-425
25. Stonebraker M, Frew J, Gardels K, Meredith J (1993) The Sequoia 2000 Storage Benchmark. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, Washington, DC, pp 2-11
26. Shasha D, Goodman N (1988) Concurrent search structure algorithms. ACM Trans Database Syst 13:53-90
27. +-tree: a dynamic index for multi-dimensional objects. In: International Conference on Very Large Data Bases, Brighton, England, pp 1-24