Constraint-based processing of multiway spatial joins

Algorithmica (New York)

Volumn 30, Issue 2, 2001, Pages 188-215

  Papadias, D ^a   Mamoulis, N ^a   Theodoridis, Y ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b University of Patras and Computer Technology Institute   (Greece)

Author keywords

Constraint satisfaction; R trees; Spatial databases; Spatial joins

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; OPTIMIZATION;

SPATIAL JOINS;

CONSTRAINT THEORY;

EID: 0010601326     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0005-y     Document Type: Article

References (54)

1. Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S. Scalable Sweeping-Based Spatial Join. Proc. VLDB, pp. 570-581, 1998.
2. Bacchus, E, van Run, P. Dynamic Variable Ordering in CSPs. Principles and Practice of Constraint Programming, pp. 258-275. LNCS 976, Springer-Verlag, Berlin, 1995.
3. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. ACM SIGMOD, pp. 322-331, 1990.
4. Bergman, L., Castelli, V., Li, C.-S. Progressive Content-Based Retrieval from Satellite Image Archives. D-Lib Magazine, October 1997 (http://mirrored.ukoln.ac.uk/lis-journals/dlib/dlib/dlib/october97/ ibm/101i.html).
5. Brinkhoff, T., Kriegel, H., Seeger, B. Efficient Processing of Spatial Joins Using R-Trees. Proc. ACM SIGMOD, pp. 237-246, 1993.
6. Cerny, V. Thermodynamical APproach to the Travelling Salesman Problem: An Efficient Simulation Algorithm. Journal of Optimization Theory and Applications, 45:41-51, 1985.
7. Comer, D. The Ubiquitous B-Tree. ACM Computing Surveys, 11(2): 121-138, 1979.
8. Dechter, R. Decomposing a Relation into a Tree of Binary Relations. Journal of Computer and System Sciences, Special Issue on the Theory of Relational Databases, 41:2-24, 1990.
9. Egenhofer, M. Query Processing in Spatial-Query-by-Sketch. Journal of Visual Languages and Computing, 8:403-424, 1997.
10. Faloutsos, C., Ranganathan, M., Manolopoulos, Y. Fast Subsequence Matching in Time Series Databases. Proc. ACM SIGMOD, pp. 419-429, 1994.
11. Gaede, V., Guenther, O. Multidimensional Access Methods. ACM Computing Surveys, 30(2): 123-169, 1998.
12. Graefe, G. Query Evaluation Techniques for Large Databases. ACM Computing Surveys, 25(2): 73-170, 1993.
13. Gudivada, V, Raghavan, V. Design and Evaluation of Algorithms for Image Retrieval by Spatial Similarity. ACM TOIS, 13(1): 115-144, 1995.
14. Guttman, A. R-Trees: A Dynamic Index Structure for Spatial Searching. Proc. ACM SIGMOD, pp. 47-57, 1984.
15. Gyssens, M., Jeavons, P., Cohen, D. Decomposing Constraint Satisfaction Problems Using Database Techniques. Artificial Intelligence, 66(1): 57-89, 1994.
16. Haralick, R.M., Elliott, G.L. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14: 263-313, 1980.
17. Huang, Y.-W., Jing, N., Rundensteiner, E. Spatial Joins Using R-Trees: Breadth First Traversal with Global Optimizations. Proc. VLDB, pp. 396-405, 1997.
18. Ioannidis, Y. Query Optimization. ACM Computing Surveys, 28(1): 121-123, 1996.
19. Ioannidis, Y., Kang, Y. Randomized Algorithms for Optimizing Large Join Queries. Proc. ACM SIGMOD, pp. 312-321, 1990.
20. Kamel, I., Faloutsos, C. Parallel R-Trees. Proc. ACM SIGMOD, pp. 195-204, 1992.
21. Kamel, I., Faloutsos, C. On Packing R-Trees. Proc. ACM CIKM, pp. 490-499, 1993.
22. Kirkpatrick, S., Gelat, C., Vecchi, M. Optimization by Simulated Annealing. Science, 220: 671-680, 1983.
23. Koudas, N., Sevcik, K. Size Separation Spatial Join. Proc. ACM SIGMOD, pp. 324-333, 1997.
24. Lo, M.-L., Ravishankar, C.V. Spatial Joins Using Seeded Trees. Proc. ACM SIGMOD, pp. 209-220, 1994.
25. Lo, M.-L., Ravishankar, C.V. Spatial Hash-Joins. Proc. ACM SIGMOD, pp. 247-258, 1996.
26. Mamoulis, N., Papadias, D. Constraint-Based Algorithms for Computing Clique Intersection Joins. Proc. ACM-GIS, pp. 118-123, 1998.
27. Mamoulis, N., Papadias, D. Integration of Spatial Join Algorithms for Processing Multiple Inputs. Proc. ACM SIGMOD, pp. 1-12, 1999.
28. Mamoulis, N., Papadias, D. Improving Search Using Indexing: A Study with Temporal CSPs. Proc. IJCAI, pp. 436-441, 1999.
29. Mamoulis, N., Papadias, D. Synchronous R-Tree Traversal. Technical Report HKUST-CS99-03, February 1999. Available via ftp from http://www.cs.ust.hk/~dimitris/
30. Nabil, M., Ngu, A., Shepherd, J. Picture Similarity Retrieval using 2d Projection Interval Representation, IEEE TKDE, 8(4): 533-539, 1996.
31. Nadel, B. Constraint Satisfaction Algorithms. Computational Intelligence, 5: 188-224, 1989.
32. Nahar, S., Sahni, S., Shragowitz, E. Simulated Annealing and Combinatorial Optimization. Proc. 23rd Design Automation Conference, pp. 293-299, 1986.
33. Orenstein, J.A. Spatial Query Processing in an Object-Oriented Database System. Proc. ACM SIGMOD, pp. 326-336, 1986.
34. Pagel, B.-W., Six, H. Are Window Queries Representative for Arbitrary Range Queries? Proc. ACM PODS, pp. 150-160, 1996.
35. Pagel, B.-W., Six, H., Toben, H., Widmayer, P. Towards an Analysis of Range Query Performance. Proc. ACM PODS, pp. 214-221, 1993.
36. Papadias, D., Theodoridis, Y., Sellis, T., Egenhofer, M. Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-Trees. Proc. ACM SIGMOD, pp. 92-103, 1995.
37. Papadias, D., Theodoridis, Y., Stefanakis, E. Multidimensional Range Query Processing with Spatial Relations. Geographical Systems, 4(4): 343-365, 1997.
38. Papadias, D., Mamoulis, N., Delis, B. Algorithms for Querying by Spatial Structure. Proc. VLDS, pp. 547-557, 1998.
39. Papadias, D., Kalnis, P., Mamoulis, N. Hierarchical Constraint Satisfaction in Spatial Databases. Proc. AAAI, pp. 142-147, 1999.
40. Papadopoulos, A.N., Rigaux, P., Scholl, M. A Performance Evaluation of Spatial Join Processing Strategies. Proc. SSD, pp. 286-307. LNCS 1651, Springer-Verlag, Berlin, 1999.
41. Park, H., Cha, G., Chung, C.J.M. Multiway Spatial Joins Using R-Trees: Methodology and Performance Evaluation. Proc. SSD, pp. 231-250. LNSC 1651, Springer-Verlag, Berlin, 1999.
42. Park, H., Lee, C.-G., Lee, Y.-J., Chung, C.-W. Early Separation of Filter and Refinement Steps in Spatial Query Optimization. Proc. DASFAA, pp. 161-168, 1999.
43. Patel, J.M., DeWitt, DJ. Partition Bases Spatial-Merge Join. Proc. ACM SIGMOD, pp. 259-270, 1996.
44. Petrakis, E., Faloutsos, C. Similarity Searching in Medical Image Databases. IEEE TKDE, 9(3): 435-447, 1997.
45. Preparata, F., Shamos, M. Computational Geometry. Springer-Verlag, New York, 1988.
46. Prosser, P. Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence, 9(3): 268-299, 1993.
47. Roussopoulos, N., Kelley, F., Vincent, F. Nearest Neighbor Queries. Proc. ACM SIGMOD, pp. 71-79, 1995.
48. +-Tree: A Dynamic Index for Multidimensional Objects. Proc. VLDB, pp. 507-518, 1987.
49. Silberschatz, A., Korth, H.F., Sudarshan, S. Database System Concepts. McGraw-Hill, New York, 1997.
50. Smith, J., Chang, S.-F. VisualSEEk: A Fully Automated Content-Based Image Query System. Proc. ACM Multimedia, pp. 87-98, 1996.
51. Swami, A., Gupta, A. Optimization of Large Join Queries. Proc. ACM SIGMOD, pp. 8-17, 1988.
52. Theodoridis, Y., Sellis, T. A Model for the Prediction of R-Tree Performance. Proc. ACM PODS, pp. 161-171, 1996.
53. Theodoridis, Y., Stefanakis, E., Sellis, T. Cost Models for Join Queries in Spatial Databases. Proc. IEEE ICDE, pp. 476-483, 1998.
54. van der Bercken, J., Seeger, B., Widmayer, P. A Generic Approach to Bulk Loading Multidimensional Index Structures. Proc. VLDB, p. 406-415, 1997.