Declarative graph querying in practice and theory

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

With the recent resurgence of interest in graph data man- agement, there has been a flurry of research on the design and engineering of graph query languages. On the design side, there is a large body of theoretical results that have been obtained regarding graph languages. On the engineer- ing side, many sophisticated scalable solutions for graph query processing have been developed and put into practice. While both areas are focusing on the study of graph query languages, there has been relatively little work bridging the results on both sides. This tutorial will survey the state of the art in this landscape with a particular focus on uncovering and highlighting indicative research issues that are ripe for collaboration and cross-fertilization between the engineering and theoretical studies of graph database systems.
Original languageEnglish
Title of host publicationAdvances in database technology - EDBT 2017 : 20th International Conference on Extending Database Technology, Venice, Italy, March 21-24, 2017 : proceedings
EditorsBernhard Mitschang, Volker Markl, Sebastian Bress, Periklis Andritsos, Kai-Uwe Sattler, Salvatore Orlando
Pages598-601
Number of pages4
ISBN (Electronic)9783893180738
DOIs
Publication statusPublished - 25 Mar 2017
EventEDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology - Venice, Italy
Duration: 21 Mar 201724 Mar 2017
Conference number: 20
http://edbticdt2017.unive.it/

Conference

ConferenceEDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology
Abbreviated titleEDBT 2017
Country/TerritoryItaly
CityVenice
Period21/03/1724/03/17
Internet address

Keywords

  • Graph algorithms
  • Databases as Topic
  • Indexes

Fingerprint

Dive into the research topics of 'Declarative graph querying in practice and theory'. Together they form a unique fingerprint.

Cite this