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

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 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

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

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial