ReCAP enables relational DBMS like DuckDB to push property constraints deep into path query plans for speedups up to 400,000x over state-of-the-art graph and relational systems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Efficient Path Query Processing in Relational Database Systems
ReCAP enables relational DBMS like DuckDB to push property constraints deep into path query plans for speedups up to 400,000x over state-of-the-art graph and relational systems.