Title: +Query and Update Efficient B-Tree Based Indexing of Moving Objects
Abstract: 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.