- +Query and Update Efficient B-Tree Based Indexing of Moving Objects

https://doi.org/10.1016/B978-012088469-8.50068-1Get rights and content

Publisher Summary

A number of emerging applications of data management technology involve the monitoring and querying of large quantities of continuous variables—the positions of mobile service users, termed moving objects. In such applications, large quantities of state samples obtained via sensors are streamed to a database. Indexes for moving objects must support queries efficiently, but must also support frequent updates. Indexes based on minimum bounding regions (MBRs) such as the R-tree exhibit high concurrency overheads during node splitting, and each individual update is known to be quite costly that has led to the design of a solution that enables the B+-tree to manage moving objects. This chapter presents moving-object locations as vectors that are time-stamped based on their update time. By applying a novel linearization technique to these values, it is possible to index the resulting values using a single B+-tree that partitions values according to their timestamp and otherwise preserves spatial proximity.

References (0)

Cited by (289)

  • SwapQt: Cloud-based in-memory indexing of dynamic spatial data

    2020, Future Generation Computer Systems
    Citation Excerpt :

    In this paper, we focus on spatial range queries. Other query types such as k-nearest neighbors can be derived from range query [24]. In a distributed environment, the query processing performance is drastically affected by how the data is distributed.

  • Construction and Training of Multi-Associative Graph Networks

    2023, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View all citing articles on Scopus
View full text