Database Paper Browser

Back to papers

Containment of Graph Queries Modulo Schema

Summary: Containment of graph queries modulo DL-based schemas: use DLs to capture label constraints, participation, cardinality, and keys; derive containment for UCRPQs. For UC2RPQs, with practical limits on concatenation and participation, decidability follows. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1908
Venue
PODS
Year
2024
Pagerank
4.8925595e-05
Overall Rank
6,896 | 52.03%
DOI
10.1145/3651140

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,349 Minimizing Conjunctive Regular Path Queries 2025 PODS 4.1945683e-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.

Rank Cited Paper Year Venue Pagerank
690 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.00018099792
810 Query Containment for Conjunctive Queries With Regular Expressions 1998 PODS 0.00016428374
1,037 Querying Graph Databases 2013 PODS 0.00014502493
1,490 On the Decidability of Query Containment under Constraints 1998 PODS 0.00011699154
1,785 PG-Schema: Schemas for Property Graphs 2023 SIGMOD 0.00010560236
2,505 Graph Pattern Matching in GQL and SQL/PGQ 2022 SIGMOD 8.634551e-05
3,306 PG-Keys: Keys for Property Graphs 2021 SIGMOD 7.2437997e-05
8,450 Static Analysis of Graph Database Transformations 2023 PODS 4.5086643e-05
Previous Page 1 / 1 Next

Semantically Similar Papers