Efficiently processing snapshot and continuous reverse k nearest neighbors queries

Efficiently processing snapshot and continuous reverse k nearest neighbors queries Given a set of objects and a query q , a point p is called the reverse k nearest neighbor (R k NN) of q if q is one of the k closest objects of p . In this paper, we introduce the concept of influence zone that is the area such that every point inside this area is the R k NN of q and every point outside this area is not the R k NN. The influence zone has several applications in location-based services, marketing and decision support systems. It can also be used to efficiently process R k NN queries. First, we present efficient algorithm to compute the influence zone. Then, based on the influence zone, we present efficient algorithms to process R k NN queries that significantly outperform existing best-known techniques for both the snapshot and continuous R k NN queries. We also present a detailed theoretical analysis to analyze the area of the influence zone and IO costs of our R k NN processing algorithms. Our experiments demonstrate the accuracy of our theoretical analysis. This paper is an extended version of our previous work (Cheema et al. in Proceedings of ICDE, pp. 577–588, 2011 ). We make the following new contributions in this extended version: (1) we conduct a rigorous complexity analysis and show that the complexity of one of our proposed algorithms in Cheema et al. (Proceedings of ICDE, pp. 577–588, 2011 ) can be reduced from O ( m 2 ) to O ( km ) where m > k is the number of objects used to compute the influence zone, (2) we show that our techniques can be applied to dimensionality higher than two, and (3) we present efficient techniques to handle data updates. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Efficiently processing snapshot and continuous reverse k nearest neighbors queries

Loading next page...
 
/lp/springer_journal/efficiently-processing-snapshot-and-continuous-reverse-k-nearest-sBDS7Fck7z
Publisher
Springer-Verlag
Copyright
Copyright © 2012 by Springer-Verlag
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-012-0265-y
Publisher site
See Article on Publisher Site

Abstract

Given a set of objects and a query q , a point p is called the reverse k nearest neighbor (R k NN) of q if q is one of the k closest objects of p . In this paper, we introduce the concept of influence zone that is the area such that every point inside this area is the R k NN of q and every point outside this area is not the R k NN. The influence zone has several applications in location-based services, marketing and decision support systems. It can also be used to efficiently process R k NN queries. First, we present efficient algorithm to compute the influence zone. Then, based on the influence zone, we present efficient algorithms to process R k NN queries that significantly outperform existing best-known techniques for both the snapshot and continuous R k NN queries. We also present a detailed theoretical analysis to analyze the area of the influence zone and IO costs of our R k NN processing algorithms. Our experiments demonstrate the accuracy of our theoretical analysis. This paper is an extended version of our previous work (Cheema et al. in Proceedings of ICDE, pp. 577–588, 2011 ). We make the following new contributions in this extended version: (1) we conduct a rigorous complexity analysis and show that the complexity of one of our proposed algorithms in Cheema et al. (Proceedings of ICDE, pp. 577–588, 2011 ) can be reduced from O ( m 2 ) to O ( km ) where m > k is the number of objects used to compute the influence zone, (2) we show that our techniques can be applied to dimensionality higher than two, and (3) we present efficient techniques to handle data updates.

Journal

The VLDB JournalSpringer Journals

Published: Oct 1, 2012

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off