License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2017.43
URN: urn:nbn:de:0030-drops-83989
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8398/
Go to the corresponding LIPIcs Volume Portal


Michaliszyn, Jakub ; Otop, Jan ; Wieczorek, Piotr

Querying Best Paths in Graph Databases

pdf-format:
LIPIcs-FSTTCS-2017-43.pdf (0.6 MB)


Abstract

Querying graph databases has recently received much attention. We propose a new approach to this problem, which balances competing goals of expressive power, language clarity and computational complexity. A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria. To express complex properties in a modular way, we introduce labelling-generating ontologies. The resulting formalism is computationally attractive - queries can be answered in non-deterministic logarithmic space in the size of the database.

BibTeX - Entry

@InProceedings{michaliszyn_et_al:LIPIcs:2018:8398,
  author =	{Jakub Michaliszyn and Jan Otop and Piotr Wieczorek},
  title =	{{Querying Best Paths in Graph Databases}},
  booktitle =	{37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
  pages =	{43:1--43:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-055-2},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{93},
  editor =	{Satya Lokam and R. Ramanujam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8398},
  URN =		{urn:nbn:de:0030-drops-83989},
  doi =		{10.4230/LIPIcs.FSTTCS.2017.43},
  annote =	{Keywords: graph databases, queries, aggregation}
}

Keywords: graph databases, queries, aggregation
Seminar: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Issue Date: 2018
Date of publication: 26.01.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI