Sciweavers

1091 search results - page 46 / 219
» Approximation in Databases
Sort
View
SIGMOD
2001
ACM
160views Database» more  SIGMOD 2001»
15 years 12 months ago
Adaptive Precision Setting for Cached Approximate Values
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
Chris Olston, Boon Thau Loo, Jennifer Widom
ICIP
2007
IEEE
15 years 6 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 1 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 6 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 1 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu