Querying Graphs (Paperback)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Synthesis Lectures on Data Management
Release date:	October 2018
First published:	2018
Authors:	Angela Bonifati • George Fletcher • Hannes Voigt • Nikolay Yakovets
Dimensions:	235 x 191mm (L x W)
Format:	Paperback
Pages:	166
ISBN-13:	978-3-03-100736-1
Languages:	English
Subtitles:	English
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Computer communications & networking > General Promotions
LSN:	3-03-100736-0
Barcode:	9783031007361

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!