Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

An Indexing Technique for Range Sum Queries in Spatio - Temporal Databases

시공간 데이타베이스에서 영역 합 질의를 위한 색인 기법

  • 조형주 (LG전자 DM 연구소) ;
  • 최용진 (한국과학기술원 전산학과) ;
  • 민준기 (한국기술교육대학교 인터넷 미디어학부) ;
  • 정진완 (한국과학기술원 전자전산학과 및 영상정보특화연구센터)
  • Published : 2005.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.

시공간 데이타베이스는 최근에 많은 주목을 받았지만, 영역 합 질의에 대한 연구는 그 중요성에 비하여 많이 부족하다. 영역 합 질의를 처리하기 위하여, 많은 양의 데이타에 대한 직접적인 접근은 엄청난 계산 비용을 야기하기 때문에, 최근에 기존 색인 기법을 활용한 materialization 방법이 제안되었다. 간단하면서 효과적인 방법은 시공간 조건을 가지는 윈도우 질의를 효율적인 처리하는 MVR-tree에 materialization 방법을 적용하는 것이다. 그러나, MVR-tree는 노드들 사이의 존재하는 원형 경로 때문에, 중간 노드에 미리 계산된 합을 유지하는 것이 불가능하다. 다른 색인 구조들에 기초한 집합적 구조(aggregate structures)는 만족스러운 질의 성능을 제공하지 못 한다. 본 논문에서는 적응적 분할 기법을 사용하는 새로운 색인 기법(Adaptive Partitioned Aggregate R-Tree, APART)과 다양한 환경에서 영역합 질의를 효율적으로 처리하는 질의 처리 알고리즘을 제안한다. 실험 결과는 APART의 성능이 다양한 상황에서 기존의 집합적 색인 기법들보다 2배 이상 우월하다는 것을 보여준다.

Keywords

References

  1. 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
  2. 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
  3. 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
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. T. Brinkhoff: A Framework for Generating Network-Based Moving Objects. GeoInformation 6(2): 153-180, 2002 https://doi.org/10.1023/A:1015231126594
  18. 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
  19. http://www.esri.com/data/download/census2000_tigerline/Index.html
  20. 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