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

SIGMOD Rec.最新文献

筛选
英文 中文
Data partitioning for single-round multi-join evaluation in massively parallel systems 大规模并行系统中单轮多连接评估的数据分区
SIGMOD Rec. Pub Date : 2016-06-02 DOI: 10.1145/2949741.2949750
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, F. Neven, T. Schwentick
{"title":"Data partitioning for single-round multi-join evaluation in massively parallel systems","authors":"Tom J. Ameloot, Gaetano Geck, Bas Ketsman, F. Neven, T. Schwentick","doi":"10.1145/2949741.2949750","DOIUrl":"https://doi.org/10.1145/2949741.2949750","url":null,"abstract":"A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over many servers and then evaluated in a parallel but communication- free way. The reshuffling itself is specified as a distribution policy. We introduce a correctness condition, called parallel-correctness, for the evaluation of queries w.r.t. a distribution policy. We provide a semantical characterization for when conjunctive queries (and extensions thereof) are parallel-correct and give matching complexity bounds for the associated decision problem.\u0000 Motivated by scenarios for workload optimization, we further consider the problem of parallel-correctness transfer from a query Q to a query Q0, that is, whether Q0 is parallelcorrect for all distribution policies for which Q is parallelcorrect. In this case, Q0 can always be evaluated after Q without repartitioning the data. We provide a semantical characterization for parallel-correctness transfer and provide matching complexity bounds for the associated decision problem for conjunctive queries (and extensions). Finally, we investigate restrictions of queries and families of distribution policies with better complexities, including, for instance, the Hypercube distributions.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"23 1","pages":"33-40"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79639686","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}
引用次数: 10
Technical Perspective: Attacking the Problem of Consistent Query Answering 技术视角:解决一致性查询应答问题
SIGMOD Rec. Pub Date : 2016-06-02 DOI: 10.1145/2949741.2949745
W. Tan
{"title":"Technical Perspective: Attacking the Problem of Consistent Query Answering","authors":"W. Tan","doi":"10.1145/2949741.2949745","DOIUrl":"https://doi.org/10.1145/2949741.2949745","url":null,"abstract":"Inconsistent data refers to data that do not adhere to one or more constraints. The term constraints refers to conditions that need to be imposed on the data. Constraints often arise from organizational requirements or business logic, such as the requirement that every employee in the database must be uniquely identified by the employee id, or every employee must work on some project, or the expenses cannot exceed the credit limit, or even a desired designated format for storing phone numbers. The need to manage inconsistent data arises in many settings. Quite typically, when one integrates data from different sources, the integrated data can be inconsistent data even when the data sources may be individually consistent. Another scenario where inconsistency in data can arise is when data and/or schema evolves, for example, through the addition or removal of data, changes in schema, or knowledge of new constraints.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"47 1","pages":"14"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73985580","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
Technical Perspective: Incremental Knowledge Base Construction Using DeepDive 技术视角:使用DeepDive进行增量知识库构建
SIGMOD Rec. Pub Date : 2016-06-02 DOI: 10.1145/2949741.2949755
A. Halevy
{"title":"Technical Perspective: Incremental Knowledge Base Construction Using DeepDive","authors":"A. Halevy","doi":"10.1145/2949741.2949755","DOIUrl":"https://doi.org/10.1145/2949741.2949755","url":null,"abstract":"Imagine the task of creating a database of all the highquality specialty cafes around the world so you never have to settle for an imperfect brew. There are plenty of online sources with content relevant to your envisioned database. Cafes may be featured in well-respected coffee publications such as sprudge.com or baristamagazine.com. Data of more fleeting nature may pop up when your coffee-savvy friends note their location by checking in on Facebook or tweeting. Naturally, there is a plethora of books that studied cafes around the world in even more detail.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"112 1","pages":"59"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84918561","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
Technical Perspective: Data Distribution for Fast Joins 技术视角:快速连接的数据分布
SIGMOD Rec. Pub Date : 2016-06-02 DOI: 10.1145/2949741.2949749
L. Libkin
{"title":"Technical Perspective: Data Distribution for Fast Joins","authors":"L. Libkin","doi":"10.1145/2949741.2949749","DOIUrl":"https://doi.org/10.1145/2949741.2949749","url":null,"abstract":"In your favorite database theory papers you will surely find all these three ingredients. A recent paper that has them as well – and that serves as the basis for the highlights paper that follows – is the PODS 2015 paper by Ameloot, Geck, Ketsman, Neven, and Schwentick that considers single-round multi-way join algorithms in parallel systems. This brief overview explains why this is so, and hopefully convinces you to read the full highlights paper.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"62 1","pages":"32"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77588599","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: k-Shape: Efficient and Accurate Clustering of Time Series 技术视角:k形:时间序列高效准确聚类
SIGMOD Rec. Pub Date : 2016-06-02 DOI: 10.1145/2949741.2949757
Z. Ives
{"title":"Technical Perspective: k-Shape: Efficient and Accurate Clustering of Time Series","authors":"Z. Ives","doi":"10.1145/2949741.2949757","DOIUrl":"https://doi.org/10.1145/2949741.2949757","url":null,"abstract":"Database research frequently cuts across many layers of abstraction (from formal foundations to algorithms to languages to systems) and the software stack (from data storage and distribution to runtime systems and query optimizers). It does this in a way that is specialized to a particular class of data and workloads. Over the decades, we have seen this pattern applied to enterprise data, persistent objects, Web data, sensor data, data streams, and so on. Each time, the community has developed extensions to algebraic query primitives, specialized implementation techniques (index structures, pattern detection algorithms, update and consistency mechanisms, etc.), benchmarks, and new optimization techniques.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"8 1","pages":"68"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79252363","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}
引用次数: 9
Consistent Query Answering for Primary Keys 主键一致性查询应答
SIGMOD Rec. Pub Date : 2016-06-02 DOI: 10.1145/2949741.2949746
Paraschos Koutris, J. Wijsen
{"title":"Consistent Query Answering for Primary Keys","authors":"Paraschos Koutris, J. Wijsen","doi":"10.1145/2949741.2949746","DOIUrl":"https://doi.org/10.1145/2949741.2949746","url":null,"abstract":"We study the complexity of consistent query answering with respect to primary key violations, for self-join-free conjunctive queries. A repair of a possibly inconsistent database is obtained by selecting a maximal number of tuples without selecting two distinct tuples with the same primary key value. For any Boolean query q, CERTAINTY(q) is the problem that takes a database as input, and asks whether q is true in every repair of the database. The complexity of this problem has been extensively studied for q ranging over the class of self-join-free Boolean conjunctive queries. A research challenge is to determine, given q, whether CERTAINTY(q) belongs to complexity classes FO, P, or coNP-complete. We show that for any self-join-free Boolean conjunctive query q, it can be decided whether or not CERTAINTY(q) is in FO. Further, CERTAINTY(q) is either in P or coNP-complete, and the complexity dichotomy is effective. This settles a research question of practical relevance that has been open for ten years.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"3637 1","pages":"15-22"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86678004","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}
引用次数: 16
Report on the First International Workshop on Exploratory Search in Databases and the Web (ExploreDB 2014) 第一届数据库与网络探索性搜索国际研讨会报告(explorerdb 2014)
SIGMOD Rec. Pub Date : 2016-05-09 DOI: 10.1145/2694413.2694425
G. Koutrika, L. Lakshmanan, Mirek Riedewald, K. Stefanidis
{"title":"Report on the First International Workshop on Exploratory Search in Databases and the Web (ExploreDB 2014)","authors":"G. Koutrika, L. Lakshmanan, Mirek Riedewald, K. Stefanidis","doi":"10.1145/2694413.2694425","DOIUrl":"https://doi.org/10.1145/2694413.2694425","url":null,"abstract":"The second ExploreDB 2015 workshop intends to bring together researchers and practitioners from different fields, ranging from data management and information retrieval to data visualization and human computer interaction. The workshop program consisted of two keynote talks and six peer-reviewed research papers. The first keynote talk titled 'Explore-By-Example: A New Database Service for Interactive Data Exploration' was given by Prof. Yanlei Diao from the University of Massachusetts at Amherst. Prof. Diao pointed out that while computing power, memory size, and the ability to collect data are growing exponentially, human ability to understand data remains practically flat. In the second keynote, titled 'Principled Optimization Frameworks for Query Reformulation of Database Queries', Prof. Gautam Das from the University of Texas at Arlington focused on solutions for the many-answers and the empty-answers problems. He proposed to address both problems through ranked retrieval. Xiaoyu Ge, Panos Chrysanthis and Alexandros Labrinidis ('Preferential Diversity') explored how to achieve personalization through preferences on result diversity. Diversity was also the focus in 'Diversifying with Few Regrets, But too Few to Mention' by Zaeem Hussain, Hina Khan and Mohamed Sharaf.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"53 1","pages":"49-52"},"PeriodicalIF":0.0,"publicationDate":"2016-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79103329","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}
引用次数: 3
A Relational Framework for Information Extraction 信息抽取的关系框架
SIGMOD Rec. Pub Date : 2016-05-09 DOI: 10.1145/2935694.2935696
Ronald Fagin, B. Kimelfeld, Frederick Reiss, Stijn Vansummeren
{"title":"A Relational Framework for Information Extraction","authors":"Ronald Fagin, B. Kimelfeld, Frederick Reiss, Stijn Vansummeren","doi":"10.1145/2935694.2935696","DOIUrl":"https://doi.org/10.1145/2935694.2935696","url":null,"abstract":"Information Extraction commonly refers to the task of populating a relational schema, having predefined underlying semantics, from textual content. This task is pervasive in contemporary computational challenges associated with Big Data. In this article we provide an overview of our work on document spanners--a relational framework for Information Extraction that is inspired by rule-based systems such as IBM's SystemT.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"64 1","pages":"5-16"},"PeriodicalIF":0.0,"publicationDate":"2016-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77951741","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
Rick Snodgrass Speaks Out on Standards, Personal Brands and Science 里克·斯诺德格拉斯谈标准、个人品牌和科学
SIGMOD Rec. Pub Date : 2016-05-09 DOI: 10.1145/2935694.2935704
M. Winslett, V. Braganholo
{"title":"Rick Snodgrass Speaks Out on Standards, Personal Brands and Science","authors":"M. Winslett, V. Braganholo","doi":"10.1145/2935694.2935704","DOIUrl":"https://doi.org/10.1145/2935694.2935704","url":null,"abstract":"Welcome to ACM SIGMOD Record’s series of interviews with distinguished members of the database community. I’m Marianne Winslett, and today we’re in Phoenix, site of the 2012 SIGMOD and PODS conferences. I have here with me Rick Snodgrass, who is a professor of computer science at the University of Arizona. Rick has served as the Editor-in-Chief of ACM Transactions on Database Systems, the chair of ACM SIGMOD, the ACM Pubs Board and the ACM History Committee. He has received the SIGMOD Outstanding Contributions Award and ACM Outstanding Contribution Award and he’s an ACM Fellow. Rick’s PhD is from Carnegie-Mellon University.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"9 1","pages":"41-48"},"PeriodicalIF":0.0,"publicationDate":"2016-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90814023","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
Participant Privacy in Mobile Crowd Sensing Task Management: A Survey of Methods and Challenges 移动人群感知任务管理中的参与者隐私:方法和挑战的调查
SIGMOD Rec. Pub Date : 2016-05-09 DOI: 10.1145/2935694.2935700
Layla Pournajaf, Daniel A. Garcia-Ulloa, Li Xiong, V. Sunderam
{"title":"Participant Privacy in Mobile Crowd Sensing Task Management: A Survey of Methods and Challenges","authors":"Layla Pournajaf, Daniel A. Garcia-Ulloa, Li Xiong, V. Sunderam","doi":"10.1145/2935694.2935700","DOIUrl":"https://doi.org/10.1145/2935694.2935700","url":null,"abstract":"Mobile crowd sensing enables a broad range of novel applications by leveraging mobile devices and smartphone users worldwide. While this paradigm is immensely useful, it involves the collection of detailed information from sensors and their carriers (i.e. participants) during task management processes including participant recruitment and task distribution. Such information might compromise participant privacy in various regards by identification or disclosure of sensitive attributes -- thereby increasing vulnerability and subsequently reducing participation. In this survey, we identify different task management approaches in mobile crowd sensing, and assess the threats to participant privacy when personal information is disclosed. We also outline how privacy mechanisms are utilized in existing sensing applications to protect the participants against these threats. Finally, we discuss continuing challenges facing participant privacy-preserving approaches during task management.","PeriodicalId":21740,"journal":{"name":"SIGMOD Rec.","volume":"1 1","pages":"23-34"},"PeriodicalIF":0.0,"publicationDate":"2016-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76568921","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}
引用次数: 93
首页 上一页
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学术官方微信