发布求助
文献互助 智能选刊 最新文献

ACM SIGMOD Record最新文献

筛选
英文 中文
When is it safe to run a transactional workload under Read Committed? 什么时候在Read Committed下运行事务性工作负载是安全的?
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604446
Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven
{"title":"When is it safe to run a transactional workload under Read Committed?","authors":"Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven","doi":"https://dl.acm.org/doi/10.1145/3604437.3604446","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604446","url":null,"abstract":"<p>The popular isolation level multiversion Read Committed (RC) exchanges some of the strong guarantees of serializability for increased transaction throughput. Nevertheless, transaction workloads can sometimes be executed under RC while still guaranteeing serializability at a reduced cost. Such workloads are said to be robust against RC. This paper provides a high level overview of deciding robustness against RC. In particular, we discuss how a sound and complete test can be obtained through the formalization of transaction templates. We then increase the modeling power of transaction templates by extending them with functional constraints which are useful for capturing data dependencies like foreign keys. We show that the incorporation of functional constraints can identify more workloads as robust than would otherwise be the case. Even though the robustness problem becomes undecidable in its most general form, we establish that various restrictions on functional constraints lead to decidable and even tractable results that can be used to model and test for robustness against RC for practical scenarios.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"250 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510380","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
Technical Perspective on 'R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys R2T的技术展望:带有外键的差分私有查询求值的实例最优截断
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604461
Graham Cormode
{"title":"Technical Perspective on 'R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys","authors":"Graham Cormode","doi":"https://dl.acm.org/doi/10.1145/3604437.3604461","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604461","url":null,"abstract":"<p>Increased use of data to inform decision making has brought with it a rising awareness of the importance of privacy, and the need for appropriate mitigations to be put in place to protect the interests of individuals whose data is being processed. From the demographic statistics that are produced by national censuses, to the complex predictive models built by \"big tech\" companies, data is the fuel that powers these applications. A majority of such uses rely on data that is derived from the properties and actions of individual people. This data is therefore considered sensitive, and in need of protections to prevent inappropriate use or disclosure. Some protections come from enforcing policies, access control, and contractual agreements. But in addition, we also seek technical interventions: definitions and algorithms that can be applied by computer systems in order to protect the private information while still enabling the intended use.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"254 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510365","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
An Optimal Algorithm for Partial Order Multiway Search 一种偏序多路搜索的最优算法
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604456
Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao
{"title":"An Optimal Algorithm for Partial Order Multiway Search","authors":"Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao","doi":"https://dl.acm.org/doi/10.1145/3604437.3604456","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604456","url":null,"abstract":"<p>Partial order multiway search (POMS) is an important problem that finds use in crowdsourcing, distributed file systems, software testing, etc. In this problem, a game is played between an algorithm A and an oracle, based on a directed acyclic graph G known to both parties. First, the oracle picks a vertex t in G called the target; then, A aims to figure out which vertex is t by probing reachability. In each probe, A selects a set Q of vertices in G whose size is bounded by a pre-agreed value k, and the oracle then reveals, for each vertex q 2 Q, whether q can reach the target in G. The objective of A is to minimize the number of probes. This article presents an algorithm to solve POMS in O(log1+k n + d k log1+d n) probes, where n is the number of vertices in G, and d is the largest out-degree of the vertices in G. The probing complexity is asymptotically optimal.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"253 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510370","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
Technical Perspective: When is it safe to run a transactional workload under Read Committed? 技术观点:在Read Committed下运行事务工作负载何时是安全的?
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604445
Alan D. Fekete
{"title":"Technical Perspective: When is it safe to run a transactional workload under Read Committed?","authors":"Alan D. Fekete","doi":"https://dl.acm.org/doi/10.1145/3604437.3604445","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604445","url":null,"abstract":"<p>A data management platform provides many capabilities to assist the data owner, application coder, or end-user. For example, it should support an expressive query language, schema definition, and sophisticated access control. Another way many platforms add value is through a transaction mechanism, which allows the application programmer to indicate that a stretch of code, including multiple accesses to data, represents a single real-world activity and so all these steps should happen as if a single step, despite really being interleaved with other programs, or perhaps cancelled after partial execution. If the platform perfectly hides interleaving of different activities, the execution is called serializable, and this is a great aid to protecting data quality. Any integrity constraint over the data (whether explicitly declared in schema or not) which is preserved by each transaction running alone, is also valid at the end of any serializable execution of several transactions.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"250 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510381","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
Technical Perspective: Revisiting Runtime Dynamic Optimization for Join Queries in Big Data Management Systems 技术视角:回顾大数据管理系统中连接查询的运行时动态优化
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604459
Andreas Kipf
{"title":"Technical Perspective: Revisiting Runtime Dynamic Optimization for Join Queries in Big Data Management Systems","authors":"Andreas Kipf","doi":"https://dl.acm.org/doi/10.1145/3604437.3604459","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604459","url":null,"abstract":"<p>Query optimization is the process of finding an efficient query execution plan for a given SQL query. The runtime difference between a good and a bad plan can be tremendous. For example, in the case of TPC-H query 5, a query with 5 joins, the difference between the best and the worst plan is more than 10,000×. Therefore, it is vital to avoid bad plans. The dominating factor which differentiates a good from a bad plan is their join order and whether this join order avoids large intermediate results.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"253 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510367","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
Technical Perspective: Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs 技术角度:通过基数估计图的镜头精确的基于摘要的基数估计
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604457
Dan Suciu
{"title":"Technical Perspective: Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs","authors":"Dan Suciu","doi":"https://dl.acm.org/doi/10.1145/3604437.3604457","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604457","url":null,"abstract":"<p>Query engines are really good at choosing an efficient query plan. Users don't need to worry about how they write their query, since the optimizer makes all the right choices for executing the query, while taking into account all aspects of data, such as its size, the characteristics of the storage device, the distribution pattern, the availability of indexes, and so on. The query optimizer always makes the best choice, no matter how complex the query is, or how contrived it was written. Or, this is what we expect today from a modern query optimizer. Unfortunately, reality is not as nice.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"253 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510369","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
Building Write-Optimized Tree Indexes on Disaggregated Memory 在分解内存上构建写优化树索引
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604448
Qing Wang, Youyou Lu, Jiwu Shu
{"title":"Building Write-Optimized Tree Indexes on Disaggregated Memory","authors":"Qing Wang, Youyou Lu, Jiwu Shu","doi":"https://dl.acm.org/doi/10.1145/3604437.3604448","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604448","url":null,"abstract":"<p>Memory disaggregation architecture physically separates CPU and memory into independent components, which are connected via high-speed RDMA networks, greatly improving resource utilization of database systems. However, such an architecture poses unique challenges to data indexing due to limited RDMA semantics and near-zero computation power at memory side. Existing indexes supporting disaggregated memory either suffer from low write performance, or require hardware modification.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"251 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510378","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
Ad Hoc Transactions: What They Are and Why We Should Care 特设事务:它们是什么以及为什么我们应该关心
ACM SIGMOD Record Pub Date : 2023-06-08 DOI: https://dl.acm.org/doi/10.1145/3604437.3604440
Chuzhe Tang, Zhaoguo Wang, Xiaodong Zhang, Qianmian Yu, Binyu Zang, Haibing Guan, Haibo Chen
{"title":"Ad Hoc Transactions: What They Are and Why We Should Care","authors":"Chuzhe Tang, Zhaoguo Wang, Xiaodong Zhang, Qianmian Yu, Binyu Zang, Haibing Guan, Haibo Chen","doi":"https://dl.acm.org/doi/10.1145/3604437.3604440","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604440","url":null,"abstract":"<p>Many transactions in web applications are constructed ad hoc in the application code. For example, developers might explicitly use locking primitives or validation procedures to coordinate critical code fragments. We refer to database operations coordinated by application code as ad hoc transactions. Until now, little is known about them. This paper presents the first comprehensive study on ad hoc transactions. By studying 91 ad hoc transactions among 8 popular open-source web applications, we find that (i) every studied application uses ad hoc transactions (up to 16 per application), 71 of which play critical roles; (ii) compared with database transactions, concurrency control of ad hoc transactions is much more flexible; (iii) ad hoc transactions are error-prone-53 of them have correctness issues, and 33 of them are confirmed by developers; and (iv) ad hoc transactions have the potential to improve performance in contentious workloads by utilizing application semantics such as access patterns. Finally, implications of ad hoc transactions to the database research community are discussed.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"249 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510386","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
Chenggang Wu Speaks Out on his ACM SIGMOD Jim Gray Dissertation Award, Rejection, Believing in Your Work, and More 吴成刚谈到了他的ACM SIGMOD吉姆·格雷博士论文奖，拒绝，相信你的工作等等
ACM SIGMOD Record Pub Date : 2023-01-25 DOI: https://dl.acm.org/doi/10.1145/3582302.3582318
Chenggang Wu
{"title":"Chenggang Wu Speaks Out on his ACM SIGMOD Jim Gray Dissertation Award, Rejection, Believing in Your Work, and More","authors":"Chenggang Wu","doi":"https://dl.acm.org/doi/10.1145/3582302.3582318","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3582302.3582318","url":null,"abstract":"<p>Welcome to this installment of ACM SIGMOD Record's series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we are on Zoom with Chenggang Wu, co-founder and CTO of Aqueduct. Chenggang received the 2022 ACM SIGMOD Jim Gray Dissertation Award for his thesis entitled The Design of Any-scale Serverless Infrastructure with Rich Consistency Guarantees. His PhD is from UC Berkeley. So, Chenggang, welcome!</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"2 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510319","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
Concurrency control for database theorists 数据库理论家的并发控制
ACM SIGMOD Record Pub Date : 2023-01-25 DOI: https://dl.acm.org/doi/10.1145/3582302.3582304
Bas Ketsman, Christoph Koch, Frank Neven, Brecht Vandevoort
{"title":"Concurrency control for database theorists","authors":"Bas Ketsman, Christoph Koch, Frank Neven, Brecht Vandevoort","doi":"https://dl.acm.org/doi/10.1145/3582302.3582304","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3582302.3582304","url":null,"abstract":"<p>The aim of this paper is to serve as a lightweight introduction to concurrency control for database theorists through a uniform presentation of the work on robustness against Multiversion Read Committed and Snapshot Isolation.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"1 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138510362","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学术文献互助群
群 号：481959085
Book学术官方微信