A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Location-based Spatial Queries with Data Sharing in Mobile Environments
2006
22nd International Conference on Data Engineering Workshops (ICDEW'06)
Preserved Fulltext
We present novel approaches to support nearest-neighbor queries and window queries from mobile hosts by leveraging the sharing capabilities of wireless ad-hoc networks. ...
We illustrate how previous query results cached in the local storage of neighboring mobile peers can be leveraged to either fully or partially compute and verify spatial queries at a local host. ...
Algorithm 1 kNN single (q, p, k) end if 13: end for 14: return H
Step 2: Multiple Peer NN Verification Under some conditions the kNN single method may not be able to verify all k nearest neighbors. ...
doi:10.1109/icdew.2006.72
dblp:conf/icde/KuZ06
fatcat:hlwp7juc25b2bnlx3fkmuy4tbi
Nearest neighbor queries with peer-to-peer data sharing in mobile environments
2008
Pervasive and Mobile 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 2017; you can also visit the original URL.
The file type is application/pdf.
We present a novel approach to support nearest neighbor queries from mobile hosts by leveraging the sharing capabilities of wireless ad-hoc networks. ...
We illustrate how previous query results cached in the local storage of neighboring mobile users can be leveraged to either fully or partially compute and verify nearest neighbor queries at a local host ...
With the emergence of mobile devices attention has focused on the problem of continuously finding k nearest neighbors for moving query points (k-NNMP). ...
doi:10.1016/j.pmcj.2008.08.001
fatcat:brtiy22ucbbtnfvfya7qkisfzi
Continuous k-Nearest Neighbor Queries in Wireless Environments
2017
Indian Journal of Science and 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 2018; you can also visit the original URL.
The file type is application/pdf.
Objectives: Network Coding-based Spatial Air Index (NCSAI) has been proposed for improving query performance of continuous k-nearest neighbor queries in road networks. ...
Methods: Due to unreliable nature of wireless links, network coding has been playing an important role in wireless environments and improves scalability and throughput. ...
Assume that the client is located at node v 5 and request continuous k-nearest neighbor query to find "continuous four nearest neighbor restaurants from a query point q.Then the continuous k-nearest neighbor ...
doi:10.17485/ijst/2016/v9i48/104045
fatcat:ffcnkto4wjcnpgw74ziwgngmdu
Distributed Continuous k Nearest Neighbors Search over Moving Objects on Wireless Sensor Networks
2013
International Journal of Distributed Sensor Networks
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 k-nearest neighbor (CkNN) search is a variation of kNN search that the system persistently reports k nearest moving objects to a user. ...
For example, system continuously returns 3 nearest moving sensors to the user. Many query processing approaches for CkNN search have been proposed in traditional environments. ...
Acknowledgment This work is partially supported by NSC under the Grant 98-2220-E-027-007, 100-2221-E-027-087-MY2, and 102-2221-E-027-088-. ...
doi:10.1155/2013/125145
fatcat:mkm4bxht4vabnmgfievk7ivkki
A distributed spatial index for error-prone wireless data broadcast
2009
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 2014; you can also visit the original URL.
The file type is application/pdf.
It supports search algorithms for classical locationbased queries such as window queries and kNN queries in both of the snapshot and continuous query modes. ...
DSI is very resilient to the error-prone wireless communication environment because interrupted search operations based on DSI can be resumed easily. ...
Based on DSI, efficient search algorithms for energy efficient forwarding (EEF), snapshot window queries, snapshot k nearest neighbor queries, continuous window queries, and continuous nearest neighbor ...
doi:10.1007/s00778-009-0137-2
fatcat:gbufi6pxjfbhrewba723awme7q
Location-based Spatial Queries with Data Sharing in Wireless Broadcast Environments
2007
2007 IEEE 23rd International Conference on Data Engineering
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.
Our approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. ...
For example, a significant challenge is presented by wireless broadcasting environments, which often translates to high-latency database access. ...
In this paper, we concentrate on two common types of spatial searches, namely, k nearest neighbor queries and window queries. ...
doi:10.1109/icde.2007.369010
dblp:conf/icde/KuZW07
fatcat:p56nukddy5bfnj7r52kjfkybwe
Mobile Client-Server System for Real-time Continuous Query of Moving Objects
2011
International Journal of Fuzzy Logic and Intelligent Systems
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.
These problems are caused by weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client-server environments. ...
In this paper, a Mobile Continuous Query Processing System (MCQPS) is designed to solve problems related to database hoarding, maintenance of shared data consistency, and optimization of logging. ...
database system under mobile client-server environments. ...
doi:10.5391/ijfis.2011.11.2.095
fatcat:rpjveuuchbdkbeuudwa2y35u4m
An Efficient Network Coding-based Air Index for Queries in Road Networks
2020
International Journal of Engineering Research and
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.
IJERTV9IS040005 (This work is licensed under a Creative Commons Attribution 4.0 International License.) www.ijert.org ...
Continuous k-Nearest Neighbor Query Continuous k-Nearest Neighbor (Ck-NN) [30] , [31] query widely used in many real-time applications. ...
k-Nearest Neighbor Query K-Nearest Neighbor Query defined as a mobile client retrieves k-nearest data objects from a query point q. ...
doi:10.17577/ijertv9is040005
fatcat:hmopjyeo5jhfzob6duyvf33il4
Realtime segmentation of range data using continuous nearest neighbors
2009
2009 IEEE International Conference on Robotics and Automation
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.
In mobile robotics, the segmentation of range data is an important prerequisite to object recognition and environment understanding. ...
This paper presents an algorithm for realtime segmentation of a continuous stream of incoming range data. ...
continuous nearest neighbor approach V. ...
doi:10.1109/robot.2009.5152498
dblp:conf/icra/KlasingWB09
fatcat:q2gv4dgu75c2zjplmuhfrdyc4e
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
2007
IEEE Transactions on Mobile 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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we develop a generalized search algorithm for continuous k-nearest neighbors based on Hilbert Curve Index in wireless data broadcast systems. ...
A continuous nearest neighbor (CNN) search, which retrieves the nearest neighbors corresponding to every point in a given query line segment, is important for location-based services such as vehicular ...
k-nearest neighbor objects, the whole line segment is dominated by those k-nearest neighbors. ...
doi:10.1109/tmc.2007.1004
fatcat:jzs22kwzdbdpjfvrxlmcy667gm
Query Processing with Respect to Location in Wireless Broadcasting
2012
International Journal of Future Computer and Communication
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.
The nearest neighbor candidate can be identified by using the KNN algorithm. After identifying INN candidate, the required data are retrieved using the SBNN algorithm. ...
The method of single transmission is introduced to support unlimited number of mobile host over a large geographical area. ...
Sharing Based Nearest Neighbors Queries
D. Broadcast Channel Data Filtering
E. ...
doi:10.7763/ijfcc.2012.v1.73
fatcat:tobl67zimnbpvps3znpkc2i72i
Trajectory Clustering and k-NN for Robust Privacy Preserving k-NN Query Processing in GeoSpark
2020
Algorithms
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.
Th next step is to gain deeper understanding of the data through the application of k nearest neighbor (k-NN) queries either using indexing methods or otherwise. ...
The k-anonymity set computation, which is the main component for privacy preservation evaluation and the main issue of our previous works, is evaluated in the GeoSpark environment. ...
. 1 An Overview of Continuous Trajectory Point k Nearest Neighbor (CTPkNN) Query. ...
doi:10.3390/a13080182
fatcat:cqqosen2fjc67ebizgmci4nsrq
An Efficient Algorithm For Privacy In Nearest Neighbourhood Search In Mqmo For Point Clouds
2018
Zenodo
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 2022; you can also visit the original URL.
The file type is application/pdf.
Due to the growth in mobile phones, the location based service (LBS) market is growing tremendously fast. Many mobile phone applications uses LBS such as store finder, car navigation system etc. ...
In order to protect users private information many solutions are offered but most of them only addressed on snapshot query and no support for continual query and Moving Query Moving Object(MQMO). https ...
The k nearest neighbor query verification with location points on Voronoi diagram increases the verification cost on mobile clients. ...
doi:10.5281/zenodo.1411177
fatcat:y5smvm7uvjam7hge5pcvvs3npe
Database Correlation for GSM Location in Outdoor & Indoor Environments
2008
2008 4th International Conference on Information and Automation for Sustainability
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.
Estimation of the location of a Mobile Station accurately is a key requirement to effectively provide a wide range of Location Based Services over mobile networks. ...
The ultimate solution proposed in this paper is not a single positioning technique; rather it presents several positioning techniques that achieve optimum performance in each test environment. ...
of the k th nearest neighbor. ...
doi:10.1109/iciafs.2008.4783992
fatcat:ddbegee5xbcpfin6xlvqmf7ynq
A Trajectory Privacy Preserving Scheme in the CANNQ Service for IoT
2019
Sensors
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.
The response speed of the results is improved by narrowing the search scope of the points of interest (POIs) and speeding up the prune of the non-nearest neighbors. ...
Furthermore, an aggregate nearest neighbor query algorithm based on strategy optimization, is adopted, to minimize the overhead of the LSP. ...
Later, Chow [15] proposed a spatial cloaking algorithm for mobile P2P environments. ...
doi:10.3390/s19092190
fatcat:73wfdz5pqzfplj3foswlzykdly
« Previous
Showing results 1 — 15 out of 18,550 results