NDLI: An index structure for efficient reverse nearest neighbor queries

Content Provider	IEEE Xplore Digital Library
Author	Congyun Yang King-Ip Lin
Copyright Year	2001
Description	Author affiliation: Div. of Comput. Sci., Memphis Univ., TN, USA (Congyun Yang)
Abstract	The Reverse Nearest Neighbor (RNN) problem is to find all points in a given data set whose nearest neighbor is a given query point. Just like the Nearest Neighbor (NN) queries, the RNN queries appear in many practical situations such as marketing and resource management. Thus, efficient methods for the RNN queries in databases are required. The paper introduces a new index structure, the Rdnn-tree, that answers both RNN and NN queries efficiently. A single index structure is employed for a dynamic database, in contrast to the use of multiple indexes in previous work. This leads to significant savings in dynamically maintaining the index structure. The Rdnn-tree outperforms existing methods in various aspects. Experiments on both synthetic and real world data show that our index structure outperforms previous methods by a significant margin (more than 90% in terms of number of leaf nodes accessed) in RNN queries. It also shows improvement in NN queries over standard techniques. Furthermore, performance in insertion and deletion is significantly enhanced by the ability to combine multiple queries (NN and RNN) in one traversal of the tree. These facts make our index structure extremely preferable in both static and dynamic cases.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Data Eng.
Starting Page	485
Ending Page	492
File Size	718385
Page Count	8
File Format	PDF
ISBN	0769510019
ISSN	10636382
DOI	10.1109/ICDE.2001.914862
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2001-04-02
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Nearest neighbor searches Recurrent neural networks Neural networks Indexes Computer science Resource management Indexing Database systems Internet Sorting
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

Nearest neighbor and reverse nearest neighbor queries for moving objects

Visible Reverse k-Nearest Neighbor Queries

Utilizing indexes for approximate and on-line nearest neighbor queries

Ranked Reverse Nearest Neighbor Search

Reverse Nearest Neighbors Search in Ad-hoc Subspaces

Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases

Applying bulk insertion techniques for dynamic reverse nearest neighbor problems

Incremental Reverse Nearest Neighbor Ranking

The N-tree: an Indexing Technique for Nearest-Neighbor Queries

An index structure for efficient reverse nearest neighbor queries

Similar Documents

Nearest neighbor and reverse nearest neighbor queries for moving objects

Visible Reverse k-Nearest Neighbor Queries

Utilizing indexes for approximate and on-line nearest neighbor queries

Ranked Reverse Nearest Neighbor Search

Reverse Nearest Neighbors Search in Ad-hoc Subspaces

Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases

Applying bulk insertion techniques for dynamic reverse nearest neighbor problems

Incremental Reverse Nearest Neighbor Ranking

The N-tree: an Indexing Technique for Nearest-Neighbor Queries

An index structure for efficient reverse nearest neighbor queries