Iterative spatial join

ACM Transactions on Database Systems

Volumn 28, Issue 3, 2003, Pages 230-256

  Jacox, Edwin H ^a   Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

External memory algorithms; Plane sweep; Spatial databases; Spatial join

Indexed keywords

EXTERNAL MEMORY ALGORITHMS; PLANE-SWEEP; SPATIAL DATABASES; SPATIAL JOIN;

ALGORITHMS; ITERATIVE METHODS; QUERY LANGUAGES; RESOURCE ALLOCATION; SORTING; STORAGE ALLOCATION (COMPUTER);

DATABASE SYSTEMS;

EID: 19544371805     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/937598.937600     Document Type: Article

References (43)

1. AREF, W. G. AND SAMET, H. 1992. Uniquely reporting spatial objects: Yet another operation for comparing spatial data structures. In Proc. of the 5th Int. Symposium on Spatial Data Handling. (Charleston, S.C), 178-189.
2. AREF, W. G. AND SAMET, H. 1994a. The spatial filter revisited. In Proc. of the 6th Int. Symposium on Spatial Data Handling, (Edinburgh, Scotland.) T. C. Waugh and R. G. Healey, Eds. International Geographical Union Commission on Geographic Information Systems, Association for Geographical Information, pp. 190-208.
3. AREF, W. G. AND SAMET, H. 1994b. Hashing by proximity to process duplicates in spatial databases. In Proc. of the 3rd Int. Conf. on Information and Knowledge Management (CIKM) (Gaithersburg, Md.). pp. 347-354.
4. ARGE, L., PROCOPIUC, O., RAMASWAMY, S., SUEL, T., AND VITTER, J. S. 1998. Scalable sweeping-based spatial join. In Proc. of the 24th Int. Conf. on Very Large Data Bases (VLDB), A. Gupta, O. Shmueli, and J. Widom, Eds. pp. 570-581.
5. BATORY, D. S., BARNETT, J. R., GARZA, J. P., SMITH, K. P., TSUKUDA, K., TWICHELL, B. C., AND WISE, T. E. 1988. GENESIS: An extensible database management system. IEEE Trans. Softw. Eng. 14, 11, 1711-1730.
6. BECKMANN, N., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. of the 1990 ACM SIGMOD Int. Conf. on Management of Data (Atlantic City, N.J.). ACM, New York, pp. 322-331.
7. BENTLEV, J. L. AND FRIEDMAN, J. H. 1979. Data structures for range searching. ACM Comput. Surv. 11, 4 (Dec.), 397-409.
8. BERCHTOLD, S., BÖHM, C., AND KRIEGEL, H.-P. 1998. Improving the query performance of high-dimensional index structures by bulk-load operations. In Advances in Database Technology -EDBT98, Proc. of the 6th Int. Conf. on Extending Database Technology (Valencia, Spain). Lecture Notes in Computer Science, vol. 1377. pp. 216-230.
9. BRINKHOFF, T., KRIEGEL, H.-R., SCHNEIDER, R., AND SEEGER, B. 1994. GENESYS: A system for efficient spatial query processing. In Proc. of the 1994 ACM SIGMOD Int. Conf. on Management of Data (Minneapolis, Minn.). ACM, New York, p. 519.
10. BRINKHOFF, T., KRIEGEL, H.-R, AND SEEGER, B. 1993. Efficient processing of spatial joins using R-trees. In Proc. of the 1993 ACM SIGMOD Int. Conf. on Management of Data (Washington, D.C.). P. Buneman and S. Jajodia, Eds. ACM, New York, pp. 237-246.
11. CAREY, M. J., DEWITT, D. J., RICHARDSON, J. E., AND SHEKITA, E. J. 1986. Object and file management in the EXODUS extensible database system. In Proc. of the 12th Int. Conf. on Very Large Databases (VLDB) (Kyoto, Japan), W. W. Chu, G. Gardarin, S. Ohsuga, and Y. Kambayashi, Eds. pp. 91-100.
12. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press/McGraw-Hill, Cambridge, Mass., Chapter 15, pp. 290-296.
13. DITTRICH, J.-R AND SEEGER, B. 2000. Data redundancy and duplicate detection in spatial join processing. In Proc. of the 16th IEEE Int. Conf. on Data Engineering (San Diego, Calif.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 535-546.
14. EDELSBRUNNER, H. 1980. Dynamic Rectangle Intersection Searching. Institute for Information Processing 47, Technical University of Graz, Graz, Austria. Feb.
15. ESPERANÇA, C. AND SAMET, H. 1996. Spatial database programming using SAND. In Proc. of the 7th Int. Symposium on Spatial Data Handling, vol. 2. (Delft, The Netherlands). M. J. Kraak and M. Molenaar, Eds. International Geographical Union Commission on Geographic Information Systems, Association for Geographical Information, pp. A29-A42.
16. FERHATOSMANOGLU, H., TUNCEL, E., AGRAWAL, D., AND EL ABBADI, A. 2000. Vector approximation based indexing for non-uniform high dimensional data sets. In Proc. of the 9th Int. Conf. on Information and Knowledge Management (CIKM) (McLean, Va), pp. 202-209.
17. GRAEFE, G. 1993. Query evaluation techniques for large databases. ACM Comput. Surv. 25, 2 (June), 73-170.
18. GÜNTHER, O. 1993. Efficient computation of spatial joins. In Proc. of the 9th IEEE Int. Conf. on Data Engineering (Vienna, Austria). IEEE Computer Society Press, Los Alamitos, Calif., pp. 50-59.
19. GÜTING, R. H. AND SCHILLING, W. 1987. A practical divide-and-conquer algorithm for the rectangle intersection problem. Inf. Sci. 42, 2 (July), 95-112.
20. HERRING, J. R. 1996. Oracle? spatial data option™: Advances in relational database technology for spatial data management. Tech. rep., Oracle Corporation. Sept.
21. HOEL, E. G. AND SAMET, H. 1995. Benchmarking spatial join operations with spatial output. In Proc. of the 21st Int. Conf. on Very Large Data Bases (VLDB) (Zurich, Switzerland), U. Dayal, P. M. D. Gray, and S. Nishio, Eds. pp. 606-618.
22. HUANG, Y.-W., JONES, M. C., AND RUNDENSTEINER, E. A. 1997. Improving spatial intersect joins using symbolic intersect detection. In Advances in Spatial Databases-5th Int. Symposium, SSD'97 (Berlin, Germany), M. Scholl and A. Voisard, Eds. Lecture Notes in Computer Science, vol. 1262. pp. 165-177.
23. IWERKS, G. AND SAMET, H. 1999. The spatial spreadsheet. In Proc. of the 3rd Int. Conf. on Visual Information Systems (VISUAL99) (Amsterdam, The Netherlands), D. P. Huijsmans and A. W. M. Smeulders, Eds. pp. 317-324.
24. KEDEM, G. 1981. The quad-cif tree: A data structure for hierarchical on-line algorithms. Computer Science Department TR-91, University of Rochester, Rochester, NY. Sept.
25. KNUTH, D. E. 1973. The Art of Computer Programming: Sorting and Searching, vol. 3. Addison-Wesley, Reading, Mass.
26. KOUDAS, N. AND SEVCIK, K. C. 1997. Size separation spatial join. In Proc. of the 1997 ACM SIGMOD Int. Conf. on Management of Data (Tucson, Az.), J. Peckham, Ed. ACM, New York, pp. 324-335.
27. LO, M.-L. AND RAVISHANKAR, C. V. 1994. Spatial joins using seeded trees. In Proc. of the 1994 ACM SIGMOD Int. Conf. on Management of Data (Minneapolis, Minn.), R. T. Snodgrass and M. Winslett, Eds. ACM, New York, pp. 209-220.
28. LO, M.-L. AND RAVISHANKAR, C. V. 1995. Generating seeded trees from data sets. In Advances in Spatial Databases-4th Int. Symposium, SSD'95 (Portland, Me.), M. J. Egenhofer and J. R. Herring, Eds. Lecture Notes in Computer Science, vol. 951. pp. 328-347.
29. LO, M.-L. AND RAVISHANKAR, C. V. 1996. Spatial hash-joins. In Proc. of the 1996 ACM SIGMOD Int. Conf. on Management of Data (Montréal, Ont., Canada). ACM, New York, pp. 247-258.
30. MAMOULIS, N. AND PAPADIAS, D. 1999. Integration of spatial join algorithms for processing multiple inputs. In Proc. of the 1999 ACM SIGMOD Int. Conf. on Management of Data (Philadelphia, Pa.), A. Delis, C. Faloutsos, and S. Ghandeharizadeh, Eds. ACM, New York, pp. 1-12.
31. NEVER, G. AND WIDMAYER, P. 1997. Singularities make spatial join scheduling hard. In Algorithms and Computation, 8th Int. Symposium, ISAAC. (Singapore), pp. 293-302.
32. ORENSTEIN, J. A. 1986. Spatial query processing in an object-oriented database system. In Proc. of the 1986 ACM SIGMOD Int. Conf. on Management of Data (Washington, D.C.), C. Zaniolo, Ed. ACM, New York, pp. 326-336.
33. ORENSTEIN, J. A. 1989. Strategies for optimizing the use of redundancy in spatial databases. In Design and Implementation of Large Spatial Databases-1st Symposium, SSD'89 (Santa Barbara, Calif), A. P. Buchmann, O. Günther, T. R. Smith, and Y.-F. Wang, Eds. Lecture Notes in Computer Science, vol. 409, pp. 115-134.
34. ORENSTEIN, J. A. 1991. An algorithm for computing the overlay of k -dimensional spaces. In Advances in Spatial Databases - 2nd Int. Symposium, SSD'91 (Zurich, Switzerland), O. Günther and H.-J. Schek, Eds. Lecture Notes in Computer Science, vol. 525, pp. 381-400.
35. OTTMANN, T. AND WOOD, D. 1986. Space-economical plane-sweep algorithms. Comput. Vis. Graph. Image Proc. 34, 1, 35-51.
36. PATEL, J. M. AND DEWITT, D. J. 1996. Partition based spatial-merge join. In Proc. of the 1996 ACM SIGMOD Int. Conf. on Management of Data (Montréal, Ont., Canada), H. V. Jagadish and I. S. Mumick, Eds. ACM, New York, pp. 259-270.
37. PREPARATA, F. P. AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Springer-Verlag, New York.
38. STONEBRAKER, M., FREW, J., AND DOZIER, J. 1993. The SEQUOIA 2000 project. In Advances in Spatial Databases-3rd Int. Symposium, SSD'93 (Singapore), D. Abel and B. C. Ooi, Eds. Lecture Notes in Computer Science, vol. 692, pp. 397-412.
39. SZYMANSKY, T. G. AND VAN WYK, C. J. 1983. Space efficient algorithms for VLSI artwork analysis. In Proc. of the 20th Design Automation Conf. (San Jose), pp. 734-739.
40. U.S. BUREAU OF THE CENSUS. 1992. Tiger/Line files. Tech. rep., U.S. Bureau of the Census, Washington, DC.
41. VENGROFF, D. E. AND VITTER, J. S. 1995. I/O-efficient scientific computation using TPIE. Tech. Rep. Technical report DUKE-TR-1995-18, Duke University.
42. VUILLEMIN, J. 1978. A data structure for manipulating priority queues. Commun. ACM 21, 4, 309-315.
43. WEBER, R., SCHEK, H.-J., AND BLOTT, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of the 24th Int. Conf. on Very Large Data Bases (VLDB) (New York, N.Y.), A. Gupta, O. Shmueli, and J. Widom, Eds. pp. 194-205.