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...
 
/lp/springer_journal/efficient-k-k-closest-pair-queries-in-general-metric-spaces-V2mZLWdsWf
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2015 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-015-0383-4
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

The VLDB JournalSpringer Journals

Published: Jun 1, 2015

References

  • 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 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