A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://www.comp.nus.edu.sg/~ooibc/bxtree.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Proceedings 2004 VLDB Conference
A number of emerging applications of data management technology involve the monitoring and querying of large quantities of continuous variables, e.g., 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<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-012088469-8/50068-1">doi:10.1016/b978-012088469-8/50068-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r7zqdhynpjhspoklm47c27v6cy">fatcat:r7zqdhynpjhspoklm47c27v6cy</a> </span>
more »... concurrency overheads during node splitting, and each individual update is known to be quite costly. This motivates the design of a solution that enables the B § -tree to manage moving objects. We represent moving-object locations as vectors that are timestamped 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. We develop algorithms for range and¨nearest neighbor queries, as well as continuous queries. The proposal can be grafted into existing database systems cost effectively. An extensive experimental study explores the performance characteristics of the proposal and also shows that it is capable of substantially outperforming the R-tree based TPRtree for both single and concurrent access scenarios.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170107101232/http://www.comp.nus.edu.sg/~ooibc/bxtree.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/89/5f/895fee46ed6b1b662dc9b1daaac211f218048d2b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-012088469-8/50068-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>