2514 search results - page 165 / 503 » On the Computation of Approximations of Database Queries |
166
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
187
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
159
click to vote
GPCE
2008
Springer
15 years 7 months ago
2008
Springer
High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the...
164
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
181
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...