Results 231 to 240 of about 4,847 (258)
Some of the next articles are maybe not open access.
eDAR Algorithm for Continuous KNN Queries Based on Pine
International Journal of Information Technology and Web Engineering, 2006The continuous K nearest neighbor (CKNN) query is an important type of query that continuously finds the KNN to a query point on a given path. In this article we focus on moving queries issued on stationary objects in spatial network database (SNDB).
Maytham Safar, Dariush Ebrahimi
openaire +1 more source
Evaluating KNN-skyline queries in dynamic road networks
2018 27th Wireless and Optical Communication Conference (WOCC), 2018The continuous K-nearest neighbor-skyline query (CKN-SQ) is an important type of location-based queries in road networks. However, previous studies focus only on static road networks. That is, the object attributes and the conditions of roads in a road network are unchanged.
Yuan-Ko Huang +2 more
openaire +1 more source
Keyword-aware continuous kNN query on road networks
2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016It is nowadays quite common for road networks to have textual contents on the vertices, which describe auxiliary information (e.g., business, traffic, etc.) associated with the vertex. In such road networks, which are modelled as weighted undirected graphs, each vertex is associated with one or more keywords, and each edge is assigned with a weight ...
Bolong Zheng +6 more
openaire +3 more sources
An Efficient Framework for Correctness-Aware kNN Queries on Road Networks
2019 IEEE 35th International Conference on Data Engineering (ICDE), 2019Given a set O of objects and a query point q on a road network, the k Nearest Neighbor (kNN) query returns the k nearest objects in O with the shortest road network distance to q. These kNN queries find many applications in location-based services, e.g., ride-hailing services, where each taxi is regarded as an object.
Dan He 0009 +3 more
openaire +3 more sources
Research of KNN query processing in road networks
2009 2nd International Conference on Power Electronics and Intelligent Transportation System (PEITS), 2009With the developments of mobile computations and location-based services, searching for k nearest neighbors in road networks become a challenging research direction. In this paper, we first introduce a road network model based on mobile agents. Based on this model, we design a new algorithm.
null Xuedong Du, null Jiangtao Ji
openaire +1 more source
PRkNN: Efficient and Privacy-Preserving Reverse kNN Query Over Encrypted Data
IEEE Transactions on Dependable and Secure Computing, 2023Rongxing Lu, Jun Shao, Songnian Zhang
exaly
Answering range-based reverse kNN and why-not reverse kNN queries
Frontiers of Computer Science, 2019Zhefan Zhong +2 more
openaire +1 more source
Efficient and Privacy-Preserving Aggregated Reverse kNN Query Over Crowd-Sensed Data
IEEE Transactions on Information Forensics and Security, 2023Rongxing Lu, Hui Li, Jun Shao
exaly