995 search results - page 121 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
120
click to vote
CIDR
2007
15 years 4 months ago
2007
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
117
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
151
click to vote
PVLDB
2008
15 years 2 months ago
2008
Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia a...
123
click to vote
ICDT
2001
ACM
15 years 7 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
138
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...