The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance

ACM Transactions on Database Systems (TODS)

Volumn 15, Issue 4, 1990, Pages 625-658

  Lomet, David B ^a   Salzberg, Betty ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE--INFORMATION RETRIEVAL;

HB TREES; INDEX STRUCTURES; MULTIATTRIBUTE INDEXING;

DATA PROCESSING;

EID: 0025625409     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/99935.99949     Document Type: Article

References (19)

1. BAYER, R., AND MCCREIGHT, E. M. Organization and maintenance of large ordered indices. Acta Inf. 1, 3 (1972), 173-189.
2. BENTLEY, J. L. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (Sept. 1975), 509-517.
3. BENTLEY, J. L. Multidimensional binary search trees in database applications. IEEE Trans. Softw. Eng. SE-5, 4 (July, 1979), 333-340.
4. COMER, D. The ubiquitous B-tree. ACM Comput. Surv. 11, 2 (June 1979), 121-138.
5. FREESTON, M. The BANG file: A new kind of grid file. In Proceedings of the ACM SIGMOD Conference on Management of Data (San Francisco, May 1987). ACM, New York, 1987, 260-269.
6. LEHMAN, P., AND YAO, S. B. Efficient locking for concurrent operations on B-trees. ACM Trans. Database Syst. 5, 3 (Sept. 1980), 339-353.
7. LITWIN, W., AND LOMET, D. A new method for fast data searches with keys. IEEE Softw. 4, 2 (Mar. 1987), 16-24.
8. LOMET, D. Digital B-trees. In Proceedings of the 7th Conference on Very Large Data Bases (Cannes, Sept. 1981), 333-343.
9. LOMET, D. DL*-trees. IBM Res. Rep. RC10860, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., Nov. 1984.
10. LOMET, D. Partial expansions for file organizations with an index. ACM Trans. Database Syst. 12, 1 (Mar. 1987), 65-84.
11. LOMET, D. A simple bounded disorder file organization with good performance. ACM Trans. Database Syst. 13, 3 (Dec. 1988), 525-551.
12. NIEVERGELT, J., HINTERBERGER, H., AND SEVCIK, K. C. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9, 1 (Mar. 1984), 38-71.
13. OHSAWA, Y., AND SAKAUCHI, M. The BD-tree-A new n-dimensional data structure with highly efficient dynamic characteristics. In Proceedings IFIP Congress (Paris, 1983). North Holland, 1983, 539-544.
14. ORENSTEIN, J. A., AND MERRETT, T. A class of data structures for associative searching. In Proceedings of ACM SIGACT-SIGMOD Principles of Database Systems Conference (Waterloo, 1984). ACM, New York, 1984, 181-190.
15. ROBINSON, J. T. The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In Proceedings ACM SIGMOD Conference on Management of Data (Boston, June 1984). ACM, New York, 1984, 10-18.
16. SAGIV, Y. Concurrent operations on B-trees with overtaking. In Proceedings ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (Portland, Ore., 1985). ACM, New York, 1985, 28-37.
17. SALZBERG, B. Restructuring the Lehman-Yao tree. Tech. Rep. BS-85-21, Northeastern Univ., Boston, 1985.
18. SALZBERG, B. Using the buddy system on the K-D-B-tree. Tech. Rep. BS-85-21, Northeastern Univ., Boston, 1985.
19. SALZBERG, B. Grid file concurrency. Inf. Syst. 11, 3 (1986), 235-244.