Querying best paths in graph databases
From MaRDI portal
Publication:5136335
DOI10.4230/LIPICS.FSTTCS.2017.43zbMATH Open1491.68061arXiv1710.04419MaRDI QIDQ5136335FDOQ5136335
Authors: Jakub Michaliszyn, Jan Otop, Piotr Wieczorek 
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1710.04419
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Database theory (68P15)
Cites Work
- Data complexity of query answering in description logics
- Automata and Logics for Words and Trees over an Infinite Alphabet
- On Relations Defined by Generalized Finite Automata
- Two-variable logic on data words
- Reachability in two-dimensional vector addition systems with states is PSPACE-complete
- Finding Regular Simple Paths in Graph Databases
- Finite-memory automata
- What's decidable about weighted automata?
- Rewriting of regular expressions and regular path queries
- Synchronized rational relations of finite and infinite words
- Title not available (Why is that?)
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
- Finite state machines for strings over infinite alphabets
- Expressive path queries on graph with data
- Path logics for querying graphs: combining expressiveness and efficiency
- Low-complexity aggregation in GraphLog and Datalog
- Complexity of Subcases of Presburger Arithmetic
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Synchronizing relations on words
- Querying Graphs with Data
Cited In (7)
- Extrema predicates in deductive databases
- Straight-path queries in trajectory data
- Investigations on Path Indexing for Graph Databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algebra for Path Manipulation in Graph Databases
- Relative expressive power of navigational querying on graphs
Uses Software
This page was built for publication: Querying best paths in graph databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136335)
