On decidability of boundedness property for regular path queries

MaRDI QIDQ2708969zbMATH OpenFDO

Authors Yves André, Francis Bossut, Anne-Cecile Caron

Publication date 4 April 2001

zbMATH Keywords

path inclusions

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Regular path queries with constraints
• Bounded regular path queries in view-based data integration
• scientific article; zbMATH DE number 2051179
• Path constraints in semistructured data
• Mathematical Foundations of Computer Science 2004

Cited in

(11)

• Regular path queries with constraints
• On regular paths with counting and data tests
• Path constraints in semistructured data
• The complexity of regular expressions and property paths in SPARQL
• Conjunctive visibly-pushdown path queries
• scientific article; zbMATH DE number 2051179 (Why is no real title available?)
• The first-order truth behind undecidability of regular path queries determinacy
• Boundedness of conjunctive regular path queries
• Can One Escape Red Chains?
• On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
• Bounded regular path queries in view-based data integration

This page was built for publication: On decidability of boundedness property for regular path queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708969)