Indexing support for spatial joins

Data and Knowledge Engineering

Volumn 34, Issue 2, 2000, Pages 99-124

  Koudas, Nick ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INDEXING (OF INFORMATION);

FILTER TREE; SPATIAL JOINS;

FILE ORGANIZATION;

EID: 0034245707     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0169-023X(00)00010-0     Document Type: Article

References (33)

1. D.J. Abel, J.L. Smith. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Computer Vision, Graphics, and Image Processing (24 March) (1983) 1-13.
2. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vitter, Scalable sweeping based spatial join, in: Proceedings of VLDB, September 1998, pp. 170-181.
3. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in: Proceedings of ACM SIGMOD, June 1990, pp. 220-231.
4. T. Brinkhoff, H.-P. Kriegel, B. Seeger, Efficient processing of spatial joins using R-trees, in: Proceedings of ACM SIGMOD, May 1993, pp. 237-246.
5. Bureau of the Census, TIGER/Line Census Files, March 1991.
6. Gaede V., Gunther O. Multidimensional access methods. ACM Computing Surveys. 30(2):1998;170-231.
7. Gargantini I. An effective way to represent Quadtrees. Communications of Association of Computing Machinery. 25(12):1982;905-910.
8. O. Gunther, Efficient computation of spatial joins, in: Proceedings of the International Conference on Data Engineering, April 1993, pp. 50-59.
9. A. Guttman, R-trees: A dynamic index structure for spatial searching, in: Proceedings of ACM SIGMOD, June 1984, pp. 47-57.
10. K. Hinrichs, J. Nievergelt, The Grid File: A data structure designed to support proximity queries on spatial objects, in: Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science, August 1983.
11. E.G. Hoel, H. Samet, Data parallel R-tree algorithms, in: Proceedings of the 22nd International Conference on Parallel Processing, August 1993, pp. III-47-III-50.
12. E.G. Hoel, H. Samet, Data parallel spatial join algorithms, in: Proceedings of the 22nd International Conference on Parallel Processing, August 1994, pp. III-227-III-234.
13. E.G. Hoel, H. Samet, Benchmarking spatial join operations with spatial output, in: Proceedings of VLDB, September 1995, pp. 1-12.
14. H.V. Jagadish. Linear clustering of objects with multiple attributes, in: Proceedings of ACM SIGMOD, May 1990, pp. 332-342.
15. I. Kamel, C. Faloutsos, On packing R-trees, in: Second International Conference on Information and Knowledge Management (CIKM), November 1993.
16. I. Kamel, C. Faloutsos, Hilbert R-tree: An improved R-tree using fractals, in: Proceedings of VLDB, September 1994, pp. 500-510.
17. G. Kedem, The Quad-CIF tree: A data structure for hierarchical on-line algorithms, in: Proceedings of the 19th Design Automation Conference, June 1982, pp. 352-357.
18. M.-L. Lo, C.V. Ravishankar, Spatial hash-joins, in: Proceedings of ACM SIGMOD, June 1996, pp. 247-258.
19. N. Mamoulis, D. Papadias, Integration of spatial join algorithms for processing multiple inputs, in: Proceedings of ACM SIGMOD, June 1999, pp. 10-21.
20. R. Nelson, H. Samet, A consistent hierarchical representation for vector data, in: Proceedings of ACM SIGGRAPH 1986 20 (4) (1986) 197-206.
21. R.T. Ng, J. Han, Efficient and effective clustering methods for spatial data mining, in: Proceedings of VLDB, September 1994, pp. 144-155.
22. J. Nievergelt, H. Hinterberger, K.C. Sevcik, The Grid File: An adaptable symmetric multikey file structure, in: ACM TODS 1984, May 1984, pp. 38-71.
23. J. Orenstein, Spatial query processing in an object-oriented database system, in: Proceedings of ACM SIGMOD, May 1986, pp. 326-336.
24. J.M. Patel, D.J. DeWitt, Partition based spatial-merge join, in: Proceedings of ACM SIGMOD, June 1996, pp. 259-270.
25. J.T. Robinson, The K-D-B-Tree: A search structure for large multidimensional dynamic indexes, in: Proceedings of ACM SIGMOD, 1981, pp. 10-18.
26. D. Rotem, Spatial join indices, in: Proceedings of the International Conference on Data Engineering, March 1993, pp. 500-509.
27. N. Roussopoulos, S. Kelly, F. Vincent, Nearest neighbor queries, in: Proceedings of ACM SIGMOD, May 1995, pp. 71-79.
28. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.
29. B. Seeger, P.-A. Larson, R. McFayden, Reading a set of disk pages, in: Proceedings of VLDB, September 1993, pp. 592-603.
30. T. Sellis, N. Roussopoulos, C. Faloutsos, The R+-tree: A dynamic index for multi-dimensional data, in: Proceedings of VLDB 1987, September 1987, pp. 507-518.
31. M. Stonebraker, The Miro DBMS, in: Proceedings of ACM SIGMOD, May 1993, p. 439.
32. Markku Tamminen, The EXCELL method for efficient geometric access to data, Acta Polytechnica Scandinavica 34 (March) (1981).
33. G. Weikum, Set-oriented disk access to large complex objects, in: International Conference on Data Engineering, March 1989, pp. 426-433.