The hardness of resilience for nested aggregation query
Work
Year: 2019
Type: article
Abstract: Resilience problem is defined on a database d, given a boolean query q where q(d) is initially true, and an integer k, it is to find the tuple set d′ of smallest size such that the query result q(d∖d′... more
Source: Theoretical Computer Science
Authors Dongjing Miao, Jiguo Yu, Zhipeng Cai
Institutions Heilongjiang Institute of Technology, Harbin Institute of Technology, Qufu Normal University, Shandong Academy of Sciences, Qilu University of Technology +2 more
Cites: 33
Cited by: 6
Related to: 10
FWCI: 0.844
Citation percentile (by year/subfield): 59.61
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,690