大葉大學圖書館 |

Answering queries using views /

纪录类型:	书目-电子资源 : Monograph/item
[NT 15000414] null:	005.7565
[NT 47271] Title/Author:	Answering queries using views // Foto Afrati, Rada Chirkova.
作者:	Afrati, Foto,
[NT 51406] other author:	Chirkova, Rada Y.,
出版者:	[San Rafael, California] : : Morgan & Claypool,, 2018.
面页册数:	1 PDF (xix, 215 pages) : : illustrations.
附注:	Part of: Synthesis digital library of engineering and computer science.
标题:	Querying (Computer science)
ISBN:	9781681730325
[NT 15000227] null:	Includes bibliographical references (pages 201-213).
[NT 15000228] null:	1. Queries and views -- 1.1 Views -- 1.2 Using views in database systems -- 1.2.1 Views and use cases -- 1.2.2 Views and technical issues -- 1.3 Answering queries using views -- 1.3.1 Producing all the answers--equivalent rewritings -- 1.3.2 Producing a subset of the answers--contained rewritings -- 1.3.3 Data exchange -- 1.4 Relational databases and queries -- 1.4.1 Conjunctive queries -- 1.4.2 Conjunctive queries with arithmetic comparisons (CQAC) -- 1.4.3 Conjunctive queries with negation (CQN) -- 1.4.4 Unions of conjunctive queries -- 1.4.5 Conjunctive queries with aggregation (CQA) -- 1.5 The structure of the book -- 1.6 Exercises --
[NT 15000229] null:	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.
电子资源:	http://ieeexplore.ieee.org/servlet/opac?bknumber=8168882

Answering queries using views /
Afrati, Foto,

Answering queries using views /Foto Afrati, Rada Chirkova. - [San Rafael, California] :Morgan & Claypool,2018. - 1 PDF (xix, 215 pages) :illustrations. - Synthesis lectures on data management,# 462153-5426 ;. - Synthesis digital library of engineering and computer science..

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

Includes bibliographical references (pages 201-213).

1. Queries and views -- 1.1 Views -- 1.2 Using views in database systems -- 1.2.1 Views and use cases -- 1.2.2 Views and technical issues -- 1.3 Answering queries using views -- 1.3.1 Producing all the answers--equivalent rewritings -- 1.3.2 Producing a subset of the answers--contained rewritings -- 1.3.3 Data exchange -- 1.4 Relational databases and queries -- 1.4.1 Conjunctive queries -- 1.4.2 Conjunctive queries with arithmetic comparisons (CQAC) -- 1.4.3 Conjunctive queries with negation (CQN) -- 1.4.4 Unions of conjunctive queries -- 1.4.5 Conjunctive queries with aggregation (CQA) -- 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.

Mode of access: World Wide Web.

ISBN: 9781681730325

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

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

conjunctive queriesIndex Terms--Genre/Form:

336502
Electronic books.

LC Class. No.: QA76.9.D3 / A372 2018

Dewey Class. No.: 005.7565

Answering queries using views /
LDR:08242nmm 2200733 i 4500 001 509513
003 IEEE
005 20171213104050.0
006 m eo d
007 cr cn |||m|||a
008 210524s2018 caua foab 000 0 eng d
020 $a 9781681730325 $q ebook
020 $z 9781681730318 $q print
024 7 $a 10.2200/S00805ED1V01Y201709DTM046 $2 doi
035 $a (CaBNVSL)swl00408022
035 $a (OCoLC)1015314933
035 $a 8168882
040 $a CaBNVSL $b eng $e rda $c CaBNVSL $d CaBNVSL
050 4 $a QA76.9.D3 $b A372 2018
082 0 4 $a 005.7565 $2 23
100 1 $a Afrati, Foto, $e author. $3 729041
245 1 0 $a Answering queries using views / $c Foto Afrati, Rada Chirkova.
260 1 $a [San Rafael, California] : $b Morgan & Claypool, $c 2018.
264 1 $a [San Rafael, California] : $b Morgan & Claypool, $c 2018.
300 $a 1 PDF (xix, 215 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 # 46
500 $a Part of: Synthesis digital library of engineering and computer science.
504 $a Includes bibliographical references (pages 201-213).
505 0 $a 1. Queries and views -- 1.1 Views -- 1.2 Using views in database systems -- 1.2.1 Views and use cases -- 1.2.2 Views and technical issues -- 1.3 Answering queries using views -- 1.3.1 Producing all the answers--equivalent rewritings -- 1.3.2 Producing a subset of the answers--contained rewritings -- 1.3.3 Data exchange -- 1.4 Relational databases and queries -- 1.4.1 Conjunctive queries -- 1.4.2 Conjunctive queries with arithmetic comparisons (CQAC) -- 1.4.3 Conjunctive queries with negation (CQN) -- 1.4.4 Unions of conjunctive queries -- 1.4.5 Conjunctive queries with aggregation (CQA) -- 1.5 The structure of the book -- 1.6 Exercises --
505 8 $a 2. Query containment and equivalence -- 2.1 CQ query containment -- 2.1.1 Containment mapping and homomorphisms: canonical database -- 2.1.2 Query evaluation vs. query containment -- 2.2 CQAC query containment -- 2.2.1 Multiple containment mappings and normalization: set of canonical databases -- 2.2.2 When normalization is not needed -- 2.2.3 When single mapping suffices - the homomorphism property: AC-canonical databases -- 2.3 CQN query containment -- 2.3.1 Set of canonical databases -- 2.4 CQA query containment and equivalence -- 2.4.1 MAX queries -- 2.4.2 SUM queries -- 2.4.3 More general aggregate operators -- 2.5 Acyclic CQs -- 2.5.1 Definition of acyclic queries and special cases -- 2.5.2 Efficient algorithm for checking query containment -- 2.5.3 Efficient algorithm for query evaluation -- 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.1.1 Expansion of a rewriting -- 3.1.2 Contained rewritings -- 3.2 CQ queries and views -- 3.2.1 Canonical rewritings and the naive algorithm -- 3.2.2 Properties of the expansion -- 3.2.3 Algorithm corecover -- 3.3 Acyclic CQ views -- 3.4 CQAC queries and views -- 3.4.1 Algorithms for finding equivalent rewritings for queries and views with ACs -- 3.4.2 When the homomorphism property holds -- 3.5 Rewriting CQN queries using CQN views -- 3.6 CQA queries -- 3.6.1 Unfoldings of rewritings -- 3.6.2 Equivalence of unfoldings and rewritings -- 3.6.3 Constructing central rewritings -- 3.6.4 Non-central rewritings -- 3.7 Exercises --
505 8 $a 4. Maximally contained rewritings (MCRs) -- 4.1 Preliminaries -- 4.1.1 CQAC queries and views -- 4.2 Finding MCRs for CQ queries and views: the MS algorithm -- 4.2.1 Finding MCDs -- 4.2.2 Property of MCDs -- 4.2.3 Combining MCDs--most relaxed rewriting -- 4.3 CQACs, the homomorphism property, extending algorithm MS -- 4.3.1 Exportable and distinguishable variables of an expansion -- 4.3.2 AC-MCDs -- 4.3.3 Combining AC-MCDs and MCDs, and adding ACs -- 4.4 Datalog -- 4.4.1 Definition of the datalog language -- 4.4.2 Views that are unions of CQs -- 4.4.3 Rewriting datalog queries-the inverse-rule algorithm -- 4.4.4 CQAC-SI queries and views -- 4.5 Exercises --
505 8 $a 5. Answering queries in presence of dependencies -- 5.1 Preliminaries -- 5.1.1 The chase -- 5.1.2 Weakly acyclic sets of Tgds -- 5.1.3 Property of the chase -- 5.2 Query containment under dependencies -- 5.3 Equivalent rewritings -- 5.3.1 Algorithm for CQ queries, views, and rewritings -- 5.3.2 Finding equivalent rewritings for weakly acyclic LAV dependencies -- 5.4 MCRs -- 5.4.1 Functional dependencies need recursion -- 5.4.2 Inverse-rule algorithm for finding MCRs in presence of Egds -- 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.2.1 Dependencies with arithmetic comparisons -- 6.2.2 The AC-chase -- 6.2.3 Solutions and universal solutions -- 6.2.4 Solutions and conjunctive queries -- 6.2.5 Query answering -- 6.2.6 When the homomorphism property holds--preliminaries -- 6.2.7 Succinct AC-chase -- 6.2.8 Computing certain answers using succinct AC-chase -- 6.3 Incomplete data exchange -- 6.3.1 Incomplete instances -- 6.3.2 The IDE setting and the corresponding CDE settings -- 6.3.3 Computing certain answers in IDE settings -- 6.4 Exercises --
505 8 $a 7. Answering queries using views -- 7.1 Certain answers for queries in presence of view instances -- 7.1.1 Closed vs. open world assumption -- 7.1.2 Certain answers vs. MCRs -- 7.2 Determinacy -- 7.2.1 Definitions and preliminaries -- 7.2.2 Path queries--single view -- 7.2.3 Path queries--CQ is almost complete for rewriting -- 7.2.4 Chain queries --
505 8 $a 8. Bibliographical notes -- 8.1 Query containment -- 8.1.1 Query containment--set semantics -- 8.1.2 Query containment--bag semantics, aggregation -- 8.1.3 Acyclicity -- 8.2 Query rewriting -- 8.2.1 Binding patterns -- 8.3 Dependencies--the chase -- 8.4 Data exchange -- 8.5 Other related work -- 8.5.1 Determinacy -- 8.5.2 More recent related work --
505 8 $a 9. Conclusion -- Bibliography -- Authors' biographies.
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.
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 December 12, 2017).
650 0 $a Querying (Computer science) $3 418063
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
655 0 $a Electronic books. $2 local $3 336502
700 1 $a Chirkova, Rada Y., $e author. $3 729042
776 0 8 $i Print version: $z 9781681730318
830 0 $a Synthesis digital library of engineering and computer science. $3 461208
830 0 $a Synthesis lectures on data management ; $v # 48. $x 2153-5426 $3 728978
856 4 2 $3 Abstract with links to resource $u http://ieeexplore.ieee.org/servlet/opac?bknumber=8168882