Historical spatio-temporal aggregation

ACM Transactions on Information Systems

Volumn 23, Issue 1, 2005, Pages 61-102

  Tao, Yufei ^a   Papadias, Dimitris ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

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

Author keywords

Access methods; Additional Key Words and Phrases: Aggregation; Cost models

Indexed keywords

ACCESS METHODS; COST MODELS; ONLINE PROCESSING; SPATIO-TEMPORAL AGGREGATION;

AGGLOMERATION; DATA ACQUISITION; DATA STORAGE EQUIPMENT; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; MOBILE COMPUTING; PROBABILISTIC LOGICS; WAREHOUSES;

DATABASE SYSTEMS;

EID: 13844299248     PISSN: 10468188     EISSN: None     Source Type: Journal    
DOI: 10.1145/1055709.1055713     Document Type: Review

References (61)

1. ACHARYA, S., POOSALA, V., AND RAMASWAMY, S. 1999. Selectivity estimation in spatial databases. In Proceedings of the ACM SIGMOD conference (June), 13-24.
2. AGARWAL, P., ARGE, L., AND ERICKSON, J. 2000. Indexing moving points. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (May), 175-168.
3. BARALIS, E., PARABOSCHI, S., AND TENIENTE, E. 1997. Materialized view selection in a multidimensional database. In Proceedings of Very Large Database Conference (VLDB) (August), 156-165.
4. BECKER, B., GSCHWIND, S., OHLER, T., SEEGER, B., AND WIDMAYER, P. 1996. An asymptotically optimal multiversion B-Tree. The VLDB Journal 5, 4, 264-275.
5. 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), 322-331.
6. CHOI, Y. AND CHUNG, C. 2002. Selectivity estimation for spatio-temporal queries to moving objects. In Proceedings of the ACM SIGMOD conference (June), 440-451.
7. DENNY, M., FRANKLIN, M., CASTRO, P., AND PURAKAYASTHA, A. 2003. Mobiscope: A scalable spatial discovery service for mobile network resources. In Proceedings of the 4th Mobile Data Management (MDM) (Jan.), 307-324.
8. FLAJOLET, P. AND MARTIN, G. 1985. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 32, 2, 182-209.
9. FORLIZZI, L., GÜTING, R., NARDELLI, E., AND SCHNEIDER, M. 2000. A data model and data structures for moving objects databases. In Proceedings of the ACM SIGMOD conference (May), 319-330.
10. GAEDE, V. AND GÜNTHER, O. 1998. Multidimensional access methods. ACM Comput. Surv. 30, 2, 123-169.
11. GENDRANO, J., HUANG, B., RODRIGUE, J., MOON, B., AND SNODGRASS, R. 1999. Parallel algorithms for computing temporal aggregates. In Proceedings of International Conference on Database Engineering (ICDE), 418-427.
12. GOVINDARAJAN, S., AGARWAL, P., AND ARGE, L. 2003. CRB-Tree: An efficient indexing scheme for range aggregate queries. In Proceedings of International Conference on Database Theory (ICDT) (Jan.), 143-157.
13. GRAY, J., BOSWORTH, A., LAYMAN, A., AND PIRAHESH, H. 1996. Data cube: A relational aggregation operator generalizing group-by, cross-tabs and subtotals. In Proceedings of International Conference on Database Engineering (ICDE), 152-159.
14. GUPTA, H. 1997. Selection of views to materialize in a data warehouse. In Proceedings of International Conference on Database Theory (ICDT) (Jan.), 98-112.
15. GUPTA, H. AND MUMICK, I. 1999. Selection of views to materialize under a maintenance-time constraint. In Proceedings of International Conference on Database Theory (ICDT) (Jan.), 453-470.
16. GÜTING, R., BÖHLEN, M., ERWIG, M., JENSEN, C., LORENTZOS, N., SCHNEIDER, M., AND VAZIRGIANNIS, M. 2000. A foundation for representing and querying moving objects. ACM Tran. Datab. Syst. 25, 1, 1-42.
17. GUTTMAN, A. 1984. R-Trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD conference (June), 47-57.
18. HADJIELEFTHERIOU, M., KOLLIOS, AND G., TSOTRAS, V. 2003. Performance evaluation of spatiotemporal selectivity estimation techniques. In Proceedings of Statistical and Scientific Database Management (SSDBM) (July), 202-211.
19. HADJIELEFTHERIOU, M., KOLLIOS, G., TSOTRAS, V., AND GUNOPULOS, D. 2002. Efficient indexing of spatiotemporal objects. In Proceedings of Extending Data Base Technology (EDBT) (March). 251-268.
20. HAN, J., STEFANOVIC, N., AND KOPERSKI, K. 1998. Selective materialization: An efficient method for spatial data cube construction. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD) (April), 144-158.
21. HARINARAYAN, V., RAJARAMAN A., AND ULLMAN, J. 1996. Implementing data cubes efficiently. In Proceedings of the ACM SIGMOD conference (June), 205-216.
22. HURTADO, C., MENDELZON, A., AND VAISMAN, A. 1999. Maintaining data cubes under dimension updates. In Proceedings of International Conference on Database Engineering (ICDE) (March), 346-355.
23. JURGENS M. AND LENZ H. 1998. The Ra*-tree: An improved R-tree with materialized data for supporting range queries on OLAP-data. In Proceedings of International Workshop on Database and Expert Systems Applications (Aug.), 186-191.
24. KIMBALL, R. 1996. The Data Warehouse Toolkit. John Wiley.
25. KLINE, N. AND SNODGRASS, R. 1995. Computing temporal aggregates. In Proceedings of International Conference on Database Engineering (ICDE) (March), 222-231.
26. 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), 261-272.
27. KOLLIOS, G., GUNOPULOS, D., TSOTRAS, V., DELIS, A., AND HADJIELEFTHERIOU, M. 2001. Indexing animated objects using spatiotemporal access methods. Tran. Knowl. Data Eng. (TKDE), 13, 5, 758-777.
28. KUMAR, A., TSOTRAS, V., AND FALOUTSOS, C. 1998. Designing access methods for bitemporal databases. Tran. Knowl Data Eng. (TKDE), 10, 1, 1-20.
29. KWON, D., LEE, S., AND LEE. S. 2002. Indexing the current positions of moving objects using the lazy update R-tree. In Proceedings of the 4th Mobile Data Management (MDM) (Jan.), 113-120.
30. LAZARIDIS, I. AND MEHROTRA, S. 2001. Progressive approximate aggregate queries with a multiresolution tree structure. In Proceedings of the ACM SIGMOD conference (June), 401-412.
31. LEE, M., HSU, W., JENSEN, C., CUI, B., AND TEO, K. 2003. Supporting frequent updates in R-Trees: A bottom-up approach. In Proceedings of Very Large Database Conference (VLDB) (Sep.), 608-619.
32. MENDELZON, A. AND VAISMAN, A. 2000. Temporal queries in OLAP. In Proceedings of Very Large Database Conference (VLDB) (Sep.), 242-253.
33. MOON, B., LOPEZ, I., AND IMMANUEL, V. 2000. Scalable algorithms for large temporal aggregation. In Proceedings of International Conference on Database Engineering (ICDE) (Feb.), 145-154.
34. PAGEL, B.U., SIX, H.W., TOBEN, H., AND WIDMAYER, 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), 49-58.
35. PAPADIAS, D., KALNIS, P., ZHANG, J., AND TAO, Y. 2001. Efficient OLAP operations in spatial data warehouses. In Proceedings of the International Symposium on Spatial and Temporal Databases (SSTD) (July), 443-459.
36. PAPADIAS, D., TAO, Y., KALNIS, P., AND ZHANG, J. 2002. Indexing spatio-temporal data warehouses. 2002. In Proceedings of International Conference on Database Engineering (ICDE) (Feb.), 166-175.
37. 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) (Sep.), 395-406.
38. SALTENIS, S. AND JENSEN, C. 2002. Indexing of moving objects for location-based services. In Proceedings of International Conference on Database Engineering (ICDE) (Feb.), 463-472.
39. SALTENIS, S., JENSEN, C., LEUTENEGGER, S., AND LOPEZ, M. 2000. Indexing the positions of continuously moving objects. In Proceedings of the ACM SIGMOD conference (June), 331-342.
40. SALZBERG, B. AND TSOTRAS, V. 1999. A comparison of access methods for temporal data. ACM Computing Surveys 31, 2, 158-221.
41. SHUKLA, A., DESHPANDE, P., AND NAUGHTON, J. 1998. Materialized view selection for multidimensional datasets. In Proceedings of Very Large Database Conference (VLDB) (Aug.), 488-499.
42. SISTLA, A., WOLFSON, O., CHAMBERLAIN, S., AND DAO, S. 1997. Modeling and querying moving objects. In Proceedings of International Conference on Database Engineering (ICDE) (April), 422-432.
43. STEFANOVIC, N., HAN, J., AND KOPERSKI, K. 2000. Object-based selective materialization for efficient implementation of spatial data cubes. Tran. Knowl. Data Eng. (TKDE), 12, 6, 938-958.
44. TAO, Y., KOLLIOS, G., CONSIDINE, J., LI, F., AND PAPADIAS, D. 2004. Spatio-temporal aggregation using sketches. In Proceedings of International Conference on Database Engineering (ICDE) (March), 214-226.
45. TAO, Y. AND PAPADIAS, D. 2001. The MV3R-tree: A spatio-temporal access method for timestamp and interval queries. In Proceedings of Very Large Database Conference (VLDB) (Sep.), 431-440.
46. TAO, Y. AND PAPADIAS, D. 2004. Performance analysis of R*-trees with arbitrary node extents. Tran. Knowl. Data Eng. (TKDE), 16, 6, 653-668.
47. TAO, Y., PAPADIAS, D., AND SUN, J. 2003a. The TPR*-tree: An optimized spatio-temporal access method for predictive queries. Proceedings of Very Large Database Conference (VLDB) (Sep.), 790-801.
48. TAO, Y., PAPADIAS, D., AND ZHANG, J. 2002a. Cost models for overlapping and multi-version structures. ACM Tran. Datab. Syst. 27, 3, 299-342.
49. TAO, Y., PAPADIAS, D., AND ZHANG, J. 2002b. Efficient processing of planar points. In Proceedings of Extended Database Technology (EDBT) (March), 682-700.
50. TAO, Y., SUN, J., AND PAPADIAS, D. 2003b. Selectivity estimation for predictive spatio-temporal queries. ACM Tran. Datab. Syst. 28, 4, 295-336.
51. THEODORIDIS, Y. AND SELLIS, T. 1996. A model for the prediction of R-tree performance. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (June), 161-171.
52. 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.
53. TIGER, http://www.census.gov/geo/www/tiger/.
54. VARMAN, P. AND VERMA, R. 1997. Optimal Storage and access to multiversion data. Tran. Knowl. Data Eng. (TKDE), 9, 3, 391-409.
55. VAZIRGIANNIS, M., THEODORIDIS, Y., AND SELLIS, T. 1998. Spatio-temporal composition and indexing for large multimedia applications. Multimedia Systems, 6, 4, 284-298.
56. YANG, J. AND WIDOM, J. 2003. Incremental computation and maintenance of temporal aggregates. The VLDB Journal, 12, 3, 262-283.
57. YAO, S. Random 2-3 Trees. 1978. Acta Informatica, 2, 9, 159-179.
58. ZHANG, D., GUNOPULOS, D., TSOTRAS, V., AND SEEGER, B. 2002. Temporal aggregation over data streams using multiple granularities. In Proceedings of Extended Database Technology (EDBT) (March), 646-663.
59. ZHANG, D., GUNOPULOS, D., TSOTRAS, V., AND SEEGER, B. 2003. Spatial and temporal aggregation over data streams using multiple granularities. Information Systems, 28, 1-2, 61-84.
60. ZHANG, D., MARKOWETZ, A., TSOTRAS, V., GUNOPULOS, D., AND SEEGER, B. 2001. Efficient computation of temporal aggregates with range predicates. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (May), 237-245.
61. ZHANG, D., TSOTRAS, V., AND GUNOPULOS, D. 2002. Efficient aggregation over objects with extent. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) (May), 121-132.