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

SIGMOD Rec.最新文献

筛选
英文 中文
Richard Hipp Speaks Out on SQLite Richard Hipp谈SQLite
SIGMOD Rec. Pub Date : 2019-12-19 DOI: 10.1145/3377330.3377338
M. Winslett, V. Braganholo
{"title":"Richard Hipp Speaks Out on SQLite","authors":"M. Winslett, V. Braganholo","doi":"10.1145/3377330.3377338","DOIUrl":"https://doi.org/10.1145/3377330.3377338","url":null,"abstract":"Welcome to ACM SIGMOD Record Series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we are at the 2017 SIGMOD and PODS Conference in Chicago. I have here with me, Richard Hipp, who won the 2017 SIGMOD Systems Award and the 2005 Google O'Reilly Open Source Award for SQLite. Richard has his own consulting firm, Hwaci, and his Ph.D. is from Duke University.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"34 6 1","pages":"39-46"},"PeriodicalIF":0.0,"publicationDate":"2019-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79650229","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}
引用次数: 6
Technical Perspective: How Do Humans and Data Systems Establish a Common Query Language? 技术视角:人类和数据系统如何建立共同的查询语言?
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371328
H. Jagadish
{"title":"Technical Perspective: How Do Humans and Data Systems Establish a Common Query Language?","authors":"H. Jagadish","doi":"10.1145/3371316.3371328","DOIUrl":"https://doi.org/10.1145/3371316.3371328","url":null,"abstract":"We all structure information in our brains: without structure, we would not be able to deal with the huge quantities of highly heterogenous information we process. However, each of us structures this information slightly differently, often leading to misunderstandings or requiring additional rounds of dialog to clarify. Database schema are also designed by humans. The structure imposed on the information by the schema reflects the human designers' perspective on the world, even if mediated through formal design techniques or computer software. Therefore, the structured data querying task can be viewed as having a schema mapping problem at its core: mapping between the \"schema\" the human has in her brain and the schema used to organize the database.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"21 1","pages":"50"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82665496","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
Efficient Signal Reconstruction for a Broad Range of Applications 广泛应用的高效信号重构
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371327
Abolfazl Asudeh, Jees Augustine, Azade Nazi, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das, D. Srivastava
{"title":"Efficient Signal Reconstruction for a Broad Range of Applications","authors":"Abolfazl Asudeh, Jees Augustine, Azade Nazi, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das, D. Srivastava","doi":"10.1145/3371316.3371327","DOIUrl":"https://doi.org/10.1145/3371316.3371327","url":null,"abstract":"The signal reconstruction problem (SRP) is an important optimization problem where the objective is to identify a solution to an under-determined system of linear equations AX = b that is closest to a given prior. It has a substantial number of applications in diverse areas including network traffic engineering, medical image reconstruction, acoustics, astronomy and many more. Most common approaches for solving SRP do not scale to large problem sizes. In this paper, we propose a dual formulation of this problem and show how adapting database techniques developed for scalable similarity joins provides a significant speedup when the A matrix is sparse and binary. Extensive experiments on real-world and synthetic data show that our approach produces a significant speedup of up to 20x over competing approaches.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"78 1","pages":"42-49"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91139586","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
Research Highlights: Bridging Theory and Practice with Query Log Analysis 研究重点:用查询日志分析架起理论与实践的桥梁
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371318
L. Libkin
{"title":"Research Highlights: Bridging Theory and Practice with Query Log Analysis","authors":"L. Libkin","doi":"10.1145/3371316.3371318","DOIUrl":"https://doi.org/10.1145/3371316.3371318","url":null,"abstract":"Take a database conference paper and search for \"in the real world\" in it; chances are high you will find it. Of course what is real depends on one's perspective: for a pure theory paper it could be what one saw in a systems paper, for a systems paper it could be an issue that implementors of DBMSs had to deal with, and for the latter it may be what the customers need. But to sharpen our research tools, it helps tremendously to understand that the real \"real world\" is, and adjust our (sometimes very elaborate) techniques to address problems that actually occur.\u0000 A nice example of this is analyzing the computational complexity of database queries. Database theory has developed an arsenal of tools for this. We know that for many classes of queries, the complexity is roughly kDkO(kQk) for a database D and a query Q, where k k means size. Thus, much research went into the detailed analysis of the structure of queries that removes kQk from the exponent and replaces it by a small fixed constant. We have a very good theoretical understanding of such classes, but we know much less about their relationship with queries that real-world users write.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"22 1","pages":"5"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73436899","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
How Do Humans and Data Systems Establish a CommonQuery Language? 人类和数据系统如何建立共同的查询语言?
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371329
Ben McCamish, Vahid Ghadakchi, Arash Termehchy, Liang Huang, B. Touri
{"title":"How Do Humans and Data Systems Establish a CommonQuery Language?","authors":"Ben McCamish, Vahid Ghadakchi, Arash Termehchy, Liang Huang, B. Touri","doi":"10.1145/3371316.3371329","DOIUrl":"https://doi.org/10.1145/3371316.3371329","url":null,"abstract":"As most users do not precisely know the structure and/or the content of databases, their queries do not exactly reflect their information needs. While database management systems (DBMS) may interact with users and use their feedback on the returned results to learn the information needs behind their queries, current query interfaces assume that users do not learn and modify the way way they express their information needs in form of queries during their interaction with the DBMS. Using a real-world interaction workload, we show that users learn and modify how to express their information needs during their interactions with the DBMS and their learning is accurately modeled by a well-known reinforcement learning mechanism. As current data interaction systems assume that users do not modify their strategies, they cannot discover the information needs behind users' queries effectively. We model the interaction between users and DBMS as a game with identical interest between two rational agents whose goal is to establish a common language for representing information needs in form of queries. We propose a reinforcement learning method that learns and answers the information needs behind queries and adapts to the changes in users' strategies and prove that it stochastically improves the effectiveness of answering queries. We propose two efficient implementation of this method over large relational databases. Our empirical studies over realworld query workloads indicate that our algorithms are efficient and effective.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"41 1","pages":"51-58"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77211688","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: Efficient Signal Reconstruction for a Broad Range of Applications 技术观点:广泛应用的高效信号重构
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371326
Z. Ives
{"title":"Technical Perspective: Efficient Signal Reconstruction for a Broad Range of Applications","authors":"Z. Ives","doi":"10.1145/3371316.3371326","DOIUrl":"https://doi.org/10.1145/3371316.3371326","url":null,"abstract":"When problems are scaled to \"big data,\" researchers must often come up with new solutions, leveraging ideas from multiple research areas - as we frequently witness in today's big data techniques and tools for machine learning, bioinformatics, and data visualization. Beyond these heavily studied topics, there exist other classes of general problems that need to be rethought at scale. One such problem is that of large-scale signal reconstruction [4]: taking a set of observations of relatively low dimensionality, and using them to reconstruct a high-dimensional, unknown signal. This class of problems arises when we can only observe a subset of a complex environment that we are seeking to model - for instance, placing a few sensors and using their readings to reconstruct an environment's temperature, or monitoring multiple points in a network and using the readings to estimate end-to-end network traffic, or using 2D slices to reconstruct a 3D image.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"26 1","pages":"41"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78256475","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: Efficient Query Processing for Dynamically Changing Datasets 技术视角:动态变化数据集的高效查询处理
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371324
W. Martens
{"title":"Technical Perspective: Efficient Query Processing for Dynamically Changing Datasets","authors":"W. Martens","doi":"10.1145/3371316.3371324","DOIUrl":"https://doi.org/10.1145/3371316.3371324","url":null,"abstract":"The paper Efficient Query Processing for Dynamically Changing Datasets, by Muhammad Idris, Mart´n Ugarte, Stijn Vansummeren, Hannes Voigt, and Wolfgang Lehner studies two central aspects of answering queries: (1) enumerating the answers to a query and (2) changing data. It is based on two papers by the same authors or a subset thereof, namely The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates [4] and Conjunctive Queries with Inequalities Under Updates [5].","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"313 1","pages":"32"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85409373","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
Technical Perspective: Succinct Range Filters 技术角度:简洁的范围过滤器
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371334
Stratos Idreos
{"title":"Technical Perspective: Succinct Range Filters","authors":"Stratos Idreos","doi":"10.1145/3371316.3371334","DOIUrl":"https://doi.org/10.1145/3371316.3371334","url":null,"abstract":"Data structures that filter data for point or range queries are prevalent across all data-driven applications, from analytics to transactions, and modern machine learning applications. The primary objective is simple: find whether one or more data items exist in the database. Yet, this simple task is exceptionally hard to perform efficiently, and surprisingly critical for the overall properties of the dataintensive applications that rely on filtering.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"3 1","pages":"77"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73037701","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
Succinct Range Filters 简洁范围过滤器
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371335
Huanchen Zhang, Hyeontaek Lim, Viktor Leis, D. Andersen, Kimberly Keeton, Andrew Pavlo
{"title":"Succinct Range Filters","authors":"Huanchen Zhang, Hyeontaek Lim, Viktor Leis, D. Andersen, Kimberly Keeton, Andrew Pavlo","doi":"10.1145/3371316.3371335","DOIUrl":"https://doi.org/10.1145/3371316.3371335","url":null,"abstract":"We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries. SuRF is based on a new data structure called the Fast Succinct Trie (FST) that matches the point and range query performance of state-of-the-art order-preserving indexes, while consuming only 10 bits per trie node. The false positive rates in SuRF for both point and range queries are tunable to satisfy different application needs. We evaluate SuRF in RocksDB as a replacement for its Bloom filters to reduce I/O by filtering requests before they access on-disk data structures. Our experiments on a 100 GB dataset show that replacing RocksDB's Bloom filters with SuRFs speeds up open-seek (without upper-bound) and closed-seek (with upper-bound) queries by up to 1.5× and 5× with a modest cost on the worst-case (all-missing) point query throughput due to slightly higher false positive rate.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"18 1","pages":"78-85"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84509860","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}
引用次数: 11
Bridging Theory and Practice with Query Log Analysis 连接查询日志分析的理论与实践
SIGMOD Rec. Pub Date : 2019-11-05 DOI: 10.1145/3371316.3371319
W. Martens, T. Trautner
{"title":"Bridging Theory and Practice with Query Log Analysis","authors":"W. Martens, T. Trautner","doi":"10.1145/3371316.3371319","DOIUrl":"https://doi.org/10.1145/3371316.3371319","url":null,"abstract":"Since large structured query logs have recently become available, we have a new opportunity to gain insights in the types of queries that users ask. Even though such logs can be quite volatile, there are various new observations that can be made about the structure of queries inside them, on which we report here. Furthermore, building on an extensive analysis that has been done on such logs, we were able to provide a theoretical explanation why regular path queries in graph database applications behave better than worst-case complexity results suggest at first sight.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"3 1","pages":"6-13"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79600990","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信