A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit <a rel="external noopener" href="http://infolab.usc.edu/csci599/Fall2007/papers/c-3.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="ACM Press">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vxrc3vebzzachiwy3nopwi3h5u" style="color: black;">Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02</a>
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current motion of the query and the database objects, and (iii) the change that causes the expiration of the result. Due to the highly dynamic nature of several spatiotemporal applications, TP queries are important both as standalone methods, as well as building blocks of more complex operations. However, little work has been<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/564691.564730">doi:10.1145/564691.564730</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigmod/TaoP02.html">dblp:conf/sigmod/TaoP02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h7uf4hpbqfanvolo45kdnjpteq">fatcat:h7uf4hpbqfanvolo45kdnjpteq</a> </span>
more »... towards their efficient processing. In this paper, we propose a general framework that covers time-parameterized variations of the most common spatial queries, namely window queries, k-nearest neighbors and spatial joins. In particular, each of these TP queries is reduced to nearest neighbor search where the distance functions are defined according to the query type. This reduction allows the application and extension of well-known branch and bound techniques to the current problem. The proposed methods can be applied with mobile queries, mobile objects or both, given a suitable indexing method. Our experimental evaluation is based on R-trees and their extensions for dynamic objects.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070824164750/http://infolab.usc.edu/csci599/Fall2007/papers/c-3.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/56/25/5625db5a3c33cfda7f0f135223400c16ccdd4c23.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/564691.564730"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>