613 search results - page 38 / 123 » Query Evaluation on a Database Given by a Random Graph |
ECCC
2010
15 years 16 days ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
140
click to vote
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
133
click to vote
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
116
click to vote
VLDB
1994
ACM
15 years 6 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
104
click to vote
WEBDB
2009
Springer
15 years 8 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...