{"title":"Parallelizing a Database Programming Language","authors":"B. Hart, S. Danforth, P. Valduriez","doi":"10.1109/DPDS.1988.675004","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675004","url":null,"abstract":"We extend distributed database query optimization techniques to support a database programming language, a language much richer than relational query languages. With the richness comes difficulties, e.g., how to recognize joins and how to handle aliases. In this paper we describe our techniques: dataflow analysis, abstract evaluation, partial evaluation, and rewriting. Also, we overview the algorithm that uses these techniques.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127181874","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":"Performance Modeling of Distributed Object-Oriented Database Systems","authors":"J. Brumfield, J. Miller, H. Chou","doi":"10.1109/DPDS.1988.674999","DOIUrl":"https://doi.org/10.1109/DPDS.1988.674999","url":null,"abstract":"A simulation model has been designed to evaluate the performance of distributed object-oriented database systems. By adjusting parameters, a variety of different hardware configurations and workloads can be represented. The model has been used to study a number of performance issues relating to ORION-2, a distributed object-oriented database system being developed by the Advanced Computer Architecture Program at MCC. Experiments show that the central server or the local area network can be a performance bottleneck.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123686155","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 Robust: Protocol For Parallel Join Operation In Distributed Data Bases","authors":"S. Bandyopadhyay","doi":"10.1109/DPDS.1988.675007","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675007","url":null,"abstract":"Fault tolerant distributed databases use replicated data(e.g., record or relation) to handle failures of one or more nodes in a computer network. Efficient and economic access strategies for such data bases have not been investigated. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied. It has been shown that, for a local area network based on a binary hypercube, having 2r nodes where every data is replicated r times, in the absence of faults, any query involving an arbitrary sequence of joins R1 @@@@ R2 @@@@ … @@@@ Rn, n ≤ r, may be performed by repeatedly executing joins in a distributed fashion using n node disjoint paths from n/2 distinct sites of database operations to n arbitrary sites containing a target relation each. This protocol also solves the problem of materialization of relations. In the presence of up to r-2 faults, the protocol still guarantees N node disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134407032","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":"Exploiting Concurrency in a DBMS Implementation for Production Systems","authors":"L. Raschid, T. Sellis, Chih-Chen Lin","doi":"10.1109/DPDS.1988.675000","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675000","url":null,"abstract":"An important aspect of integration of AI and DBMS technology is identifying functional similarities in database processing and reasoning with rules. In this paper, we focus on applying concurrency techniques to rule-based production systems. We tailor DBMS concurrent execution to a production system environment and investigate the resulting concurrent execution strategies for productions. This research is in conjunction with a novel DBMS mechanism for testing if the left hand side conditions of productions are satisfied. This set-oriented mechanism uses a special data structure implemented using relational tables. To demonstrate the equivalence of a serial and a concurrent (interleaved) execution strategy, for a set of productions, we assume a locking scheme to enforce serializability and specify what locks must be obtained. We define a logical commit point for a production. After this point the execution of a production is independent of all other (executing) productions. We compare the number of possible serial and parallel execution schedules.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129276661","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":"The Relation Between Problems in Large-Scale Concurrent Systems and Distributed Databases","authors":"G. Agha","doi":"10.1109/DPDS.1988.674997","DOIUrl":"https://doi.org/10.1109/DPDS.1988.674997","url":null,"abstract":"We first describes the state of the art in models of concurrency. The models are analyzed along two dimensions: communication and computation. The paper then discusses some problems which make it difficult to realize large-scale concurrent systems. Such problems include compositionality, heterogeneity, debugging, resource management, and concurrency control. Some useful comparisons are drawn to problems in distributed databases and it is argued that solutions to these problems cross disciplinary boundaries. Finally, the paper discusses trends in building concurrent computers and provides some expectations for the future.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121993558","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":"Node Autonomy In Distributed Systems","authors":"H. Garcia-Molina, B. Kogan","doi":"10.1109/DPDS.1988.675012","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675012","url":null,"abstract":"The goal of this paper is to explore the notion of node autonomy in distributed computer systems. Some motivations for autonomy are exposed. Different facets of autonomy as well as relationships among them are discussed. Finally, we look into how autonomy affects other aspects of distributed computing, including timeliness, correctness, load sharing, data sharing, and data replication.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121672992","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":"Sharing The Load Of Logic-program Evaluation","authors":"O. Wolfson","doi":"10.1109/DPDS.1988.675001","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675001","url":null,"abstract":"We propose a method of parallelizing bottom-up-evaluation of logic programs. The method does not introduce interprocess communication, or synchronization overhead. We demonstrate that it can be applied when evaluating several classes of logic programs, e.g., the class of linear single rule programs. This extends the work reported in [WS] by significantly expanding the classes of logic programs that can be evaluated in parallel. We also prove that there are classes of programs to which the parallelization method cannot be applied.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133795945","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}
P. Agrawal, D. Bitton, Keh-Chang Guh, C. Liu, Clement T. Yu
{"title":"A Case Study For Distributed Query Processing","authors":"P. Agrawal, D. Bitton, Keh-Chang Guh, C. Liu, Clement T. Yu","doi":"10.1109/DPDS.1988.675009","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675009","url":null,"abstract":"(i) (ii) (is) In the integrated strategy, one component decides which relation should remain fragmented at different sites. The other component decides which local operations, selections and projections, should be performed before the join operations. Our experimental results reveal that the choices made by the integrated algorithm in deciding which relation should remain fragmented and which local operations to be performed are valid. More precisely , the response times of queries processed by the algorithm are lower than those of the same queries processed using other strategies. These experimental results agree with the analytic cost model which we have previously proposed [YGC87]. In addition, our experiments provide insight on the relative cost VO, network, and processing cost in a real environment. This enables us to identify timeconsuming operations in distributed query processing, and suggest ways to improve perforniance.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123438473","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":"Reliable servers:Design and implementation in Avalon/C++","authors":"R. Lerner","doi":"10.1109/DPDS.1988.674998","DOIUrl":"https://doi.org/10.1109/DPDS.1988.674998","url":null,"abstract":"Avalon/C++ is a programming language that supports the construction of reliable programs consisting of a set of servers communicating over a network. It provides high-level language support for user-defined data types with customized synchronization and fault-tolerance properties. These data types are encapsulated in servers, and accessed through exported server operations. Avalon/C++ greatly simplifies the programming of these servers by hiding the distributed nature of a server from both the implementor and callers of a server. Avalon/C++ exploits the similarity of servers and classes, making server definition and use look like that for C++ classes. A detailed description is given of a typical Avalon/C++ server, the catalog server, which is used by clients to locate servers.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114207868","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":"VIP-MDBS: A Logic Multidatabase System","authors":"E. Kühn, T. Ludwig","doi":"10.1109/DPDS.1988.675015","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675015","url":null,"abstract":"We present a multidatabase management system built in Vienna Integrated Prolog (VIP) for cooperative management of autonomous databases. Data in different databases may differ with respect to naming, structures and value types. VIP-MDBS (VIP MultiDataBase System) allows the ability to manipulate them jointly and in a non-procedural way. Its features are similar to those of the relational multidatabase language MSQL, but adapted to logic programming. We introduce the concept of so-called semantic relations, a concept which stems from the extension of global views by deductiveness. VIP-MDBS allows for representation of intentional data and formulation of recursive multiple queries.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129554357","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}