NDLI: A New K-NN Query Algorithm Based on the Traversal and Search of the Dynamic Rectangle

Content Provider	IEEE Xplore Digital Library
Author	Guobin Li Jine Tang
Copyright Year	2010
Abstract	The K-NN query algorithm is a widely used algorithm in the spatial database, effectively carrying on K-NN query algorithm has become the focus problem of the spatial database, the traditional query algorithm will adopt the measurement distance and pruning strategy to improve the query performance by using the tree index, it needs to carry on a large amount of distance calculation to exclude the unnecessary queried region when continue to find the next nearest neighbor object, the cost of the time spent on the frequent distance calculation is great in the large amount of data objects, so the query efficiency is dramatically decreased, if adopts the grid index to conduct K-NN query, the query scope is not flexible, there will appear many empty grid cells, resulting in the slow searching speed and the low storage utilization. Based on the analysis and research of the previous K-NN algorithm, a new K-NN query algorithm based on the traversal and search of the dynamic rectangle is proposed in this paper, use the clustering method to cluster the spatial data objects to the horizontal and vertical directions of the queried object, select the appropriate rectangle to carry on dynamic movement and obtain the next query range to be searched, the experiments show that the new algorithm uses the dynamic rectangle to effectively select the search range, it can take full advantage of the dynamic rectangular region by use of the clustering algorithm, the query efficiency can be significantly improved within the large space region.
Starting Page	1
Ending Page	4
File Size	215582
Page Count	4
File Format	PDF
ISBN	9781424471591
e-ISBN	9781424471614
DOI	10.1109/ICEEE.2010.5661078
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-11-07
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Heuristic algorithms Clustering algorithms Search problems Spatial databases Indexes Nearest neighbor searches
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

Anew K-NN query algorithm based on grid clustering of the neighbor objects

A New K-NN Query Algorithm Based on the Clustering and Sorting of Minimum Bounding Rectangle

A new multi-object K-NN query algorithm based on the MBR of having been queried data objects

Research for the nearest neighbor query based on $R^{BRT}$ tree

New methods for the construction of Voronoi Diagram and the nearest neighbor query

An Approximate Nearest Neighbor Query Algorithm Based on B^Z-Tree

Furthest k neighbors queries in spatial databases

Advanced fast nearest neighbor search with keywords over spatial database

On processing view field nearest neighbor queries on the $R^{∗}-tree$

A New K-NN Query Algorithm Based on the Traversal and Search of the Dynamic Rectangle

Similar Documents

Anew K-NN query algorithm based on grid clustering of the neighbor objects

A New K-NN Query Algorithm Based on the Clustering and Sorting of Minimum Bounding Rectangle

A new multi-object K-NN query algorithm based on the MBR of having been queried data objects

Research for the nearest neighbor query based on $R^{BRT}$ tree

New methods for the construction of Voronoi Diagram and the nearest neighbor query

An Approximate Nearest Neighbor Query Algorithm Based on B^Z-Tree

Furthest k neighbors queries in spatial databases

Advanced fast nearest neighbor search with keywords over spatial database

On processing view field nearest neighbor queries on the $R^{∗}-tree$

A New K-NN Query Algorithm Based on the Traversal and Search of the Dynamic Rectangle