Efficient $$k$$ k -closest pair queries in general metric spaces

Efficient $$k$$ k -closest pair queries in general metric spaces Given two object sets $$P$$ P and $$Q$$ Q , a k-closest pair $$(k\hbox {CP})$$ ( k CP ) query finds $$k$$ k closest object pairs from $$P\times Q$$ P × Q . This operation is common in many real-life applications such as GIS, data mining, and recommender systems. Although it has received much attention in the Euclidean space , there is little prior work on the metric space . In this paper, we study the problem of kCP query processing in general metric spaces , namely Metric kCP $$(\hbox {M}k\hbox {CP})$$ ( M k CP ) search , and propose several efficient algorithms using dynamic disk-based metric indexes (e.g., M-tree), which can be applied to arbitrary type of data as long as a certain metric distance is defined and satisfies the triangle inequality. Our approaches follow depth-first and/or best-first traversal paradigm(s), employ effective pruning rules based on metric space properties and the counting information preserved in the metric index, take advantage of aggressive pruning and compensation to further boost query efficiency, and derive a node-based cost model for $$\hbox {M}k\hbox {CP}$$ M k CP retrieval. In addition, we extend our techniques to tackle two interesting variants of $$\hbox {M}k\hbox {CP}$$ M k CP queries. Extensive experiments with both real and synthetic data sets demonstrate the performance of our proposed algorithms, the effectiveness of our developed pruning rules, and the accuracy of our presented cost model. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Efficient $$k$$ k -closest pair queries in general metric spaces

Loading next page...
Springer Berlin Heidelberg
Copyright © 2015 by Springer-Verlag Berlin Heidelberg
Computer Science; Database Management
Publisher site
See Article on Publisher Site


  • Efficient processing of metric skyline queries
    Chen, L; Lian, X
  • On approximate algorithms for distance-based queries using R-trees
    Corral, A; Vassilakopoulos, M
  • Index-driven similarity search in metric spaces
    Hjaltason, GR; Samet, H
  • Processing distance join queries with constraints
    Papadopoulos, AN; Nanopoulos, A; Manolopoulos, Y

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


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.



billed annually
Start Free Trial

14-day Free Trial