Selectivity estimation of complex spatial queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2121, Issue , 2001, Pages 155-174

  Mamoulis, Nikos ^a   Papadias, Dimitris ^b  

^a CWI   (Netherlands)

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AND JOINS; COMPLEX QUERIES; SELECTIVITY ESTIMATION; SPATIAL DATABASE; SPATIAL INPUTS; SPATIAL JOIN; SPATIAL QUERIES;

DATABASE SYSTEMS;

EID: 84944052718     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47724-1_9     Document Type: Conference Paper

References (29)

1. Aboulnaga, A., Naughton, J.F. Accurate Estimation of the Cost of Spatial Selections. IEEE ICDE, 2000.
2. Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S. Scalable Sweeping-Based Spatial Join. VLDB Conference, 1998.
3. Achaya S., Poosala V., Ramaswamy S. Selectivity Estimation in Spatial Databases. ACM SIGMOD, 1999.
4. Belussi A., Faloutsos C. Estimating the Selectivity of Spatial Queries Using the Correlation Fractal Dimension. VLDB Conference, 1995.
5. Brinkhoff, T., Kriegel, H.P., Seeger B. Efficient Processing of Spatial Joins Using R-trees. ACM SIGMOD, 1993.
6. Faloutsos C., Seeger B., Traina A., Traina C. Spatial Join Selectivity Using Power Laws. ACM SIGMOD, 2000.
7. Gaede V., Günther O. Multidimensional Access Methods. ACM Computing Surveys, 30(2): 123-169, 1998.
8. Guttman, A. R-trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD, 1984.
9. Güting R.H. An Introduction to Spatial Database Systems, VLDB Journal, 3(4): 357-399, 1994.
10. Graefe, G. Query Evaluation Techniques for Large Databases. ACM Computing Surveys, 25(2): 73-170, 1993.
11. Ioannidis Y., Christodoulakis S. On the Propagation of Errors in the Size of Join Results. ACM SIGMOD1991.
12. Ioannidis Y., Kang Y. Randomized Algorithms for Optimizing Large Join Queries. ACM SIGMOD, 1990.
13. Kamel I., Faloutsos C. On Packing R-trees. ACM CIKM, 1993.
14. Koudas, N., Sevcik, K. Size Separation Spatial Join. ACM SIGMOD, 1997.
15. Lo, M-L., Ravishankar, C.V. Spatial Joins Using Seeded Trees. ACM SIGMOD, 1994.
16. Lo, M-L., Ravishankar, C.V. Spatial Hash-Joins. ACM SIGMOD, 1996.
17. Mackworth A. Consistency in Networks of Relations. Artificial Intelligence, 8, 1977.
18. Mamoulis, N, Papadias, D. Integration of Spatial Join Algorithms for Processing Multiple Inputs. ACM SIGMOD, 1999.
19. Patel J.M., DeWitt D.J. Partition Based Spatial-Merge Join. ACM SIGMOD, 1996.
20. Papadias, D., Mamoulis, N., Delis, V. Approximate Spatio-Temporal Retrieval. To appear in ACM Transactions on Information Systems.
21. Papadias, D., Mamoulis, N., Theodoridis, Y. Processing and Optimization of Multiway Spatial Joins Using R-trees. ACM PODS, 1999.
22. Poosala, V. Histogram-based estimation techniques in databases. PhD Thesis, University of Wisconsin-Madison, 1997.
23. Pagel, B.W., Six, H. Are Window Queries Representative for Arbitrary Range Queries? ACM PODS, 1996.
24. Pagel, B.W., Six, H., Toben, H., Widmayer, P. Towards an Analysis of Range Query Performance. ACM PODS, 1993.
25. Silberschatz, A., Korth, H.F., Sudarshan, S. Database System Concepts. McGraw-Hill, 1997.
26. Transaction Processing Performance Council, TPC Benchmark R (Decision Support), Rev. 1.0.1, http://www.tpc.org/, 1993 –1998. 174 N. Mamoulis and D. Papadias
27. Theodoridis, Y., Sellis, T. A Model for the Prediction of R-tree Performance, ACM PODS, 1996.
28. Theodoridis, Y., Stefanakis, E., Sellis, T. Cost Models for Join Queries in Spatial Databases, IEEE ICDE, 1998.
29. Tsang, E. Foundations of Constraint Satisfaction, Academic Press, London and San Diego, 1993.