Abstract
An application is presented of performance criteria (e. g. total operational cost of jobs execution and relations updating) to relational data base design and updating (caused by changes of affecting factors, e. g. appearance of new queries) in the framework of adaptive constructing of its collection of relations. An algorithm (Algorithm 2) is presented which reconstructs a collection of relations representing a data base in the direction of total cost reduction. Two main internal steps of Algorithm 2 are analyzed: attaching of a subset of a current collection to a query, and introducing of new relations. Algorithm 3 is given that attaches relations to a query using AND/OR graphs for displaying of a given logical data structure. Two heuristics for introducing of new relations are described.
| Original language | English |
|---|---|
| Pages (from-to) | 273-294 |
| Number of pages | 22 |
| Journal | Proceedings of The Western Snow Conference |
| State | Published - 1978 |
| Event | Proc of the Int Conf on Databases, Improving Usability and Responsiveness - Haifa, Isr Duration: 2 Aug 1978 → 3 Aug 1978 |