995 search results - page 56 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
118
click to vote
VLDB
1991
ACM
15 years 5 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
132
click to vote
ICDT
2003
ACM
15 years 7 months ago
2003
ACM
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
145
click to vote
CACM
1998
15 years 1 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
107
click to vote
RTDB
1996
15 years 3 months ago
1996
We are developing an object-oriented real-time database system that includes a relationally complete query language. Unlike conventional query optimizers, our optimizer estimates ...