4081 search results - page 653 / 817 » Metaprogramming for Relational Databases |
99
Voted
ICDT
1999
ACM
15 years 5 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
SIGMOD
1996
ACM
15 years 5 months ago
1996
ACM
Materialized views and view maintenance are important for data warehouses, retailing, banking, and billing applications. We consider two related view maintenance problems: 1) how ...
103
click to vote
SIGMOD
1996
ACM
15 years 5 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
119
click to vote
CIKM
1993
Springer
15 years 5 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
107
click to vote
SIGMOD
1993
ACM
15 years 4 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...