大葉大學圖書館 |

Querying graphs /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	001.4226
書名/作者:	Querying graphs // Angela Bonifati, George Fletcher, Hannes Voigt, Nikolay Yakovets.
作者:	Bonifati, Angela,
其他作者:	Fletcher, George,
出版者:	[San Rafael, California] : : Morgan & Claypool,, 2018.
面頁冊數:	1 PDF (xvii, 166 pages) : : illustrations.
附註:	Part of: Synthesis digital library of engineering and computer science.
標題:	Querying (Computer science)
標題:	Graphic methods - Data processing.
ISBN:	9781681734316
書目註:	Includes bibliographical references (pages 143-163).
內容註:	1. Introduction --
摘要、提要註:	Graph data modeling and querying arises in many practical application domains such as social and biological networks where the primary focus is on concepts and their relationships and the rich patterns in these complex webs of interconnectivity. In this book, we present a concise unified view on the basic challenges which arise over the complete life cycle of formulating and processing queries on graph databases. To that purpose, we present all major concepts relevant to this life cycle, formulated in terms of a common and unifying ground: the property graph data model--the pre-dominant data model adopted by modern graph database systems. We aim especially to give a coherent and in-depth perspective on current graph querying and an outlook for future developments. Our presentation is self-contained, covering the relevant topics from: graph data models, graph query languages and graph query specification, graph constraints, and graph query processing. We conclude by indicating major open research challenges towards the next generation of graph data management systems.
電子資源:	https://ieeexplore.ieee.org/servlet/opac?bknumber=8481009

Querying graphs /
Bonifati, Angela,

Querying graphs /Angela Bonifati, George Fletcher, Hannes Voigt, Nikolay Yakovets. - [San Rafael, California] :Morgan & Claypool,2018. - 1 PDF (xvii, 166 pages) :illustrations. - Synthesis lectures on data management,# 512153-5426 ;. - Synthesis digital library of engineering and computer science..

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

Includes bibliographical references (pages 143-163).

1. Introduction --

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

Compendex

Graph data modeling and querying arises in many practical application domains such as social and biological networks where the primary focus is on concepts and their relationships and the rich patterns in these complex webs of interconnectivity. In this book, we present a concise unified view on the basic challenges which arise over the complete life cycle of formulating and processing queries on graph databases. To that purpose, we present all major concepts relevant to this life cycle, formulated in terms of a common and unifying ground: the property graph data model--the pre-dominant data model adopted by modern graph database systems. We aim especially to give a coherent and in-depth perspective on current graph querying and an outlook for future developments. Our presentation is self-contained, covering the relevant topics from: graph data models, graph query languages and graph query specification, graph constraints, and graph query processing. We conclude by indicating major open research challenges towards the next generation of graph data management systems.

Mode of access: World Wide Web.

ISBN: 9781681734316

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

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

graph databases

LC Class. No.: QA90 / .B656 2018

Dewey Class. No.: 001.4226

Querying graphs /
LDR:06368nmm 2200661 i 4500 001 509499
003 IEEE
005 20181101130329.0
006 m eo d
007 cr cn |||m|||a
008 210524s2018 caua foab 000 0 eng d
020 $a 9781681734316 $q ebook
020 $z 9781681734323 $q hardcover
020 $z 9781681734309 $q paperback
024 7 $a 10.2200/S00873ED1V01Y201808DTM051 $2 doi
035 $a (CaBNVSL)swl000408759
035 $a (OCoLC)1060574777
035 $a 8481009
040 $a CaBNVSL $b eng $e rda $c CaBNVSL $d CaBNVSL
050 4 $a QA90 $b .B656 2018
082 0 4 $a 001.4226 $2 23
100 1 $a Bonifati, Angela, $e author. $3 729002
245 1 0 $a Querying graphs / $c Angela Bonifati, George Fletcher, Hannes Voigt, Nikolay Yakovets.
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 (xvii, 166 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 # 51
500 $a Part of: Synthesis digital library of engineering and computer science.
504 $a Includes bibliographical references (pages 143-163).
505 0 $a 1. Introduction --
505 8 $a 2. Data models -- 2.1 Property graph model -- 2.2 Variations of the PGM -- 2.2.1 Specializations -- 2.2.2 Structural extensions -- 2.2.3 Data representation extensions -- 2.2.4 Summary -- 2.3 Bibliographic and historical notes --
505 8 $a 3. Query languages -- 3.1 Basic functionality -- 3.1.1 Regular path queries -- 3.1.2 Conjunctive graph queries -- 3.1.3 Conjunctive regular path queries -- 3.1.4 Unions of conjunctive regular path queries -- 3.1.5 Relation algebra -- 3.2 Regular property graph queries -- 3.2.1 Regular property graph logic -- 3.2.2 Regular property graph algebra -- 3.2.3 Equivalence and complexity of RPGLog and RPGA -- 3.3 RPGQ in context -- 3.3.1 Important fragments of RPGQ -- 3.3.2 Extending RPGQ for composability -- 3.3.3 RPGQ and practical graph query languages -- 3.4 Bibliographic and historical notes --
505 8 $a 4. Constraints -- 4.1 Preliminaries -- 4.2 Graph functional dependencies -- 4.2.1 Syntax -- 4.2.2 Semantics -- 4.2.3 Satisfiability -- 4.2.4 Implication -- 4.2.5 Validation -- 4.3 Graph entity dependencies -- 4.3.1 Definition and special cases -- 4.3.2 Preliminaries -- 4.3.3 Chasing graph entity dependencies -- 4.3.4 Satisfiability, implication, and validation -- 4.3.5 Extension to graph denial constraints -- 4.3.6 Applications and practical impact of graph dependencies -- 4.4 Other constraints for graph data management -- 4.4.1 Graph neighborhood constraints -- 4.4.2 Graph-to-graph constraints -- 4.5 Bibliographic and historical notes --
505 8 $a 5. Query specification -- 5.1 Path query specification -- 5.1.1 The definability problem for graph queries -- 5.1.2 Complexity of definability for graph queries -- 5.1.3 From definability to learnability of graph queries -- 5.1.4 Interactive graph query specification -- 5.2 Graph searching for querying -- 5.3 Query-driven graph exploration -- 5.4 Bibliographic notes --
505 8 $a 6. Data structures and indexes -- 6.1 Conceptual schemas of PGM representation -- 6.2 Direct representation of ternary relations -- 6.2.1 Value compression -- 6.2.2 Value indexing -- 6.3 Pivoted representation of ternary relations -- 6.4 Adjacency indexing -- 6.4.1 Uncompressed adjacency representation -- 6.4.2 Compressed adjacency representation -- 6.5 Reachability indexing -- 6.5.1 General considerations -- 6.5.2 Techniques -- 6.6 Structural indexing -- 6.7 Bibliographic and historical notes --
505 8 $a 7. Query processing -- 7.1 Query pipeline -- 7.2 Subgraph matching queries -- 7.2.1 DFS-based algorithms -- 7.2.2 BFS-based algorithms -- 7.2.3 Discussion -- 7.3 Regular path queries -- 7.3.1 Relational algebra and datalog-based approaches -- 7.3.2 Finite automata-based approaches -- 7.4 Unions of conjunctive regular path queries -- 7.5 Bibliographic and historical notes --
505 8 $a 8. Physical operators -- 8.1 Transitive closure -- 8.2 Multi-way joins -- 8.3 Cardinality estimation -- 8.3.1 Cardinality of paths -- 8.3.2 Cardinality of patterns -- 8.4 Further optimizations -- 8.5 Bibliographic and historical notes --
505 8 $a 9. Research challenges -- 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 Graph data modeling and querying arises in many practical application domains such as social and biological networks where the primary focus is on concepts and their relationships and the rich patterns in these complex webs of interconnectivity. In this book, we present a concise unified view on the basic challenges which arise over the complete life cycle of formulating and processing queries on graph databases. To that purpose, we present all major concepts relevant to this life cycle, formulated in terms of a common and unifying ground: the property graph data model--the pre-dominant data model adopted by modern graph database systems. We aim especially to give a coherent and in-depth perspective on current graph querying and an outlook for future developments. Our presentation is self-contained, covering the relevant topics from: graph data models, graph query languages and graph query specification, graph constraints, and graph query processing. We conclude by indicating major open research challenges towards the next generation of graph data management systems.
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 November 1, 2018).
650 0 $a Querying (Computer science) $3 418063
650 0 $a Graphic methods $x Data processing. $3 729006
653 $a graph databases
653 $a property graphs
653 $a graph query languages
653 $a graph constraints
653 $a graph query specification
653 $a graph data representation
653 $a graph query processing
700 1 $a Fletcher, George, $e author. $3 729003
700 1 $a Voigt, Hannes, $d 1980-, $e author. $3 729004
700 1 $a Yakovets, Nikolay, $e author. $3 729005
776 0 8 $i Print version: $z 9781681734309 $z 9781681734323
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 https://ieeexplore.ieee.org/servlet/opac?bknumber=8481009