참고문헌
- M. Nascimento and J. Silva: Towards historical R-trees. In Proceedings of the 1998 ACM symposium on Applied Computing, pages 226-234, 1998 https://doi.org/10.1145/330560.330692
- S. Saltenis, C. S. Jensen, S. Leutenegger and M. Lopez, 'Indexing the Positions of Continuously Moving Objects,' In Proc. of the ACM SIGMOD International Conference on the Management of Data, pp.331-342, 2000 https://doi.org/10.1145/342009.335427
- Y. Tao and D. Papadias: The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries, In Proceedings of the International Conference on Very Large Data Bases, pages 431-440, 2001
- M. Vazirgiannis, Y. Theodoridis, and T. Sellis: Spatio-Temporal Composition and Indexing for Large Multimedia Applications. Multimedia Systems 6(4), pages 284-298, 1998 https://doi.org/10.1007/s005300050094
- Z. Song and N. Roussopoulos: K-Nearest Neighbor Search for Moving Query Point. In Proceedings of the Symposium on Large Spatial Databases, pages 79-96, 2001
- Y. Tao and D. Papadias: Time-Parameterized Queries in Spatio-Temporal Databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 334-345, 2002 https://doi.org/10.1145/564691.564730
- Y. Tao, D. Papadias, and Q. Shen: Continuous Nearest Neighbor Search. In Proceedings of the International Conference on Very Large Data Bases, pages 287-298, 2002
- D. Pfoser, C. S. Jensen, and Y. Theodoridis: Novel Approaches in Query Processing for Moving Object Trajectories. In Proceedings of the International Conference on Very Large Data Bases, pages 395-406, 2000
- J.Gray, A.Bosworth, A.Layman, H.Pitamish, Data Cube : A Relational Aggregatioon Operator Generalizing Group-By, Cross-Tab, and Sub-Totals, In Proc. of ICDE, pp. 152-159, 1996 https://doi.org/10.1109/ICDE.1996.492099
- V. Harinarayan, A. Rajaraman, and J. Ullman: Implementing Data Cubes Efficiently. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 205-216, 1996 https://doi.org/10.1145/235968.233333
- I. Lazaridis and S. Mehrotra: Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 401-412, 2001 https://doi.org/10.1145/375663.375718
- D. Papadias, Y. Tao, P. Kalnis, and J. Zhang: Indexing Spatio-Temporal Data Warehouses. In Proceedings of IEEE International Conference on Data Engineering, pages 166-175, 2002 https://doi.org/10.1109/ICDE.2002.994706
- N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 322-331, 1990
- A. Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 47-57, 1984
- W. Choi, B. Moon, and S. Lee: Adaptive cell-based index for moving objects. Data & Knowledge Engineering, 48(1): 75-101, 2004 https://doi.org/10.1016/S0169-023X(03)00120-4
- Y. Theodoridis, J. Silva, and M. Nascimento: On the Generation of Spatio-temporal Datasets. In Proceedings of the Symposium on Large Spatial Databases, pages 147-164, 1999
- T. Brinkhoff: A Framework for Generating Network-Based Moving Objects. GeoInformation 6(2): 153-180, 2002 https://doi.org/10.1023/A:1015231126594
- M. Nascimento, J. Silva, and Y. Theodoridis: Evaluation of Access Structures for Discretely Moving Points. In Proceedings of the Workshop on Spatio-Temporal Database Management, pages 171-188, 1999
- http://www.esri.com/data/download/census2000_tigerline/Index.html
- T. Sellis, N. Roussopoulos, and C. Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In Proceedings of the International Conference on Very Large Data Bases, pages 507-518, 1987