SEPIA: estimating selectivities of approximate string predicates in large Databases

SEPIA: estimating selectivities of approximate string predicates in large Databases Many database applications have the emerging need to support approximate queries that ask for strings that are similar to a given string, such as “name similar to smith ” and “telephone number similar to 412-0964 ”. Query optimization needs the selectivity of such an approximate predicate, i.e., the fraction of records in the database that satisfy the condition. In this paper, we study the problem of estimating selectivities of approximate string predicates. We develop a novel technique, called S epia , to solve the problem. Given a bag of strings, our technique groups the strings into clusters, builds a histogram structure for each cluster, and constructs a global histogram. It is based on the following intuition: given a query string q , a preselected string p in a cluster, and a string s in the cluster, based on the proximity between q and p , and the proximity between p and s , we can obtain a probability distribution from a global histogram about the similarity between q and s . We give a full specification of the technique using the edit distance metric. We study challenges in adopting this technique, including how to construct the histogram structures, how to use them to do selectivity estimation, and how to alleviate the effect of non-uniform errors in the estimation. We discuss how to extend the techniques to other similarity functions. Our extensive experiments on real data sets show that this technique can accurately estimate selectivities of approximate string predicates. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

SEPIA: estimating selectivities of approximate string predicates in large Databases

Loading next page...
 
/lp/springer_journal/sepia-estimating-selectivities-of-approximate-string-predicates-in-2km2sJjhzf
Publisher
Springer-Verlag
Copyright
Copyright © 2008 by Springer-Verlag
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-007-0061-2
Publisher site
See Article on Publisher Site

Abstract

Many database applications have the emerging need to support approximate queries that ask for strings that are similar to a given string, such as “name similar to smith ” and “telephone number similar to 412-0964 ”. Query optimization needs the selectivity of such an approximate predicate, i.e., the fraction of records in the database that satisfy the condition. In this paper, we study the problem of estimating selectivities of approximate string predicates. We develop a novel technique, called S epia , to solve the problem. Given a bag of strings, our technique groups the strings into clusters, builds a histogram structure for each cluster, and constructs a global histogram. It is based on the following intuition: given a query string q , a preselected string p in a cluster, and a string s in the cluster, based on the proximity between q and p , and the proximity between p and s , we can obtain a probability distribution from a global histogram about the similarity between q and s . We give a full specification of the technique using the edit distance metric. We study challenges in adopting this technique, including how to construct the histogram structures, how to use them to do selectivity estimation, and how to alleviate the effect of non-uniform errors in the estimation. We discuss how to extend the techniques to other similarity functions. Our extensive experiments on real data sets show that this technique can accurately estimate selectivities of approximate string predicates.

Journal

The VLDB JournalSpringer Journals

Published: Aug 1, 2008

References

  • Index-driven similarity search in metric spaces
    Hjaltason, G.R.; Samet, H.

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