Bounded regular path queries in view-based data integration

DOI10.1016/j.ipl.2009.03.011zbMath1209.68157OpenAlexW1968622325MaRDI QIDQ989472

Alex Thomo, Gösta Grahne

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

zbMATH Keywords

semistructured dataformal languagesdatabasesdistance automataregular path queriesview-based rewritings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Related Items (2)

Evolving schemas for streaming XML ⋮ Visibly Pushdown Transducers for Approximate Validation of Streaming XML

Cites Work

• Unnamed Item
• Unnamed Item
• Rewriting of regular expressions and regular path queries
• Limitedness theorem on finite automata with distance functions: An algebraic proof
• Improved limitedness theorems on finite automata with distance functions
• Limitedness theorem on finite automata with distance functions
• Representation theorems on regular languages
• A decision procedure for the order of regular events
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Information integration using logical views
• 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
• On semigroups of matrices over the tropical semiring
• Finding Regular Simple Paths in Graph Databases
• Distance desert automata and the star height problem
• Foundations of Information and Knowledge Systems

This page was built for publication: Bounded regular path queries in view-based data integration