## Automated database restructuring |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 1 |

The Problem | 9 |

Optimal Solutions for Unary Databases | 19 |

Copyright | |

6 other sections not shown

### Common terms and phrases

arity automated database restructuring candidate solutions Chapter computing the query conjunctive queries conjunctive views consider construction cost models cost of computing data warehouse database instance database V2 database-restructuring problem datalog defined described domain eliminator tuples equivalent rewriting evaluation costs example exponential number exponential-time lower bound fat tuples finite graph head variables intermediate relation intimidator tuples joining the relation materialized views minimize the evaluation n/2 attributes number of views optimal solution optimal viewset orthogonal basis preferred plan preferred query preferred viewset problem input Proc product-cost model projection proof queries and views queries using views query optimization query plans query q query workload Recall relations Pi remove stubborn tuples rewriting q satisfy the storage set of views Sf]T SIGMOD storage limit stored relations subgoals subset sum-cost model Theorem thesis unary database schema unary input unary relation unary subquery view selection view vk VLDB wasteful computation workload Q workload queries