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.
Ilyas, and Theodoros Rekatsinas
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.DB 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
A new catalog classifying 35 data error types into missing, incorrect, and redundant categories for tabular data, with definitions and examples to improve data quality management.
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.
-
A Catalog of Data Errors
A new catalog classifying 35 data error types into missing, incorrect, and redundant categories for tabular data, with definitions and examples to improve data quality management.