Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706287
Yuhua Luo, Ricardo Galli, M. Mascaró, Pere A. Palmer
The paper describes a cooperative design system for a 3D virtual scene. The objective of the system is to allow multiple users to design a 3D scene cooperatively via a communication network. The system is based on a distributed layered architecture. At the application layer, a 3D cooperative design tool is implemented. The basic cooperative design operations include reading and saving a 3D scene, selecting an object from the common 3D scene, modification of the objects by geometrical transformations, modification of the attributes of the global scene or an individual object, such as, object texture, material, illumination parameters, etc. A special protocol (SMI) has been designed and implemented for the communication with the peer cooperative design tool situated on peer hosts. The session control layer and group communication layer form the cooperative support platform for the system. The session control layer is responsible for the tasks required by a cooperative working session such as service multiplexing, data consistency control, member admission etc. The group communication layer provides the point to point or point to multipoint communication. The experimental system is currently implemented on Silicon Graphics hardware platform with a 100 MB/s internal network. Open Inventor has been used for the 3D design tool. The data format is fully VRML compatible.
{"title":"Cooperative design for 3D virtual scenes","authors":"Yuhua Luo, Ricardo Galli, M. Mascaró, Pere A. Palmer","doi":"10.1109/COOPIS.1998.706287","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706287","url":null,"abstract":"The paper describes a cooperative design system for a 3D virtual scene. The objective of the system is to allow multiple users to design a 3D scene cooperatively via a communication network. The system is based on a distributed layered architecture. At the application layer, a 3D cooperative design tool is implemented. The basic cooperative design operations include reading and saving a 3D scene, selecting an object from the common 3D scene, modification of the objects by geometrical transformations, modification of the attributes of the global scene or an individual object, such as, object texture, material, illumination parameters, etc. A special protocol (SMI) has been designed and implemented for the communication with the peer cooperative design tool situated on peer hosts. The session control layer and group communication layer form the cooperative support platform for the system. The session control layer is responsible for the tasks required by a cooperative working session such as service multiplexing, data consistency control, member admission etc. The group communication layer provides the point to point or point to multipoint communication. The experimental system is currently implemented on Silicon Graphics hardware platform with a 100 MB/s internal network. Open Inventor has been used for the 3D design tool. The data format is fully VRML compatible.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127123898","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706188
Qiming Chen, P. Chundi, U. Dayal, M. Hsu
We claim that a dynamic-agent infrastructure can provide a shift from static distributed computing to dynamic distributed computing, and we have developed such an infrastructure to realize such a shift. We shall show its impact on software engineering through a comparison with other distributed object-oriented systems such as CORBA and DCOM, and demonstrate its value in highly dynamic system integration and service provisioning. The infrastructure is Java-based, light-weight, and extensible. It differs from other agent platforms and client/server infrastructures in its support of dynamic behavior modification of agents. A dynamic-agent is not designed to have a fixed set of predefined functions but instead, to carry application-specific actions, which can be loaded and modified on theory. This allows a dynamic-agent to adjust its capability for accommodating environment and requirement changes, and play different roles across multiple applications. The above features are supported by the light-weight, built-in management facilities of dynamic-agents, which can be commonly used by the "carried" application programs to communicate, manage resources and modify their problem solving capabilities. Therefore, the proposed infrastructure allows application-specific multi-agent systems to be developed easily on top of it, provides "nuts and bolts" for run-time system integration, and supports dynamic service construction, modification and movement. A prototype has been developed at HP Labs and made available to several external research groups.
{"title":"Dynamic-agents for dynamic service provisioning","authors":"Qiming Chen, P. Chundi, U. Dayal, M. Hsu","doi":"10.1109/COOPIS.1998.706188","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706188","url":null,"abstract":"We claim that a dynamic-agent infrastructure can provide a shift from static distributed computing to dynamic distributed computing, and we have developed such an infrastructure to realize such a shift. We shall show its impact on software engineering through a comparison with other distributed object-oriented systems such as CORBA and DCOM, and demonstrate its value in highly dynamic system integration and service provisioning. The infrastructure is Java-based, light-weight, and extensible. It differs from other agent platforms and client/server infrastructures in its support of dynamic behavior modification of agents. A dynamic-agent is not designed to have a fixed set of predefined functions but instead, to carry application-specific actions, which can be loaded and modified on theory. This allows a dynamic-agent to adjust its capability for accommodating environment and requirement changes, and play different roles across multiple applications. The above features are supported by the light-weight, built-in management facilities of dynamic-agents, which can be commonly used by the \"carried\" application programs to communicate, manage resources and modify their problem solving capabilities. Therefore, the proposed infrastructure allows application-specific multi-agent systems to be developed easily on top of it, provides \"nuts and bolts\" for run-time system integration, and supports dynamic service construction, modification and movement. A prototype has been developed at HP Labs and made available to several external research groups.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130488810","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706278
Regina Motz, Péter Fankhauser
We present a methodology to semi-automatically propagate semantic modifications on local schemas of a federated database to the integrated schema. Our approach is based on a declarative schema integration methodology, called SIM, which accomplishes schema integration by resolving a set of equivalence correspondences between arbitrarily complex local subschemas. This paper extends this methodology with a more diversified set of semantic correspondences and with an approach to integrate schemas incrementally. On this basis, local schema changes can be modelled as semantic correspondences between subschemas, which extend or alter the correspondences that have led to the existing integrated schema. Propagating these changes to the integrated schema then amounts in incrementally revising the affected original schema correspondences and reintegrating the affected portions of the integrated schema.
{"title":"Propagation of semantic modifications to an integrated schema","authors":"Regina Motz, Péter Fankhauser","doi":"10.1109/COOPIS.1998.706278","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706278","url":null,"abstract":"We present a methodology to semi-automatically propagate semantic modifications on local schemas of a federated database to the integrated schema. Our approach is based on a declarative schema integration methodology, called SIM, which accomplishes schema integration by resolving a set of equivalence correspondences between arbitrarily complex local subschemas. This paper extends this methodology with a more diversified set of semantic correspondences and with an approach to integrate schemas incrementally. On this basis, local schema changes can be modelled as semantic correspondences between subschemas, which extend or alter the correspondences that have led to the existing integrated schema. Propagating these changes to the integrated schema then amounts in incrementally revising the affected original schema correspondences and reintegrating the affected portions of the integrated schema.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114824930","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706200
V. Josifovski, T. Risch
The concept of object-oriented (OO) views has been a popular approach to data integration. Nevertheless, there have been few reported results on optimization of queries over integrated OO views. The authors have developed an OO view system for data integration based on the AMOS database mediator system. The paper describes a system architecture and implementation that takes advantage of query optimization techniques to improve the performance of queries to integrated OO views. The main features of the system are: 1) a passive mediation framework that preserves the autonomy of the data sources. 2) A selective materialization mechanism that minimizes the number of materialized view objects. 3) A predicate based mechanism to guarantee the validity of the materialized view objects as well as the completeness of queries to the view. In order to reduce the overhead of the passive view integration, they use inexpensive calculus based transformations to generate minimal query expressions before the query decomposition and the cost-based algebraic optimization take place.
{"title":"Calculus-based transformations of queries over object-oriented views in a database mediator system","authors":"V. Josifovski, T. Risch","doi":"10.1109/COOPIS.1998.706200","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706200","url":null,"abstract":"The concept of object-oriented (OO) views has been a popular approach to data integration. Nevertheless, there have been few reported results on optimization of queries over integrated OO views. The authors have developed an OO view system for data integration based on the AMOS database mediator system. The paper describes a system architecture and implementation that takes advantage of query optimization techniques to improve the performance of queries to integrated OO views. The main features of the system are: 1) a passive mediation framework that preserves the autonomy of the data sources. 2) A selective materialization mechanism that minimizes the number of materialized view objects. 3) A predicate based mechanism to guarantee the validity of the materialized view objects as well as the completeness of queries to the view. In order to reduce the overhead of the passive view integration, they use inexpensive calculus based transformations to generate minimal query expressions before the query decomposition and the cost-based algebraic optimization take place.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116251935","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706181
Mattia De Rosa, T. Catarci, L. Iocchi, D. Nardi, G. Santucci
In this paper we present a novel approach to accessing the Web, that enables automatically acquiring data from Web sites and making them accessible to the user through a database query paradigm. The basic idea is to build, once the user has specified a generic domain of interest, the domain conceptual representation, to instantiate it with data extracted from Web sites (so to build a materialized view over the Web), and to query such a conceptual representation through an easy-to-use visual interface. Knowledge representation techniques are used for both the internal modeling of the conceptual representation and for supporting the automatic extraction of data from Web sites to feed the materialized view. We describe a prototype implementation, focusing on the internal representation of information and on the process for analysing Web sites and acquiring data from them. Our preliminary results support our intuition that, at least for certain kinds of queries, the proposed approach can effectively provide the desired information.
{"title":"Materializing the Web","authors":"Mattia De Rosa, T. Catarci, L. Iocchi, D. Nardi, G. Santucci","doi":"10.1109/COOPIS.1998.706181","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706181","url":null,"abstract":"In this paper we present a novel approach to accessing the Web, that enables automatically acquiring data from Web sites and making them accessible to the user through a database query paradigm. The basic idea is to build, once the user has specified a generic domain of interest, the domain conceptual representation, to instantiate it with data extracted from Web sites (so to build a materialized view over the Web), and to query such a conceptual representation through an easy-to-use visual interface. Knowledge representation techniques are used for both the internal modeling of the conceptual representation and for supporting the automatic extraction of data from Web sites to feed the materialized view. We describe a prototype implementation, focusing on the internal representation of information and on the process for analysing Web sites and acquiring data from them. Our preliminary results support our intuition that, at least for certain kinds of queries, the proposed approach can effectively provide the desired information.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122487510","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706275
Gregor Joeris, O. Herzog
Dynamic evolution of workflow models due to process (re)engineering activities and dynamic changing situations of the real process is one of the most important challenges in workflow management. The authors present an approach for the management of evolving workflow specifications which copes with the evolution of a workflow schema and the dynamic modification of workflow instances. The approach is based on the integrated modeling of workflow schema and instance elements, the separated definition of 'what to do' and 'how to do' in the workflow schema, late binding of workflows at run-time, and the versioning of the workflow schema. On this basis, they support lazy, eager, and selective propagation as well as local customization of instances and their upward propagation. Furthermore, they address the problem of managing consistent configurations of the versioned entities of a workflow schema. In their workflow-specific versioning approach, the consistency of the workflow configuration is guaranteed and hence the version mechanism is transparent to the user.
{"title":"Managing evolving workflow specifications","authors":"Gregor Joeris, O. Herzog","doi":"10.1109/COOPIS.1998.706275","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706275","url":null,"abstract":"Dynamic evolution of workflow models due to process (re)engineering activities and dynamic changing situations of the real process is one of the most important challenges in workflow management. The authors present an approach for the management of evolving workflow specifications which copes with the evolution of a workflow schema and the dynamic modification of workflow instances. The approach is based on the integrated modeling of workflow schema and instance elements, the separated definition of 'what to do' and 'how to do' in the workflow schema, late binding of workflows at run-time, and the versioning of the workflow schema. On this basis, they support lazy, eager, and selective propagation as well as local customization of instances and their upward propagation. Furthermore, they address the problem of managing consistent configurations of the versioned entities of a workflow schema. In their workflow-specific versioning approach, the consistency of the workflow configuration is guaranteed and hence the version mechanism is transparent to the user.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123024421","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706184
Philippe Thiran, Jean-Luc Hainaut, S. Bodart, A. Deflorenne, Jean-Marc Hick
Accessing and managing data from several existing independent databases pose complex problems that can be classified into platform, DMS, location and semantic levels. This paper describes a general architecture, a methodology and a CASE environment intended to address the problem of providing users and programmers with an abstract interface to independent heterogeneous and distributed databases. The architecture comprises a hierarchy of mediators that dynamically transform actual data into a virtual homogeneous database. Each layer provides a certain kind of independence. The InterDB approach provides a complete methodology to define this architecture, including schema recovery through reverse engineering, database integration and mapping building. The methodology is supported by the DB-MAIN CASE tool that helps to generate the mediators and their repository.
{"title":"Interoperation of independent, heterogeneous and distributed databases. Methodology and CASE support: the InterDB approach","authors":"Philippe Thiran, Jean-Luc Hainaut, S. Bodart, A. Deflorenne, Jean-Marc Hick","doi":"10.1109/COOPIS.1998.706184","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706184","url":null,"abstract":"Accessing and managing data from several existing independent databases pose complex problems that can be classified into platform, DMS, location and semantic levels. This paper describes a general architecture, a methodology and a CASE environment intended to address the problem of providing users and programmers with an abstract interface to independent heterogeneous and distributed databases. The architecture comprises a hierarchy of mediators that dynamically transform actual data into a virtual homogeneous database. Each layer provides a certain kind of independence. The InterDB approach provides a complete methodology to define this architecture, including schema recovery through reverse engineering, database integration and mapping building. The methodology is supported by the DB-MAIN CASE tool that helps to generate the mediators and their repository.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128357521","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706197
F. Baião, M. Mattoso, Gerson Zaverucha
Cooperative information systems (CIS) often consist of applications that access shared resources such as databases. Since centralized systems may have a great impact on the system performance, parallel and distribution techniques are needed for attaining scalability. Distributed databases are, then, crucial for the development of cooperative applications. However, in order to improve performance, it is very important to design information distribution properly, which is the goal of distribution design. Considering the various difficulties embedded in the design of distributed object oriented databases, this work presents an algorithm to assist distribution designers in their task. The analysis algorithm indicates the most adequate fragmentation technique (vertical, horizontal or mixed) for each class in the database schema, and we propose the use of a machine learning method-inductive logic programming-to uncover some implicit issues to be considered in the distribution design, thus revising the proposed analysis algorithm.
{"title":"Towards an inductive design of distributed object oriented databases","authors":"F. Baião, M. Mattoso, Gerson Zaverucha","doi":"10.1109/COOPIS.1998.706197","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706197","url":null,"abstract":"Cooperative information systems (CIS) often consist of applications that access shared resources such as databases. Since centralized systems may have a great impact on the system performance, parallel and distribution techniques are needed for attaining scalability. Distributed databases are, then, crucial for the development of cooperative applications. However, in order to improve performance, it is very important to design information distribution properly, which is the goal of distribution design. Considering the various difficulties embedded in the design of distributed object oriented databases, this work presents an algorithm to assist distribution designers in their task. The analysis algorithm indicates the most adequate fragmentation technique (vertical, horizontal or mixed) for each class in the database schema, and we propose the use of a machine learning method-inductive logic programming-to uncover some implicit issues to be considered in the distribution design, thus revising the proposed analysis algorithm.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128819100","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}
Due to the autonomy of individual databases, a multidatabase system (MDBS) has no control over the task execution within each database system. This complicates the issue of query optimization in a MDBS. Past researchers tackled this problem mainly by regenerating the cost model of each participating database systems. However a completely autonomous participating database system does nor own the information (data) as well as the mechanism (software) for converting data of one database to another to resolve the data type conflict problems that can occur in any MDBS environment. In addition, unpredictable factors that can drastically deviate the accuracy of a regenerated cost model (in the past research) come into play at unknown time. This confines the processing of an intersite operation (such as a join over two relations of different databases) to the MDBS only. The participating database systems will not be able to share the workload of the MDBS under this circumstance. Hence, minimizing the consumption of system resources of the MDBS is an urgent problem. The authors propose three scheduling algorithms that are used in the MDBS to reduce the processing cost of a multidatabase query. A major difference between the strategies and the past methods is that ours do not require the knowledge of the cost models of the participating databases.
{"title":"Minimization of resource consumption for multidatabase query optimization","authors":"Chiang Lee, Chih-Horng Ke, Jer-Bin Chang, Yaw-Huei Chen","doi":"10.1109/COOPIS.1998.706202","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706202","url":null,"abstract":"Due to the autonomy of individual databases, a multidatabase system (MDBS) has no control over the task execution within each database system. This complicates the issue of query optimization in a MDBS. Past researchers tackled this problem mainly by regenerating the cost model of each participating database systems. However a completely autonomous participating database system does nor own the information (data) as well as the mechanism (software) for converting data of one database to another to resolve the data type conflict problems that can occur in any MDBS environment. In addition, unpredictable factors that can drastically deviate the accuracy of a regenerated cost model (in the past research) come into play at unknown time. This confines the processing of an intersite operation (such as a join over two relations of different databases) to the MDBS only. The participating database systems will not be able to share the workload of the MDBS under this circumstance. Hence, minimizing the consumption of system resources of the MDBS is an urgent problem. The authors propose three scheduling algorithms that are used in the MDBS to reduce the processing cost of a multidatabase query. A major difference between the strategies and the past methods is that ours do not require the knowledge of the cost models of the participating databases.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127344509","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}
Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706289
Dean Kuo, V. Gaede, K. Taylor
Spatial information systems are employed to record the schematics of large networks for utilities and telecommunication organisations. Concurrent users access the spatial information systems to insert new designs, update designs and to record the current status of the network. Concurrency must be managed such that the data is not corrupted. This paper introduces a model for long duration transactions based on the use of integrity constraints. The model, called COLT (COnstraint-based Long Transaction), is domain-independent but is especially suitable for spatial information systems and domains where its intent naturally manifests constraints that relate data items. User-defined constraints and database integrity constraints are used both to specify the correctness criteria and to manage long duration ad-hoc transactions. The model is a generalisation of the traditional ACID transaction model. The approach enables the specification of the correctness criteria to be declarative and the user needs no knowledge of the semantics of other concurrently executing transactions. The COLT model is formally specified using the external actions of the I/O automata method and correctness is defined with respect to that method. Correctness is defined independent of implementation.
{"title":"Using constraints to manage long duration transactions in spatial information systems","authors":"Dean Kuo, V. Gaede, K. Taylor","doi":"10.1109/COOPIS.1998.706289","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706289","url":null,"abstract":"Spatial information systems are employed to record the schematics of large networks for utilities and telecommunication organisations. Concurrent users access the spatial information systems to insert new designs, update designs and to record the current status of the network. Concurrency must be managed such that the data is not corrupted. This paper introduces a model for long duration transactions based on the use of integrity constraints. The model, called COLT (COnstraint-based Long Transaction), is domain-independent but is especially suitable for spatial information systems and domains where its intent naturally manifests constraints that relate data items. User-defined constraints and database integrity constraints are used both to specify the correctness criteria and to manage long duration ad-hoc transactions. The model is a generalisation of the traditional ACID transaction model. The approach enables the specification of the correctness criteria to be declarative and the user needs no knowledge of the semantics of other concurrently executing transactions. The COLT model is formally specified using the external actions of the I/O automata method and correctness is defined with respect to that method. Correctness is defined independent of implementation.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121651844","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
扫码关注我们
求助内容：
应助结果提醒方式：