Filters








3,375 Hits in 7.4 sec

CORE: Continuous Monitoring of Reverse k Nearest Neighbors on Moving Objects in Road Networks [chapter]

Muhammad Attique, Hyung-Ju Cho, Tae-Sun Chung
2015 Studies in Computational Intelligence  
Reverse K-Nearest Neighbor (RKNN) queries in road networks have been studied extensively in recent years.  ...  However, at present, there is still a lack of algorithms for moving queries in a road network. In this paper, we study how to efficiently process moving queries.  ...  Given a query point q, a Reverse K-Nearest Neighbor (RKNN) query retrieves all the data points that have q as one of their K-Nearest Neighbors (KNN) (K closest points).  ... 
doi:10.1007/978-3-319-23467-0_8 fatcat:pl64chy5a5b5dozhzr4ckxt2gy

A pruning algorithm for reverse nearest neighbors in directed road networks

Rizwan Qamar, Muhammad Attique, Tae-Sun Chung
2015 2015 IEEE/ACIS 14th International Conference on Computer and Information Science (ICIS)  
In this paper, we studied the problem of continuous reverse k nearest neighbors (RkNN) in directed road network, where a road segment can have a particular orientation.  ...  Based on these pruning rules we provide an algorithm named SWIFT for answering RNN queries in continuous directed road network.  ...  In this paper we propose an algorithm SWIFT that can efficiently find reverse nearest neighbors of a moving query in a directed road network.  ... 
doi:10.1109/icis.2015.7166606 dblp:conf/ACISicis/QamarAC15 fatcat:xkwakwuzpfdk7jy642tcumghxu

Continuous Reverse k-Nearest-Neighbor Query in Dynamic Road Network

Chen Wen
2016 International Journal of Grid and Distributed Computing  
On this basis, a continuous reverse K-nearest-neighbor (RKNN) query method is proposed, and it is proved to be efficient by the experimental results.  ...  In order to solve the new application problems brought by the real-time traffic status, a dynamic monitoring algorithm is designed in this paper, and it mainly updates the weight changes of road network  ...  In this paper, an effective continuous reverse k-nearest-neighbor query method based on the dynamic weight road network is designed according to the changes in real-time traffic stats.  ... 
doi:10.14257/ijgdc.2016.9.5.12 fatcat:mbenxt5dnjhozhxohya4j5ij5a

Monitoring path nearest neighbor in road networks

Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey Xu Yu
2009 Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09  
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks.  ...  We name this query the k -Path Nearest Neighbor query (k -PNN). As the user is moving and may not always follow the shortest path, the query path keeps changing.  ...  Therefore, in [11] , Mouratidis et al. investigate the Continuous Nearest Neighbor monitoring problem in a road network, in which the query point moves freely and the data objects' positions are also  ... 
doi:10.1145/1559845.1559907 dblp:conf/sigmod/ChenSZY09 fatcat:467fil4ovzb3vn45tdxgncogre

Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks

Muhammad Attique, Hyung-Ju Cho, Rize Jin, Tae-Sun Chung
2016 ISPRS International Journal of Geo-Information  
In this paper, we study the problem of continuous reverse nearest neighbor queries where both the query object q and data objects are moving.  ...  In recent years, considerable research has been conducted into monitoring reverse k nearest neighbor queries.  ...  Algorithms for Continuous Reverse Nearest Neighbor Query Processing in Road Networks In recent years, reverse neighbor query processing in road networks has received attention by the spatial database systems  ... 
doi:10.3390/ijgi5120247 fatcat:ykl6aka7jzgmplfggv6u37olji

Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction [chapter]

Ugur Demiryurek, Farnoush Banaei-Kashani, Cyrus Shahabi
2009 Lecture Notes in Computer Science  
Assuming a moving query object and a set of data objects that make frequent and arbitrary moves on a spatial network with dynamically changing edge weights, CkNN continuously monitors the nearest (in network  ...  In this paper, we propose an efficient method to answer continuous k nearest neighbor (CkNN) queries in spatial networks.  ...  A Continuous k nearest neighbor (CkNN) query in spatial networks continuously monitors the k data objects that are nearest (in network distance) to a given query object, while the data objects and/or the  ... 
doi:10.1007/978-3-642-02982-0_5 fatcat:qmknqmpmwrb7xdvumu6esnvlyq

Effective trajectory data analysis using continuous k-means clustering

2016 International Journal of Latest Trends in Engineering and Technology  
Dynamic distance measurement is used in the system. Keywords---TKM (Threshold-based k-means monitoring method), HC*(an improved HC), confinement circle (CC),Continuous K-means clustering I.  ...  The K-means clustering based monitoring model uses the centroid values to assess the network load difference.  ...  Several types of queries have been studied in the road network, such as kNN queries, range queries, aggregate nearest neighbor queries, and reverse nearest neighbor queries.  ... 
doi:10.21172/1.72.547 fatcat:l4smz3dgcfcozd5tzw3mq55dp4

Privacy in location-based services

Chi-Yin Chow, Mohamed F. Mokbel
2009 SIGSPATIAL Special  
One of the future directions is to extend existing frameworks to support other kinds of location-based queries, e.g., reverse nearest-neighbor queries [20] and aggregate nearest-neighbor queries [32  ...  In reality, most of the object movement is constrained by the underlying road network.  ... 
doi:10.1145/1567253.1567258 fatcat:hwe47hijs5acrbizc25wyx5iny

Incremental and General Evaluation of Reverse Nearest Neighbors

James M Kang, Mohamed F Mokbel, Shashi Shekhar, Tian Xia, Donghui Zhang
2010 IEEE Transactions on Knowledge and Data Engineering  
Previous algorithms for monochromatic continuous reverse nearest neighbor queries rely mainly on monitoring at the worst case of six pie regions, whereas IGERN takes a radical approach by monitoring only  ...  The IGERN algorithm is general in that it is applicable for both continuous monochromatic and bichromatic reverse nearest neighbor queries.  ...  The input to this generator is the road map of Hennepin County in Minneapolis (Figure 4c ). The output of the generator is a set of moving objects that move on the road network of the given city.  ... 
doi:10.1109/tkde.2009.133 fatcat:3wb3s657kncn5ahgwjmlgf3wpq

Finding the most accessible locations

Shuo Shang, Bo Yuan, Ke Deng, Kexin Xie, Xiaofang Zhou
2011 Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '11  
In this paper, we propose and investigate a novel spatial query called Reverse Path Nearest Neighbor (R-PNN) search to find the most accessible locations in road networks.  ...  The performance of the proposed R-PNN query processing is verified by extensive experiments based on real and synthetic trajectory data in road networks.  ...  Recently, k-PNN proposed by Chen et al. in [5] is an extension of the IRNN query. k-PNN can efficiently monitor the k nearest neighbors to a continuously changing shortest path, and the user only needs  ... 
doi:10.1145/2093973.2093999 dblp:conf/gis/ShangYDXZ11 fatcat:qobyfnhbq5bg5bnnmxczu4xami

Keyword K-Nearest Neighbor Query of Road Network under Wireless Broadcast Environment

Chen Wen
2016 International Journal of Future Generation Communication and Networking  
Besides, keyword k-nearest neighbor query of road network under wireless broadcast environment is proposed.  ...  In this paper, a space keyword index structure is designed, so as to effectively organize keyword information, location information and index information of objects on various sides in road network.  ...  In recent ten years, researchers have made an in-depth study on location-based query especially nearest neighbor query (NN) and reverse nearest neighbor query (RNN), and proposed many effective query processing  ... 
doi:10.14257/ijfgcn.2016.9.4.19 fatcat:zi4pf7tccvbpbelvgvzvu5t5fq

Reverse k-Nearest Neighbor monitoring on mobile objects

Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Naixin Xu, Andreas Züfle
2010 Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '10  
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server architecture.  ...  The RkNN monitoring query computes for a given query object q, the set RkNN(q) of objects having q as one of their k-nearest neighbors for each point in time.  ...  For this general scenario, we propose an approach for continuous reverse k-nearest neighbor monitoring in a client-server architecture.  ... 
doi:10.1145/1869790.1869870 dblp:conf/gis/EmrichKKRXZ10 fatcat:fve37lyaifhozihb4lgcbtu4pi

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks

Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang, Xuefei Li
2011 The VLDB journal  
In this paper, we study the problem of continuous monitoring of reverse nearest neighbors queries in Euclidean space as well as in spatial networks.  ...  We present a framework for continuous reverse nearest neighbor (R NN) queries by assigning each object and query with a safe region such that the expensive recomputation is not required as long as the  ...  These applications may require continuous monitoring of reverse nearest moving objects.  ... 
doi:10.1007/s00778-011-0235-9 fatcat:lzoggwniavfklnfpmcq76ggjiy

Continuous Monitoring of Spatial Queries [chapter]

Kenneth A. Ross, Christian S. Jensen, Richard Snodgrass, Curtis E. Dyreson, Christian S. Jensen, Richard Snodgrass, Spiros Skiadopoulos, Cristina Sirangelo, Mary Lynette Larsgaard, Gösta Grahne, Daniel Kifer, Hans-Arno Jacobsen (+106 others)
2009 Encyclopedia of Database Systems  
Typically, the query type is range or nearest neighbor (NN), and the assumed distance metric is the Euclidean one. In general, there are multiple queries being processed simultaneously.  ...  As cabs and pedestrians move, each free taxi driver wishes to know his/her closest client. This is an instance of continuous NN monitoring.  ...  CROSS REFERENCES B+-tree Nearest Neighbor Query R-tree (and family) Reverse Nearest Neighbor Query Road Networks Space Filling Curves for Query Processing Figure 2 2 TB example (k = 3) Figure 4 4 SEA-CNN  ... 
doi:10.1007/978-0-387-39940-9_82 fatcat:473vmzuklraozbdbyammvrxp5i

Continuous monitoring of nearest neighbors on land surface

Songhua Xing, Cyrus Shahabi, Bei Pan
2009 Proceedings of the VLDB Endowment  
The first method, inspired by the existing techniques in monitoring kNN in road networks [7] maintains an analogous counterpart of the Dijkstra Expansion Tree on land surface, called Surface Expansion  ...  As geo-realistic rendering of land surfaces is becoming commonplace in geographical information systems (GIS), games and online Earth visualization platforms, a new type of k Nearest Neighbor (kNN) queries  ...  ACKNOWLEDGMENTS This research has been funded in part by NSF grants IIS-0238560 (PECASE), IIS-0534761 and CNS-0831505 (CyberTrust), the NSF Center for Embedded Networked Sensing (CCR-0120778) and in part  ... 
doi:10.14778/1687627.1687753 fatcat:aw6jcakdv5hpxppjwdq5lzuoxa
« Previous Showing results 1 — 15 out of 3,375 results