Bounded regular path queries in view-based data integration
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1163636 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A decision procedure for the order of regular events
- Deductive databases for computing certain and consistent answers from mediated data integration systems
- Distance automata having large finite distance or finite ambiguity
- Distance desert automata and the star height problem
- Finding Regular Simple Paths in Graph Databases
- Foundations of Information and Knowledge Systems
- Improved limitedness theorems on finite automata with distance functions
- Information integration using logical views
- Limitedness theorem on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- New upper bounds to the limitedness of distance automata
- On semigroups of matrices over the tropical semiring
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Representation theorems on regular languages
- Rewriting of regular expressions and regular path queries
Cited in
(4)
This page was built for publication: Bounded regular path queries in view-based data integration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989472)