Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data

ACM SIGMOD Record

Volumn 20, Issue 2, 1991, Pages 138-147

  Kolovson, Curtis P ^a   Stonebraker, Michael ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976678680     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/119995.115807     Document Type: Article

References (19)

1. Bayer, R., and McCreight, E., “Organization and Maintenance of Large Ordered Indexes”, Acta Informatica, 1, No. 3 (1972), pp. 173-189, Springer-Verlag.
2. Beckmann, N., Kriegei, H., Schneider, R., Seeger, B. “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles”, Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, June 1990.
3. Bentley, J.L., “Algorithms for Klee's Rectangle Problems”, Computer Science Department, Carnegie-Mellon University, Pittsburgh.
4. Easton, M., “Key-Sequences Data Sets on Indelible Storage”, IBM Journal of Research and Development, 30, 3, (May 1986).
5. Edelsbrunner, H., “Dynamic Rectangle Intersection Searching”, Institute for Information Processing Rept. 47, Technical University of Graz, Graz, Austria.
6. Guttman, A., “R-Trees: A Dynamic Index Structure for Spatial Searching”, Proceedings of ACM SIGMOD International Conference on Management of Data, Ed. B. Yormark. Association for Computing Machinery. Boston, MA: June 1984.
7. Kolovson, C. and Stonebraker, M., “Indexing Techniques for Historical Databases”, Proceedings of the Fifth International Conference on Data Engineering, Los Angeles, CA, Feb. 1989.
8. Kolovson, C., “Indexing Techniques for Multi-Dimensional Spatial Data and Historical Data in Database Management Systems”, PhD Dissertation, Electronics Research Laboratory Memorandum No. UCB/ERL M90/105, University of California, Berkeley, CA, Nov. 1990.
9. Lomet, D. and Salzberg, B., “Access Methods for Multiversion Data”, Proc. 1989 ACM-SIGMOD Conference on Management of Data, Portland, Ore., June 1989.
10. McCreight, E., “Priority Search Trees”, SIAM J. Comput. 14, 2 (May).
11. Preparata, F., and Shamos, M., “Computational Geometry, An Introduction”, Springer-Verlag Publishing Co., 1985.
12. Roussopoulos, N., and Leifker, D., “Direct Spatial Search on Pictorial Databases using Packed R-
13. Trees”, Proc. 1985 ACM-SIGMOD Conference on Management of Data, Austin, TX, May 1985.
14. Samet, H., “The Design and Analysis of Spatial Data Structures”, Addison-Wesley Publishing Co., 1989.
15. Sarnak, N. and Tarjan, R., “Planar Point Location Using Persistent Search Trees”, Comm. ACM, 29, 7 (July).
16. Sellis, T., Roussopoulos, N., and Faloutsos, C., “The R+-Tree: A Dynamic Index for Multi-Dimensional Objects”, Proc. 1987 VLDB Conference, Brighton, England, Sept. 1987.
17. Stonebraker, M., and Rowe, L., “The Design of POSTGRES”, Proc. 1986 ACM-SIGMOD Conference on Management of Data, Washington, D.C., May 1986.
18. Stonebraker, M., “The POSTGRES Storage System”, Proc. 1987 VLDB Conference, Brighton, England, Sept. 1987.
19. Stonebraker, M., Jhingran, A., Goh, J., Potamianos, S., “On Rules, Procedures, Caching, and Views in Data Base Systems”, Proc. 1990 ACM-SIGMOD Conference on Management of Data, Atlantic City, NJ, May 1990.