Part V. DATA BASES

Table of Contents

17. Memory Management
17.1. 17.1 Partitioning
17.1.1. 17.1.1 Fixed partitions
17.1.2. 17.1.2 Dynamic partitions
17.2. 17.2 Page replacement algorithms
17.2.1. 17.2.1 Static page replacement
17.2.2. 17.2.2 Dynamic paging
17.3. 17.3 Anomalies
17.3.1. 17.3.1 Page replacement
17.3.2. 17.3.2 Scheduling with lists
17.3.3. 17.3.3 Parallel processing with interleaved memory
17.3.4. 17.3.4 Avoiding the anomaly
17.4. 17.4 Optimal file packing
17.4.1. 17.4.1 Approximation algorithms
17.4.2. 17.4.2 Optimal algorithms
17.4.3. 17.4.3 Shortening of lists (SL)
17.4.4. 17.4.4 Upper and lower estimations (ULE)
17.4.5. 17.4.5 Pairwise comparison of the algorithms
17.4.6. 17.4.6 The error of approximate algorithms
18. Relational Database Design
18.1. 18.1 Functional dependencies
18.1.1. 18.1.1 Armstrong-axioms
18.1.2. 18.1.2 Closures
18.1.3. 18.1.3 Minimal cover
18.1.4. 18.1.4 Keys
18.2. 18.2 Decomposition of relational schemata
18.2.1. 18.2.1 Lossless join
18.2.2. 18.2.2 Checking the lossless join property
18.2.3. 18.2.3 Dependency preserving decompositions
18.2.4. 18.2.4 Normal forms
18.2.5. 18.2.5 Multivalued dependencies
18.3. 18.3 Generalised dependencies
18.3.1. 18.3.1 Join dependencies
18.3.2. 18.3.2 Branching dependencies
19. Query Rewriting in Relational Databases
19.1. 19.1 Queries
19.1.1. 19.1.1 Conjunctive queries
19.1.2. 19.1.2 Extensions
19.1.3. 19.1.3 Complexity of query containment
19.2. 19.2 Views
19.2.1. 19.2.1 View as a result of a query
19.3. 19.3 Query rewriting
19.3.1. 19.3.1 Motivation
19.3.2. 19.3.2 Complexity problems of query rewriting
19.3.3. 19.3.3 Practical algorithms
20. Semi-structured Databases
20.1. 20.1 Semi-structured data and XML
20.2. 20.2 Schemas and simulations
20.3. 20.3 Queries and indexes
20.4. 20.4 Stable partitions and the PT-algorithm
20.5. 20.5 A()-indexes
20.6. 20.6 D()- and M()-indexes
20.7. 20.7 Branching queries
20.8. 20.8 Index refresh