10988 search results - page 1685 / 2198 » Algorithmic Folding Complexity |
309
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
280
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
290
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
199
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
183
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...