Because of data proliferation, efficient access methods and data storage techniques have become increasingly critical to maintain an acceptable query response time. One way to improve query response time is to reduce the number of disk I/Os by partitioning the database vertically (attribute clustering) and/or horizontally (record clustering). A clustering is optimized for a given set of queries. However in dynamic systems the queries change with time, the clustering in place becomes obsolete, and the database needs to be re-clustered dynamically. In this paper we discuss an efficient algorithm for attribute clustering that dynamically and automatically generate attribute clusters based on closed item sets mined from the attributes sets found in the queries running against the database
{"title":"Automatic Database Clustering Using Data Mining","authors":"Sylvain Guinepain, L. Gruenwald","doi":"10.1109/DEXA.2006.32","DOIUrl":"https://doi.org/10.1109/DEXA.2006.32","url":null,"abstract":"Because of data proliferation, efficient access methods and data storage techniques have become increasingly critical to maintain an acceptable query response time. One way to improve query response time is to reduce the number of disk I/Os by partitioning the database vertically (attribute clustering) and/or horizontally (record clustering). A clustering is optimized for a given set of queries. However in dynamic systems the queries change with time, the clustering in place becomes obsolete, and the database needs to be re-clustered dynamically. In this paper we discuss an efficient algorithm for attribute clustering that dynamically and automatically generate attribute clusters based on closed item sets mined from the attributes sets found in the queries running against the database","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"10 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":"128323713","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}
When a database is defined as views over autonomous sources, inconsistencies with respect to global integrity constraints are to be expected. This paper investigates the possibility of using simplification techniques for integrity constraints in order to maintain, in an incremental way, a correction table of virtual updates which, if executed, would restore consistency; access can be made through auxiliary views that take the table into account. The approach employs assumptions about local source consistency as well as cross-source constraints whenever possible
{"title":"On Using Simplification and Correction Tables for Integrity Maintenance in Integrated Databases","authors":"Henning Christiansen, D. Martinenghi","doi":"10.1109/DEXA.2006.103","DOIUrl":"https://doi.org/10.1109/DEXA.2006.103","url":null,"abstract":"When a database is defined as views over autonomous sources, inconsistencies with respect to global integrity constraints are to be expected. This paper investigates the possibility of using simplification techniques for integrity constraints in order to maintain, in an incremental way, a correction table of virtual updates which, if executed, would restore consistency; access can be made through auxiliary views that take the table into account. The approach employs assumptions about local source consistency as well as cross-source constraints whenever possible","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":"133907914","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}
Presenting RDF graphs to the end user as hypertext enables interactive exploration and inquiry of "semantic" data. In this paper, we present a tool that allows users to "see" their RDF data, without having to decipher syntactic representations that are typically not human-friendly. The tool is part of a broader architecture designed for viewing many different types of data in semantic Web formalisms, for experimenting with the caching of dynamically changing data, and for exploring the possible ad hoc integration of data from multiple sources. Additionally, this tool enables browsing of semantic data on a mobile device, by adapting the hypertext generation to better suit small screens
{"title":"Browsing the SemanticWeb","authors":"O. Lassila","doi":"10.1109/DEXA.2006.38","DOIUrl":"https://doi.org/10.1109/DEXA.2006.38","url":null,"abstract":"Presenting RDF graphs to the end user as hypertext enables interactive exploration and inquiry of \"semantic\" data. In this paper, we present a tool that allows users to \"see\" their RDF data, without having to decipher syntactic representations that are typically not human-friendly. The tool is part of a broader architecture designed for viewing many different types of data in semantic Web formalisms, for experimenting with the caching of dynamically changing data, and for exploring the possible ad hoc integration of data from multiple sources. Additionally, this tool enables browsing of semantic data on a mobile device, by adapting the hypertext generation to better suit small screens","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"10 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":"132904580","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 paper presents some preliminary results developed throughout a research work aiming at capturing and making available short-term organizational memory in order to support specific decision making processes. It introduces, with regard to the environmental planning domain, a conceptual model describing the production and use of both short and long term organizational memories referring to organizations emerging when developing spatial plans environmentally oriented. In particular the paper focuses on the role of argumentation in explaining modification along time of the short-term memory, or working memory, from one transient-scenario to the subsequent and presents the attempt made to use argumentative-maps as means to partially explain the evolution of the process-scenario
{"title":"Structuring Short-Term Organizational Memories by Argumentation Based Transient-Scenarios","authors":"D. Borri, A. Celino, G. Concilio, A. Liddo","doi":"10.1109/DEXA.2006.133","DOIUrl":"https://doi.org/10.1109/DEXA.2006.133","url":null,"abstract":"The paper presents some preliminary results developed throughout a research work aiming at capturing and making available short-term organizational memory in order to support specific decision making processes. It introduces, with regard to the environmental planning domain, a conceptual model describing the production and use of both short and long term organizational memories referring to organizations emerging when developing spatial plans environmentally oriented. In particular the paper focuses on the role of argumentation in explaining modification along time of the short-term memory, or working memory, from one transient-scenario to the subsequent and presents the attempt made to use argumentative-maps as means to partially explain the evolution of the process-scenario","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"39 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":"133067476","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 peer-to-peer (P2P) paradigm of computing has been growing dramatically in popularity over the last decade. Consequently, large amounts of data are being shared among P2P users on a global-scale. Given the inherently untrustworthy nature of P2P networks, this paper provides a perspective concerning trust, privacy and security issues in P2P networks. Additionally, we discuss the applicability of the P2P paradigm to new application domains, the aim being to ensure that the power of the P2P paradigm goes well beyond P2Pfile-sharing interactions
{"title":"Privacy, Security and Trust in P2P environments: A Perspective","authors":"Anirban Mondal, M. Kitsuregawa","doi":"10.1109/DEXA.2006.116","DOIUrl":"https://doi.org/10.1109/DEXA.2006.116","url":null,"abstract":"The peer-to-peer (P2P) paradigm of computing has been growing dramatically in popularity over the last decade. Consequently, large amounts of data are being shared among P2P users on a global-scale. Given the inherently untrustworthy nature of P2P networks, this paper provides a perspective concerning trust, privacy and security issues in P2P networks. Additionally, we discuss the applicability of the P2P paradigm to new application domains, the aim being to ensure that the power of the P2P paradigm goes well beyond P2Pfile-sharing interactions","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"39 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":"122093717","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}
Kim Viljanen, Teppo Kansala, E. Hyvönen, E. Mäkelä
Content in semantic Web portals is often projected along application specific navigational taxonomies and linked semantically. This paper presents a logic-based method and a server Ontodella for these tasks. We argue that logic rules between the content layer and the application layer add flexibility and better architectural separation of content and functionality. The system has been implemented and applied succesfully in several semantic portals
{"title":"ONTODELLA -- A Projection and Linking Service for Semantic Web Applications","authors":"Kim Viljanen, Teppo Kansala, E. Hyvönen, E. Mäkelä","doi":"10.1109/DEXA.2006.105","DOIUrl":"https://doi.org/10.1109/DEXA.2006.105","url":null,"abstract":"Content in semantic Web portals is often projected along application specific navigational taxonomies and linked semantically. This paper presents a logic-based method and a server Ontodella for these tasks. We argue that logic rules between the content layer and the application layer add flexibility and better architectural separation of content and functionality. The system has been implemented and applied succesfully in several semantic portals","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"35 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":"125882103","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}
Alternative splicing of pre-mRNAs is a major mechanism of generating protein diversity in higher eukaryotes. It is well known that one of the major forms of alternative splicing is exon skipping, which alternatively skips specific exon during splicing. Previous research, by Miriami and his colleagues, was conducted by using a statistical method to identify two motifs both in upstream and downstream introns that were associated with exon skipping events. In this study, we employed pattern branching motif finding algorithm and approximate mining of consensus sequences algorithm. The data mining approach developed in the study showed its strength of being able to completely discover all possible motifs and made itself a more ideal approach compared to Miriami's statistical one. Furthermore, because of the similarities in genes between human and mouse, we compared the two species' motifs in our study. We also discovered the patterns are very likely associated with exon skipping event between human and mouse
{"title":"Comparative Analysis of Exon Skipping Patterns in Human and Mouse","authors":"Yu-Wei Chiu, F. Hsu, M. Shan","doi":"10.1109/DEXA.2006.42","DOIUrl":"https://doi.org/10.1109/DEXA.2006.42","url":null,"abstract":"Alternative splicing of pre-mRNAs is a major mechanism of generating protein diversity in higher eukaryotes. It is well known that one of the major forms of alternative splicing is exon skipping, which alternatively skips specific exon during splicing. Previous research, by Miriami and his colleagues, was conducted by using a statistical method to identify two motifs both in upstream and downstream introns that were associated with exon skipping events. In this study, we employed pattern branching motif finding algorithm and approximate mining of consensus sequences algorithm. The data mining approach developed in the study showed its strength of being able to completely discover all possible motifs and made itself a more ideal approach compared to Miriami's statistical one. Furthermore, because of the similarities in genes between human and mouse, we compared the two species' motifs in our study. We also discovered the patterns are very likely associated with exon skipping event between human and mouse","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":"123836208","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}
Small and medium enterprises (SMEs) frequently face big difficulties in joining e-commerce B2B networks. Often this is due to high entry costs and/or IT infrastructure requirements. The main contribution of the work presented in this paper is a new approach to RosettaNet B2B standards for SMEs. Our work is concentrated on information exchange model within so called public registries based on RosettaNet specifications. Registries built basing on the presented model can be used as a background for conducting B2B over Internet and building electronically managed supply chains or networks
{"title":"A New Approach to Information Exchange within Public Registries Based on RosettaNet Standards","authors":"Konrad Fuks, Waldemar Wieczerzycki","doi":"10.1109/DEXA.2006.13","DOIUrl":"https://doi.org/10.1109/DEXA.2006.13","url":null,"abstract":"Small and medium enterprises (SMEs) frequently face big difficulties in joining e-commerce B2B networks. Often this is due to high entry costs and/or IT infrastructure requirements. The main contribution of the work presented in this paper is a new approach to RosettaNet B2B standards for SMEs. Our work is concentrated on information exchange model within so called public registries based on RosettaNet specifications. Registries built basing on the presented model can be used as a background for conducting B2B over Internet and building electronically managed supply chains or networks","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"99 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":"127105633","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 the recent past, the scope of distributed systems has drastically changed. Advances in device miniaturization and wireless networking have made distributed systems components evolve from workstations and servers linked by wired networks, to Internet of things linked by a variety of networks. Middleware technology designed for legacy distributed systems is no longer suitable to these new kinds of distributed systems. In this paper we describe the main challenges raised by this evolution, with stress put on ad hoc, spontaneous and sensor systems. A survey of the current state of the art will be given, together with major pending issues and perspectives in the domain
{"title":"Invited Paper: Middleware for Next Generation Distributed Systems: Main Challenges and Perspectives","authors":"G. Bernard","doi":"10.1109/DEXA.2006.79","DOIUrl":"https://doi.org/10.1109/DEXA.2006.79","url":null,"abstract":"In the recent past, the scope of distributed systems has drastically changed. Advances in device miniaturization and wireless networking have made distributed systems components evolve from workstations and servers linked by wired networks, to Internet of things linked by a variety of networks. Middleware technology designed for legacy distributed systems is no longer suitable to these new kinds of distributed systems. In this paper we describe the main challenges raised by this evolution, with stress put on ad hoc, spontaneous and sensor systems. A survey of the current state of the art will be given, together with major pending issues and perspectives in the domain","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"97 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":"127160874","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}
Query-by-keywords is the most popular manner to search for data in this computing age. However, most work was proposed for searching centralized relational databases. This paper investigates how keyword search is to be deployed in relational database-enabled peer-to-peer systems. Unlike centralized system, the key challenges in this new computing paradigm come from the autonomy of peers, the lack of a global schema, and the dynamics of the peer connectivity. First, the concept of P2P-join is proposed, which is a join operation to combine tuples among relations from different peers containing certain keywords in the query. Second, a fully distributed framework to realize P2P-join processing is devised, which not only inherits the syntax and semantics of traditional join but also cherishes the ideology of peer-to-peer computing. Finally, two mechanisms are proposed to improve the performance of the operation: a join path selecting order scheme and a push-based load balancing mechanism across peers
{"title":"P2P-Join: A Keyword Based Join Operation in Relational Database Enabled Peer-to-Peer Systems","authors":"Zhigang Chen, Zhongding Huang, Bo Ling, Jiang Li","doi":"10.1109/DEXA.2006.110","DOIUrl":"https://doi.org/10.1109/DEXA.2006.110","url":null,"abstract":"Query-by-keywords is the most popular manner to search for data in this computing age. However, most work was proposed for searching centralized relational databases. This paper investigates how keyword search is to be deployed in relational database-enabled peer-to-peer systems. Unlike centralized system, the key challenges in this new computing paradigm come from the autonomy of peers, the lack of a global schema, and the dynamics of the peer connectivity. First, the concept of P2P-join is proposed, which is a join operation to combine tuples among relations from different peers containing certain keywords in the query. Second, a fully distributed framework to realize P2P-join processing is devised, which not only inherits the syntax and semantics of traditional join but also cherishes the ideology of peer-to-peer computing. Finally, two mechanisms are proposed to improve the performance of the operation: a join path selecting order scheme and a push-based load balancing mechanism across peers","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"19 1 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":"124338744","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
扫码关注我们
求助内容：
应助结果提醒方式：