SIGN IN
SIGN UP
Estimating the selectivity of approximate string queries
Full Text:
PDF
Buy this Article
Authors:
Arturas Mazeika
Free University of Bozen-Bolzano, Bozen-Bolzano BZ, Italy
Michael H. Böhlen
Free University of Bozen-Bolzano, Bozen-Bolzano BZ, Italy
Nick Koudas
University of Toronto, Toronto, Ontario
Divesh Srivastava
AT&T Labs--Research, Florham Park, NJ
2007 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 39
· Downloads (cumulative): 797
· Citation Count: 7
Published in:
· Journal
ACM Transactions on Database Systems (TODS)
TODS Homepage
archive
Volume 32 Issue 2, June 2007
Article No. 12
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1242524.1242529
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
experimentation
inverse strings
min-wise hash signatures
performance
q-grams
query processing
statistical databases
textual databases
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder