The hardness of resilience for nested aggregation query

DOI10.1016/j.tcs.2019.09.049zbMath1436.68090OpenAlexW2979277919WikidataQ127191303 ScholiaQ127191303MaRDI QIDQ2283020

Jiguo Yu, Zhipeng Cai, Dongjing Miao

Publication date: 27 December 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.049

zbMATH Keywords

aggregationcomplexitydatabaseresilience

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (4)

Parameterized complexity of completeness reasoning for conjunctive queries ⋮ Range partitioning within sublinear time: algorithms and lower bounds ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Sampling-based approximate skyline calculation on big data

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
• A theory of diagnosis from first principles
• On the complexity of database queries
• Abduction from logic programs: Semantics and complexity
• From causes for database queries to repairs and model-based diagnosis and back
• On the Relationship Between Abduction and Deduction
• Updates of Relational Views
• Update semantics of relational views
• On the correct translation of update operations on relational views

This page was built for publication: The hardness of resilience for nested aggregation query