Querying Graphs
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Querying Graphs: (Synthesis Lectures on Data Management)
Querying Graphs: (Synthesis Lectures on Data Management)

Querying Graphs: (Synthesis Lectures on Data Management)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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.

Table of Contents:
Foreword Acknowledgments Introduction Data Models Query Languages Constraints Query Specification Data Structures and Indexes Query Processing Physical Operators Research Challenges Bibliography Authors' Biographies

About the Author :
Angela Bonifati is a full professor of computer science at Université Claude Bernard Lyon 1 and affiliated with the CNRS Liris research lab. She received her Ph.D. from Politecnico di Milano in 2002 and right after she was a postdoctoral researcher at INRIA Roquencourt. Her current research interests are on the interplay of relational and graph-shaped data paradigms, particularly on schema mapping and data exchange, query processing, and learning for these data models. She was Vice Chair of ICDE 2018 for the information extraction, data cleaning, and curation track and Vice Chair of ICDE 2011 for the semi-structured data track. She is Associate Editor of the VLDB Journal, ACM TODS, and Distributed and Parallel Databases. She is a member-at-large of the ICDT council and serving on the program committees of SIGMOD, PODS, PVLDB, ICDE, and EDBT. George Fletcher is an associate professor of computer science at Technische Universiteit Eindhoven where he is chair of the Database Group. He defended a Ph.D. at Indiana University Bloomington in 2007. His research interests span query language design and engineering, foundations of databases, and data integration. His current focus is on management of massive graphs such as social networks and linked open data. He was a co-organizer of the EDBT Summer School on Graph Data Management (2015) and is currently a member of the LDBC Graph Query Language Standardization Task Force. His other recent activities include co-organizing an NII Shonan seminar on Graph Database Systems (2018) and serving on the program committees of SIGMOD, VLDB, ISWC, ICDE, EDBT, and IJCAI. Hannes Voigt is a software engineer at Neo4j since June 2018, where he is part of the Query Languages, Standards, and Research team. Before that he was a post-doctoral researcher at the Dresden Database Systems Group, Technische Universität Dresden and obtained his Ph.D. from the same university in 2014. As a researcher, he worked on various database topics such as declarative graph query languages, database evolution and versioning, management of schemaflexible data, and self-adapting indexes. He is member of the LDBC Graph Query Language Standardization Task Force. Other recent activities include co-editing the section on graph analytics in the Encyclopedia of Big Data Technologies, co-presenting a tutorial on graph query processing at EDBT 2017, and serving on the program committees of VLDB, ICDE, and CIKM. Nikolay Yakovets is an assistant professor of computer science at Technische Universiteit Eindhoven. He obtained his Ph.D. from Lassonde School of Engineering at York University in 2017. He worked on various database topics at IBM CAS Canada and Empress Software Canada. His current focus is on design and implementation of core database technologies, management of massive graph data, and efficient processing of queries on graphs. His recent activities include co-presenting a tutorial on graph query processing at EDBT 2017, co-organizing the 2017 edition of the Dutch-Belgian Database Day, and serving on a program committee of ICDE. H. V. Jagadish is Bernard A Galler Collegiate Professor of Electrical Engineering and Computer Science, and Distinguished Scientist at the Institute for Data Science, at the University of Michigan in Ann Arbor. Prior to 1999, he was Head of the Database Research Department at AT&T Labs, Florham Park, NJ. Professor Jagadish is well known for his broad-ranging research on information management, and has approximately 200 major papers and 37 patents. He is a fellow of the ACM, The First Society in Computing, (since 2003) and serves on the board of the Computing Research Association (since 2009). He has been an Associate Editor for the ACM Transactions on Database Systems (1992-1995), Program Chair of the ACM SIGMOD annual conference (1996), Program Chair of the ISMB conference (2005), a trustee of the VLDB (Very Large DataBase) foundation (2004-2009), Founding Editor-in-Chief of the Proceedings of the VLDB Endowment (2008-2014), and Program Chair of the VLDB Conference (2014). Among his many awards, he won the ACM SIGMOD Contributions Award in 2013 and the David E Liddle Research Excellence Award (at the University of Michigan) in 2008.


Best Sellers


Product Details
  • ISBN-13: 9781681734309
  • Publisher: Morgan & Claypool Publishers
  • Publisher Imprint: Morgan & Claypool Publishers
  • Height: 235 mm
  • No of Pages: 184
  • Series Title: Synthesis Lectures on Data Management
  • Width: 191 mm
  • ISBN-10: 1681734303
  • Publisher Date: 01 Oct 2018
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Weight: 333 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Querying Graphs: (Synthesis Lectures on Data Management)
Morgan & Claypool Publishers -
Querying Graphs: (Synthesis Lectures on Data Management)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Querying Graphs: (Synthesis Lectures on Data Management)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!