Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2004.11D.7.1399

Declustering Method for Moving Object Database  

Seo YoungDuk (부산대학교 대학원 컴퓨터공학과)
Hong EnSuk (삼성전자 무선사업부)
Hong BongHee (부산대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartD / v.11D, no.7, 2004 , pp. 1399-1408 More about this Journal
Abstract
Because there are so many spatio-temporal data in Moving Object Databases, a single disk system can not gain the fast response time and tota throughput. So it is needed to take a parallel processing system for the high effectiveness query process. In these existing parallel process-ing system. it does not consider characters of moving object data. Moving object data have to be thought about continuous report to the Moving Object Databases. So it is necessary think about the new Declustering System for the high performance system. In this paper, we propose the new Dechustering Policies of Moving objet data for high effectiveness query processing. At first, consider a spatial part of MBB(Minimum Bounding Box) then take a SD(SemiAllocation Disk) value. Second time, consider a SD value and time value which is node made at together as SDT-Proximity. And for more accuracy Declustering effect, consider a Load Balancing. Evaluation shows performance improvement of aver-age %15\%$ compare with Round-Robin method about $5\%\;and\;10\%$ query area. And performance improvement of average $6\%$ compare with Spatial Proximity method.
Keywords
이동체 데이터베이스;디플러스터링;병렬데이타베이스;공간데이타베이스;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Dieter Proser, Christian S. Jensen, Yannis Theodorisdis, 'Novel Approaches to the Indexing of Moving Object Trajectories,' In Proc, of the 26th Int, 1 Conference on VLDB, pp.395-406, 2000
2 홍은석, 서영덕, 홍봉희, '이동체 데이터의 근접성을 이용한 시공간 디클러스터링 방법', 한국정보과학회 2003 봄 학술발표논문집, 제30권 제1호, pp.767-769, Apr., 2003
3 홍은석, 서영덕, 홍봉희, '이동체 데이터베이스에서 시공간 근접성을 고려한 디클러스터링정책', 한국정보과학회 2004 가을 학술발표논문집, pp.118-120, Oct., 2003   과학기술학회마을
4 Bernhard Seeger, Per-Ake Larson, 'Multi-Disk B-trees,' ACM SIGMOD Conference, pp.436-445, 1991   DOI
5 Ibrahim Kamel, Christos Faloustsos, 'Parallel R-Trees,' Proxeedings of the 1992 ACM SIGMOD, pp.195-204, 1992   DOI
6 Nick Koudas and Christos Faloutsos and Ibrahim Kamel, 'Declustering Spatial Databases on a Multi-Computer Architecture,' Extending Database Technology, pp.592-614, 1996
7 Peter J. Varman and Rakesh M. Verma, 'An Efficient Multiversion Access Structure,' IEEE TRANSACTION ON KNOWLEDGE AND DATA ENGINEERING, pp.391-409, 1997   DOI   ScienceOn
8 HV Jagadish, 'Analysis of the hilbert curve for representing two-dimensional space,' Information Processing Letters, pp.17-22, 1997   DOI   ScienceOn
9 Yannis Theodoridis, Jefferson R. O. Silva, Mario A. Nascimento, 'On the Generation of Spatio-temporal Datasets,' In Proceedings of the 6th Int'l Symposium on Large Spatial Databases, 1999
10 Sanjiv Behl, Rakesh M. Verma, 'Efficient Declustering Techniques for Temporal Access Structures,' Proceedings of the 1991 ACM SIGMOD Conference, pp.436-445, 1991   DOI