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 the original URL.
The file type is application/pdf.
Filters
Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates
[chapter]
2003
Proceedings 2003 VLDB Conference
Preserved Fulltext
V r i s & k 8m d t D T Í k 8m d H D % T ¦ ( 2 " q ! V f k ! } ' x ' d ) D % D T ¢ T 2 | ' u a t i % & E v ! V Y D ( k 2 } ' x ' d D % D T Q T ¢ T Ç © @ B A E D ) d T { ! V Ì Y y k Ì 8C 0 ¦ µ ! ...
V k Ì % m x ' } @d © C ' C W d i } @ i D S F H G B I ) G G k 8m z d H D % T G d T 1 V Y y k Ä 8C § ¦ µ ! ...
doi:10.1016/b978-012722442-8/50052-5
dblp:conf/vldb/IwerksSS03
fatcat:shhbv3m2wvbwjbqxxe4rlcgfj4
Approximate Continuous K Nearest Neighbor Queries for Continuous Moving Objects with Pre-defined Paths
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
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 the original URL.
The file type is application/pdf.
Continuous K nearest neighbor queries (C-KNN) on moving objects retrieve the K nearest neighbors of all points along a query trajectory. ...
The cost includes the location updates of the moving objects when the velocities change over time and the number of continuous KNN queries posed by the moving object to the server. ...
In this paper, we present a new approach, termed an approximate continuous K nearest neighbor query (AC-KNN) algorithm, to maintain a KNN result set with efficient updates for moving objects. ...
doi:10.1007/11568346_29
fatcat:zpsvxqsem5dzlklf5ecyv7xjui
View field nearest neighbor: A novel type of spatial queries
2014
Information Sciences
Preserved Fulltext
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 the original URL.
The file type is application/pdf.
Continuous view field nearest neighbor query processing consists of two phases: (1) initial phase and (2) update phase. ...
We propose a view field nearest neighbor query processing method that considers moving data objects (i.e., continuous view field nearest neighbor query processing), where we utilize the grid index. ...
We compared the monitoring method for continuous view field k nearest neighbor query with continually evaluating methods by periods. ...
doi:10.1016/j.ins.2014.02.022
fatcat:mwqwx36k3vd3ta2xrbd5465ewm
Continuous kNN Queries in Dynamic Road Networks
2016
Revista Técnica de la Facultad de Ingeniería Universidad del Zulia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose a query algorithm on continue k nearest neighbors in dynamic road networks, the CkNNDN algorithm. ...
The algorithm is applied to query continuous k nearest neighbors in dynamic condition, minimize the count of nearest neighbors candidates, and reduce expensive costs of the shortest path computation. ...
Step 2: Acquire the queries path and NVP intersection point In continuous k nearest neighbor queries, k nearest neighbor changes with the change of the location of the moving objects in the queries path ...
doi:10.21311/001.39.4.44
fatcat:fpm6ix2ozbbqtcrgwx662ki4ui
Nearest and reverse nearest neighbor queries for moving objects
2006
The VLDB journal
Preserved Fulltext
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 the original URL.
The file type is application/pdf.
This paper proposes algorithms for k nearest and reverse k nearest neighbor queries on the current and anticipated future positions of points moving continuously in the plane. ...
k closest neighbors, again for each time point during a time interval. ...
Acknowledgements This research was supported in part by grants from the Danish National Centre for IT research, the Nordic Academy for Advanced Study, and the Nykredit Corporation. ...
doi:10.1007/s00778-005-0166-4
fatcat:s5n4mwkugrf4hkwz46z7pl57qi
Continuous Reverse k-Nearest-Neighbor Monitoring
2008
The Ninth International Conference on Mobile Data Management (mdm 2008)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The processing of a Continuous Reverse k-Nearest-Neighbor (CRkNN) query on moving objects can be divided into two sub tasks: continuous filter, and continuous refinement. ...
The algorithms for the two tasks can be completely independent. Existing CRkNN solutions employ Continuous k-Nearest-Neighbor (CkNN) queries for both continuous filter and continuous refinement. ...
In this paper, we investigate the problem of processing Continuous Reverse k-Nearest-Neighbor (CRkNN) queries on moving objects. ...
doi:10.1109/mdm.2008.31
dblp:conf/mdm/WuYCT08
fatcat:7hfhjltklfg3fnypzo2eh7rjxq
Direction-Aware Continuous Moving K-Nearest-Neighbor Query in Road Networks
2019
ISPRS International Journal of Geo-Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Continuous K-nearest neighbor (CKNN) queries on moving objects retrieve the K-nearest neighbors of all points along a query trajectory. ...
In order to find the top K-nearest objects move towards the query object within a period of time, this paper presents a novel algorithm of direction-aware continuous moving K-nearest neighbor (DACKNN) ...
[16] developed a continuous K-nearest-neighbor query algorithm (CKNN) for moving objects in road networks. ...
doi:10.3390/ijgi8090379
fatcat:47xf2izoufbmtcedlisoopkehq
Dynamic Nearest Neighbor Queries in Euclidean Space
[chapter]
2015
Encyclopedia of GIS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Synonyms Nearest neighbor monitoring; Temporal nearest neighbor query Definition Given a query point q and a set D of data points, a nearest neighbor (NN) query returns the data point p in D that minimizes ...
One important variant of this query type is kNN query, which returns k data ...
Cross-References Nearest Neighbor Query Queries in Spatio-temporal Databases, Time Parameterized Neighbor Queries in Euclidean Space, Fig. 1 Continuous k-nearest neighbor query with a moving query point ...
doi:10.1007/978-3-319-23519-6_1558-1
fatcat:djuqr3v7k5g2jjvbd3xailxn2i
Dynamic Nearest Neighbor Queries in Euclidean Space
[chapter]
2017
Encyclopedia of GIS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Synonyms Nearest neighbor monitoring; Temporal nearest neighbor query Definition Given a query point q and a set D of data points, a nearest neighbor (NN) query returns the data point p in D that minimizes ...
One important variant of this query type is kNN query, which returns k data ...
Cross-References Nearest Neighbor Query Queries in Spatio-temporal Databases, Time Parameterized Neighbor Queries in Euclidean Space, Fig. 1 Continuous k-nearest neighbor query with a moving query point ...
doi:10.1007/978-3-319-17885-1_1558
fatcat:425f2o25ynhwno5renou66xpci
An query processing for continuous K-nearest neighbor based on R-Tree and Quad Tree
2010
2010 3rd International Conference on Computer Science and Information Technology
Preserved Fulltext
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 the original URL.
The file type is application/pdf.
This paper focus on continuous K-nearest neighbor (CKNN for short) query and propose a query method based on R-Tree and Quad Tree (QR-Tree) to support continuous Knearest neighbor query for moving objects ...
In the interested region, it uses the QR-Tree and hash tables as an index to store the moving object, and then calculates the distances between the query point and the moving objects to get the result. ...
For a given query, q'k-NN-dist denotes the minimum distance between query point q and its k-th nearest neighbor. ...
doi:10.1109/iccsit.2010.5563984
fatcat:u63xjct2dreifhufiypfhop45u
Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an efficient method to answer continuous k nearest neighbor (CkNN) queries in spatial networks. ...
Assuming a moving query object and a set of data objects that make frequent and arbitrary moves on a spatial network with dynamically changing edge weights, CkNN continuously monitors the nearest (in network ...
A Continuous k nearest neighbor (CkNN) query in spatial networks continuously monitors the k data objects that are nearest (in network distance) to a given query object, while the data objects and/or the ...
doi:10.1007/978-3-642-02982-0_5
fatcat:qmknqmpmwrb7xdvumu6esnvlyq
Continuous aggregate nearest neighbor queries
2011
Geoinformatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The answer to this continuous query is the set of k moving objects that have the smallest aggregate distance f . A CANN query may also be viewed as a combined set of nearest neighbor queries. ...
This paper addresses the problem of continuous aggregate nearestneighbor (CANN) queries for moving objects in spatio-temporal data stream management systems. ...
While traditional nearest-neighbor queries aim to find the k-nearest objects to only one certain point, the aggregate k-nearest-neighbor queries aim to find the k-nearest objects to a set of multiple points ...
doi:10.1007/s10707-011-0149-0
fatcat:brmyksigi5brfnpel63f75usay
CORE: Continuous Monitoring of Reverse k Nearest Neighbors on Moving Objects in Road Networks
[chapter]
2015
Studies in Computational Intelligence
Preserved Fulltext
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 the original URL.
The file type is application/pdf.
Reverse K-Nearest Neighbor (RKNN) queries in road networks have been studied extensively in recent years. ...
To avoid this recomputation, we introduce a new technique that can efficiently compute the safe exit points for continuous RKNNs. ...
Acknowledgements We thank anonymous reviewers for their valuable comments and suggestions. ...
doi:10.1007/978-3-319-23467-0_8
fatcat:pl64chy5a5b5dozhzr4ckxt2gy
Continuous Reverse k-Nearest-Neighbor Query in Dynamic Road Network
2016
International Journal of Grid and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
On this basis, a continuous reverse K-nearest-neighbor (RKNN) query method is proposed, and it is proved to be efficient by the experimental results. ...
Traditional location-based query measures the distance of all data points in various methods, but it is not applicable for the condition in which the weight of all sections in the road network are altered ...
As a significant location query, Reverse k-nearest-neighbor query (RKNN) receives much attention, and it is mainly applied to search the spatial data points containing the query point in k-neighbor, for ...
doi:10.14257/ijgdc.2016.9.5.12
fatcat:mbenxt5dnjhozhxohya4j5ij5a
FP-CPNNQ: A Filter-Based Protocol for Continuous Probabilistic Nearest Neighbor Query
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We propose an efficient probabilistic filter-based protocol for answering continuous nearest neighbor queries over uncertain sensor data. ...
Experimental evaluation on real-world temperature sensing data and synthetic location data showed a significant reduction in the number of update messages. ...
Reynold Cheng (University of Hong Kong) for providing support in the early stage of this research. ...
doi:10.1007/978-3-319-18123-3_4
fatcat:nuuzdfsty5gpppy44dtdjci6wm
« Previous
Showing results 1 — 15 out of 10,703 results