000 05692nam a2200685 i 4500
001 6812940
003 IEEE
005 20200413152903.0
006 m eo d
007 cr cn |||m|||a
008 110814s2011 caua foab 000 0 eng d
020 _a9781608452798 (electronic bk.)
020 _z9781608452781 (pbk.)
024 7 _a10.2200/S00363ED1V01Y201105DTM018
_2doi
035 _a(CaBNVSL)gtp00549314
035 _a(OCoLC)743246512
040 _aCaBNVSL
_cCaBNVSL
_dCaBNVSL
050 4 _aQA76.9.D26
_bT654 2011
082 0 4 _a005.74
_222
100 1 _aToman, David.
245 1 0 _aFundamentals of physical design and query compilation
_h[electronic resource] /
_cDavid Toman and Grant Weddell.
260 _aSan Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) :
_bMorgan & Claypool,
_cc2011.
300 _a1 electronic text (xii, 110 p.) :
_bill., digital file.
490 1 _aSynthesis lectures on data management,
_x2153-5426 ;
_v# 18
538 _aMode of access: World Wide Web.
538 _aSystem requirements: Adobe Acrobat Reader.
500 _aPart of: Synthesis digital library of engineering and computer science.
500 _aSeries from website.
504 _aIncludes bibliographical references (p. 105-108).
505 0 _aPreface -- Acknowledgments --
505 8 _a1. Introduction -- 1.1 Logical and physical design -- 1.2 Summary -- 1.3 Bibliographic notes -- 1.4 Exercises with topics for discussion --
505 8 _a2. 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 --
505 8 _a3. 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 --
505 8 _a4. 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 --
505 8 _a5. 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 --
505 8 _a6. 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 --
505 8 _aA. First-order logic -- Signatures -- Syntax -- Semantics -- Proofs and the sequent calculus -- Bibliography -- Authors' biographies.
506 1 _aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 _aCompendex
510 0 _aINSPEC
510 0 _aGoogle scholar
510 0 _aGoogle book search
520 3 _aQuery 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.
530 _aAlso available in print.
588 _aTitle from PDF t.p. (viewed on August 14, 2011).
650 0 _aDatabase design.
650 0 _aQuerying (Computer science)
650 0 _aFirst-order logic.
653 _aquery compilation
653 _asemantic query optimization
653 _aphysical database design
653 _adatabase update
653 _alogical foundations and integrity constraints
653 _abag semantics and query plans
700 1 _aWeddell, Grant E.
_q(Grant Edwin),
_d1954-
776 0 8 _iPrint version:
_z9781608452781
830 0 _aSynthesis digital library of engineering and computer science.
830 0 _aSynthesis lectures on data management,
_x2153-5426 ;
_v# 18.
856 4 2 _3Abstract with links to resource
_uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6812940
999 _c561867
_d561867