Results 151 to 160 of about 4,853 (185)
Some of the next articles are maybe not open access.
Crawling hidden objects with kNN queries
2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016With rapidly growing popularity, Location Based Services (LBS), e.g., Google Maps, Yahoo Local, WeChat, FourSquare, etc., started offering web-based search features that resemble a kNN query interface. Specifically, for a user-specified query location q, these websites extract from the objects in their backend database the top-k nearest neighbors to q ...
Hui Yan +5 more
openaire +1 more source
SPRIG: A Learned Spatial Index for Range and kNN Queries
17th International Symposium on Spatial and Temporal Databases, 2021A corpus of recent work has revealed that the learned index can improve query performance while reducing the storage overhead. It potentially offers an opportunity to address the spatial query processing challenges caused by the surge in location-based services.
Songnian Zhang +3 more
openaire +1 more source
Answering why-not questions on KNN queries
Frontiers of Computer Science, 2019Being decades of study, the usability of database systems have received more attention in recent years. Now it is especially able to explain missing objects in a query result, which is called “why-not” questions, and is the focus of concern. This paper studies the problem of answering why-not questions on KNN queries. In our real life, many users would
Zhefan Zhong +3 more
openaire +1 more source
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
The VLDB Journal, 2009The moving k nearest neighbor (MkNN) query continuously finds the k nearest neighbors of a moving query point. MkNN queries can be efficiently processed through the use of safe regions. In general, a safe region is a region within which the query point can move without changing the query answer.
Sarana Nutanong +3 more
openaire +2 more sources
Indexing land surface for efficient kNN query
Proceedings of the VLDB Endowment, 2008The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, with the recent advances in remote sensory devices that can acquire detailed elevation data, the new geospatial applications heavily ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
openaire +1 more source
Efficient Parallel Processing for KNN Queries
Proceedings of the 2017 International Conference on Industrial Design Engineering, 2017The most efficient algorithms so far for top-k query over sorted lists are the best position algorithms, BPA and BPA2 and they can be deduced to answering parallel k nearest neighbor (PkNN) of a given query point q. However, BPA and BPA2 may still incur a lot of useless random accesses to (m - 1) lists, where m is the number of lists. In this paper, we
Tao Jiang, Bin Zhang, Fahong Yu
openaire +1 more source
Processing the v-KNN Queries inWireless Sensor Networks
2007 International Conference on Parallel Processing (ICPP 2007), 2007Recently there have been growing interests in the applications of wireless sensor networks. Given a query point, which is a value, find a set of K nodes whose values are nearest to this point. We call this query the value-based KNN (v-KNN) query. v-KNN is a challenging query in wireless sensor networks because the network is highly distributed and ...
Yongxuan Lai +2 more
openaire +1 more source
Distributed continuous KNN query over moving objects
International Journal of High Performance Computing and Networking, 2019The Continuous K-Nearest Neighbour (CKNN) queries over moving objects have been widely researched in many fields. However, existing centralised works cannot work anymore and distributed solutions suffer the problem of index maintaining, high communication cost and query latency.
Xiaolin Yang +3 more
openaire +1 more source
An exhaustive algorithm based on GPU to process a kNN query
2020 39th International Conference of the Chilean Computer Science Society (SCCC), 2020The Nearest Neighbors search is a widely used technique with applications on several classification problems. Particularly, the k-nearest neighbor (kNN) algorithm is a well-known method used in modern information retrieval systems aiming to obtain relevant objects based on their similarity to a given query object.
Javier A. Riquelme +3 more
openaire +1 more source
A kNN Query Processing Method in Mobile Ad Hoc Networks
, 2011 Yuka Komai +2 more
exaly +2 more sources