Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems最新文献

筛选
英文 中文
Sampling Big Ideas in Query Optimization 抽样查询优化中的大思想
E. Cohen
{"title":"Sampling Big Ideas in Query Optimization","authors":"E. Cohen","doi":"10.1145/3584372.3589935","DOIUrl":"https://doi.org/10.1145/3584372.3589935","url":null,"abstract":"The use of random sampling can greatly enhance the scalability of complex data analysis tasks. Samples serve as concise representations or versatile summaries that can be applied directly or integrated as a component in the data analysis process. We survey some of the author's favorite big ideas in the design and applications of weighted and coordinated sampling schemes. We emphasize algorithmic simplicity and practicality and the context of streaming or distributed data.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114987863","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}
引用次数: 2
Set Cover in the One-pass Edge-arrival Streaming Model 设置覆盖在一次通过边缘到达流模型
S. Khanna, C. Konrad, Cezar-Mihail Alexandru
{"title":"Set Cover in the One-pass Edge-arrival Streaming Model","authors":"S. Khanna, C. Konrad, Cezar-Mihail Alexandru","doi":"10.1145/3584372.3588678","DOIUrl":"https://doi.org/10.1145/3584372.3588678","url":null,"abstract":"We study the Set Cover problem in the one-pass edge-arrival streaming model. In this model, the input stream consists of a sequence of tuples (S, u), indicating that element u is contained in set S. This setting captures the streaming Dominating Set problem and is more general and harder to solve than the Set Cover set-arrival setting, where entire sets with all their elements arrive in the stream one-by-one. We prove the following results (n is the size of the universe, m is the number of sets): A work by [Khanna, Konrad, ITCS'22] on streaming Dominating Set implies a one-pass Õ(√n)-approximation algorithm with space Õ (m) for edge-arrival Set Cover in adversarially ordered streams. We show that this space bound is best possible up to poly-log factors in that every α-approximation algorithm, for α = Ω(√n ), requires space Ω(mn^2/α^4 ) in adversarially ordered streams, even if the algorithm is only required to output an α-approximation of the size of an optimal cover. As our main result, we give a one-pass Õ (√n )-approximation algorithm with space Õ (m/√n) for edge-arrival Set Cover in random order streams. This result together with the lower bound mentioned above establishes a strong separation between the adversarial and random order settings. Finally, in adversarial order streams, we show that non-trivial algorithms with space o(m) can be achieved at the expense of increased approximation factors Ω(√n ), which is in contrast to the set-arrival setting, where space Õ (n) is enough for a Θ(√n )-approximation, and space Ω(n) is needed for an o(n/łog n)-approximation. We give an α-approximation algorithm for one-pass edge-arrival Set Cover with space Õ(mn/α^2 ), for every α = Ω(√n).","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122395168","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}
引用次数: 0
A Query Language Perspective on Graph Learning 图学习的查询语言视角
Floris Geerts
{"title":"A Query Language Perspective on Graph Learning","authors":"Floris Geerts","doi":"10.1145/3584372.3589936","DOIUrl":"https://doi.org/10.1145/3584372.3589936","url":null,"abstract":"A key component of graph and relational learning methods is the computation of vector representations of the input graphs or relations. The starting point of this tutorial is that we model this computation as queries, mapping relational objects into the realm of real vector spaces. We then revisit recent works in the machine learning community on the expressive power of graph learning methods from this unifying query language perspective. Here, we consider the expressive power related to the discrimination of inputs and to the approximation power of functions. Finally, we argue that the bridge between graph learning and query languages opens many interesting avenues for further research.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126941887","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}
引用次数: 0
Differentially Private Data Release over Multiple Tables 跨多表的差异私有数据释放
Badih Ghazi, Xiao Hu, Ravi Kumar, Pasin Manurangsi
{"title":"Differentially Private Data Release over Multiple Tables","authors":"Badih Ghazi, Xiao Hu, Ravi Kumar, Pasin Manurangsi","doi":"10.1145/3584372.3588665","DOIUrl":"https://doi.org/10.1145/3584372.3588665","url":null,"abstract":"We study synthetic data release for answering multiple linear queries over a set of database tables in a differentially private way. Two special cases have been considered in the literature: how to release a synthetic dataset for answering multiple linear queries over a single table, and how to release the answer for a single counting (join size) query over a set of database tables. Compared to the single-table case, the join operator makes query answering challenging, since the sensitivity (i.e., by how much an individual data record can affect the answer) could be heavily amplified by complex join relationships. We present an algorithm for the general problem, and prove a lower bound illustrating that our general algorithm achieves parameterized optimality (up to logarithmic factors) on some simple queries (e.g., two-table join queries) in the most commonly-used privacy parameter regimes. For the case of hierarchical joins, we present a data partition procedure that exploits the concept of uniformized sensitivities to further improve the utility.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124806371","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}
引用次数: 1
Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond HyperLogLog、PCSA等的更好的基数估计器
Dingyu Wang, S. Pettie
{"title":"Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond","authors":"Dingyu Wang, S. Pettie","doi":"10.1145/3584372.3588680","DOIUrl":"https://doi.org/10.1145/3584372.3588680","url":null,"abstract":"Cardinality Estimation (aka Distinct Elements) is a classic problem in sketching with many applications in databases, networking, and security. Although sketching algorithms are fairly simple, analyzing the cardinality estimators is notoriously difficult, and even today the analyses of state-of-the-art sketches like HyperLogLog and ¶CSA are not very accessible. In this paper we introduce a new class of estimators called τ-Generalized-Remaining-Area estimators, as well as a dramatically simpler approach to analyzing estimators. The estimators of Durand and Flajolet, Flajolet et al., and Lang can be seen as τ-GRA estimators for integer values of τ. By using fractional values of τ we derive improved estimators for HyperLogLog and ¶CSA whose variance comes very close to the Cramé r-Rao lower bounds. We also derive τ-GRA-based estimators for the class of Curtain sketches introduced by Pettie, Wang, and Yin, which can be seen as a hybrid of HyperLogLog and ¶CSA with a more attractive simplicity-accuracy tradeoff than both.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893989","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}
引用次数: 1
Corrigendum: Are Few Bins Enough: Testing Histogram Distributions 勘误:几个箱子就足够了:测试直方图分布
C. Canonne
{"title":"Corrigendum: Are Few Bins Enough: Testing Histogram Distributions","authors":"C. Canonne","doi":"10.1145/3584372.3588652","DOIUrl":"https://doi.org/10.1145/3584372.3588652","url":null,"abstract":"Corrigendum for the PODS'16 paper, Are Few Bins Enough: Testing Histogram Distributions, by the author. The analysis of the testing algorithm presented in that paper had a flaw, and the claimed upper bound on the sample complexity of the problem, Õ (√n/ε^2 + k/ε^3), is as a result incorrect.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121680874","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}
引用次数: 0
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis 带自连接的联合查询,面向细粒度枚举复杂度分析
Nofar Carmeli, L. Segoufin
{"title":"Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis","authors":"Nofar Carmeli, L. Segoufin","doi":"10.1145/3584372.3588667","DOIUrl":"https://doi.org/10.1145/3584372.3588667","url":null,"abstract":"Even though query evaluation is a fundamental task in databases, known classifications of conjunctive queries by their fine-grained complexity only apply to queries without self-joins. We study how self-joins affect enumeration complexity, with the aim of building upon the known results to achieve general classifications. We do this by examining the extension of two known dichotomies: one with respect to linear delay, and one with respect to constant delay after linear preprocessing. As this turns out to be an intricate investigation, this paper is structured as an example-driven discussion that initiates this analysis. We show enumeration algorithms that rely on self-joins to efficiently evaluate queries that otherwise (i.e., if the relation names were replaced to eliminate self-joins) cannot be answered with the same guarantees. Due to these additional tractable cases, the hardness proofs are more complex than the self-join-free case. We show how to harness a known tagging technique to prove hardness of queries with self-joins. Our study offers sufficient conditions and necessary conditions for tractability and settles the cases of queries of low arity and queries with cyclic cores. Nevertheless, many cases remain open.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"18 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116547959","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}
引用次数: 2
On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms 组合输出敏感连接算法的连接采样和硬度
Shiyuan Deng, Shangqi Lu, Yufei Tao
{"title":"On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms","authors":"Shiyuan Deng, Shangqi Lu, Yufei Tao","doi":"10.1145/3584372.3588666","DOIUrl":"https://doi.org/10.1145/3584372.3588666","url":null,"abstract":"We present a dynamic index structure for join sampling. Built for an (equi-) join Q --- let IN be the total number of tuples in the input relations of Q --- the structure uses ~O(IN) space, supports a tuple update of any relation in ~O(1) time, and returns a uniform sample from the join result in ~O(INρ* / /max{1, OUT} ) time with high probability (w.h.p.), where OUT and ρ* are the join's output size and fractional edge covering number, respectively; notation ~O(.) hides a factor polylogarithmic to IN. We further show how our result justifies the O(INρ* ) running time of existing worst-case optimal join algorithms (for full result reporting) even when OUT łl INρ*. Specifically, unless the combinatorial k-clique hypothesis is false, no combinatorial algorithms (i.e., algorithms not relying on fast matrix multiplication) can compute the join result in O(INρ*-ε ) time w.h.p. even if OUT łe INε, regardless of how small the constant ε > 0 is.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134470681","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}
引用次数: 4
Efficient Computation of Quantiles over Joins 连接上分位数的高效计算
Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, B. Kimelfeld, Mirek Riedewald
{"title":"Efficient Computation of Quantiles over Joins","authors":"Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, B. Kimelfeld, Mirek Riedewald","doi":"10.1145/3584372.3588670","DOIUrl":"https://doi.org/10.1145/3584372.3588670","url":null,"abstract":"We present efficient algorithms for Quantile Join Queries, abbreviated as %JQ. A %JQ asks for the answer at a specified relative position (e.g., 50% for the median) under some ordering over the answers to a Join Query (JQ). Our goal is to avoid materializing the set of all join answers, and to achieve quasilinear time in the size of the database, regardless of the total number of answers. A recent dichotomy result rules out the existence of such an algorithm for a general family of queries and orders. Specifically, for acyclic JQs without self-joins, the problem becomes intractable for ordering by sum whenever we join more than two relations (and these joins are not trivial intersections). Moreover, even for basic ranking functions beyond sum, such as min or max over different attributes, so far it is not known whether there is any nontrivial tractable %JQ. In this work, we develop a new approach to solving %JQ and show how this approach allows not just to recover known results, but also generalize them and resolve open cases. Our solution uses two subroutines: The first one needs to select what we call a \"pivot answer\". The second subroutine partitions the space of query answers according to this pivot, and continues searching in one partition that is represented as new %JQ over a new database. For pivot selection, we develop an algorithm that works for a large class of ranking functions that are appropriately monotone. The second subroutine requires a customized construction for the specific ranking function at hand. We show the benefit and generality of our approach by using it to establish several new complexity results. First, we prove the tractability of min and max for all acyclic JQs, thereby resolving the above question. Second, we extend the previous %JQ dichotomy for sum to all partial sums (over all subsets of the attributes). Third, we handle the intractable cases of sum by devising a deterministic approximation scheme that applies to every acyclic JQ.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131489855","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}
引用次数: 1
Optimal Uncoordinated Unique IDs 最佳非协调唯一id
P. Dillinger, Martín Farach-Colton, Guido Tagliavini, Stefan Walzer
{"title":"Optimal Uncoordinated Unique IDs","authors":"P. Dillinger, Martín Farach-Colton, Guido Tagliavini, Stefan Walzer","doi":"10.1145/3584372.3588674","DOIUrl":"https://doi.org/10.1145/3584372.3588674","url":null,"abstract":"In the Uncoordinated Unique Identifiers Problem (UUIDP) there are n independent instances of an algorithm A that generates IDs from a universe (1, ..., m) , and there is an adversary that requests IDs from these instances. The goal is to design A such that it minimizes the probability that the same ID is ever generated twice across all instances, that is, minimizes the collision probability. Crucially, no communication between the instances of A is possible. Solutions to the UUIDP are often used as mechanisms for surrogate key generation in distributed databases and key-value stores. In spite of its practical relevance, we know of no prior theoretical work on the UUIDP. In this paper we initiate the systematic study of the UUIDP. We analyze both existing and novel algorithms for this problem, and evaluate their collision probability using worst-case analysis and competitive analysis, against oblivious and adaptive adversaries. In particular, we present an algorithm that is optimal in the worst case against oblivious adversaries, an algorithm that is at most a logarithmic factor away from optimal in the worst case against adaptive adversaries, and an algorithm that is optimal in the competitive sense against both oblivious and adaptive adversaries.","PeriodicalId":360503,"journal":{"name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114792922","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书