首页 > 最新文献
paperpass

Proceedings of the 2016 on SIGMOD'16 PhD Symposium最新文献

英文 中文
What I Wish I Knew When I Finished my PhD 我希望当我完成我的博士学位时我就知道
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929896
A. Halevy
You're about to finish your Ph.D and looking forward to a bright career. You might have some plans for what that career will look like, but the truth is, you're about to embark on a fascinating journey you know little about. You think that in 5 or 10 years you'll be all set, but actually, careers take interesting twists at many stages. In this talk I will share a few of the lessons I learned in the first 20+ years of my journey.
你即将完成你的博士学位,期待着一个光明的职业生涯。你可能对自己的职业生涯有一些规划,但事实是,你即将踏上一段你知之甚少的迷人旅程。你认为在5年或10年内你就会一切就绪,但实际上,职业生涯在许多阶段都有有趣的转折。在这次演讲中,我将分享我在前20多年的职业生涯中学到的一些经验教训。
{"title":"What I Wish I Knew When I Finished my PhD","authors":"A. Halevy","doi":"10.1145/2926693.2929896","DOIUrl":"https://doi.org/10.1145/2926693.2929896","url":null,"abstract":"You're about to finish your Ph.D and looking forward to a bright career. You might have some plans for what that career will look like, but the truth is, you're about to embark on a fascinating journey you know little about. You think that in 5 or 10 years you'll be all set, but actually, careers take interesting twists at many stages. In this talk I will share a few of the lessons I learned in the first 20+ years of my journey.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115385347","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
Temporal Data Exchange 临时数据交换
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929900
Ladan Golshanara, J. Chomicki, W. Tan
In this work, we study data exchange for temporal data. There are two views associated with temporal data: the concrete temporal view, which depicts how temporal data is compactly represented and on which implementations are based, and the abstract temporal view, which defines the semantics of temporal data. Based on the chase procedure, which is a fundamental tool in relational data exchange, two new kinds of chase are proposed in this paper: the abstract chase for the abstract temporal view and the concrete chase for the concrete temporal view. While labeled nulls are sufficient for relational data exchange, they have to be refined in temporal data exchange to keep the connection between the result produced by the concrete chase and the result of the abstract chase. We show that the concrete chase respects the semantics defined by the abstract chase and provides a foundation for query answering
在这项工作中,我们研究了时态数据的数据交换。与时态数据相关的视图有两种:具体时态视图,它描述时态数据是如何紧凑地表示的,以及基于哪些实现;抽象时态视图,它定义时态数据的语义。基于关系数据交换的基本工具——追踪程序,提出了两种新的追踪方法:针对抽象时间视图的抽象追踪和针对具体时间视图的具体追踪。虽然标记的null对于关系数据交换已经足够了,但是必须在时态数据交换中对它们进行细化,以保持具体查询产生的结果与抽象查询产生的结果之间的联系。我们证明了具体搜索尊重抽象搜索所定义的语义,并为查询应答提供了基础
{"title":"Temporal Data Exchange","authors":"Ladan Golshanara, J. Chomicki, W. Tan","doi":"10.1145/2926693.2929900","DOIUrl":"https://doi.org/10.1145/2926693.2929900","url":null,"abstract":"In this work, we study data exchange for temporal data. There are two views associated with temporal data: the concrete temporal view, which depicts how temporal data is compactly represented and on which implementations are based, and the abstract temporal view, which defines the semantics of temporal data. Based on the chase procedure, which is a fundamental tool in relational data exchange, two new kinds of chase are proposed in this paper: the abstract chase for the abstract temporal view and the concrete chase for the concrete temporal view. While labeled nulls are sufficient for relational data exchange, they have to be refined in temporal data exchange to keep the connection between the result produced by the concrete chase and the result of the abstract chase. We show that the concrete chase respects the semantics defined by the abstract chase and provides a foundation for query answering","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044862","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}
引用次数: 8
Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances 有界树宽实例上表达查询的概率计算
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929905
Mikaël Monet
Though data uncertainty naturally appears in many real-life situations, traditional database theory and systems tend to assume that the data is reliable and complete. The reason is that of complexity and performance: on arbitrary relational database instances annotated with probabilities, performing exact probabilistic query evaluation is hard. However, a criterion on the shape of the database has been shown in recent work to be sufficient and in some sense necessary to the tractability of this task. Databases whose treewidth is bounded by a constant k are exactly those that can be tractably queried, with respect to quantitative uncertainty estimation. But this is a data complexity result, that does not take into account the cost in terms of the query or of k -- in many cases, this cost is too high for real-world applications. The aim of our PhD research is to study in which circumstances the overall complexity of probabilistic query evaluation can become tractable, aiming at both theoretical and practical results.
虽然数据不确定性在许多现实生活中自然出现,但传统的数据库理论和系统倾向于假设数据是可靠和完整的。原因在于复杂性和性能:在带有概率注释的任意关系数据库实例上,很难执行精确的概率查询计算。但是,在最近的工作中表明,关于数据库形状的标准是足够的,并且在某种意义上对这项任务的可跟踪性是必要的。从定量的不确定性估计来看,树宽以常数k为界的数据库正是那些可以跟踪查询的数据库。但这是一个数据复杂性的结果,它没有考虑查询或k的成本——在许多情况下,这个成本对于实际应用程序来说太高了。我们博士研究的目的是研究在什么情况下概率查询评估的整体复杂性可以变得易于处理,旨在获得理论和实践结果。
{"title":"Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances","authors":"Mikaël Monet","doi":"10.1145/2926693.2929905","DOIUrl":"https://doi.org/10.1145/2926693.2929905","url":null,"abstract":"Though data uncertainty naturally appears in many real-life situations, traditional database theory and systems tend to assume that the data is reliable and complete. The reason is that of complexity and performance: on arbitrary relational database instances annotated with probabilities, performing exact probabilistic query evaluation is hard. However, a criterion on the shape of the database has been shown in recent work to be sufficient and in some sense necessary to the tractability of this task. Databases whose treewidth is bounded by a constant k are exactly those that can be tractably queried, with respect to quantitative uncertainty estimation. But this is a data complexity result, that does not take into account the cost in terms of the query or of k -- in many cases, this cost is too high for real-world applications. The aim of our PhD research is to study in which circumstances the overall complexity of probabilistic query evaluation can become tractable, aiming at both theoretical and practical results.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132526958","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}
引用次数: 7
TrailMarker: Automatic Mining of Geographical Complex Sequences TrailMarker:地理复杂序列的自动挖掘
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929903
Takato Honda
Given a huge collection of vehicle sensor data consisting of d sensors for w trajectories of duration n, which are accompanied by geographical information, how can we find patterns, rules and outliers? How can we efficiently and effectively find typical patterns and points of variation? In this paper we present TRAILMARKER, a fully automatic mining algorithm for geographical complex sequences. Our method has the following properties: (a) effective: it finds important patterns and outliers in real datasets; (b) scalable: it is linear with respect to the data size; (c) parameter-free: it is fully automatic, and requires no prior training, and no parameter tuning. Extensive experiments on real data demonstrate that TRAILMARKER finds interesting and unexpected patterns and groups accurately. In fact, TRAILMARKER consistently outperforms the best state-of-the-art methods in terms of both accuracy and execution speed.
给定由d个传感器组成的w条持续时间为n的轨迹的庞大车辆传感器数据集,这些数据伴随着地理信息,我们如何找到模式,规则和异常值?我们如何才能有效地找到典型的模式和变异点?本文提出了一种地理复杂序列的全自动挖掘算法TRAILMARKER。我们的方法具有以下特点:(a)有效:在真实数据集中发现重要的模式和异常值;(b)可扩展:它与数据大小是线性的;(c)无参数:是全自动的,不需要事先训练,也不需要参数调整。对真实数据的大量实验表明,TRAILMARKER可以准确地发现有趣的和意想不到的模式和组。事实上,TRAILMARKER在准确性和执行速度方面始终优于最先进的方法。
{"title":"TrailMarker: Automatic Mining of Geographical Complex Sequences","authors":"Takato Honda","doi":"10.1145/2926693.2929903","DOIUrl":"https://doi.org/10.1145/2926693.2929903","url":null,"abstract":"Given a huge collection of vehicle sensor data consisting of d sensors for w trajectories of duration n, which are accompanied by geographical information, how can we find patterns, rules and outliers? How can we efficiently and effectively find typical patterns and points of variation? In this paper we present TRAILMARKER, a fully automatic mining algorithm for geographical complex sequences. Our method has the following properties: (a) effective: it finds important patterns and outliers in real datasets; (b) scalable: it is linear with respect to the data size; (c) parameter-free: it is fully automatic, and requires no prior training, and no parameter tuning. Extensive experiments on real data demonstrate that TRAILMARKER finds interesting and unexpected patterns and groups accurately. In fact, TRAILMARKER consistently outperforms the best state-of-the-art methods in terms of both accuracy and execution speed.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126993906","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
Techniques and Systems for Large Dynamic Graphs 大型动态图的技术和系统
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929897
Khaled Ammar
Many applications regularly generate large graph data. Many of these graphs change dynamically, and analysis techniques for static graphs are not suitable in these cases. This thesis proposes an architecture to process and analyze dynamic graphs. It is based on a new computation model called Grab'n Fix. The architecture includes a novel distributed graph storage layer to support dynamic graph processing. These proposals were inspired by an extensive quantitative and qualitative analysis of existing graph analytics platform.
许多应用程序经常生成大型图形数据。这些图中有许多是动态变化的,静态图的分析技术不适用于这些情况。本文提出了一种处理和分析动态图形的体系结构。它是基于一种新的计算模型,叫做“抓取修复”。该体系结构包括一个新的分布式图形存储层,以支持动态图形处理。这些建议的灵感来自于对现有图形分析平台的广泛定量和定性分析。
{"title":"Techniques and Systems for Large Dynamic Graphs","authors":"Khaled Ammar","doi":"10.1145/2926693.2929897","DOIUrl":"https://doi.org/10.1145/2926693.2929897","url":null,"abstract":"Many applications regularly generate large graph data. Many of these graphs change dynamically, and analysis techniques for static graphs are not suitable in these cases. This thesis proposes an architecture to process and analyze dynamic graphs. It is based on a new computation model called Grab'n Fix. The architecture includes a novel distributed graph storage layer to support dynamic graph processing. These proposals were inspired by an extensive quantitative and qualitative analysis of existing graph analytics platform.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122426662","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}
引用次数: 5
Scalable Microblogs Data Management 可扩展微博数据管理
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929898
A. Magdy
Microblogs, e.g., tweets, reviews, or comments on news websites and social media, have become so popular among web users that many applications are exploiting them for different types of analysis. The distinguishing characteristics of microblogs have motivated a lot of research for managing such data. However, the developed technology for microblogs is still scattered efforts here and there which leads to several data management gaps that limits supporting microblogs-centric applications end-to-end. Our research aims to provide a holistic system approach to manage microblogs data, so that whoever builds new functionality on microblogs can seamlessly exploit a single data management system to power his applications. In this paper, we present a full proposal for Kite; the first holistic system that provides end-to-end management for microblogs data. Kite aims to fill the gap in existing systems to support scalable queries with selective search criteria on data that comes in high velocity and adds up to large volumes (billions of records). To this end, the system is going to exploit and extend the infrastructure of Apache Spark system. Throughout the paper, we represent a roadmap for the accomplished contributions, on-going contributions towards the first cut realization of Kite, and future contributions to iteratively improve the system maturity and capabilities.
微博,如推特、评论、新闻网站和社交媒体上的评论,在网络用户中变得如此流行,以至于许多应用程序都在利用它们进行不同类型的分析。微博的显著特征激发了大量管理此类数据的研究。然而,微博开发的技术仍然是分散的,这导致了一些数据管理上的差距,限制了对以微博为中心的端到端应用程序的支持。我们的研究旨在提供一种管理微博数据的整体系统方法,以便在微博上构建新功能的任何人都可以无缝地利用单一数据管理系统来为其应用程序提供动力。在本文中,我们提出了一个完整的Kite方案;首个为微博数据提供端到端管理的整体系统。Kite的目标是填补现有系统的空白,支持对高速数据和大量数据(数十亿条记录)进行可扩展的查询,并提供有选择的搜索条件。为此,本系统将对Apache Spark系统的基础设施进行开发和扩展。在整篇论文中,我们为完成的贡献,对Kite的第一次切割实现的持续贡献,以及迭代地改进系统成熟度和功能的未来贡献描绘了一个路线图。
{"title":"Scalable Microblogs Data Management","authors":"A. Magdy","doi":"10.1145/2926693.2929898","DOIUrl":"https://doi.org/10.1145/2926693.2929898","url":null,"abstract":"Microblogs, e.g., tweets, reviews, or comments on news websites and social media, have become so popular among web users that many applications are exploiting them for different types of analysis. The distinguishing characteristics of microblogs have motivated a lot of research for managing such data. However, the developed technology for microblogs is still scattered efforts here and there which leads to several data management gaps that limits supporting microblogs-centric applications end-to-end. Our research aims to provide a holistic system approach to manage microblogs data, so that whoever builds new functionality on microblogs can seamlessly exploit a single data management system to power his applications. In this paper, we present a full proposal for Kite; the first holistic system that provides end-to-end management for microblogs data. Kite aims to fill the gap in existing systems to support scalable queries with selective search criteria on data that comes in high velocity and adds up to large volumes (billions of records). To this end, the system is going to exploit and extend the infrastructure of Apache Spark system. Throughout the paper, we represent a roadmap for the accomplished contributions, on-going contributions towards the first cut realization of Kite, and future contributions to iteratively improve the system maturity and capabilities.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433351","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
Understanding User Behavior From Online Traces 从上网痕迹了解用户行为
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929901
Elad Kravi
People nowadays share large amounts of data online, explicitly or implicitly. Analysis of such data can detect useful behavior patterns of varying natures and scales, from mass immigration between continents to trendy venues in a city in turn. Detecting these patterns can be used for improving online services. However, capturing behavior patterns may be challenging, since such patterns are often of a specialized essence, no benchmark or labeled data exist, and it is not even clear how to formulate them to enable computation. Moreover, it is often unclear how recognition of these patterns can be translated into concrete service improvement. We analyzed major datasets of three common types of online traces: microbloging, social networking, and web search. We detected online behavior patterns and utilized them toward novel services and improvement of traditional services. In this paper we describe our studies and findings, and offer a vision for future development.
如今,人们或明或暗地在网上分享大量数据。对这些数据的分析可以发现不同性质和规模的有用行为模式,从大陆之间的大规模移民到一个城市的时尚场所。检测这些模式可用于改进在线服务。然而,捕获行为模式可能具有挑战性,因为这些模式通常具有专门的本质,不存在基准或标记数据,甚至不清楚如何制定它们以启用计算。此外,人们往往不清楚对这些模式的认识如何转化为具体的服务改进。我们分析了三种常见在线痕迹的主要数据集:微博、社交网络和网络搜索。我们发现了在线行为模式,并将其用于创新服务和改进传统服务。在本文中,我们描述了我们的研究和发现,并对未来的发展提出了展望。
{"title":"Understanding User Behavior From Online Traces","authors":"Elad Kravi","doi":"10.1145/2926693.2929901","DOIUrl":"https://doi.org/10.1145/2926693.2929901","url":null,"abstract":"People nowadays share large amounts of data online, explicitly or implicitly. Analysis of such data can detect useful behavior patterns of varying natures and scales, from mass immigration between continents to trendy venues in a city in turn. Detecting these patterns can be used for improving online services. However, capturing behavior patterns may be challenging, since such patterns are often of a specialized essence, no benchmark or labeled data exist, and it is not even clear how to formulate them to enable computation. Moreover, it is often unclear how recognition of these patterns can be translated into concrete service improvement. We analyzed major datasets of three common types of online traces: microbloging, social networking, and web search. We detected online behavior patterns and utilized them toward novel services and improvement of traditional services. In this paper we describe our studies and findings, and offer a vision for future development.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":" 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113951968","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
Non-linear Time-series Analysis of Social Influence 社会影响非线性时间序列分析
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929902
Thinh Minh Do, Yasuko Matsubara, Yasushi Sakurai
In this paper, we present Δ-SPOT, a non-linear model for analysing large scale web search data, and its fitting algorithm. Δ-SPOT can forecast long-range future dynamics of the keywords/queries. We use the Google Search, Twitter and MemeTracker data set for extensive experiments, which show that our method outperforms other non-linear mining methods. We also provide an online algorithm contributing to the need of monitoring multiple co-evolving data sequences.
本文提出了一个用于分析大规模网络搜索数据的非线性模型Δ-SPOT及其拟合算法。Δ-SPOT可以预测关键字/查询的长期未来动态。我们使用Google Search, Twitter和MemeTracker数据集进行了广泛的实验,结果表明我们的方法优于其他非线性挖掘方法。我们还提供了一种在线算法,有助于监测多个共同进化的数据序列。
{"title":"Non-linear Time-series Analysis of Social Influence","authors":"Thinh Minh Do, Yasuko Matsubara, Yasushi Sakurai","doi":"10.1145/2926693.2929902","DOIUrl":"https://doi.org/10.1145/2926693.2929902","url":null,"abstract":"In this paper, we present Δ-SPOT, a non-linear model for analysing large scale web search data, and its fitting algorithm. Δ-SPOT can forecast long-range future dynamics of the keywords/queries. We use the Google Search, Twitter and MemeTracker data set for extensive experiments, which show that our method outperforms other non-linear mining methods. We also provide an online algorithm contributing to the need of monitoring multiple co-evolving data sequences.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130904577","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
Query Answering over Complete Data with Conceptual Constraints 具有概念约束的完整数据的查询回答
Pub Date : 2016-06-14 DOI: 10.1145/2926693.2929899
Nhung Ngo
Query answering over databases with conceptual constraints is an important problem in database theory. To deal with the problem, the ontology-based data access approach uses ontologies to capture both constraints and databases. In this approach, databases are considered under open-world assumption which creates many issues including the necessity of restricting to only positive queries, and the failure of query composition. In our research, we focus on a combined approach that allows data in databases stays completely as under closed-world assumption while knowledge providing by conceptual constraints can be incomplete. We first study the complexity of query answering problem under description logic constraints in the presence of complete data and show that complete data makes query answering become harder than query answering over incomplete data only. We then provide a query rewriting technique that supports deciding the existence of a safe-range first-order equivalent reformulation of a query in terms of the database schema, and if so, it provides an effective approach to construct the reformulation. Since the reformulation is a safe-range formula, it is effectively executable as an SQL query. At the end, we study the definability abduction problem which aims to characterize the least committing extensions of conceptual constraints to gain the exact rewritable of queries. We also apply this idea to data exchange - where we want to characterize the case of lossless transformations of data.
具有概念约束的数据库查询应答是数据库理论中的一个重要问题。为了解决这个问题,基于本体的数据访问方法使用本体来捕获约束和数据库。在这种方法中,数据库是在开放世界的假设下考虑的,这就产生了许多问题,包括只限制正查询的必要性和查询组合的失败。在我们的研究中,我们关注的是一种组合方法,该方法允许数据库中的数据完全保持在封闭世界假设下,而概念约束提供的知识可能是不完整的。我们首先研究了描述逻辑约束下完整数据下的查询回答问题的复杂性,表明完整数据使得查询回答比仅不完整数据下的查询回答更加困难。然后,我们提供了一种查询重写技术,该技术支持根据数据库模式确定查询是否存在安全范围的一阶等效重新表述,如果存在,它提供了一种构造该重新表述的有效方法。由于重新表述是一个安全范围的公式,因此它可以作为SQL查询有效地执行。最后,我们研究了可定义溯因问题,该问题旨在描述概念约束的最少提交扩展,以获得查询的精确可重写性。我们也将这个想法应用到数据交换中——我们想要描述数据无损转换的情况。
{"title":"Query Answering over Complete Data with Conceptual Constraints","authors":"Nhung Ngo","doi":"10.1145/2926693.2929899","DOIUrl":"https://doi.org/10.1145/2926693.2929899","url":null,"abstract":"Query answering over databases with conceptual constraints is an important problem in database theory. To deal with the problem, the ontology-based data access approach uses ontologies to capture both constraints and databases. In this approach, databases are considered under open-world assumption which creates many issues including the necessity of restricting to only positive queries, and the failure of query composition. In our research, we focus on a combined approach that allows data in databases stays completely as under closed-world assumption while knowledge providing by conceptual constraints can be incomplete. We first study the complexity of query answering problem under description logic constraints in the presence of complete data and show that complete data makes query answering become harder than query answering over incomplete data only. We then provide a query rewriting technique that supports deciding the existence of a safe-range first-order equivalent reformulation of a query in terms of the database schema, and if so, it provides an effective approach to construct the reformulation. Since the reformulation is a safe-range formula, it is effectively executable as an SQL query. At the end, we study the definability abduction problem which aims to characterize the least committing extensions of conceptual constraints to gain the exact rewritable of queries. We also apply this idea to data exchange - where we want to characterize the case of lossless transformations of data.","PeriodicalId":123723,"journal":{"name":"Proceedings of the 2016 on SIGMOD'16 PhD Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133946212","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
期刊
Proceedings of the 2016 on SIGMOD'16 PhD Symposium
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1