A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit <a rel="external noopener" href="http://dna.fernuni-hagen.de/papers/KNearestNeighbors-Revised-2010-01-22.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Springer Nature">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bj2uhzcrunglzmjsyjjm3qh4hm" style="color: black;">The VLDB journal</a>
With the growing number of mobile applications, data analysis on large sets of historical moving objects trajectories becomes increasingly important. Nearest neighbor search is a fundamental problem in spatial and spatio-temporal databases. In this paper we consider the following problem: Given a set of moving object trajectories D and a query trajectory mq, find the k nearest neighbors to mq within D for any instant of time within the life time of mq. We assume D is indexed in a 3D-R-tree and<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00778-010-0185-7">doi:10.1007/s00778-010-0185-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ne2htenb55cm5jaspmabe6ifyi">fatcat:ne2htenb55cm5jaspmabe6ifyi</a> </span>
more »... mploy a filter-and-refine strategy. The filter step traverses the index and creates a stream of so-called units (linear pieces of a trajectory) as a superset of the units required to build the result of the query. The refinement step processes an ordered stream of units and determines the pieces of units forming the precise result. To support the filter step, for each node p of the index, in preprocessing a time dependent coverage function C p (t) is computed which is the number of trajectories represented in p present at time t. Within the filter step, sophisticated data structures are used to keep track of the aggregated coverages of the nodes seen so far in the index traversal to enable pruning. Moreover, the R-tree index is built in a special way to obtain coverage functions that are effective for pruning. As a result, one obtains a highly efficient k-NN algorithm for moving data and query points that outperforms the two competing algorithms by a wide margin. Implementations of the new algorithms and of the competing techniques are made available as well. Algorithms can be used in a system context including, for example, visualization and animation of results. Experiments of the paper can be easily checked or repeated, and new experiments be performed.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110331181530/http://dna.fernuni-hagen.de/papers/KNearestNeighbors-Revised-2010-01-22.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/a1/a8/a1a8cb636602095c19ed4ad652db3efbf829958a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00778-010-0185-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>