Results 131 to 140 of about 20,788 (183)

Efficient Oblivious Query Processing for Range and kNN Queries

IEEE Transactions on Knowledge and Data Engineering, 2022
Increasingly, individuals and companies adopt a cloud service provider as a primary data and IT infrastructure platform. The remote access of the data inevitably brings the issue of trust. Data encryption is necessary to keep sensitive information secure and private on the cloud.
Zhao Chang, Dong Xie, Feifei Li, Jeff M. Phillips, Rajeev Balasubramonian   +4 more
openaire   +1 more source

Distributed kNN Query Authentication

2018 19th IEEE International Conference on Mobile Data Management (MDM), 2018
With the prevalence of location-based services and geo-functioned devices, the trend of spatial data outsourcing is rising. In the data outsourcing scenario, result integrity must be ensured by means of a query authentication scheme. However, most of the existing studies are confined to a centralized environment. In this paper, we investigate the query
Ce Zhang, Cheng Xu, Jianliang Xu, Byron Choi   +3 more
openaire   +1 more source

Crawling hidden objects with kNN queries

2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016
With 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, Zhiguo Gong, Nan Zhang, Tao Huang, Hua Zhong, Jun Wei   +5 more
openaire   +1 more source

Group Reverse kNN Query optimisation

Journal of Computational Science, 2015
Abstract Spatial queries have been used to assist human mobility. One of them is the Reverse Nearest Neighbour (RNN) Queries, which its concept is to have a set of objects that considers a query object as the nearest neighbour. One solution to the RNN queries is through region approach, which in this case every single object in the space has a ...
Anasthasia Agnes Haryanto, David Taniar, Kiki Maulana Adhinugraha   +2 more
openaire   +1 more source

Efficient Parallel Processing for KNN Queries

Proceedings of the 2017 International Conference on Industrial Design Engineering, 2017
The 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

GPU-based exhaustive algorithms processing kNN queries

The Journal of Supercomputing, 2017
Efficient kNN search, or k-nearest neighbors search, is useful, among other fields, in multimedia information retrieval, data mining and pattern recognition problems. A distance function determines how similar the objects are to a given kNN query object. As finding the distance between any given pair of objects (i.e., high-dimensional vectors) is known
Ricardo J. Barrientos, Fabricio Millaguir, José L. Sánchez, Enrique Arias   +3 more
openaire   +1 more source

Indexing land surface for efficient kNN query

Proceedings of the VLDB Endowment, 2008
The 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

Answering why-not questions on KNN queries

Frontiers of Computer Science, 2019
Being 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, Xin Lin, Liang He, Jing Yang   +3 more
openaire   +1 more source

Distributed continuous KNN query over moving objects

International Journal of High Performance Computing and Networking, 2019
The 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.
Cheqing Jin, Yilin Wang, Xiaolin Yang, Zhigang Zhang   +3 more
openaire   +1 more source

Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries

The VLDB Journal, 2009
The 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.
Nutanong, S, Zhang, R, Tanin, E, Kulik, L   +3 more
openaire   +2 more sources