Consistent query answers on numerical databases under aggregate constraints
Sergio Flesca, Filippo Furfaro, Francesco Parisi
Abstract
The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defined as linear inequalities on aggregate-sum queries on input data are considered. The notion of repair as consistent set of updates at attribute-value level is exploited, and the characterization of several complexity issues related to repairing data and computing consistent query answers is provided.
Create a lesson
Related papers
Autonomous ETL Pipelines for Salesforce M&A Consolidation: A Reference Framework, Jitterbit Mapping, and Reproducible Simulation Study
Imran Basha Shaik, Sahla Sultana, Khader Moinuddin Shaik
When Is One Query per Template Enough? Adapting Learned Cost Models to New Hardware
Krish Patel
Optimizing Geo-replicated Deterministic Databases
Yunhao Mao, Shiquan Zhang, Gengrui Zhang et al.
BobFlow: Towards Human-Agent Collaborative Data Science Using Dataflows
Jiadong Bai, Yicong Huang, Chen Li
Turbocharging PiPNN for Proximity and k-NN Graph Building
Tobias Rubel, Richard Wen, Guy Blelloch et al.
Whiel: A Neurosymbolic Platform for Certified Relational Program Verification
Jesse Comer, Fangzhu Shen, Shuo Zhang et al.