Database Paper Browser

Back to papers

Flag & Check: Data Access with Monadically Defined Queries

Summary: Introduce MODEQs and NEMODEQs, query formalisms that extend CQs, conjunctive two-way RPQs and monadic Datalog, expressible in Datalog/MSO but crucially enjoying decidable query containment. They have P data complexity, combined complexity NP (MODEQs)/PSPACE (NEMODEQs), and preserve decidable answering under broad classes of TGDs via (partial) rewriting techniques. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1610
Venue
PODS
Year
2013
Pagerank
4.9089877e-05
Overall Rank
6,848 | 52.37%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,739 Expressive Languages for Querying the Semantic Web 2014 PODS 4.2936538e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers