Towards quadtree-based moving objects databases

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nowadays, one of the main research issues of great interest is the efficient tracking of mobile objects that enables the effective answering of spatiotemporal queries. This line of research is relevant to a number of modern applications spanning many contexts. In this paper, we consider the organization of a moving object database by quadtree based structures (structures obeying the Embedding Space Hierarchy). In this context, we adapt an indexing method, called XBR trees, to support range queries about the history of trajectories of moving objects. The XBR tree is a quadtree like external memory, balanced and compact structure that follows regular decomposition. Apart from the presentation of the new method, we experimentally show that it outperforms the only previous Embedding Space Hierarchy approach (based on PRM quadtrees) for indexing moving objects. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Raptopoulou, K., Vassilakopoulos, M., & Manolopoulos, Y. (2004). Towards quadtree-based moving objects databases. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3255, 230–245. https://doi.org/10.1007/978-3-540-30204-9_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free