The complex system formalism is utilized for describing structural and behavioral properties of complexly structured systems. A complex system is a production system that models a database with complex objects and explicitly supports time and nondeterminism. Consequently, complex systems can be used to predict the evolution of databases. To obtain predictions about future behavior, a futuristic query language is defined. A query optimisation algorithm is provided for a subset of this language. In general, complex systems do not yield unique answers to futuristic queries because of the inherent nondetermination. Therefore, an optimal control problem is formulated that finds behavior satisfying user-defined goals. Subsequently, such goals can be converted into additional system constraints, thus reducing nondeterminism and providing for the optimal system's behavior.<>
{"title":"Querying and controlling the future behavior of complex objects","authors":"A. Tuzhilin, Z. Kedem","doi":"10.1109/ICDE.1989.47247","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47247","url":null,"abstract":"The complex system formalism is utilized for describing structural and behavioral properties of complexly structured systems. A complex system is a production system that models a database with complex objects and explicitly supports time and nondeterminism. Consequently, complex systems can be used to predict the evolution of databases. To obtain predictions about future behavior, a futuristic query language is defined. A query optimisation algorithm is provided for a subset of this language. In general, complex systems do not yield unique answers to futuristic queries because of the inherent nondetermination. Therefore, an optimal control problem is formulated that finds behavior satisfying user-defined goals. Subsequently, such goals can be converted into additional system constraints, thus reducing nondeterminism and providing for the optimal system's behavior.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134508649","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}
A discussion is given on the use of object-oriented database systems for supporting database applications such as office information systems, knowledge-based systems, engineering design databases, (computer-aided design/manufacturing), hypermedia and software engineering databases. Typically, the research on object-oriented database systems has been addressed from two different disciplines: the programming language discipline and the database discipline. The author discusses his motivations from each of the two disciplines and then explains how they are combined into an integrated framework.<>
{"title":"A seamless integration in object-oriented database systems","authors":"K. Whang","doi":"10.1109/ICDE.1989.47277","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47277","url":null,"abstract":"A discussion is given on the use of object-oriented database systems for supporting database applications such as office information systems, knowledge-based systems, engineering design databases, (computer-aided design/manufacturing), hypermedia and software engineering databases. Typically, the research on object-oriented database systems has been addressed from two different disciplines: the programming language discipline and the database discipline. The author discusses his motivations from each of the two disciplines and then explains how they are combined into an integrated framework.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745944","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}
Summary form only given. The issue of ease of using shared data in a data-intensive parallel computing environment is discussed. An approach is investigated for transparently supporting data sharing in a loosely coupled parallel computing environment, where a moderate to a large number of individual computing elements are connected via a high-bandwidth network without necessarily physically sharing memory. A system called VOYAGER is discussed which serves as the underlying system facility that supervises the distributed shared virtual memory. VOYAGER allows shared-data parallel applications to take advantage of parallel and distributed processing with relative ease. The application program merely maps the shared data onto its virtual address space replicates itself on distributed machines and spawns appropriate execution threads; the threads would automatically be given coordinated access to the shared data distributed in the network. Multiple computation threads migrate and populate the processors of a number of computing elements, making use of the multiple processors to achieve a high degree of parallelism. The low-level resource management chores are made available once and for all in the underlying facility VOYAGER, usable by many different data-intensive applications.<>
{"title":"Parallel computing with distributed shared data","authors":"M. Hsu","doi":"10.1109/ICDE.1989.47253","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47253","url":null,"abstract":"Summary form only given. The issue of ease of using shared data in a data-intensive parallel computing environment is discussed. An approach is investigated for transparently supporting data sharing in a loosely coupled parallel computing environment, where a moderate to a large number of individual computing elements are connected via a high-bandwidth network without necessarily physically sharing memory. A system called VOYAGER is discussed which serves as the underlying system facility that supervises the distributed shared virtual memory. VOYAGER allows shared-data parallel applications to take advantage of parallel and distributed processing with relative ease. The application program merely maps the shared data onto its virtual address space replicates itself on distributed machines and spawns appropriate execution threads; the threads would automatically be given coordinated access to the shared data distributed in the network. Multiple computation threads migrate and populate the processors of a number of computing elements, making use of the multiple processors to achieve a high degree of parallelism. The low-level resource management chores are made available once and for all in the underlying facility VOYAGER, usable by many different data-intensive applications.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132127665","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 consistency problems that arise in the design and implementation of functional databases are investigated. The notion of derived functions is used to capture the redundancies that are a common feature of the specification of fundamental databases. To maintain the consistency of databases in the presence of redundant specification, the derived functions in the conceptual schema are identified, and updates on derived functions are performed in a manner consistent with their derivations. An interactive design aid is developed to facilitate the identification of derived functions. Algorithms are developed of derived functions. Algorithms are developed that perform updates in a side-effect-free manner.<>
{"title":"Identifying and update of derived functions in functional databases","authors":"Ramana Yerneni, S. Lanka","doi":"10.1109/ICDE.1989.47206","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47206","url":null,"abstract":"The consistency problems that arise in the design and implementation of functional databases are investigated. The notion of derived functions is used to capture the redundancies that are a common feature of the specification of fundamental databases. To maintain the consistency of databases in the presence of redundant specification, the derived functions in the conceptual schema are identified, and updates on derived functions are performed in a manner consistent with their derivations. An interactive design aid is developed to facilitate the identification of derived functions. Algorithms are developed of derived functions. Algorithms are developed that perform updates in a side-effect-free manner.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367473","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 concept of loose coupling of artificial intelligence systems and database systems is defined. The issues that arise in determining the scope of loose integration are identified. A cache-based architecture being implemented in a knowledge management system project is described. The objective is to develop an interface that is useful for generalized database access from an expert system.<>
{"title":"Does loose AI-DBMS coupling stand a chance?","authors":"A. Sheth","doi":"10.1109/ICDE.1989.47221","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47221","url":null,"abstract":"The concept of loose coupling of artificial intelligence systems and database systems is defined. The issues that arise in determining the scope of loose integration are identified. A cache-based architecture being implemented in a knowledge management system project is described. The objective is to develop an interface that is useful for generalized database access from an expert system.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133873279","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}
A dynamic voting scheme is presented that enhances the availability of replicated files in a distributed system in the presence of network partitions. In such situations, the proposed scheme maintains consistency of replicated files by imposing the following constraint; a node can commit a file update only if its current enclosing group is a majority of the nodes that participated in the most recent update on the file. Thus, the number of nodes that constitutes a majority is reduced dynamically upon successive partitions. Compared to other dynamic voting schemes, the proposed scheme provides higher availability by taking into account partitions that occur between successive file updates. Towards this end, each node maintains, for each file copy, a view of the network in terms of partition groups. When a file update is attempted, the node updates its view by taking into account partitions occurred since previous update. It refines the view, further using views held by other reachable nodes. Another merit of the proposed scheme is that it does not require failures and repairs of links and nodes to be detected instantaneously by all nodes. Different nodes may have different views of the network at any time.<>
{"title":"A scheme for maintaining consistency and availability of replicated files in a partitioned distributed system","authors":"Jian Tang, N. Natarajan","doi":"10.1109/ICDE.1989.47259","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47259","url":null,"abstract":"A dynamic voting scheme is presented that enhances the availability of replicated files in a distributed system in the presence of network partitions. In such situations, the proposed scheme maintains consistency of replicated files by imposing the following constraint; a node can commit a file update only if its current enclosing group is a majority of the nodes that participated in the most recent update on the file. Thus, the number of nodes that constitutes a majority is reduced dynamically upon successive partitions. Compared to other dynamic voting schemes, the proposed scheme provides higher availability by taking into account partitions that occur between successive file updates. Towards this end, each node maintains, for each file copy, a view of the network in terms of partition groups. When a file update is attempted, the node updates its view by taking into account partitions occurred since previous update. It refines the view, further using views held by other reachable nodes. Another merit of the proposed scheme is that it does not require failures and repairs of links and nodes to be detected instantaneously by all nodes. Different nodes may have different views of the network at any time.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133499696","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 external index mechanism for generating hypotheses in a data-driven object recognition system has been designed, implemented, and tested. The index serves to improve the speed of recognizing objects in a scene. A secondary memory implementation of this approach is discussed. The philosophy behind the present conception of image databases is quite different from that of other researchers in that image interpretation is relied on as the backbone of this approach.<>
{"title":"A pictorial index mechanism for model-based matching","authors":"W. Grosky, Peter Neo, R. Mehrotra","doi":"10.1109/ICDE.1989.47213","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47213","url":null,"abstract":"An external index mechanism for generating hypotheses in a data-driven object recognition system has been designed, implemented, and tested. The index serves to improve the speed of recognizing objects in a scene. A secondary memory implementation of this approach is discussed. The philosophy behind the present conception of image databases is quite different from that of other researchers in that image interpretation is relied on as the backbone of this approach.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126969030","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}
Integration technologies for parallel computing are discussed. Requirements imposed by the need to properly interconnect large numbers of processing elements are emphasized. Four topics discussed as cornerstones in the field of parallel computing are programmability, communication network design, reliable operation, and performance evaluation and benchmarking.<>
{"title":"Parallel computing; one opportunity, four challenges","authors":"J. Gaudiot","doi":"10.1109/ICDE.1989.47252","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47252","url":null,"abstract":"Integration technologies for parallel computing are discussed. Requirements imposed by the need to properly interconnect large numbers of processing elements are emphasized. Four topics discussed as cornerstones in the field of parallel computing are programmability, communication network design, reliable operation, and performance evaluation and benchmarking.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127335972","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}
Generic requirements are discussed for a CASE (computer-aided software engineering) database based on a study, performed in a programming-in-the-large environment, of a project which involves the interaction of thousands of software developers and over a million lines of source code and other related design objects. The discussion covers data modeling in software engineering and version control, as well as briefly touching on composite/complex object management, object servers, long transactions, and seamless query processing.<>
{"title":"Generic computer aided software engineering (CASE) databases requirements","authors":"D. Hsieh","doi":"10.1109/ICDE.1989.47245","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47245","url":null,"abstract":"Generic requirements are discussed for a CASE (computer-aided software engineering) database based on a study, performed in a programming-in-the-large environment, of a project which involves the interaction of thousands of software developers and over a million lines of source code and other related design objects. The discussion covers data modeling in software engineering and version control, as well as briefly touching on composite/complex object management, object servers, long transactions, and seamless query processing.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127633966","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}
A performance model of buffer management is presented that is appropriate for use in the context of a multilayer database performance model. Some empirical evidence that supports the model's hypothesis that database page references are Bradford-Zipf-distributed is provided. A validation of the buffer performance model against data from a real-life environment is reported. Overall, the database buffer management model proposed has accuracy commensurate with that of the other components of multilayer database performance models, yet it does not require extensive parametrization or excessive computation.<>
{"title":"A buffer management model for use in predicting overall database system performance","authors":"Ignacio R. Casas, K. Sevcik","doi":"10.1109/ICDE.1989.47250","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47250","url":null,"abstract":"A performance model of buffer management is presented that is appropriate for use in the context of a multilayer database performance model. Some empirical evidence that supports the model's hypothesis that database page references are Bradford-Zipf-distributed is provided. A validation of the buffer performance model against data from a real-life environment is reported. Overall, the database buffer management model proposed has accuracy commensurate with that of the other components of multilayer database performance models, yet it does not require extensive parametrization or excessive computation.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129687959","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
扫码关注我们
求助内容：
应助结果提醒方式：