• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

    Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

    ConferenceISSN 1055-6338

    年发文量

    研究主题

    论文(3)

    排序
    1Subspace Exploration: Bounds on Projected Frequency Estimation
    Graham Cormode,Charlie Dickens,David P Woodruff

    Given an $n \times d$ dimensional dataset A, a projection query specifies a subset $C \subseteq [d]$ of columns which yields a new $n \times |C|$ array. We study the space complexity of computing data analysis functions over such subspaces, including heavy hitters and norms, when the subspaces are revealed only after observing the data. We show that this important class of problems is typically hard: for many problems, we show $2^Ømega(d) $ lower bounds. However, we present upper bounds which demonstrate space dependency better than $2^d$. That is, for $c,c' \in (0,1)$ and a parameter $N=2^d$ an $N^c$-approximation can be obtained in space $\min(N^c', n)$, showing that it is possible to improve on the naï ve approach of keeping information for all $2^d$ subsets of d columns. Our results are based on careful constructions of instances using coding theory and novel combinatorial reductions that exhibit such space-approximation tradeoffs.

    2021引用:1
    引用
    AI阅读
    加入学术空间
    2Computing Optimal Repairs for Functional Dependencies
    Ester Livshits,Benny Kimelfeld,Sudeepa Roy

    We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two types of repairs: an optimal subset repair (optimal S-repair) that is obtained by a minimum number of tuple deletions, and an optimal update repair (optimal U-repair) that is obtained by a minimum number of value (cell) updates. For computing an optimal S-repair, we present a polynomial-time algorithm that succeeds on certain sets of FDs and fails on others. We prove the following about the algorithm. When it succeeds, it can also incorporate weighted tuples and duplicate tuples. When it fails, the problem is NP-hard, and in fact, APX-complete (hence, cannot be approximated better than some constant). Thus, we establish a dichotomy in the complexity of computing an optimal S-repair. We present general analysis techniques for the complexity of computing an optimal U-repair, some based on the dichotomy for S-repairs. We also draw a connection to a past dichotomy in the complexity of finding a "most probable database" that satisfies a set of FDs with a single attribute on the left hand side; the case of general FDs was left open, and we show how our dichotomy provides the missing generalization and thereby settles the open problem.

    2018引用:63
    引用
    AI阅读
    加入学术空间
    3Data Citation: A Computational Challenge
    Susan B Davidson,Peter Buneman,Daniel Deutch,Tova Milo,Gianmaria Silvello

    Data citation is an interesting computational challenge, whose solution draws on several well-studied problems in database theory: query answering using views, and provenance. We describe the problem, suggest an approach to its solution, and highlight several open research problems, both practical and theoretical.

    2017引用:15
    引用
    AI阅读
    加入学术空间

    高被引作者

    作者引用发文
    Ester Livshits631
    Sudeepa Roy631
    Benny Kimelfeld631
    Peter Buneman151
    Tova Milo151
    Daniel Deutch151
    Gianmaria Silvello151
    Susan B. Davidson151
    David P. Woodruff11
    Charlie Dickens11

    高产作者

    作者引用发文
    Gianmaria Silvello151
    Ester Livshits631
    David P. Woodruff11
    Peter Buneman151
    Tova Milo151
    Graham Cormode11
    Susan B. Davidson151
    Benny Kimelfeld631
    Daniel Deutch151
    Charlie Dickens11

    相关期刊

    Developments in Computational Models
    Finite-State Methods and Natural Language Processing
    International Conference on Genetic Algorithms
    International Conference on Rewriting Techniques and Applications
    Security Protocols Workshop
    Description Logics
    International Conference on Graph Transformation
    International Conference on Computers for Handicapped Persons
    Exploring Modeling Methods for Systems Analysis and Design
    Synthesis Lectures on Computer Science