Document Open Access Logo

Querying Best Paths in Graph Databases

Authors Jakub Michaliszyn, Jan Otop, Piotr Wieczorek

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2017.43.pdf
  • Filesize: 0.58 MB
  • 15 pages

Document Identifiers

Subject Classification

Keywords
  • graph databases
  • queries
  • aggregation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Jakub Michaliszyn, Jan Otop, and Piotr Wieczorek. Querying Best Paths in Graph Databases. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 43:1-43:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.FSTTCS.2017.43

Author Details

Jakub Michaliszyn
Jan Otop
Piotr Wieczorek

References

  1. Shaull Almagor, Udi Boker, and Orna Kupferman. What’s decidable about weighted automata? In Automated Technology for Verification and Analysis, pages 482-491. Springer, 2011. Google Scholar
  2. Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan Reutter, and Domagoj Vrgoč. Foundations of Modern Graph Query Languages. CoRR, abs/1610.06264, 2016. URL: http://arxiv.org/abs/1610.06264.
  3. Marcelo Arenas, Georg Gottlob, and Andreas Pieris. Expressive languages for querying the semantic web. In PODS 2014, pages 14-26. ACM, 2014. Google Scholar
  4. Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. DL-lite in the light of first-order logic. In Proceedings of the national conference on artificial intelligence, volume 22, page 361. AAAI Press; MIT Press, 2007. Google Scholar
  5. Pablo Barceló. Querying graph databases. In Proceedings of the 32nd Symposium on Principles of Database Systems (PODS13), pages 175-188, 2013. Google Scholar
  6. Pablo Barceló, Gaëlle Fontaine, and Anthony W. Lin. Expressive path queries on graph with data. Logical Methods in Comp. Sci., 11(4), 2015. Google Scholar
  7. Pablo Barceló, Leonid Libkin, Anthony W. Lin, and Peter T. Wood. Expressive languages for path queries over graph-structured data. ACM Transactions on Database Systems, 37:31:1-31:46, 2012. Google Scholar
  8. Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, and Pierre McKenzie. Reachability in two-dimensional vector addition systems with states is PSpace-complete. CoRR, abs/1412.4259, 2014. Google Scholar
  9. Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, and Pierre McKenzie. Reachability in two-dimensional vector addition systems with states is pspace-complete. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 32-43. IEEE Computer Society, 2015. URL: http://dx.doi.org/10.1109/LICS.2015.14.
  10. Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick, and Luc Segoufin. Two-variable logic on data words. ACM Trans. Comput. Log., 12(4):27, 2011. Google Scholar
  11. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Data complexity of query answering in description logics. In Proceedings 10th International Conference on Principles of Knowledge Representation and Reasoning (KR06), volume 6, pages 260-270, 2006. Google Scholar
  12. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. Containment of conjunctive regular path queries with inverse. In Proceedings of the 7th International Conference Principles of Knowledge Representation and Reasoning (KR00), pages 176-185, 2000. Google Scholar
  13. Mariano Consens and Alberto Mendelzon. Low complexity aggregation in GraphLog and Datalog. Theor. Comp. Sci., 116(1):95-116, 1993. Google Scholar
  14. Mariano P. Consens and Alberto O. Mendelzon. Graphlog: a visual formalism for real life recursion. In Daniel J. Rosenkrantz and Yehoshua Sagiv, editors, Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee, USA, pages 404-416. ACM Press, 1990. URL: http://dx.doi.org/10.1145/298514.298591.
  15. Isabel F. Cruz, Alberto O. Mendelzon, and Peter T. Wood. A graphical query language supporting recursion. In Proc. of the ACM Special Interest Group on Management of Data (SIGMOD87), pages 323-330, 1987. Google Scholar
  16. Isabel F. Cruz, Alberto O. Mendelzon, and Peter T. Wood. G+: recursive queries without recursion. In Expert Database Conf., pages 645-666, 1988. Google Scholar
  17. Richard Cyganiak, Markus Lanthaler, and David Wood. RDF 1.1 concepts and abstract syntax. W3C Recommendation, 2014. URL: http://www.w3.org/TR/2014/REC-rdf11-concepts/.
  18. Stéphane Demri, Ranko Lazic, and David Nowak. On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput., 205(1):2-24, 2007. Google Scholar
  19. C.C. Elgot and J.E. Mezei. On relations defined by generalized finite automata. IBM J. Res. Dev., 9(1):47-68, 1965. Google Scholar
  20. Diego Figueira and Leonid Libkin. Path logics for querying graphs: Combining expressiveness and efficiency. In Proceedings of the 30th Annual Symposium on Logic in Computer Science (LICS15), pages 329-340, 2015. Google Scholar
  21. Diego Figueira and Leonid Libkin. Synchronizing relations on words. Theory Comput. Syst., 57(2):287-318, 2015. Google Scholar
  22. Christiane Frougny and Jacques Sakarovitch. Synchronized rational relations of finite and infinite words. Theor. Comput. Sci., 108(1):45-82, 1993. URL: http://dx.doi.org/10.1016/0304-3975(93)90230-Q.
  23. Michał Graboń, Jakub Michaliszyn, Jan Otop, and Piotr Wieczorek. Querying data graphs with arithmetical regular expressions. In Proceedings of the 25rd International Joint Conference on Artificial Intelligence (IJCAI16). AAAI Press, 2016. URL: http://www.ii.uni.wroc.pl/~jmi/papers/ijcai16.pdf.
  24. Steve Harris and Andy Seaborne. SPARQL 1.1 Query Language. W3C Recommendation, 2013. URL: https://www.w3.org/TR/sparql11-query/.
  25. Jelle Hellings, Bart Kuijpers, Jan Van den Bussche, and Xiaowang Zhang. Walk logic as a framework for path query languages on graph databases. In Proceedings of the 16th International Conference on Database Theory (ICDT13), pages 117-128, 2013. Google Scholar
  26. Michael Kaminski and Nissim Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329-363, 1994. Google Scholar
  27. Felix Klaedtke and Harald Rueß. Monadic second-order logics with cardinalities. In Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, pages 681-696, 2003. Google Scholar
  28. Anthony C. Klug. Equivalence of relational algebra and relational calculus query languages having aggregate functions. J. ACM, 29(3):699-717, 1982. Google Scholar
  29. Eryk Kopczyński and Anthony Widjaja To. Parikh images of grammars: Complexity and applications. In Proceedings of the 25th Symposium on Logic in Comp. Sci. (LICS10), pages 80-89, 2010. Google Scholar
  30. Leonid Libkin, Wim Martens, and Domagoj Vrgoč. Querying graphs with data. J. ACM, 63(2):14:1-14:53, 2016. Google Scholar
  31. Leonid Libkin, Juan L. Reutter, and Domagoj Vrgoc. Trial for RDF: adapting graph query languages for RDF data. In PODS 2013, pages 201-212, 2013. Google Scholar
  32. Alberto Mendelzon and Peter Wood. Finding regular simple paths in graph databases. SIAM Journal on Computation, 24(6):1235-1258, 1995. Google Scholar
  33. Jakub Michaliszyn, Jan Otop, and Piotr Wieczorek. Querying best paths in graph databases. CoRR, abs/1710.04419, 2017. URL: http://arxiv.org/abs/1710.04419.
  34. Frank Neven, Thomas Schwentick, and Victor Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log., 5(3):403-435, 2004. Google Scholar
  35. Eric Prud'hommeaux and Andy Seaborne. SPARQL Query Language for RDF. W3C Recommendation, 2008. URL: http://www.w3.org/TR/rdf-sparql-query/.
  36. Bruno Scarpellini. Complexity of subcases of Presburger arithmetic. Transactions of the American Mathematical Society, 284(1):203-218, 1984. Google Scholar
  37. Luc Segoufin. Automata and logics for words and trees over an infinite alphabet. In Proceedings of the 20th Int. Workshop on Computer Science Logic (CSL06), pages 41-57, 2006. Google Scholar
  38. The Neo4j Team. The Neo4j Manual v3.1., 2017. URL: http://neo4j.com/docs/.
  39. Peter T. Wood. Query languages for graph databases. SIGMOD Record, 41(1):50-60, 2012. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact