Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 105-108).

Preface -- Acknowledgments --

1. Introduction -- 1.1 Logical and physical design -- 1.2 Summary -- 1.3 Bibliographic notes -- 1.4 Exercises with topics for discussion --

2. Logical design and user queries -- 2.1 Logical design in FOL -- 2.1.1 Logical vocabularies -- 2.1.2 Logical constraints -- 2.2 User queries in FOL -- 2.3 Summary -- 2.4 Bibliographic notes -- 2.5 Exercises with topics for discussion --

3. Basic physical design and query plans -- 3.1 Access paths and simple scanning -- 3.2 Query plan execution -- 3.3 Conjunctive plans -- 3.4 General query plans -- 3.5 Summary -- 3.6 Bibliographic notes -- 3.7 Exercises with topics for discussion --

4. On practical physical design -- 4.1 References, pointers and linked structures -- 4.1.1 Efficient search and secondary indices -- 4.2 Nulls, partitions and run-time typing -- 4.2.1 Nulls indicating value inapplicable -- 4.2.2 Horizontal partitioning -- 4.2.3 Run-time typing -- 4.3 Built-in functions and hashing -- 4.3.1 Hashing -- 4.4 Two-level store -- 4.4.1 Two-level references -- 4.4.2 ISAM indexing -- 4.5 Summary -- 4.6 Bibliographic notes -- 4.7 Exercises with topics for discussion --

5. Query compilation and plan synthesis -- 5.1 Beth definability -- 5.2 Conjunctive queries and dependencies -- 5.2.1 The chase -- 5.2.2 Nested loops and right-deep join plans -- 5.2.3 Chase and plan synthesis -- 5.2.4 Equality-generating dependencies -- 5.2.5 Post-processing: assignments and comparisons -- 5.2.6 Post-processing: duplicate elimination -- 5.2.7 Post-processing: cut insertion -- 5.2.8 Extensions to chase: beyond conjunctive queries -- 5.3 First-order queries and constraints -- 5.3.1 Interpolation -- 5.3.2 Interpolants constructively -- 5.3.3 Interpolants vs. plans -- 5.3.4 Interpolants and duplicates -- 5.4 Interpolation vs. chase -- 5.5 Summary -- 5.6 Bibliographic notes -- 5.7 Exercises with topics for discussion --

6. Updating data -- 6.1 User vs. physical updates -- 6.1.1 Updates, definability, and plans -- 6.2 Updates and complements -- 6.2.1 Complements vs. a cyclic schema -- 6.2.2 Update types -- 6.3 Progressive updates -- 6.3.1 Constant space complements -- 6.4 Summary -- 6.5 Bibliographic notes -- 6.6 Exercises with topics for discussion --

A. First-order logic -- Signatures -- Syntax -- Semantics -- Proofs and the sequent calculus -- Bibliography -- Authors' biographies.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

INSPEC

Google scholar

Google book search

Query compilation is the problem of translating user requests formulated over purely conceptual and domain specific ways of understanding data, commonly called logical designs, to efficient executable programs called query plans. Such plans access various concrete data sources through their low-level often iterator-based interfaces. An appreciation of the concrete data sources, their interfaces and how such capabilities relate to logical design is commonly called a physical design. This book is an introduction to the fundamental methods underlying database technology that solves the problem of query compilation. The methods are presented in terms of first-order logic which serves as the vehicle for specifying physical design, expressing user requests and query plans, and understanding how query plans implement user requests.

Also available in print.

Title from PDF t.p. (viewed on August 14, 2011).