NDLI: OQ-Quad: An efficient query processing for continuous k-nearest neighbor based on quad tree

Content Provider	IEEE Xplore Digital Library
Author	Yong-Gui Zou Qing-Lin Fan
Copyright Year	2009
Description	Author affiliation: Sino-Korea Chongqing GIS Research Center, College of Computer Science, Chongqing University of Posts &Telecom., China (Yong-Gui Zou; Qing-Lin Fan)
Abstract	With the growing popularity of mobile computing and wireless communications, managing the continuously changing information of the moving objects is becoming feasible, especially in LBS application which is characterized by a large number of moving objects and a large number of continuous queries. In this paper, we focus on continuous k-nearest neighbor (CkNN for short) query and propose a query method based on a quad tree to support continuous k-nearest neighbor query for moving objects, in which the main idea is to use a quad tree to divide the static spatial space for the moving objects. In the interested region, we use the quad tree and hash tables as an index to store the moving objects. Then we calculate the distances between the query point and the moving objects from inside to outside to get the result. Our comprehensive experimentation shows that the performance of the proposed method is better in memory consumption and processing time than the CMP algorithm.
Starting Page	197
Ending Page	202
File Size	719190
Page Count	6
File Format	PDF
ISBN	9781424435203
DOI	10.1109/ICCSE.2009.5228493
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-07-25
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Continuous Query Geographic Information Systems Roads CkNN Educational institutions Spatial databases Index Telecommunications Quad Tree Computer science Query processing Computer science education Moving Objects Mobile computing Spatial-temporal Indexing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Efficient Technique for Continuous K-Nearest Neighbor Query Processing on Moving Objects in a Road Network

Notice of RetractionAn query processing for continuous K-nearest neighbor based on R-Tree and Quad Tree

Efficient KNN processing over moving objects with uncertain velocity

Continuous Nearest Neighbor Query on Moving Objects Using the VDTPR-Tree

Continuous nearest neighbor query on moving objects using the vdtpr-tree.

Scalable Processing of Continuous K-Nearest Neighbor Queries with Uncertainty in Spatio-Temporal Databases

Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks

Monitoring k-Nearest Neighbor Queries Over Moving Objects

Moving Continuous K Nearest Neighbor Queries in Spatial Network Databases

OQ-Quad: An efficient query processing for continuous k-nearest neighbor based on quad tree

Similar Documents

An Efficient Technique for Continuous K-Nearest Neighbor Query Processing on Moving Objects in a Road Network

Notice of RetractionAn query processing for continuous K-nearest neighbor based on R-Tree and Quad Tree

Efficient KNN processing over moving objects with uncertain velocity

Continuous Nearest Neighbor Query on Moving Objects Using the VDTPR-Tree

Continuous nearest neighbor query on moving objects using the vdtpr-tree.

Scalable Processing of Continuous K-Nearest Neighbor Queries with Uncertainty in Spatio-Temporal Databases

Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks

Monitoring k-Nearest Neighbor Queries Over Moving Objects

Moving Continuous K Nearest Neighbor Queries in Spatial Network Databases

OQ-Quad: An efficient query processing for continuous k-nearest neighbor based on quad tree