3341 search results - page 80 / 669 » On Bounded Queries and Approximation |
PODS
2000
ACM
15 years 2 months ago
2000
ACM
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
CSDA
2004
14 years 9 months ago
2004
Using a B-spline representation for splines with knots seen as free variables, the approximation to data by splines improves greatly. The main limitations are the presence of too ...
193
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
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...