國立虎尾科技大學 |

Answering queries using views /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Answering queries using views // Foto Afrati, Rada Chirkova.
作者:	Afrati, Foto,
其他作者:	Chirkova, Rada,
面頁冊數:	1 PDF (xix, 253 pages) :illustrations :
附註:	Part of: Synthesis digital library of engineering and computer science.
標題:	Querying (Computer science) -
電子資源:	https://doi.org/10.2200/S00884ED2V01Y201811DTM054
電子資源:	https://ieeexplore.ieee.org/servlet/opac?bknumber=8694766
ISBN:	9781681734637

Answering queries using views /
Afrati, Foto,

Answering queries using views /Foto Afrati, Rada Chirkova. - Second edition. - 1 PDF (xix, 253 pages) :illustrations - Synthesis lectures on data management,#542153-5426 ;. - Synthesis digital library of engineering and computer science..

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

Includes bibliographical references (pages 237-252).

1. Queries and views -- 1.1. Views -- 1.2. Using views in database systems -- 1.3. Answering queries using views -- 1.4. Relational databases and queries -- 1.5. The structure of the book -- 1.6. Exercises

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

Compendex

The topic of using views to answer queries has been popular for a few decades now, as it cuts across domains such as query optimization, information integration, data warehousing, website design and, recently, database-as-a-service and data placement in cloud systems. This book assembles foundational work on answering queries using views in a self-contained manner, with an effort to choose material that constitutes the backbone of the research. It presents efficient algorithms and covers the following problems: query containment; rewriting queries using views in various logical languages; equivalent rewritings and maximally contained rewritings; and computing certain answers in the data-integration and data-exchange settings. Query languages that are considered are fragments of SQL, in particular select-project-join queries, also called conjunctive queries (with or without arithmetic comparisons or negation), and aggregate SQL queries. This second edition includes two new chapters that refer to tree-like data and respective query languages. Chapter 8 presents the data model for XML documents and the XPath query language, and Chapter 9 provides a theoretical presentation of tree-like data model and query language where the tuples of a relation share a tree-structured schema for that relation and the query language is a dialect of SQL with evaluation techniques appropriately modified to fit the richer schema.

Mode of access: World Wide Web.

ISBN: 9781681734637

Standard No.: 10.2200/S00884ED2V01Y201811DTM054doiSubjects--Topical Terms:

785780
Querying (Computer science)
Subjects--Index Terms:

conjunctive queries

LC Class. No.: QA76.9.D3 / A372 2019eb

Dewey Class. No.: 005.7565

Answering queries using views /
LDR:06576nam 2200793 i 4500 001 959759
003 IEEE
005 20190503190106.0
006 m eo d
007 cr bn |||m|||a
008 201209s2019 caua fob 000 0 eng d
020 $a 9781681734637 $q electronic
020 $z 9781681734644 $q hardcover
020 $z 9781681734620 $q paperback
024 7 $a 10.2200/S00884ED2V01Y201811DTM054 $2 doi
035 $a (CaBNVSL)thg00978845
035 $a (OCoLC)1099319725
035 $a 8694766
040 $a CaBNVSL $b eng $e rda $c CaBNVSL $d CaBNVSL
050 4 $a QA76.9.D3 $b A372 2019eb
082 0 4 $a 005.7565 $2 23
100 1 $a Afrati, Foto, $e author. $3 1253091
245 1 0 $a Answering queries using views / $c Foto Afrati, Rada Chirkova.
250 $a Second edition.
264 1 $a [San Rafael, California] : $b Morgan & Claypool, $c [2019]
300 $a 1 PDF (xix, 253 pages) : $b illustrations
336 $a text $2 rdacontent
337 $a electronic $2 isbdmedia
338 $a online resource $2 rdacarrier
490 1 $a Synthesis lectures on data management, $x 2153-5426 ; $v #54
500 $a Part of: Synthesis digital library of engineering and computer science.
504 $a Includes bibliographical references (pages 237-252).
505 0 $a 1. Queries and views -- 1.1. Views -- 1.2. Using views in database systems -- 1.3. Answering queries using views -- 1.4. Relational databases and queries -- 1.5. The structure of the book -- 1.6. Exercises
505 8 $a 2. Query containment and equivalence -- 2.1. CQ query containment -- 2.2. CQAC query containment -- 2.3. CQN query containment -- 2.4. CQA query containment and equivalence -- 2.5. Acyclic CQS -- 2.6. Query equivalence -- 2.7. Containment and equivalence for unions of queries -- 2.8. Exercises
505 8 $a 3. Finding equivalent rewritings -- 3.1. Preliminaries -- 3.2. CQ queries and views -- 3.3. Acyclic Cq views -- 3.4. cqac queries and views -- 3.5. Rewriting Cqn queries using CQN views -- 3.6. cqa queries -- 3.7. Exercises
505 8 $a 4. Maximally contained rewritings (MCRS) -- 4.1. Preliminaries -- 4.2. Finding MCRS for Cq queries and views: the MS algorithm -- 4.3. CQACs, the homomorphism property, extending algorithm MS -- 4.4. Datalog -- 4.5. Exercises
505 8 $a 5. Answering queries in presence of dependencies -- 5.1. Preliminaries -- 5.2. Query containment under dependencies -- 5.3. Equivalent rewritings -- 5.4. MCRS -- 5.5. Exercises
505 8 $a 6. Answering queries in data exchange -- 6.1. Complete data exchange -- 6.2. Data exchange with arithmetic comparisons -- 6.3. Incomplete data exchange -- 6.4. Exercises
505 8 $a 7. Answering queries using views -- 7.1. Certain answers for queries in presence of view instances -- 7.2. Determinacy
505 8 $a 8. XPath queries and views -- 8.1. Xml databases and XPath queries -- 8.2. XPath queries vs. Conjunctive queries -- 8.3. XPath query containment and equivalence -- 8.4. Definition of extended embedding between patterns -- 8.5. Containment test for XP{//,[]} and XP{[],*} -- 8.6. Extended embedding is not enough to prove containment -- 8.7. Canonical models -- 8.8. Containment for general case -- 8.9. Containment and equivalence of union of XPath queries -- 8.10. Rewritings -- 8.11. Conclusion and bibliographical notes -- 8.12. Exercises
505 8 $a 9. Tree-structured records queried with SQL dialect -- 9.1. Trees as data and as data types -- 9.2. Querying tree-structured data -- 9.3. Flattening -- 9.4. Discussion: tree-pruning vs. flattening -- 9.5. Flattening for linear schemas -- 9.6. Aggregate queries -- 9.7. Conclusion and bibliographical notes
505 8 $a 10. Bibliographical notes for chapters 1-7 -- 10.1. Query containment -- 10.2. Query rewriting -- 10.3. Dependencies--the chase -- 10.4. Data exchange -- 10.5. Other related work -- 11. Conclusion for chapters 1-7.
506 $a Abstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 $a Compendex
510 0 $a INSPEC
510 0 $a Google scholar
510 0 $a Google book search
520 3 $a The topic of using views to answer queries has been popular for a few decades now, as it cuts across domains such as query optimization, information integration, data warehousing, website design and, recently, database-as-a-service and data placement in cloud systems. This book assembles foundational work on answering queries using views in a self-contained manner, with an effort to choose material that constitutes the backbone of the research. It presents efficient algorithms and covers the following problems: query containment; rewriting queries using views in various logical languages; equivalent rewritings and maximally contained rewritings; and computing certain answers in the data-integration and data-exchange settings. Query languages that are considered are fragments of SQL, in particular select-project-join queries, also called conjunctive queries (with or without arithmetic comparisons or negation), and aggregate SQL queries. This second edition includes two new chapters that refer to tree-like data and respective query languages. Chapter 8 presents the data model for XML documents and the XPath query language, and Chapter 9 provides a theoretical presentation of tree-like data model and query language where the tuples of a relation share a tree-structured schema for that relation and the query language is a dialect of SQL with evaluation techniques appropriately modified to fit the richer schema.
530 $a Also available in print.
538 $a Mode of access: World Wide Web.
538 $a System requirements: Adobe Acrobat Reader.
588 $a Title from PDF title page (viewed on May 3, 2019).
650 0 $a Querying (Computer science) $3 785780
653 $a conjunctive queries
653 $a aggregate queries
653 $a arithmetic comparisons
653 $a negation
653 $a acyclic queries
653 $a query containment
653 $a query equivalence
653 $a equivalent query rewritings
653 $a maximally contained query rewritings
653 $a tuple-generating dependencies
653 $a equality-generating dependencies
653 $a the chase algorithm query containment and rewriting under dependencies
653 $a data exchange
653 $a determinacy
653 $a XPath
653 $a tree data
700 1 $a Chirkova, Rada, $e author. $3 1253092
776 0 8 $i Print version: $z 9781681734644 $z 9781681734620
830 0 $a Synthesis digital library of engineering and computer science. $3 598254
830 0 $a Synthesis lectures on data management ; $v #36. $3 931356
856 4 0 $3 Abstract with links to full text $u https://doi.org/10.2200/S00884ED2V01Y201811DTM054
856 4 2 $3 Abstract with links to resource $u https://ieeexplore.ieee.org/servlet/opac?bknumber=8694766