Querying best paths in graph databases
From MaRDI portal
Publication:5136335
Recommendations
Cites work
- scientific article; zbMATH DE number 2038747 (Why is no real title available?)
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Complexity of Subcases of Presburger Arithmetic
- Data complexity of query answering in description logics
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
- Expressive path queries on graph with data
- Finding Regular Simple Paths in Graph Databases
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Low-complexity aggregation in GraphLog and Datalog
- On Relations Defined by Generalized Finite Automata
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Path logics for querying graphs: combining expressiveness and efficiency
- Querying Graphs with Data
- Reachability in two-dimensional vector addition systems with states is PSPACE-complete
- Rewriting of regular expressions and regular path queries
- Synchronized rational relations of finite and infinite words
- Synchronizing relations on words
- Two-variable logic on data words
- What's decidable about weighted automata?
Cited in
(7)- An Algebra for Path Manipulation in Graph Databases
- Extrema predicates in deductive databases
- Straight-path queries in trajectory data
- Investigations on Path Indexing for Graph Databases
- scientific article; zbMATH DE number 7407799 (Why is no real title available?)
- scientific article; zbMATH DE number 1134692 (Why is no real title available?)
- Relative expressive power of navigational querying on graphs
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)
