Analysis of predictive spatio-temporal queries

ACM Transactions on Database Systems

Volumn 28, Issue 4, 2003, Pages 295-336

  Tao, Yufei ^a   Sun, Jimeng ^b,d   Papadias, Dimitris ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b CARNEGIE MELLON UNIVERSITY   (United States)

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

^d Carnegie Mellon University   (United States)

Author keywords

Database; Histogram; Nearest distance; Selectivity; Spatio temporal

Indexed keywords

HISTOGRAM; NEAREST DISTANCE; SELECTIVITY COEFFICIENT; SPATIO TEMPORAL WINDOW QUERY (STWQ);

ALGORITHMS; COSTS; DATA REDUCTION; DATABASE SYSTEMS; ERROR ANALYSIS; INFORMATION RETRIEVAL SYSTEMS; VELOCITY MEASUREMENT;

QUERY LANGUAGES;

EID: 2442427084     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/958942.958943     Document Type: Article

References (62)

1. ABOULNAGA, A. AND NAUGHTON, J. 2000. Accurate estimation of the cost of spatial selections. In Proceedings of International Conference on Data Engineering (ICDE) (Feb.). pp. 123-134.
2. ACHAHYA, S., POOSALA, V., AND RAMASWAMY, S. 1999. Selectivity estimation in spatial databases. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 13-24.
3. AGARWAL, P., ARGE, L., AND ERICKSON, J. 2000. Indexing moving points. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (May). ACM, New York, pp. 175-168.
4. AN, N., YANG, Z., AND SIVASUBRAMANIAM, A. 2001. Selectivity estimation for spatial joins. In Proceedings of International Conference on Data Engineering (ICDE) (Apr.), pp. 368-375.
5. AREF, W. AND SAMET, H. 1994. A cost model for query optimization using R-trees. In Proceedings of the Second ACM Workshop on Advances in Geographic Information Systems (GIS) (Dec.). ACM, New York, pp. 1-7.
6. BECKMANN, N., KRIEGEL, H., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD conference (May). ACM, New York, pp. 322-331.
7. BELUSSI, A. AND FALOUTSOS, C. 1995. Estimating the selectivity of spatial queries using the correlation's fractal dimension. In Proceedings of Very Large Database Conference (VLDB) (Sep.). pp. 299-310.
8. BELUSSI, A. AND FALOUTSOS, C. 1998. Self-spatial join selectivity estimating using fractal concepts. ACM Tran. Information Systems 16, 2, 161-201.
9. BENETIS, R., JENSEN, C., KARCIAUSKAE, G., AND SALTENIS, S. 2002. Nearest neighbor and reverse nearest neighbor queries for moving objects. In Proceedings of International Database Engineering and Application Symposium (July), pp. 44-53.
10. BERCHTOLD, S., BOHM, C., KEIM, D., AND KRIEGEL, H. 1997. A cost model for nearest neighbor search in high-dimensional data space. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (May). ACM, New York, pp. 78-86.
11. BERCHTOLD, S., BOHM, C., KEIM, D., KREBS, F., AND KRIEGEL, H. 2001. On optimizing nearest neighbor queries in high-dimensional data spaces. In Proceedings of International Conference on Database Theory (ICDT) (Jan.). pp. 435-449.
12. BERG, M., KREVELD, M., OVERMAS, M., AND SCHWARZKOPF, O. 1997. Computational geometry: algorithms and applications. Springer, New York, ISBN: 3-540-61270-X.
13. BEYER, K., GOLDSTEIN, J., AND RAMAKRISHNAN, R. 1999. When is "nearest neighbor" meaningful? In Proceedings of International Conference on Database Theory (ICDT) (Jan.). pp. 217-235.
14. BLOHSFELD, B., KORUS, D., AND SEEGER, B. 1999. A comparison of selectivity estimators for range queries on metric attributes. In Proceedings of the ACM SIGMOD conference (June). ACM, New York, pp. 239-250.
15. BOHM, C. 2000. A cost model for query processing in high dimensional data spaces. ACM Tran. Datab. Syst. 25, 2, 129-178.
16. BRINKHOFF, T. 2002. A framework for generating network-based moving objects. GeoInformatica. 6, 2, 153-180.
17. BRUNO, N., GRAVANO, L., AND CHAUDHURI, S. 2001. STHoles: A workload aware multidimensional histogram. In Proceedings of the ACM SIGMOD Conference (May). ACM, New York, 211-222.
18. CHAUDHURI, S., DAS, G., DATAR, M., MOTWANI, R., AND NAHASAYYA, V. 2001. Overcoming limitations of sampling for aggregation queries. In Proceedings of International Conference on Data Engineering (ICDE) (Apr.), pp. 534-542.
19. CHOI, Y. AND CHUNG, C. 2002. Selectivity estimation for spatio-temporal queries to moving objects. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 440-451.
20. CIACCIA, P., PATELLA, M., AND ZEZULA, P. 1998. A cost model for similarity queries in metric spaces. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (June). ACM, New York, pp. 59-68.
21. CORRAL, A., MANOLOPOULOS, Y., THEODORIDIS, Y., AND VASSILAKOPOULOS, M. 2000. Closest pair queries in spatial databases. In Proceedings of the ACM SIGMOD Conference (May). ACM, New York, pp. 189-220.
22. DESHPANDE, A., GAROFALAKIS, M., AND RASTOGI, R. 2001. Independence is good: dependency-based histogram synopses for high-dimensional data. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 199-210.
23. FALOUTSOS, C., SEEGBR, B., TRAINA, A., AND TRAINA JR., C. 2000. Spatial join selectivity using power laws. In Proceedings of the ACM SIGMOD Conference (May). ACM, New York, pp. 177-188.
24. GARDNER, E. 1985. Exponential smoothing: the state of the art. J. Forecast. 4, 1-28.
25. GUNOPULOS, D., KOLLIOS, G., TSOTRAS, V., AND DOMENICONI, C. 2000. Approximating multidimensional aggregate range queries over real attributes. In Proceedings of the ACM SIGMOD Conference (May). ACM, New York, pp. 463-474.
26. GUTTMAN, A. 1984. R-Trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 47-57.
27. HADJIELEFTHERIOU, M., KOLLIOS, G., AND TSOTRAS, V. 2003. Performance evaluation of spatio-temporal selectivity estimation techniques. In Proceedings of Statistical and Scientific Database Management (SSDBM) (July), pp. 202-211.
28. HADJIELEPTHERIOU, M., KOLLIOS, G., TSOTRAS, V., AND GUNOPULOS, D. 2002. Efficient indexing of spatiotemporal objects, In Proceedings of Extending Data Base Technology (EDBT) (Mar.), pp. 251-268.
29. HJALTASON, G. AND SAMET, H. 1999. Distance browsing in spatial databases. ACM Trans. Datab. Syst. 24, 2, 266-318.
30. HUANG, Y., JING, N., AND RUNDENSTEINER, E. 1997. A cost model for estimating the performance of spatial joins using R-trees. In Proceedings of Statistical and Scientific Database Management (SSDBM) (Aug.). pp. 30-38.
31. JIn, J., AN, N., AND SRVASUBRAMANIAM, A. 2000. Analyzing range queries on spatial data. In Proceedings of International Conference on Data Engineering (ICDE) (Feb.). pp, 525-534.
32. KAMEL, I. AND FALOUTSOS, C. 1993. On packing R-trees. In Proceedings of International Conference on Information and Knowledge Management (CIKM) (Nov.). ACM, New York, pp. 490-499.
33. KOLLIOS, G., GUNOPULOS, D., AND TSOTRAS, V. 1999. On indexing mobile objects. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (May). ACM, New York, pp. 261-272.
34. LEE, J., KIM, D., AND CHUNG, C. 1999. Multidimensional selectivity estimation using compressed histogram information. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 206-214.
35. MAMOULIS, N. AND PAPADIAS, D. 2001. Multiway spatial joins. ACM Trans. Datab. Syst. 26, 4, 424-475.
36. MATIAS, Y., VITTER, J., AND WANG, M. 1998. Wavelet-based histograms for selectivity estimation. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 448-459.
37. MATIAS, Y., VITTER, J., AND WANG, M. 2000. Dynamic maintenance of wavelet-based histograms. In Proceedings of Very Large Database Conference (VLDB) (Sept.). pp. 101-110.
38. MURALIKHISHNA, M. AND DEWITT, D. 1988. Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 28-36.
39. OLKEN, F. AND ROTEM, D. 1990. Random sampling from database files: A survey. In Proceedings of Statistical and Scientific Database Management (SSDBM) (Apr.), pp. 92-111.
40. PAGEL, B., SIX, H., TOBEN, H., AND WIDMAYEH, P. 1993. Towards an analysis of range query performance in spatial data structures. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (May). ACM, New York, pp. 214-221.
41. PALMEE, C. AND FALOUTSOS, C. 2000. Density biased sampling: an improved method for data mining and clustering. In. Proceedings of the ACM SIGMOD conference (June). ACM, New York, pp. 82-92.
42. PAPADOPOULOS, A AND MANOLOPOULOS, Y. 1997. Performance of nearest neighbor queries in R-trees. In Proceedings of International Conference on Database Theory (ICDT) (Jan.). pp. 394-408.
43. PFOSER, D., JENSEN, C, AND THEODORIDIS, Y. 2000. Novel approaches to the indexing of moving object trajectories. In Proceedings of Very Large Database Conference (VLDB) (Sept.). pp. 395-406.
44. POOSALA, Y. AND IOANNIDIS, Y. 1997. Selectivity estimation without the attribute value independence assumption. In Proceedings of Very Large Database Conference (VLDB) (Aug.). pp. 486-495.
45. PRESS, W., FLANNERY, B., TEUKOLSKY, S., AND VETTEHLING, W. 2002. Numerical Recipes in C++ (second edition). Cambridge University Press, Cambridge, Mass., ISBN 0-521-75034-2.
46. PROIETTI, G. AND FALOUTSOS, C. 1998. Selectivity estimation of window queries for line segment datasets. In Proceedings of International Conference on Information and Knowledge Management (CIKM) (Nov.). ACM, New York, pp. 340-347.
47. PROIETTI, G. AND FALOUTSOS, C. 2001. Accurate modeling of region data. Trans. Knowl. Data Eng. (TKDE) 13, 6, 874-883.
48. ROUSSOPOULOS, N., KELLEY, S., AND VINCENT; F. 1995. Nearest neighbor queries. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 71-79.
49. SALTENIS, S. AND JENSEN, C. 2002. Indexing of moving objects for location-based services. In Proceedings of International Conference on Data Engineering (ICDE) (Feb.). pp. 463-472.
50. SALTENIS, S., JENSEN, C., LEUTENEOGER, S., AND LOPEZ, M. 2000. Indexing the positions of continuously moving objects. In Proceedings of the ACM SIGMOD Conference (June). ACM, New York, pp. 331-342.
51. SUN, C., AGRAWAL, D., AND EL ABBADI, A. 2002a. Exploring spatial datasets with histograms. In Proceedings of International Conference on Data Engineering (ICDE) (Feb.). pp. 93-102.
52. SUN, C., AGRAWAL, D., AND EL ABBADI, A. 2002b. Selectivity estimation for spatial joins with geometric selections. In Proceedings of Extending Data Base Technology (EDBT) (Mar.). pp. 609-626.
53. TAO, Y. AND PAPADIAS, D. 2003. Spatial queries in dynamic environments. ACM Tran. Datab. Syst. 28, 2, 101-139.
54. TAO, Y., PAPADIAS, D., AND SUN, J. 2003a. The TPR*-Tree: An optimized spatio-temporal access method for predictive queries. In Proceedings of Very Large Database Conference (VLDB) (Sept.), pp. 790-801.
55. TAO, Y., SUN, J., AND PAPADIAS, D. 2003b. Selectivity estimation for predictive spatio-temporal queries. In Proceedings of International Conference on Data Engineering (ICDE) (Mar.). pp. 417-428.
56. THAPER, N., GUHA, S., INDYK, P., AND KOUDAS, N. 2002. Dynamic multidimensional histograms. In Proceedings of the ACM SIGMOD conference (June). ACM, New York, pp. 428-439.
57. THEODORIDIS, Y., SILVA, J., AND NASCIMENTO, M. 1999. On the generation of spatiotemporal datasets. In Proceedings of Symposium on Large Spatial Databases (SSD) (July). pp. 147-164.
58. THEODORIDIS, Y., STEFANAKIS, E., AND SELLIS, T. 1998. Cost models for join queries in spatial databases. In Proceedings of International Conference on Data Engineering (ICDE) (Feb.). pp. 476-483.
59. THEODORIDIS, Y., STEFANAKIS, E., AND SELLIS, T. 2000. Efficient cost models for spatial queries using R-trees. Tran. Knowl. Data Eng. (TKDE). 12, 1, 19-32.
60. TIGER, http://www.census.gov/geo/www/tiger/.
61. WEBER, R., SCHEK, H., AND BLOTT, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of Very Large Database Conference (VLDB) (Aug.). pp. 194-205.
62. WU, Y., AGRAWAL, D., AND EL ABBADI, A 2001. Applying the golden rule of sampling for selectivity estimation. In Proceedings of the ACM SIGMOD conference (June). ACM, New York, pp. 449-460.