• VTPR-tree : An efficient index...

Result: VTPR-tree : An efficient indexing method for moving objects with frequent updates

Title:
VTPR-tree : An efficient indexing method for moving objects with frequent updates
Authors:
WEI LIAO, GUIFEN TANG, NING JING, ZHINONG ZHONG
Source:
Advances in conceptual modeling (Theory and practice)Lecture notes in computer science. :120-129
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 7 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Génie logiciel, Software engineering, Analyse conceptuelle, Conceptual analysis, Análisis conceptual, Base donnée orientée objet, Object-oriented databases, Corps mobile, Moving body, Cuerpo móvil, Distribution vitesse, Velocity distribution, Distribución velocidad, Développement logiciel, Software development, Desarrollo logicial, Indexation, Indexing, Indización, Interrogation base donnée, Database query, Interrogación base datos, Mise à jour, Updating, Actualización, Méthode arborescente, Tree structured method, Método arborescente, Méthode ascendante, Bottom up method, Método ascendente, Simultanéité informatique, Concurrency, Simultaneidad informatica, Structure arborescente, Tree structure, Estructura arborescente, Trajectoire, Trajectory, Trayectoria
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Electronic Science and Engineering, National University of Defense Technology, China
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19150552
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150552
Database:
PASCAL Archive

Further Information

Moving object databases are required to support queries on a large number of continuous moving objects. Indexes for moving objects must support both query and update operations efficiently. In previous work TPR-tree is the most popular indexing method for the future predicted position, but its frequent updates performance is very poor. In this paper we propose a novel indexing method, called VTPR-tree, for predicted trajectory of moving objects. VTPR-tree takes into account both the velocity and space distribution of moving objects. First the velocity domain is split, and moving objects are classified into different velocity buckets by their velocities, thus objects in one bucket have similar velocities. Then we use an improved TPR-tree structure to index objects in each bucket. VTPR-tree is supplemented by a hash index on IDs of moving objects to support frequent updates. Also an extended bottom-up update algorithm is developed for VTPR-tree, thus having a good dynamic update performance and concurrency. Experimental results show that the update and query performance of VTPR-tree outperforms the TPR*-tree.