Results 1 to 10 of about 4,847 (258)
A PID-Based kNN Query Processing Algorithm for Spatial Data [PDF]
As a popular spatial operation, the k-Nearest Neighbors (kNN) query is widely used in various spatial application systems. How to efficiently process a kNN query on spatial big data has always been an important research topic in the field of spatial data
Baiyou Qiao, Qiao Baiyou
exaly +4 more sources
A Distributed Hybrid Indexing for Continuous KNN Query Processing over Moving Objects
The magnitude of highly dynamic spatial data is expanding rapidly due to the instantaneous evolution of mobile technology, resulting in challenges for continuous queries.
Ying Xia, Imène Bareche
exaly +3 more sources
Processing KNN Queries in Grid-Based Sensor Networks [PDF]
Recently, developing efficient processing techniques in spatio-temporal databases has been a much discussed topic. Many applications, such as mobile information systems, traffic control system, and geographical information systems, can benefit from ...
Yuan-Ko Huang
doaj +2 more sources
Secure K-Nearest neighbor queries in two-tiered mobile wireless sensor networks
Tiered Mobile Wireless Sensor Network(TMWSN) is a new paradigm introduced by mobile edge computing. Now it has received wide attention because of its high scalability, robustness, deployment flexibility, and it has a wide range of application scenarios ...
Lihong Fan +4 more
doaj +1 more source
A KNN Dynamic Extended Query Strategy Based on GPU [PDF]
Traditional Graphics Processing Unit(GPU) executing PGrid index K-Nearest Neighbor(KNN) query method has problems such as large query granularity,redundant calculation,and unstable performance.Therefore,facing spatial KNN relation queries,a KNN query ...
TANG Jia,GONG Yili,LI Wenhai
doaj +1 more source
Authentication of moving kNN queries [PDF]
A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often returns mobile clients a safe region that bounds the validity of query results to minimize the communication cost between the two parties.
Man Lung Yiu, Eric Lo 0001, Duncan Yung
openaire +1 more source
A new locally adaptive K-nearest centroid neighbor classification based on the average distance
The classification performance of a k-nearest neighbour (KNN) method is dependent on the choice of the k neighbours of a query. However, it is difficult to optimise the performance of KNN by choosing appropriate neighbours and an appropriate value of k ...
Benqiang Wang, Shunxiang Zhang
doaj +1 more source
Spatial queries with two kNN predicates [PDF]
The widespread use of location-aware devices has led to countless location-based services in which a user query can be arbitrarily complex, i.e., one that embeds multiple spatial selection and join predicates. Amongst these predicates, the k -Nearest-Neighbor ( k NN) predicate stands as one ...
Aly, Ahmed +2 more
openaire +3 more sources
Cloud services with powerful resources are popularly used to manage exponentially increasing data and to carry out data mining to analyze the data. However, a data mining involving query can cause privacy problems by disclosing both the data and the ...
Jeongsu Park, Dong Hoon Lee
doaj +1 more source
A Novel Hybrid Approach for a Content-Based Image Retrieval Using Feature Fusion
The multimedia content generated by devices and image processing techniques requires high computation costs to retrieve images similar to the user’s query from the database.
Shahbaz Sikandar +2 more
doaj +1 more source

