2217 search results - page 163 / 444 » Rank-aware Query Optimization |
173
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
164
click to vote
VLDB
1994
ACM
15 years 10 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...
245
Voted
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Life science laboratories today have to rely on procedural techniques to store and manage large sequence datasets. Procedural techniques are cumbersome to use and are often very i...
187
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
162
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be...