Bounded regular path queries in view-based data integration
From MaRDI portal
Publication:989472
DOI10.1016/J.IPL.2009.03.011zbMATH Open1209.68157OpenAlexW1968622325MaRDI QIDQ989472FDOQ989472
Authors: Gösta Grahne, Alex Thomo
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.011
Recommendations
databasesformal languagesdistance automataregular path queriessemistructured dataview-based rewritings
Cites Work
- On semigroups of matrices over the tropical semiring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Limitedness theorem on finite automata with distance functions
- Distance desert automata and the star height problem
- Finding Regular Simple Paths in Graph Databases
- Representation theorems on regular languages
- Rewriting of regular expressions and regular path queries
- Foundations of Information and Knowledge Systems
- Improved limitedness theorems on finite automata with distance functions
- Information integration using logical views
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- A decision procedure for the order of regular events
- New upper bounds to the limitedness of distance automata
- Deductive databases for computing certain and consistent answers from mediated data integration systems
- Distance automata having large finite distance or finite ambiguity
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)