Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems最新文献

Subspace exploration: Bounds on Projected Frequency Estimation. 子空间探索:投影频率估计的边界。

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2021-06-01 Epub Date: 2021-06-20 DOI: 10.1145/3452021.3458312

Graham Cormode, Charlie Dickens, David P Woodruff

{"title":"Subspace exploration: Bounds on Projected Frequency Estimation.","authors":"Graham Cormode, Charlie Dickens, David P Woodruff","doi":"10.1145/3452021.3458312","DOIUrl":"https://doi.org/10.1145/3452021.3458312","url":null,"abstract":"Given an n × d dimensional dataset A, a projection query specifies a subset C ⊆ [d] of columns which yields a new n × |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Ω(d) lower bounds. However, we present upper bounds which demonstrate space dependency better than 2 d . That is, for c, c' ∈ (0, 1) and a parameter N = 2 d an Nc -approximation can be obtained in space <math><mrow><mi>min</mi> <mrow><mo>(</mo> <mrow><msup><mi>N</mi> <mrow><msup><mi>c</mi> <mo>'</mo></msup> </mrow> </msup> <mo>,</mo> <mi>n</mi></mrow> <mo>)</mo></mrow> </mrow> </math> , 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.","PeriodicalId":92118,"journal":{"name":"Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","volume":"2021 ","pages":"273-284"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3452021.3458312","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39289811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, June 20-25, 2021 第40届ACM SIGMOD-SIGACT-SIGAI数据库系统原理研讨会论文集，虚拟事件，中国，2021年6月20-25日

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2021-01-01 DOI: 10.1145/3452021

引用次数: 1

Computing Optimal Repairs for Functional Dependencies. 计算功能依赖的最优修复。

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2018-06-01 DOI: 10.1145/3196959.3196980

Ester Livshits, Benny Kimelfeld, Sudeepa Roy

{"title":"Computing Optimal Repairs for Functional Dependencies.","authors":"Ester Livshits, Benny Kimelfeld, Sudeepa Roy","doi":"10.1145/3196959.3196980","DOIUrl":"https://doi.org/10.1145/3196959.3196980","url":null,"abstract":"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) up-dates. 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.","PeriodicalId":92118,"journal":{"name":"Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","volume":"2018 ","pages":"225-237"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3196959.3196980","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37340326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Relational database behavior: utilizing relational discrete event systems and models 关系数据库行为:利用关系离散事件系统和模型

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2018-03-06 DOI: 10.1145/73721.73754

Z. Kedem, A. Tuzhilin

引用次数: 9

Data Citation: a Computational Challenge. 数据引用:一个计算挑战。

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2017-05-01 DOI: 10.1145/3034786.3056123

Susan B Davidson, Peter Buneman, Daniel Deutch, Tova Milo, Gianmaria Silvello

引用次数: 11

A semantic approach to correctness of concurrent transaction executions 并发事务执行正确性的语义方法

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2015-09-07 DOI: 10.1145/325405.325416

A. Tuzhilin, P. Spirakis

引用次数: 8

Foundations of data-aware process analysis: a database theory perspective 数据感知过程分析的基础:数据库理论视角

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2013-06-22 DOI: 10.1145/2463664.2467796

Diego Calvanese, Giuseppe De Giacomo, M. Montali

引用次数: 153

On XPath with transitive axes and data tests 关于具有传递轴和数据测试的XPath

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2013-06-22 DOI: 10.1145/2463664.2463675

Diego Figueira

引用次数: 13

Well-founded semantics for extended datalog and ontological reasoning 扩展数据和本体论推理的良好基础语义

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2013-06-22 DOI: 10.1145/2463664.2465229

André Hernich, C. Kupke, Thomas Lukasiewicz, G. Gottlob

引用次数: 32

Communication steps for parallel query processing 并行查询处理的通信步骤

Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Pub Date : 2013-06-22 DOI: 10.1145/2463664.2465224

P. Beame, Paraschos Koutris, Dan Suciu

{"title":"Communication steps for parallel query processing","authors":"P. Beame, Paraschos Koutris, Dan Suciu","doi":"10.1145/2463664.2465224","DOIUrl":"https://doi.org/10.1145/2463664.2465224","url":null,"abstract":"We consider the problem of computing a relational query q on a large input database of size n, using a large number p of servers. The computation is performed in rounds, and each server can receive only O(n/p1-ε) bits of data, where ε ∈[0,1] is a parameter that controls replication. We examine how many global communication steps are needed to compute q. We establish both lower and upper bounds, in two settings. For a single round of communication, we give lower bounds in the strongest possible model, where arbitrary bits may be exchanged; we show that any algorithm requires ε ≥ 1--1/τ*, where τ* is the fractional vertex cover of the hypergraph of q. We also give an algorithm that matches the lower bound for a specific class of databases. For multiple rounds of communication, we present lower bounds in a model where routing decisions for a tuple are tuple-based. We show that for the class of tree-like queries there exists a tradeoff between the number of rounds and the space exponent ε. The lower bounds for multiple rounds are the first of their kind. Our results also imply that transitive closure cannot be computed in O(1) rounds of communication.","PeriodicalId":92118,"journal":{"name":"Proceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","volume":"24 1","pages":"273-284"},"PeriodicalIF":0.0,"publicationDate":"2013-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84552276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 262