Fundamentals of Physical Design and Query Compilation
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. Table of Contents: Introduction / Logical Design and User Queries / Basic Physical Design and Query Plans / On Practical Physical Design / Query Compilation and Plan Synthesis / Updating Data
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
access paths additional access paths APS department array assume atomic query plans binding patterns capture Chapter chase step chase(Q closed world assumptions complement access path correspond data structures defined deletions dept record design and query design of payroll duplicate elimination operator emp record emp-array emp-num(y emp—name(w empfile empfile(w employee numbers employee-number encode entities Example Exercise existential quantifier express field Figure first-order logic FOL signature hash inference rules integer interpolant introduced logical design metadata n-tuples nested loop join non-logical parameters Note notion NULL ofthe Option output variables physical design plan interpretation plan language plan Q plan that implements predicate symbols primitive insertions proof query compilation query Q reference relational relational algebra require return true salary scan semantics sentences sequent calculus syntactic synthesize Theorem tuple tuple generating dependencies two-level update design update plan user query valuation well-formed formulae