Weighted path queries on semistructured databases
From MaRDI portal
Publication:2495649
Recommendations
Cites work
- A logical query language for hypermedia systems
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- An algebra for XML query
- Finding Regular Simple Paths in Graph Databases
- Finite Automata Computing Real Functions
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1916666 (Why is no real title available?)
- On the determinization of weighted finite automata
- Partially ordered regular languages for graph queries
- Probabilistic and weighted grammars
- Semirings, automata, languages
- Structured document transformations based on XSL
Cited in
(8)- Fault-tolerant computation of distributed regular path queries
- Regular path queries under approximate semantics
- Preferential regular path queries
- Regular languages with variables on graphs
- A new path expression computing approach for XML data
- Foundations of Information and Knowledge Systems
- Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries
- Weighted monadic Datalog
This page was built for publication: Weighted path queries on semistructured databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495649)