The design and implementation of seeded trees: An efficient method for spatial joins

IEEE Transactions on Knowledge and Data Engineering

Volumn 10, Issue 1, 1998, Pages 136-152

  Lo, Ming Ling ^b   Ravishankar, Chinya V ^a,c  

^a IEEE   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Buffer management; Database index; Join processing; Query processing; Spatial databases; Spatial index

Indexed keywords

ALGORITHMS; BUFFER STORAGE; DATA STRUCTURES; INDEXING (OF INFORMATION); QUERY LANGUAGES;

BUFFER MANAGEMENT; SEEDED TREES;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0031673005     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.667097     Document Type: Article

References (21)

1. M.-L. Lo and C.V. Ravishankar, "Spatial Joins Using Seeded Trees," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 209-220, Minneapolis, Minn., May 1994.
2. H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
3. D. Rotem, "Spatial Join Indices," Proc. Int'l Conf. Data Eng., pp. 500-509, Kobe, Japan, 1991.
4. P. Valduriez, "Join Indices," ACM Trans. Database Systems, vol. 12, no. 2, 1987.
5. J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans. Database Systems, vol. 9, no. 1, 1984.
6. W. Lu and J. Han, "Distance-Associated Join Indices for Spatial Range Search," Proc. Int'l Conf. Data Eng., pp. 284-292, 1992.
7. J.A. Orenstein, "Redundancy in Spatial Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, Portland, Ore., 1989.
8. J. Orenstein, "A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 343-352, 1990.
9. J. Orenstein, "An Algorithm for Computing the Overlay of k-Dimensional Spaces," Advances in Spatial Databases (SSD '91), O. Gunther and H.-J. Schek, eds., pp. 381-400, Zurich, Switzerland. Springer-Verlag, Aug. 1991.
10. R.H. Güting and W. Schilling, "A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem," Information Sciences, vol. 42, no. 2, pp. 95-112, July 1987.
11. O. Gunther, "Efficient Computation of Spatial Joins," Proc. Int'l Conf. Data Engineering, pp. 50-59, 1993.
12. A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 47-57, Aug. 1984.
13. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322-332, May 1990.
14. C. Faloutsos, T. Sellis, and N. Roussopoulos, "Analysis of Object Oriented Spatial Access Methods," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 427-439, 1987.
15. +-tree: A Dynamic Index for Multi-Dimensional Objects," Proc. Very Large Data Bases, pp. 3-11, Brighton, England, 1987.
16. T. Brinkhoff, H.P. Kriegel, and B. Seeger, "Efficient Processing of Spatial Joins Using R-Trees," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 237-246, May 1993.
17. J. Star and J. Estes, Geographic Information Systems. Englewood Cliffs, N.J.: Prentice Hall, 1990.
18. U.S. Bureau of Census, "Tiger/Lines Precensus Files: 1990 Technical Documentation," technical report, U.S. Bureau of Census, Washington, D.C., 1989.
19. F. Olken and D. Rotem, "Sampling from Spatial Databases," Proc. Int'l Conf. Data Eng., pp. 199-208, 1993.
20. M.-L. Lo and C.V. Ravishankar, "Generating Seeded Trees from Data Sets," Proc. Fourth Int'l Symp. Large Spatial Databases (Advances in Spatial Databases: SSD '95), Portland, Maine, Springer-Verlag, Aug. 1995.
21. W.J. Dixon, Introduction to Statistical Analysis, fourth ed. New York: McGraw-Hill, 1983.