The B-dual-tree: indexing moving objects by space filling curves in the dual space
Publication in refereed journal


Times Cited
Web of Science57WOS source URL (as at 23/10/2020) Click here for the latest count
Altmetrics Information
.

Other information
AbstractExisting spatiotemporal indexes suffer from either large update cost or poor query performance, except for the B-x-tree (the state-of-the-art), which consists of multiple B+-trees indexing the 1D values transformed from the (multi-dimensional) moving objects based on a space filling curve (Hilbert, in particular). This curve, however, does not consider object velocities, and as a result, query processing with a B-x-tree retrieves a large number of false hits, which seriously compromises its efficiency. It is natural to wonder "can we obtain better performance by capturing also the velocity information, using a Hilbert curve of a higher dimensionality?". This paper provides a positive answer by developing the B-dual-tree, a novel spatiotemporal access method leveraging pure relational methodology. We show, with theoretical evidence, that the B-dual-tree indeed outperforms the B-x-tree in most circumstances. Furthermore, our technique can effectively answer progressive spatiotemporal queries, which are poorly supported by B-x-trees.
All Author(s) ListYiu ML, Tao YF, Mamoulis N
Journal nameVLDB Journal
Year2008
Month5
Day1
Volume Number17
Issue Number3
PublisherSpringer Verlag (Germany)
Pages379 - 400
ISSN1066-8888
eISSN0949-877X
LanguagesEnglish-United Kingdom
Keywordsaccess method; space filling curve; spatiotemporal
Web of Science Subject CategoriesComputer Science; Computer Science, Hardware & Architecture; COMPUTER SCIENCE, HARDWARE & ARCHITECTURE; Computer Science, Information Systems; COMPUTER SCIENCE, INFORMATION SYSTEMS

Last updated on 2020-24-10 at 01:51