Abstract
Grow and post (GP) access methods, e.g., B+trees, are the dominant form of index tree access method because of properties not strictly related to search performance. GP methods fit well with the rest of a database system, and indeed profit from their inclusion, e.g, search performance is improved by caching index nodes. Enhancements to GP methods have increased their utility. GP methods solve the multi-attribute point search problem and, more speculatively, the spatial search problem. Their simplicity and flexibility make GP methods applicable in several interesting new areas. This paper examines these topics from the author's personal perspective.
Preview
Unable to display preview. Download preview PDF.
References
Baez-Yates, R. and Larson, P. Performance of B+trees with partial expansions. IEEE Trans. on Knowledge and Data Engineering 1,2 (June 1989) 248–257.
Bayer, R. and McCreight, E. Organization and maintenance of large ordered indices. Acta Inf. 1,3(1972), 173–189.
Bayer, R. and Unterauer, K. Prefix B-trees. ACM Trans. on Database Systems 2,1 (Mar. 1977), 11–26.
Bentley, J. Multidimensional binary search trees for associative searching. Comm. ACM 18,9(Sept. 1975) 509–517.
Bentley, J. Writing efficient programs. Prentice Hall, Englewood Cliffs, NJ (1982)
Carter, J. and Wegman, M. Universal classes of hash functions. J. Computer and System Sciences 18,2 (April 1979) 143–154.
Comer, D. The ubiquitous B-tree. ACM Comp. Surv. 11,2(June 1979), 121–138.
DeWitt, D., Katz, R., Olken, F., Shapiro, L., Stonebraker, M., and Wood, D. Implementation techniques for main memory database systems. Proc. ACM SIGMOD Conf. (Boston, Mass. 1984) 1–8.
Fagin, R. Nievergelt, J., Pippenger, N. and Strong, R. Extendible hashing: a fast access method for dynamic files. ACM Trans. on Database Systems 4,3 (Sept. 1979) 315–344.
Faloutsos, C. Multiattribute hashing using gray codes. Proc. ACM SIGMOD Conf. (Washington, DC 1986) 227–238.
Freeston, M. The BANG file: a new kind of grid file. Proc. ACM SIGMOD Conf. (San Francisco, Cal. 1987) 260–269.
Guenther, O. The design of the cell tree: an object oriented index structure for geometric databases. Proc. IEEE Data Engineering Conf. (Los Angeles, Cal. 1989), 598–605.
Guenther, O. and Buchmann, A. Research issues in spatial databases. SIGMOD Record 19,4 (Dec. 1990), 61–68.
Guttman, A. R-trees: a dynamic index structure for spatial searching, Proc. ACM SIGMOD Conf. (Boston, Mass. 1984)
IBM, Introduction to IBM/360 direct access storage devices and organization methods. C20-1649, IBM Corp.(White Plains, N.Y. 1966)
Jagadish, H. Linear clustering of objects with multiple attributes. Proc. ACM SIGMOD Conf. (Atlantic City, N.J. 1990) 332–342.
Joshi, A. and Rodwell, K. A relational database management system for production applications. Digital Technical Journal no. 8 (Feb. 1989) 99–109.
Keehn, D. and Lacy, J. VSAM data set design parameters. IBM Systems Journal 13,3 (1974) 186–212.
Knuth, D. The art of computer programming, Vol. 3: sorting and searching. Addison-Wesley, Reading, Mass. (1973)
Lampson, B. Hints for computer system design. IEEE Software 1,1 (Jan. 1984) 11–28.
Larson, P. Dynamic hashing. BIT 18 (1978) 184–201.
Larson, P. Linear hashing with partial expansions. Proc. VLDB Conf. (Montreal, Canada 1980), 224–232.
Lehman, P. and Yao, S. Efficient locking for concurrent operations on B-trees. ACM Trans. on Database Systems 6,4 (Dec. 1981) 650–670.
Litwin, W. Linear hashing: a new tool for file and table addressing. Proc. VLDB Conf. (Montreal, Canada 1980), 212–223.
Litwin, W. and Lomet, D. A new method for fast data searches with keys. IEEE Software 4,2 (Mar. 1987), 16–24.
Lomet, D. Digital B-trees. Proc. VLDB Conf. (Cannes, France 1981) 333–344.
Lomet, D. Partial expansions for file organizations with an index. ACM Trans. on Database Systems 12,1 (Mar. 1987), 65–84.
Lomet, D. A simple bounded disorder file organization with good performance. ACM Trans. on Database Systems 13,4 (Dec. 1988) 525–551.
Lomet, D. and Salzberg, B. Access methods for multiversion data. Proc. ACM SIGMOD Conf. (Portland, Ore. 1989) 315–324.
Lomet, D. and Salzberg, B. The hB-tree: a multiattribute indexing method with good guaranteed performance. ACM Trans. on Database Systems 15,4 (Dec. 1990) 625–658.
Lomet, D. and Salzberg, B. Concurrency and recovery for index trees. Digital Equipment Corp. Technical Report, Cambridge Research Lab, Cambridge, Mass. (to appear, summer, 1991)
Lynch, C. and Stonebraker, M. Extended user-defined indexing with application to textual databases. Proc. VLDB Conf. (Los Angeles, Cal. 1988) 306–317.
McGee, W. The information management system IMS/VS; part II: data base facilities. IBM Systems Journal 16,2 (1977) 96–122.
Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., and Schwarz, P. ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. IBM Research Report RJ 6649, IBM Almaden Research Center (Jan. 1989) and ACM Trans. on Database Systems (to appear).
Mohan, C. and Levine, F. ARIES/IM: an efficient and high concurrency index management method using write ahead logging. IBM Research Report RJ6846, IBM Almaden Research Center (August 1989).
Orenstein, J. and Merrett, T. A class of data structures for associative searching. Proc. ACM PODS Conf. (Waterloo, Canada, 1984) 181–190.
Ramakrishna, M. and Mukhopadhyay, P. Analysis of bounded disorder file organization. Proc. ACM PODS Conf. (San Francisco, Cal. 1988) 117–125.
Sagiv, Y. Concurrent operations on B-trees with overtaking. Proc. ACM PODS Conf. (Portland, Ore., 1985) 28–37.
Salzberg, B. File structures: an analytic approach. Prentice Hall, Englewood Cliffs, NJ (1988)
Salzberg, B. Practical spatial database access methods. Proc. Symposium on Applied Computing (Kansas City, Kan. 1991) 82–90.
Sellis, T., Roussopoulos, N., and Faloutsos, C. The R+-tree: a dynamic index for multi-dimensional objects. Proc. VLDB Conf. (Brighton, England 1987)
Srinivasan, V. and Carey, M. Performance of B-tree concurrency control algorithms. Proc. ACM SIGMOD Conf. (Denver, Col. 1991) 416–425.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lomet, D.B. (1991). Grow and post index trees: Role, techniques and future potential. In: Günther, O., Schek, HJ. (eds) Advances in Spatial Databases. SSD 1991. Lecture Notes in Computer Science, vol 525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54414-3_38
Download citation
DOI: https://doi.org/10.1007/3-540-54414-3_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54414-2
Online ISBN: 978-3-540-47615-3
eBook Packages: Springer Book Archive