Indexing moving objects based on 2 n index tree

Authors:
Huanzhuo Ye;Hongxia Luo;Kezhen Song;Huali Xiang;Jing Chen
Affiliations:
Information School, Zhongnan University of Economics and Law, Wuhan, Hubei Province, P. R. China;School of Geographical Sciences, Southwest University, Chongqing, P. R. China;Information School, Zhongnan University of Economics and Law, Wuhan, Hubei Province, P. R. China;Information School, Zhongnan University of Economics and Law, Wuhan, Hubei Province, P. R. China;State Key Laboratory of Information Engineering in Surveying and Mapping, Wuhan University, Wuhan, Hubei Province, P. R. China
Venue:
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
Year:
2007

Citing 28
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance

ACM Transactions on Database Systems (TODS)
The time index+: an incremental access structure for temporal databases

CIKM '94 Proceedings of the third international conference on Information and knowledge management
The snapshot index: an I/O-optimal access method for timeslice queries

Information Systems
Indexing values of time sequences

CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data structures and algorithms for nearest neighbor search in general metric spaces

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Comparison of access methods for time-evolving data

ACM Computing Surveys (CSUR)
Towards historical R-trees

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Using space-time grid for efficient management of moving objects

Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Hashing Methods for Temporal Data

IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing Methods for Temporal Relations

IEEE Transactions on Knowledge and Data Engineering
Efficient Implementation Techniques For the Time Index

Proceedings of the Seventh International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Time Index: An Access Structure for Temporal Data

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries

Proceedings of the 27th International Conference on Very Large Data Bases
Query Processing for Moving Objects with Space-Time Grid Storage Model

MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Indexing Time-Series Databases for Inverse Queries

DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
An asymptotically optimal multiversion B-tree

The VLDB Journal — The International Journal on Very Large Data Bases
Q+Rtree: Efficient Indexing for Moving Object Databases

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
A Quadtree Based Dynamic Attribute Index Structure and Query Process

ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Indexing of Moving Objects for Location-Based Services

ICDE '02 Proceedings of the 18th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In moving objects information management, Motion state model (MSM) is based on sample method and suits to most applications. Because of its characters, 2n index tree is proposed to organize the motion data. In order to increase the efficiency of indexing, some issues such as late updating of leaf node splitting and merging, pre-query before the query of objects relation and the reference of motion vectors in index tree are carefully studied. Comparing to other indexing method, 2n index tree works better with MSM.