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

Alberto Mendelzon Workshop on Foundations of Data Management最新文献

筛选
英文 中文
The Ontological Multidimensional Data Model 本体多维数据模型
Alberto Mendelzon Workshop on Foundations of Data Management Pub Date : 2017-03-10 DOI: 10.1007/978-3-319-60795-5_13
L. Bertossi, Mostafa Milani
{"title":"The Ontological Multidimensional Data Model","authors":"L. Bertossi, Mostafa Milani","doi":"10.1007/978-3-319-60795-5_13","DOIUrl":"https://doi.org/10.1007/978-3-319-60795-5_13","url":null,"abstract":"","PeriodicalId":282387,"journal":{"name":"Alberto Mendelzon Workshop on Foundations of Data Management","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114349176","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
From Classical to Consistent Query Answering under Existential Rules 从经典查询到存在规则下的一致性查询回答
Alberto Mendelzon Workshop on Foundations of Data Management Pub Date : 2015-01-25 DOI: 10.1609/aaai.v29i1.9414
Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris, Gerardo I. Simari
{"title":"From Classical to Consistent Query Answering under Existential Rules","authors":"Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris, Gerardo I. Simari","doi":"10.1609/aaai.v29i1.9414","DOIUrl":"https://doi.org/10.1609/aaai.v29i1.9414","url":null,"abstract":"\u0000 \u0000 Querying inconsistent ontologies is an intriguing new problem that gave rise to a flourishing research activity in the description logic (DL) community. The computational complexity of consistent query answering under the main DLs is rather well understood; however, little is known about existential rules. The goal of the current work is to perform an in-depth analysis of the complexity of consistent query answering under the main decidable classes of existential rules enriched with negative constraints. Our investigation focuses on one of the most prominent inconsistency-tolerant semantics, namely, the AR semantics. We establish a generic complexity result, which demonstrates the tight connection between classical and consistent query answering. This result allows us to obtain in a uniform way a relatively complete picture of the complexity of our problem.\u0000 \u0000","PeriodicalId":282387,"journal":{"name":"Alberto Mendelzon Workshop on Foundations of Data Management","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121038175","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}
引用次数: 68
Multidimensional Contexts for Data Quality Assessment 数据质量评估的多维上下文
Alberto Mendelzon Workshop on Foundations of Data Management Pub Date : 2012-12-01 DOI: 10.22215/etd/2013-07045
Aida Malaki, L. Bertossi, Flavio Rizzolo
{"title":"Multidimensional Contexts for Data Quality Assessment","authors":"Aida Malaki, L. Bertossi, Flavio Rizzolo","doi":"10.22215/etd/2013-07045","DOIUrl":"https://doi.org/10.22215/etd/2013-07045","url":null,"abstract":"The notion of data quality cannot be separated from the context in which the data is produced or used. Recently, a conceptual framework for capturing context-dependent data quality assessment has been proposed. According to it, a database D is assessed wrt. a context which is modeled as an external system containing additional data, metadata, and definitions of quality predicates. The instance D is “put in context” via schema mappings; and after contextual processing of the data, a collection of alternative clean versions D′ of D is produced. The quality of D is measured in terms of its distance to this class. In this work we extend contexts for data quality assessment by including multidimensional data, which allows to analyze data from multiple perspectives and different degrees of granularity. It is possible to navigate through dimensional hierarchies in order to go for the data that is needed for quality assessment. More precisely, we introduce contextual hierarchies as components of contexts for data quality assessment. The resulting contexts are later represented as ontologies written in description logic.","PeriodicalId":282387,"journal":{"name":"Alberto Mendelzon Workshop on Foundations of Data Management","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123610060","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}
引用次数: 12
On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees 论设计良好的模式树的答案枚举的复杂性
Alberto Mendelzon Workshop on Foundations of Data Management Pub Date : 1900-01-01 DOI: 10.4230/LIPIcs.ICDT.2016.22
Markus Kröll, R. Pichler, Sebastian Skritek
{"title":"On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees","authors":"Markus Kröll, R. Pichler, Sebastian Skritek","doi":"10.4230/LIPIcs.ICDT.2016.22","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICDT.2016.22","url":null,"abstract":"Well-designed pattern trees (wdPTs) have been introduced as an extension of conjunctive queries to allow for partial matching - analogously to the OPTIONAL operator of the semantic web query language SPARQL. Several computational problems of wdPTs have been studied in recent years, such as the evaluation problem in various settings, the counting problem, as well as static analysis tasks including the containment and equivalence problems. Also restrictions needed to achieve tractability of these tasks have been proposed. In contrast, the problem of enumerating the answers to a wdPT has been largely ignored so far. In this work, we embark on a systematic study of the complexity of the enumeration problem of wdPTs. As our main result, we identify several tractable and intractable cases of this problem both from a classical complexity point of view and from a parameterized complexity point of view.","PeriodicalId":282387,"journal":{"name":"Alberto Mendelzon Workshop on Foundations of Data Management","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125023596","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}
引用次数: 19
Combined Complexity of Repair Checking and Consistent Query Answering 维修检查与一致性查询应答的组合复杂度
Alberto Mendelzon Workshop on Foundations of Data Management Pub Date : 1900-01-01 DOI: 10.4230/LIPIcs.ICDT.2016.21
Sebastian Arming, R. Pichler, Emanuel Sallinger
{"title":"Combined Complexity of Repair Checking and Consistent Query Answering","authors":"Sebastian Arming, R. Pichler, Emanuel Sallinger","doi":"10.4230/LIPIcs.ICDT.2016.21","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICDT.2016.21","url":null,"abstract":"Inconsistent databases (i.e., databases violating some given set of integrity constraints) may arise in many applications such as, for instance, data integration. Hence, the handling of inconsistent data has evolved as an active field of research. In this paper, we consider two fundamental problems in this context: Repair Checking (RC) and Consistent Query Answering (CQA). \u0000 \u0000So far, these problems have been mainly studied from the point of view of data complexity (where all parts of the input except for the database are considered as fixed). While for some kinds of integrity constraints, also combined complexity (where all parts of the input are allowed to vary) has been considered, for several other kinds of integrity constraints, combined complexity has been left unexplored. Moreover, a more detailed analysis (keeping other parts of the input fixed - e.g., the constraints only) is completely missing. \u0000 \u0000The goal of our work is a thorough analysis of the complexity of the RC and CQA problems. Our contribution is a complete picture of the complexity of these problems for a wide range of integrity constraints. Our analysis thus allows us to get a better understanding of the true sources of complexity.","PeriodicalId":282387,"journal":{"name":"Alberto Mendelzon Workshop on Foundations of Data Management","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127413121","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}
引用次数: 17
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学术官方微信