{"title":"Efficient support for partial write operations in replicated databases","authors":"M. Rabinovich, Ed Lazowska","doi":"10.1109/ICDE.1994.283005","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283005","url":null,"abstract":"We present a new replica control technique targeted at replicated systems in which write operations update a portion of the information in the data item rather than replacing it entirely. The existing protocols capable of supporting partial writes must either perform the writes on all accessible replicas of the data item, or always apply the writes to the same group (quorum set) of replicas. In the former case, the system incurs high message overhead. In the latter case, if any of the replicas in this group fail, additional replicas must be synchronously brought up-to-date during the write operation causing delay to the operation. Also, in both cases, the system loses the advantage of load sharing provided by replication. Our protocol avoids performing the write on all nodes while preserving load sharing and reducing greatly the risk of having to propagate updates synchronously. We describe the protocol, prove it correct, and present a comparative performance study of our protocol and the existing alternatives.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124908885","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":"Disk allocation methods for parallelizing grid files","authors":"Yvonne Zhou, S. Shekhar, Mark Coyle","doi":"10.1109/ICDE.1994.283037","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283037","url":null,"abstract":"The grid file is a well known access method for multi-dimensional and spatial data. The response time needed to process path and range queries on the grid file access method can be improved significantly by distributing the data pages over multiple disks. The paper explores the disk allocation methods used to allocate the data pages of grid file among a set of disks, which can be accessed in parallel. Given N disks, a perfect allocation will speed up the processing of each query by a factor of N in this environment. The authors show that no disk allocation is perfect for the set of all orthogonal range queries, even on uniformly distributed read-only data. They then introduce two families of allocation methods, namely the Linear allocation method and the Lattice allocation method, which are perfect for a large collection of interesting path queries (rows, columns, diagonals, anti-diagonals) and range queries (small rectangles), on an interesting set of data distributions. They address the issues in extending disk allocation methods to general data distributions with random updates. Finally, they provide experimental results on the performance of the proposed methods and other well known disk allocation methods on different query sets, data distributions and data set sizes.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572138","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":"Discovering database summaries through refinements of fuzzy hypotheses","authors":"Doheon Lee, Myoung-Ho Kim","doi":"10.1109/ICDE.1994.283034","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283034","url":null,"abstract":"Recently, many applications such as scientific databases and decision supporting systems that require comprehensive analysis of a very large amount of data, have been evolved. Summary discovery techniques, which extract compact representations grasping the meanings of large databases, can play a major role in those applications. We present an effective and robust method to discover simple linguistic summaries. We first propose a hypothesis refinement algorithm that is a key technique for our summary discovery method. Using the algorithm, a formal procedure for summary discovery is presented together with an illustrative example. Our discovery method can handle both rigid concepts and fuzzy concepts that occur frequently in practice. Discovered summaries can also be regarded as high-level interattribute dependencies.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"18 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116817188","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":"Data management in delayed conferencing","authors":"A. Hsu","doi":"10.1109/ICDE.1994.283058","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283058","url":null,"abstract":"Abstract only given, as follows. Video conferencing has become an alternative way to get people to communicate with each other without having to travel long distances. Though it has proven to be very useful in many occasions, in order to have a successful video conference, (1) it requires preliminary scheduling to have all involved parties present at the same time, (2) all parties need to be fully prepared and give quick responses to minimise expensive \"dead space\", and (3) there never seems to be enough communication bandwidth. Of course, as is common in most conference settings, people inevitably try to rush for conclusions near the end. With the above in mind, we are developing new data management techniques to conduct video conferences in which all parties need not be present at the same time, people can communicate at their own pace, and network bandwidth is utilized more effectively. We briefly describe the basic ideas behind such a system and show a prototype system.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"73 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128032596","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":"Transactional workflow management in distributed object computing environments","authors":"Dimitrios Georgakopoulos","doi":"10.1109/ICDE.1994.283079","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283079","url":null,"abstract":"Focuses on transactional workflows, i.e., the advanced transaction technology required to (i) ensure the reliability of tasks in a workflow, and the correctness and reliability of concurrent workflows, and (ii) support the specification and management of extended transactions models. In addition, the author discusses research and development at GTE Laboratories to produce a Transaction Specification and Management Environment (TSME) that can satisfy such requirements. He also discusses the integration of DOM and TSME technologies.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131288139","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}
Shahram Ghandeharizadeh, David Wilhite, Kai-Ming Lin, Xiaoming Zhao
{"title":"Object placement in parallel object-oriented database systems","authors":"Shahram Ghandeharizadeh, David Wilhite, Kai-Ming Lin, Xiaoming Zhao","doi":"10.1109/ICDE.1994.283038","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283038","url":null,"abstract":"Parallelism is a viable solution to constructing high performance object-oriented database systems. In parallel systems based on a shared-nothing architecture, the database is horizontally declustered across multiple processors, enabling the system to employ multiple processors to speedup the execution time of a query. The placement of objects across the processors has a significant impact on the performance of queries that traverse a few objects. The paper describes and evaluates a greedy algorithm for the placement of objects across the processors of a system. Moreover, it describes two alternative availability strategies and quantifies their performance tradeoff using a trace-driven simulation study.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132936989","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":"Storage reclamation and reorganization in client-server persistent object stores","authors":"Voon-Fee Yong, J. Naughton, Jie-Bing Yu","doi":"10.1109/ICDE.1994.282998","DOIUrl":"https://doi.org/10.1109/ICDE.1994.282998","url":null,"abstract":"The authors develop and evaluate a number of storage reclamation algorithms for client-server persistent object stores. Experience with a detailed simulation and a prototype implementation in the Exodus storage manager shows that one of the proposed algorithms, the Incremental Partitioned Collector, is complete, maintains transaction semantics, and can be run incrementally and concurrently with client applications. Furthermore, it can significantly improve subsequent system performance by reclustering data, rendering it attractive even for systems that choose not to support automatic storage reclamation.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131858207","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":"Transactional workflows: research, enabling technologies and applications","authors":"A. Sheth","doi":"10.1109/ICDE.1994.283059","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283059","url":null,"abstract":"Abstract only given, as follows. Need to increase productivity and reduce cost have lead to reengineering and automation of operations across corporations. Some of the applications involve imaging, document processing and routing. These tasks can be effectively automated using current genre of workflow automation products. Some other applications involve tasks that can be modeled in client-server style using traditional transactions. These can be supported by distributed transaction processing/monitoring systems. Finally, there is an important class of more complicated applications that involve heterogeneous but automated tasks, with varying levels of transaction properties, and performed at heterogeneous systems. We look at three aspects of the emerging technology of transactional workflow management that aims to support such applications: Identify properties of a class of multi-system applications and the environments that can be supported by transactional workflow systems: Discuss how a transactional workflow management system is different from, but \"builds upon\" the current transaction processing and workflow automation technologies: Discuss some of the relevant database research as well as software system and application prototyping experiences, especially those related to the extended/relaxed transaction models. Much of the discussion is based on our study of some real (mostly telecommunications) applications, and research and prototyping done at Bellcore in collaboration with U. of Houston and MCC's Carnot project.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133281295","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":"On a more realistic lock contention model and its analysis","authors":"Alexander Thomasian","doi":"10.1109/ICDE.1994.283009","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283009","url":null,"abstract":"Most performance modeling studies of lock contention in transaction processing systems are deficient in that they postulate a homogeneous database access model. The non-homogeneous database access model described in this paper allows multiple transaction classes with different access patterns to the database regions. The performance of the system from the viewpoint of lock contention is analyzed in the context of the standard two-phase locking concurrency control method with the general waiting policy. The approximate analysis is based on mean values of parameters and derives expressions for the probability of lock conflict (usually leading to transaction blocking) and the mean blocking time. The latter requires estimating the distribution of the effective wait-depth encountered by blocked transactions and the mean waiting time associated with different blocking levels. The accuracy of the analysis is validated against simulation results and also shown to be more accurate than analytic solutions considering only two levels of transaction blocking. Previously proposed metrics for load control have limited applicability for the model under consideration.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124153335","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}
N. Ritter, B. Mitschang, T. Härder, Michael Gesmann, Harald Schöning
{"title":"Capturing design dynamics /spl minus/ the CONCORD approach","authors":"N. Ritter, B. Mitschang, T. Härder, Michael Gesmann, Harald Schöning","doi":"10.1109/ICDE.1994.283067","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283067","url":null,"abstract":"'Computer-Supported Cooperative Work' is a young research area considering applications with strong demands on database technology. Design applications need support for cooperation and some means for controlling their inherent dynamics. However, today's CAD systems consisting of a collection of diverse design tools typically do not support these requirements. Therefore, an encompassing processing model is needed that covers the overall design process in general as well as CAD-tool application in particular. The CONCORD model described in the paper, reflects the distinct properties of design process dynamics by distinguishing three levels of abstraction. The highest level supports application-specific cooperation control and design process administration, the second considers goal-oriented tool invocation and work-flow management while the third level provides tool processing of design data. To achieve level-spanning control, the authors rely on transactional facilities provided at the various system layers.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116082212","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}