Design and Implementation of the dynamic hashing structure for indexing the current positions of moving objects

이동체의 현재 위치 색인을 위한 동적 해슁 구조의 설계 및 구현

  • 전봉기 (신라대학교 컴퓨터정보공학부)
  • Published : 2004.10.01

Abstract

Location-Based Services(LBS) give rise to location-dependent queries of which results depend on the positions of moving objects. Because positions of moving objects change continuously, indexes of moving object must perform update operations frequently for keeping the changed position information. Existing spatial index (Grid File, R-Tree, KDB-tree etc.) proposed as index structure to search static data effectively. There are not suitable for index technique of moving object database that position data is changed continuously. In this paper, I propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. The results of my extensive experiments show the dynamic hashing index outperforms the $R^$ $R^*$-tree and the fixed grid.

References

  1. O. Wolfson, A. P. Sistla, S. Chamberlain, and Y. Yesha, 'Updating and querying databases that track mobile units,' Distributed and Parallel Databases, vol. 7, no. 3, pp. 257-387, 1999 https://doi.org/10.1023/A:1008782710752
  2. A. Guttman, 'R-trees: A dynamic index structure for spatial searching,' Proc. of the ACM SIGMOD Int'l Cont. on Management of Data, pp. 47-54, 1984
  3. H. Samet, The Design and Analysis of Spatial Data Structures, Addision-Wesley, Reading, MA, 1990
  4. J. T. Robinson, 'The K-D-B-tree: A search structure for large multidimensional dynamic indexes,' Proc. of the ACM SIGMOD Int'l Cont. on Management of Data, pp. 10-18, 1981
  5. S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, 'Indexing the positions of continuously moving objects,' Proc. of the ACM SIGMOD Int'I Conf. on Management of Data, pp. 331-342, 2000
  6. G. Kollios, D. Gunopulos, and V. J. Tsotras. 'On indexing mobile objects,' Proc. of the ACM Symposium on Principles of Database Systems, pp. 261-272, 1999
  7. J. Tayeb, O. Ulusoy, and O. Wolfson. 'A quadtree based dynamic attribute indexing method,' The Computer Journal, vol. 41, no. 3, pp. 185-200, 1998 https://doi.org/10.1093/comjnl/41.3.185
  8. Z. Song and N. Roussopoulos, 'Hashing moving object,' Int'l. Cont. on Mobile Data Management, pp. 161-172, 2001
  9. D. Kwon, S. Lee and S. Lee, 'Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree', Inn. Cont. on Mobile Data Management, pp. 113-120, 2002
  10. J. Nievergelt, H. Hinterberger, and K. C. Sevcik, 'Then Grid Files: An adaptive, symmetric multikey file structure,' ACM Transactions on Database Systems, vol.9, no. 1, pp. 38-71, 1984 https://doi.org/10.1145/348.318586
  11. N. Beckmann and H. P. Kriegel, 'The R^*-tree: An efficient and robust access method for points and rectangles,' Proc. of the ACM SIGMOD Int'l Cont. on Management of Data, pp. 332-331, 1990.
  12. Y. Theodoridis, J. R. O Silva, and M.A Nascimento, 'On the generation of spatiotemporal datasets,' Proc. of Int'l Symposium on Spatial Databases, pp. 147-164, 1999
  13. 전봉기, 홍봉희, '이동체 데이타베이스를 위한 해쉬 기반의 공간 색인,' 한국정보과학회학술발표 논문집, 제28권, 제2호, pp. 205-07, 2001