This paper briefly reviews the recent literature on consistent query answering, an approach to handle database inconsistency in a systematic and logical manner based on the notion of repair. It discusses some computational and semantic limitations of consistent query answering, and summarizes selected research directions in this area.
{"title":"Invited Paper: Consistent Query Answering: Opportunities and Limitations","authors":"J. Chomicki","doi":"10.1109/DEXA.2006.76","DOIUrl":"https://doi.org/10.1109/DEXA.2006.76","url":null,"abstract":"This paper briefly reviews the recent literature on consistent query answering, an approach to handle database inconsistency in a systematic and logical manner based on the notion of repair. It discusses some computational and semantic limitations of consistent query answering, and summarizes selected research directions in this area.","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122048901","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}
K. Kuliberda, Piotr Błaszczyk, Grzegorz Balcerzak, Krzysztof Kaczmarski, R. Adamus, K. Subieta
The paper describes a dynamic integration mechanism for a virtual repository that transparently integrates distributed, heterogeneous and redundant resources. The repository is based on combination of a P2P network, object-oriented databases, a query language SBQL and virtual updateable views defined and used in SBQL. It is currently implemented as a prototype under .NET in C#. We also discuss a solution for an independent virtual P2P network integrating resources stored in databases and a novel global index mechanism
{"title":"Virtual Repository Supporting Integration of Pluginable Resources","authors":"K. Kuliberda, Piotr Błaszczyk, Grzegorz Balcerzak, Krzysztof Kaczmarski, R. Adamus, K. Subieta","doi":"10.1109/DEXA.2006.147","DOIUrl":"https://doi.org/10.1109/DEXA.2006.147","url":null,"abstract":"The paper describes a dynamic integration mechanism for a virtual repository that transparently integrates distributed, heterogeneous and redundant resources. The repository is based on combination of a P2P network, object-oriented databases, a query language SBQL and virtual updateable views defined and used in SBQL. It is currently implemented as a prototype under .NET in C#. We also discuss a solution for an independent virtual P2P network integrating resources stored in databases and a novel global index mechanism","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124276888","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}
Efficient support of semantic location queries in distributed hash table (DHT) P2P systems is a key challenge. It is difficult to handle since object distribution criteria among data providers are not related to semantic criteria. This paper focus on range queries which are particularly expensive or impose strong restrictions in current proposals. We propose meta-data indexing to support queries involving inequalities and "like" operators in a scalable way. The proposed solution is portable, it can be used on top of any current DHT P2P system
{"title":"Range Queries in Massively Distributed Data","authors":"María-Del-Pilar Villamil, C. Roncancio, C. Labbé","doi":"10.1109/DEXA.2006.119","DOIUrl":"https://doi.org/10.1109/DEXA.2006.119","url":null,"abstract":"Efficient support of semantic location queries in distributed hash table (DHT) P2P systems is a key challenge. It is difficult to handle since object distribution criteria among data providers are not related to semantic criteria. This paper focus on range queries which are particularly expensive or impose strong restrictions in current proposals. We propose meta-data indexing to support queries involving inequalities and \"like\" operators in a scalable way. The proposed solution is portable, it can be used on top of any current DHT P2P system","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125994590","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}
If the full CRISP DM life-cycle is to be implemented then there needs to be a means by which business logic, understanding and aims can be directly related to the DM and KDD modelling process, and then onto deployment. Several graphical ways of representing data and models are considered: the E-R diagram, linked data and model ontologies, and graphical-model/Bayesian-net dependency diagrams. It is suggested that the provision of graphical tools for the domain expert to express their prior knowledge, understanding and aims is the best way of linking these to the DM & KDD process and subsequent deployment of discovered knowledge
{"title":"Visualization and Bayesian Nets to link Business Aims","authors":"Keith Rennolls","doi":"10.1109/DEXA.2006.148","DOIUrl":"https://doi.org/10.1109/DEXA.2006.148","url":null,"abstract":"If the full CRISP DM life-cycle is to be implemented then there needs to be a means by which business logic, understanding and aims can be directly related to the DM and KDD modelling process, and then onto deployment. Several graphical ways of representing data and models are considered: the E-R diagram, linked data and model ontologies, and graphical-model/Bayesian-net dependency diagrams. It is suggested that the provision of graphical tools for the domain expert to express their prior knowledge, understanding and aims is the best way of linking these to the DM & KDD process and subsequent deployment of discovered knowledge","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"43 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114036754","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}
The management of voluminous, heterogeneous, and distributed data on a large-scale raises new problems and presents real challenges: efficiency of access, placement and redistribution of data, communication, confidentiality of access, availability of data, indexing, caching and replication mechanism, and benchmarking. In this paper, we point out the contributions of execution models based on mobile agents and cost model approaches to the large scale distributed query optimization. Firstly, we summarize state of the art of the main execution models based on mobile agents. We show how mobile agents can react dynamically to estimation errors, and resources unavailability. Then, to guarantee the autonomy of mobile agents, a part of cost model must be embedded. Finally, we study the efficiency of mobile agents in relation with the cost model approaches, the query type, and the adequacy of the cost model with regard to the data sources. Identification of intervals for mobility efficiency allows to define and validate a proactive migration policy
{"title":"Invited Paper: How Can Mobile Agents and Cost Model Approaches Helpf for Distributed Query Optimization","authors":"A. Hameurlain, F. Morvan","doi":"10.1109/DEXA.2006.77","DOIUrl":"https://doi.org/10.1109/DEXA.2006.77","url":null,"abstract":"The management of voluminous, heterogeneous, and distributed data on a large-scale raises new problems and presents real challenges: efficiency of access, placement and redistribution of data, communication, confidentiality of access, availability of data, indexing, caching and replication mechanism, and benchmarking. In this paper, we point out the contributions of execution models based on mobile agents and cost model approaches to the large scale distributed query optimization. Firstly, we summarize state of the art of the main execution models based on mobile agents. We show how mobile agents can react dynamically to estimation errors, and resources unavailability. Then, to guarantee the autonomy of mobile agents, a part of cost model must be embedded. Finally, we study the efficiency of mobile agents in relation with the cost model approaches, the query type, and the adequacy of the cost model with regard to the data sources. Identification of intervals for mobility efficiency allows to define and validate a proactive migration policy","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131837","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}
At present, we have a FSQL server available for Oraclecopy databases which allow us to query a fuzzy or classical database with the FSQL (fuzzy SQL) language for any data type. The FSQL language is an extension of the SQL language, which permits us to write flexible conditions in our queries to a fuzzy or traditional database. In this paper, we proceed to extend FSQL into a new language called dmFSQL (data mining fuzzy structured query language) which can be used to solve real problems of clustering and classification. We consider that this model satisfies the requirements of data mining systems
{"title":"dmFSQL: a Language for Data Mining","authors":"R. Carrasco, M. Vila, F. Araque","doi":"10.1109/DEXA.2006.53","DOIUrl":"https://doi.org/10.1109/DEXA.2006.53","url":null,"abstract":"At present, we have a FSQL server available for Oraclecopy databases which allow us to query a fuzzy or classical database with the FSQL (fuzzy SQL) language for any data type. The FSQL language is an extension of the SQL language, which permits us to write flexible conditions in our queries to a fuzzy or traditional database. In this paper, we proceed to extend FSQL into a new language called dmFSQL (data mining fuzzy structured query language) which can be used to solve real problems of clustering and classification. We consider that this model satisfies the requirements of data mining systems","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124596916","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}
Imitation is a powerful mechanism in human society, and has proven its usefulness in machine learning. This paper describes the notion of goal-directed imitation and its possible role in realizing self-adaptive systems. The conditions for its application are analyzed. We illustrate the working of imitation in self-adaptation by means of a small example
{"title":"Requirements on the Use of Goal-Directed Imitation for Self-Adaptation","authors":"M. Hiel, H. Weigand","doi":"10.1109/DEXA.2006.123","DOIUrl":"https://doi.org/10.1109/DEXA.2006.123","url":null,"abstract":"Imitation is a powerful mechanism in human society, and has proven its usefulness in machine learning. This paper describes the notion of goal-directed imitation and its possible role in realizing self-adaptive systems. The conditions for its application are analyzed. We illustrate the working of imitation in self-adaptation by means of a small example","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115084177","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}
As XML seems to become the preferred candidate language for the interchange of data on the Internet, the integration of distributed, heterogeneous, and autonomous XML data sources in a mediation architecture is becoming a critical issue. In this paper, we present a novel and original query rewriting algorithm for the answering of queries to XML disparate sources in the presence of XML keys. The algorithm combines features of the MiniCon (Mini-Con descriptions) and the Styx algorithms (prefix and suffix queries) into an algorithm that returns more rewritings
{"title":"Answering Queries in the Presence of XML Keys","authors":"M. Essid, Omar Boucelma, S. Bressan","doi":"10.1109/DEXA.2006.28","DOIUrl":"https://doi.org/10.1109/DEXA.2006.28","url":null,"abstract":"As XML seems to become the preferred candidate language for the interchange of data on the Internet, the integration of distributed, heterogeneous, and autonomous XML data sources in a mediation architecture is becoming a critical issue. In this paper, we present a novel and original query rewriting algorithm for the answering of queries to XML disparate sources in the presence of XML keys. The algorithm combines features of the MiniCon (Mini-Con descriptions) and the Styx algorithms (prefix and suffix queries) into an algorithm that returns more rewritings","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116395364","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}
Context-awareness highly depends on easy and prompt access to the right information and this needs overcoming challenges of query expression and processing of context information. One of the main considerations in querying context is selecting and applying an appropriate and expressive query language for defining user's context needs. This paper presents an overview of current languages used for querying context and investigates their strengths and limitations in expressing different aspects of context
{"title":"An Evaluation of Query Languages for Context-Aware Computing","authors":"P. D. Haghighi, A. Zaslavsky, S. Krishnaswamy","doi":"10.1109/DEXA.2006.25","DOIUrl":"https://doi.org/10.1109/DEXA.2006.25","url":null,"abstract":"Context-awareness highly depends on easy and prompt access to the right information and this needs overcoming challenges of query expression and processing of context information. One of the main considerations in querying context is selecting and applying an appropriate and expressive query language for defining user's context needs. This paper presents an overview of current languages used for querying context and investigates their strengths and limitations in expressing different aspects of context","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123808310","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}
In traditional methodology of statistics as well as in contemporary methodology of knowledge search in field KDD and DM the problem of object is almost completely ignored and the problem of the error of statistical model is insufficiently explored. The paper pursues several objectives. Firstly, it aims to demonstrate the significance of these two problems. Secondly, the paper intends to show that the problem of object cannot be solved within the limits of rigorous mathematical theories. The problem of model error cannot be obtained in the general case, if the error is entirely specified by means of distribution law. Thirdly, it aims to suggest a methodological analysis of new effective approaches to the mentioned problems for a number of special cases which have been developed in empirical metrological concept of statistics
{"title":"Some Approaches to the Model Error Problem in Data Mining Systems","authors":"V. Reznikov","doi":"10.1109/DEXA.2006.130","DOIUrl":"https://doi.org/10.1109/DEXA.2006.130","url":null,"abstract":"In traditional methodology of statistics as well as in contemporary methodology of knowledge search in field KDD and DM the problem of object is almost completely ignored and the problem of the error of statistical model is insufficiently explored. The paper pursues several objectives. Firstly, it aims to demonstrate the significance of these two problems. Secondly, the paper intends to show that the problem of object cannot be solved within the limits of rigorous mathematical theories. The problem of model error cannot be obtained in the general case, if the error is entirely specified by means of distribution law. Thirdly, it aims to suggest a methodological analysis of new effective approaches to the mentioned problems for a number of special cases which have been developed in empirical metrological concept of statistics","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128733436","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：