.png){kind=icon}
.png){kind=icon}
Return
View-Based Query Determinacy for Walk-Based Semantics
.png){kind=icon}
PRE
AI
DOI：10.4230/LIPIcs.ICDT.2026.22.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The view-based query determinacy problem asks, given a view V and a query Q whether the information contained in V always suffices to answer the query Q. It is a notoriously hard problem that is known to be undecidable even in very restricted settings. Here, we study it in the context of graph databases and regular path queries and views evaluated under several walk-based semantics, that is, semantics in which queries and views return the matched walks in full as opposed to the classical endpoint semantics. Our main finding is that view-based query determinacy is decidable for regular path queries under both trail and shortest walk semantics.
Keywords:
graph databases
regular path queries
trail semantics
shortest walk semantics
view-based query determinacy
Journal
2
IF:
0
Papers:
28
Citations:
0