An essential issue while designing parallel database systems is to considerably minimizes the amount of response time for submitted queries. One of the system's methods to reduce the mentioned time is data load balancing. In this paper, we are going to present a trial of applying load balancing mechanism based on horizontally-range-partitioning schema to a distributed spatial telemetric data warehouse with aR-tree indexing
{"title":"On-Line Balancing of Horizontally-Range-Partitioned Data in Distributed Spatial Telemetric Data Warehouse","authors":"M. Gorawski, M. Kaminski","doi":"10.1109/DEXA.2006.104","DOIUrl":"https://doi.org/10.1109/DEXA.2006.104","url":null,"abstract":"An essential issue while designing parallel database systems is to considerably minimizes the amount of response time for submitted queries. One of the system's methods to reduce the mentioned time is data load balancing. In this paper, we are going to present a trial of applying load balancing mechanism based on horizontally-range-partitioning schema to a distributed spatial telemetric data warehouse with aR-tree indexing","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"222 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":"115531813","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 this paper, we propose a novel approach for inspecting and editing ontologies using a 3D space, where information is represented on a 3D viewport enriched by several visual cues. This approach aims at tackling space allocation issues for ontology visual models by adopting a dynamic collapsing mechanism and different views, at different granularities, for granting a constant navigability of the rendered model. A Protege plug-in, based on the presented principles and named OntoSphere3D, has been developed. Preliminary results, comparing it to other solutions as Jambalaya, OWLViz and TgViz on specific operations, show that the approach is feasible and can actually lead to a more effective modeling process with respect to currently available solutions
{"title":"OntoSphere3D: A Multidimensional Visualization Tool for Ontologies","authors":"A. Bosca, Dario Bonino","doi":"10.1109/DEXA.2006.106","DOIUrl":"https://doi.org/10.1109/DEXA.2006.106","url":null,"abstract":"In this paper, we propose a novel approach for inspecting and editing ontologies using a 3D space, where information is represented on a 3D viewport enriched by several visual cues. This approach aims at tackling space allocation issues for ontology visual models by adopting a dynamic collapsing mechanism and different views, at different granularities, for granting a constant navigability of the rendered model. A Protege plug-in, based on the presented principles and named OntoSphere3D, has been developed. Preliminary results, comparing it to other solutions as Jambalaya, OWLViz and TgViz on specific operations, show that the approach is feasible and can actually lead to a more effective modeling process with respect to currently available solutions","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"27 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":"125428305","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}
Peer to peer (P2P) systems are becoming more and more popular. With the popularity, there are many security concerns about P2P systems and the major solution is to build a trust system. While most, of the works are about how to build sound trust systems, there is relatively less work focusing on the trust management: how to store, access and update trust values. In this paper, we purpose a design of the trust model that not only presents a trust computation mechanism but also lays the emphasis on the trust management. The trust computation mechanism is completely distributed and sensitive to the deceptive peers. The trust management is also distributed and provides anonymity, reliability in the P2P systems
{"title":"Developing and Managing Trust in Peer-to-Peer Systems","authors":"Liang Ge, Junzhou Luo, Yaobin Xu","doi":"10.1109/DEXA.2006.51","DOIUrl":"https://doi.org/10.1109/DEXA.2006.51","url":null,"abstract":"Peer to peer (P2P) systems are becoming more and more popular. With the popularity, there are many security concerns about P2P systems and the major solution is to build a trust system. While most, of the works are about how to build sound trust systems, there is relatively less work focusing on the trust management: how to store, access and update trust values. In this paper, we purpose a design of the trust model that not only presents a trust computation mechanism but also lays the emphasis on the trust management. The trust computation mechanism is completely distributed and sensitive to the deceptive peers. The trust management is also distributed and provides anonymity, reliability in the P2P systems","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"66 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":"121456942","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}
Management of collaborative business processes that span multiple business entities has emerged as a key requirement for business success. These processes are embedded in sets of rules describing complex message-based interactions between parties such that if a logical expression defined on the set of received messages is satisfied, one or more outgoing messages are dispatched. The execution of these processes presents significant challenges since each content-rich message may contribute towards the evaluation of multiple expressions in different ways and the sequence of message arrival cannot be predicted. These challenges must be overcome in order to develop an efficient execution strategy for collaborative processes in an intensive operating environment with a large number of rules and very high throughput of messages. In this paper, we present a discussion on issues relevant to the evaluation of such expressions and describe a basic query-based method for this purpose, including suggested indexes for improved performance. We conclude by identifying several potential future research directions in this area
{"title":"On the Execution of Collaborative Business Processes","authors":"Belinda M. Carter, M. Orlowska","doi":"10.1109/DEXA.2006.101","DOIUrl":"https://doi.org/10.1109/DEXA.2006.101","url":null,"abstract":"Management of collaborative business processes that span multiple business entities has emerged as a key requirement for business success. These processes are embedded in sets of rules describing complex message-based interactions between parties such that if a logical expression defined on the set of received messages is satisfied, one or more outgoing messages are dispatched. The execution of these processes presents significant challenges since each content-rich message may contribute towards the evaluation of multiple expressions in different ways and the sequence of message arrival cannot be predicted. These challenges must be overcome in order to develop an efficient execution strategy for collaborative processes in an intensive operating environment with a large number of rules and very high throughput of messages. In this paper, we present a discussion on issues relevant to the evaluation of such expressions and describe a basic query-based method for this purpose, including suggested indexes for improved performance. We conclude by identifying several potential future research directions in this area","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"21 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":"121724634","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}
An important aim of a database system is to guarantee database consistency, which means that the data contained in a database is both accurate and valid. Integrity constraints represent knowledge about data with which a database must be consistent. The process of checking constraints to ensure that update operations or transactions which alter the database will preserve its consistency has proved to be extremely difficult to implement, particularly in distributed and parallel databases. In distributed databases the aim of the constraint checking is to reduce the amount of data needing to be accessed, the number of sites involved and the amount of data transferred across the network. In parallel databases the focus is on the total execution time taken in checking the constraints. This paper highlights the differences between centralized, distributed and parallel databases with respect to constraint checking
{"title":"Checking Integrity Constraints - How it Differs in Centralized, Distributed and Parallel Databases","authors":"H. Ibrahim","doi":"10.1109/DEXA.2006.39","DOIUrl":"https://doi.org/10.1109/DEXA.2006.39","url":null,"abstract":"An important aim of a database system is to guarantee database consistency, which means that the data contained in a database is both accurate and valid. Integrity constraints represent knowledge about data with which a database must be consistent. The process of checking constraints to ensure that update operations or transactions which alter the database will preserve its consistency has proved to be extremely difficult to implement, particularly in distributed and parallel databases. In distributed databases the aim of the constraint checking is to reduce the amount of data needing to be accessed, the number of sites involved and the amount of data transferred across the network. In parallel databases the focus is on the total execution time taken in checking the constraints. This paper highlights the differences between centralized, distributed and parallel databases with respect to constraint checking","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"69 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":"124510446","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}
We propose a novel cluster parallel file system: high-throughput & scalable parallel file system (HTSPFS). There are some new features in it such as automatic adaptive file striping policy based on file size, request arrival rate, concurrent of accessing files, storage servers' networking and disk performance; prefetching read-request and writing behind write-request to enable a higher throughput in HTSPFS. We give a detail discuss of Markov spatial predicting method for read request, experiment results show that Markov predicting technology has high prediction veracity. Overall, HTSPFS has some autonomies characteristics
{"title":"A Novel Cluster Parallel File System","authors":"W. Wei, Shoubin Dong, Ling Zhang, Jialin Li","doi":"10.1109/DEXA.2006.14","DOIUrl":"https://doi.org/10.1109/DEXA.2006.14","url":null,"abstract":"We propose a novel cluster parallel file system: high-throughput & scalable parallel file system (HTSPFS). There are some new features in it such as automatic adaptive file striping policy based on file size, request arrival rate, concurrent of accessing files, storage servers' networking and disk performance; prefetching read-request and writing behind write-request to enable a higher throughput in HTSPFS. We give a detail discuss of Markov spatial predicting method for read request, experiment results show that Markov predicting technology has high prediction veracity. Overall, HTSPFS has some autonomies characteristics","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"65 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":"124596884","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}
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the corresponding trees of XML documents. However, evaluating a tree edit distance is computationally expensive and does not easily scale up to large collections. We show in this paper that a tree edit distance computation often is not necessary and can be avoided. In particular, we propose a concise structural summary of XML documents and show that a comparison based on this summary is both fast and effective. Our experimental evaluation shows that this method does an excellent job of grouping documents generated by the same DTD, outperforming some of the previously proposed solutions based on a tree comparison. Furthermore, the time complexity of the algorithm is linear on the size of the structural description
{"title":"Finding Syntactic Similarities Between XML Documents","authors":"Davood Rafiei, D. L. Moise, Dabo Sun","doi":"10.1109/DEXA.2006.62","DOIUrl":"https://doi.org/10.1109/DEXA.2006.62","url":null,"abstract":"Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the corresponding trees of XML documents. However, evaluating a tree edit distance is computationally expensive and does not easily scale up to large collections. We show in this paper that a tree edit distance computation often is not necessary and can be avoided. In particular, we propose a concise structural summary of XML documents and show that a comparison based on this summary is both fast and effective. Our experimental evaluation shows that this method does an excellent job of grouping documents generated by the same DTD, outperforming some of the previously proposed solutions based on a tree comparison. Furthermore, the time complexity of the algorithm is linear on the size of the structural description","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"27 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":"116428892","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}
Massimiliano Albanese, A. Chianese, Antonio Penta, A. Picariello, L. Passariello
Nowadays an ever increasing number of companies rely on application service providers for hosting some or almost all software applications. In this domain, an effective way for customizing user interfaces would be highly desirable. We propose a profiling system interacting with the applications in order to capture users' behavior. The system is based on Bayesian networks and we show a strategy for combining data collected in each session and previous knowledge. Experiments on a prototype show that the proposed approach is promising
{"title":"A Model for User Profiling in an ASP Environment","authors":"Massimiliano Albanese, A. Chianese, Antonio Penta, A. Picariello, L. Passariello","doi":"10.1109/DEXA.2006.12","DOIUrl":"https://doi.org/10.1109/DEXA.2006.12","url":null,"abstract":"Nowadays an ever increasing number of companies rely on application service providers for hosting some or almost all software applications. In this domain, an effective way for customizing user interfaces would be highly desirable. We propose a profiling system interacting with the applications in order to capture users' behavior. The system is based on Bayesian networks and we show a strategy for combining data collected in each session and previous knowledge. Experiments on a prototype show that the proposed approach is promising","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"48 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":"121549043","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 XQuery Update Facility has been published by the World Wide Web Consortium as a working draft. Among other features, the working draft presents a novel powerful transform expression. A transform expression creates a new modified copy of an XML subtree, where the modifications are specified as update operations. In this paper we investigate the use of transform expressions and provide a method to support transform expressions efficiently: the method avoids copying of the whole modified XML subtree. Our method is based on the idea of shadow mechanism proposed in early work on recovery
{"title":"A Method for XQuery Transform Implementation Based on Shadow Mechanism","authors":"Maria Rekouts, Maxim N. Grinev, A. Boldakov","doi":"10.1109/DEXA.2006.11","DOIUrl":"https://doi.org/10.1109/DEXA.2006.11","url":null,"abstract":"The XQuery Update Facility has been published by the World Wide Web Consortium as a working draft. Among other features, the working draft presents a novel powerful transform expression. A transform expression creates a new modified copy of an XML subtree, where the modifications are specified as update operations. In this paper we investigate the use of transform expressions and provide a method to support transform expressions efficiently: the method avoids copying of the whole modified XML subtree. Our method is based on the idea of shadow mechanism proposed in early work on recovery","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"29 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":"121669886","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}
This paper is an attempt to create a holistic approach to the problem of the impact of the elements operating in cyberspace on an organization. Firstly, a classification of the entities operating in cyberspace is offered. Next, a taxonomy of the possible types of influences of the elements of cyberspace on an organization is presented. In the following part of the paper two matrices concerning types of direct and indirect impact of the above mentioned entities are provided along with examples. Finally, conclusions are offered
{"title":"A Framework of the Impact of Cyberspace on Contemporary Organizations","authors":"Janusz Wielki","doi":"10.1109/DEXA.2006.8","DOIUrl":"https://doi.org/10.1109/DEXA.2006.8","url":null,"abstract":"This paper is an attempt to create a holistic approach to the problem of the impact of the elements operating in cyberspace on an organization. Firstly, a classification of the entities operating in cyberspace is offered. Next, a taxonomy of the possible types of influences of the elements of cyberspace on an organization is presented. In the following part of the paper two matrices concerning types of direct and indirect impact of the above mentioned entities are provided along with examples. Finally, conclusions are offered","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"16 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":"126057951","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
扫码关注我们
求助内容：
应助结果提醒方式：