{"title":"How to handle global transactions in heterogeneous database systems","authors":"Peter Muth, W. Klas, E. Neuhold","doi":"10.1109/RIDE.1992.227406","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227406","url":null,"abstract":"One of the most important problems in the field of integrated heterogeneous database systems is transaction management. It is not sufficient to integrate only data models and query languages. In order to provide equivalent access to integrated heterogeneous databases as to homogeneous databases, a global transaction management is required. The authors discuss several aspects of transaction management for heterogeneous database systems. Even though different existing database systems are involved in the execution of most transactions, global serializability and recoverability is required. The authors propose a three-level transaction model. At the top- and middle-level, the semantics of operations are used in order to achieve a high degree of concurrency. For bottom-level transactions, their model allows the use of transaction managers of existing systems without changes. If no autonomous local transactions are allowed, the model provides global transactions with full serializability and recoverability.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133932594","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}
{"title":"Site partitioning for distributed redundant disk arrays","authors":"A. Mourad, W. Fuchs, D. Saab","doi":"10.1109/RIDE.1992.227403","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227403","url":null,"abstract":"Redundant disk arrays are used for the purpose of providing reliable storage while increasing the I/O bandwidth in high performance systems. Redundant disk arrays can also be used in a distributed setting to increase availability in the presence of temporary site failures or major disasters. The data at each site is partitioned into blocks and data blocks from different sites are grouped into a parity group. The bitwise parity of the data blocks in each parity group is computed and written at a different site. The authors look at the problem of partitioning a large distributed storage system into fixed size redundant arrays in such a way as to minimize the cost of remote accesses that have to be performed to update the parity information. They model the distributed computing system by an undirected connected graph G=(V,E) where V is the set of sites and each edge e in E represents a bidirectional link between two sites.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114832649","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}
{"title":"Chained declustering: load balancing and robustness to skew and failures","authors":"L. Golubchik, John C.S. Lui, R. Muntz","doi":"10.1109/RIDE.1992.227420","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227420","url":null,"abstract":"There has been considerable research concerning the use of arrays of disks in solving I/O bottleneck problems, where high availability of data is achieved through some form of data redundancy, e.g. mirroring. This paper investigates the degree to which a dynamic load balancing disk scheduling algorithm in conjunction with chained declustering, an alternative to the classical mirroring scheme, can respond robustly to variations in workload and disk failures. Specifically, it defines and investigates the behavior of two dynamic scheduling algorithms under various workload distributions and disk failure. It demonstrates that using a simple dynamic scheduling algorithm can greatly improved the average response time compared with static load balancing.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115333650","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}
T. Bowen, Robert M. Fleischman, G. Herman, Kuo Chi Lee, W. Mansfield
{"title":"The Datacycle architecture and research prototype","authors":"T. Bowen, Robert M. Fleischman, G. Herman, Kuo Chi Lee, W. Mansfield","doi":"10.1109/RIDE.1992.227418","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227418","url":null,"abstract":"Research on the Datacycle architecture attempts to achieve, in a single architecture, the goals of high performance transaction processing, a powerful and flexible query capability, and high levels of concurrent access to a single database by multiple applications. The Datacycle architecture meets these goals by providing independent structuring and scaling of processing resources, both for processing individual queries (intra-query parallelism) and for overall throughput (inter-transaction parallelism). This paper describes the experimental Datacycle research prototype implemented at Bellcore. Building the prototype forced us to identify and overcome a number of key engineering and implementation issues and provides a better understanding of the value of this approach to database architecture.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124211024","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}
{"title":"Real-time transaction processing: pessimistic, optimistic, and hybrid approaches","authors":"S. Son, Juhnyoung Lee, Savita Shamsunder","doi":"10.1109/RIDE.1992.227397","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227397","url":null,"abstract":"A real-time database system (RTDBS) differs from a conventional database system because in addition to the consistency constraints of the database, timing constraints of individual transaction need to be satisfied. To provide real-time response for queries and update while maintaining the consistency of data, real-time concurrency control should involve efficient integration of the ideas from both database concurrency control and real-time scheduling. The authors proposed hybrid real-time concurrency control protocols which combine pessimistic and optimistic approaches to concurrency control in order to control blocking and aborting in a more effective manner.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116038514","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}
{"title":"A framework for multiple-query optimization","authors":"Jamal R. Alsabbagh, Vijay V. Raghavan","doi":"10.1109/RIDE.1992.227411","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227411","url":null,"abstract":"Certain computations that may arise repeatedly during the simultaneous processing of multiple queries offer an opportunity for amortizing the processing costs. This paper classifies the types of common computations that can arise, develops methods for exploiting them, and proposes ways for detecting them. It outlines a framework developed for the optimal interleaved processing of multiple queries in relational DBMS.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130330365","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}