DPXPlain: Privately Explaining Aggregate Query Answers

被引:3
|
作者
Tao, Yuchao [1 ]
Gilad, Amir [1 ]
Machanavajjhala, Ashwin [1 ]
Roy, Sudeepa [1 ]
机构
[1] Duke Univ, Durham, NC 27708 USA
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2022年 / 16卷 / 01期
关键词
DIFFERENTIAL PRIVACY; PROVENANCE; SECURE;
D O I
10.14778/3561261.3561271
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Differential privacy (DP) is the state-of-the-art and rigorous notion of privacy for answering aggregate database queries while preserving the privacy of sensitive information in the data. In today's era of data analysis, however, it poses new challenges for users to understand the trends and anomalies observed in the query results: Is the unexpected answer due to the data itself, or is it due to the extra noise that must be added to preserve DP? In the second case, even the observation made by the users on query results may be wrong. In the first case, can we still mine interesting explanations from the sensitive data while protecting its privacy? To address these challenges, we present a three-phase framework DPXPLAIN, which is the first system to the best of our knowledge for explaining group-by aggregate query answers with DP. In its three phases, DPXPLAIN (a) answers a group-by aggregate query with DP, (b) allows users to compare aggregate values of two groups and with high probability assesses whether this comparison holds or is flipped by the DP noise, and (c) eventually provides an explanation table containing the approximately 'top-k' explanation predicates along with their relative influences and ranks in the form of confidence intervals, while guaranteeing DP in all steps. We perform an extensive experimental analysis of DPXPLAIN with multiple use-cases on real and synthetic data showing that DPXPLAIN efficiently provides insightful explanations with good accuracy and utility.
引用
收藏
页码:113 / 126
页数:14
相关论文
共 50 条
  • [21] Explaining Answers with Entailment Trees
    Dalvi, Bhavana
    Jansen, Peter
    Tafjord, Oyvind
    Xie, Zhengnan
    Smith, Hannah
    Pipatanangkura, Leighanna
    Clark, Peter
    2021 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2021), 2021, : 7358 - 7370
  • [22] Keyword Aggregate Query Based on Query Template
    Zhu, Bin
    Yuan, Fang
    Wang, Yu
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION APPLICATIONS (ICCIA 2012), 2012, : 715 - 720
  • [23] The Complexity of Causality and Responsibility for Query Answers and non-Answers
    Meliou, Alexandra
    Gatterbauer, Wolfgang
    Moore, Katherine F.
    Suciu, Dan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 4 (01): : 34 - 45
  • [24] Query rewriting for SWIFT (First) answers
    Tan, KL
    Goh, CH
    Ooi, BC
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2000, 12 (05) : 694 - 714
  • [25] Consistent query answers in inconsistent databases
    Arenas, Marcelo
    Bertossi, Leopoldo
    Chomicki, Jan
    Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1999, : 68 - 79
  • [26] Concerning Referring Expressions in Query Answers
    Borgida, Alexander
    Toman, David
    Weddell, Grant
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4791 - 4795
  • [27] Active XML and active query answers
    Abiteboul, S
    Benjelloun, O
    Milo, T
    FLEXIBLE QUERY ANSWERING SYSTEMS, PROCEEDINGS, 2004, 3055 : 17 - 27
  • [28] Negative Knowledge for Certain Query Answers
    Libkin, Leonid
    WEB REASONING AND RULE SYSTEMS, (RR 2016), 2016, 9898 : 111 - 127
  • [29] GUIDING STUDENTS TO ANSWERS: Query Recommendation
    Yilmazel, Ozgur
    TURKISH ONLINE JOURNAL OF DISTANCE EDUCATION, 2011, 12 (01): : 85 - 94
  • [30] FINITE REPRESENTATION OF INFINITE QUERY ANSWERS
    CHOMICKI, J
    IMIELINSKI, T
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 1993, 18 (02): : 181 - 223