1860 search results - page 206 / 372 » A Model of Queries for Object-Oriented Databases |
182
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
349
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
150
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
153
click to vote
WEBDB
2004
Springer
15 years 9 months ago
2004
Springer
In our research on superimposed information management, we have developed applications where information elements in the superimposed layer serve to annotate, comment, restructure...
126
click to vote
SIGMOD
1996
ACM
15 years 8 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...