Indexing structure for moving object databases based on R-tree

被引：0

作者：

College of Computer Science and Technology, Harbin University of Science and Technology, Harbin, 150080, China ^{[1
]}

不详 ^{[2
]}

机构：

[1] College of Computer Science and Technology, Harbin University of Science and Technology, Harbin

[2] College of Computer Science and Technology, Harbin Institute of Technology, Harbin

来源：

J. China Univ. Post Telecom. | 2008年 / SUPPL.卷 / 64-67,78期

关键词：

indexing structure; moving object databases; R-tree;

D O I：

10.1016/S1005-8885(08)60157-0

中图分类号：

学科分类号：

摘要：

A general trajectory model based on moving point is introduced, which can model low dimension and high dimension moving objects. Discrete update strategies are discussed. On this basis a 2-level indexing structure based on R-tree is put forward. It indexes the object's current and past moving trajectory by R-tree and dynamic array connected with its leaf node. The method of update, insertion and deletion based on the structure has been discussed in detail. It is implied that the structure supports queries on past, now and future, and the space intersection is very small. © 2008 The Journal of China Universities of Posts and Telecommunications.

引用

页码：64 / 67,78

共 4 条

[1] Guttman A., R-trees: a dynamic index structure for spatial searching, ACM SIGMOD, pp. 47-57, (1984)
[2] Saltenis S., Jensen C.S., Indexing of moving objects for location-based services, Proc of ICDE, (2002)
[3] Tayeb J., Ulusoy O., Wolfson O., A quadtree based dynamic attribute indexing method, The Computer Journal, 41, 3, pp. 185-200, (1998)
[4] GAuting R.H., BAohlen M.H., Vazirgiannis M., A foundation for representing and querying moving objects, ACM Transactions on Database Systems (TODS), 25, 1, pp. 1-42, (2000)

← 1 →