By Topic

Databases in Parallel and Distributed Systems, 1990, Proceedings. Second International Symposium on

Date 2-4 July 1990

Filter Results

Displaying Results 1 - 19 of 19
  • Proceedings. Second International Symposium on Databases in Parallel and Distributed Systems (Cat. No.90CH2895-1)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • A parallel execution model for a database machine with high performances

    Publication Year: 1990, Page(s):56 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    A mixed MIMD/SIMD execution model for a reconfigurable computer is presented. This model is adapted to the use of a specialized associative coprocessor embedded in this host machine. A main characteristic of the model is that it uses four types of processes (decoding, calculus, coprocessor communication and transaction manager) and that in principle one process of each type is allowed on each proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Retrieval performance of a distributed text database utilizing a parallel processor document server

    Publication Year: 1990, Page(s):71 - 79
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Text retrieval systems which store extremely large amounts of text while providing a multiuser retrieval service for a large customer base are discussed. Due to the severe I/O demands of such a system, it is usually beneficial, if not necessary to utilize a multiprocessor system with multiple I/O facilities in an effort to increase the parallel I/O activity, the objective being to lower search res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voting class-an approach to achieving high availability for replicated data

    Publication Year: 1990, Page(s):146 - 156
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    An approach to the design of replica control schemes which can provide higher availability than currently existing voting schemes is proposed. The approach is based on the observation that the existing voting schemes actually belong to a general class, called voting class. This class of voting schemes can be represented in a very simple and uniform way. Thus, a designer can choose the optimal sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel algorithms for functional dependency manipulations

    Publication Year: 1990, Page(s):126 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Given a set of functional dependencies Σ and a single dependency σ, it is shown that the algorithm to test whether Σ implies σ is log-space complete in P. The functional dependencies Σ are represented as a directed hypergraph HΣ. A parallel algorithm is presented which solves the above implication problem using P processors ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelism in relational data base systems: architectural issues and design approaches

    Publication Year: 1990, Page(s):4 - 29
    Cited by:  Papers (25)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1732 KB)

    The issues and solutions relation to intra-query parallelism in a relational DBMS (database management systems) supporting SQL are addressed. A broad framework for the study of the numerous issues that need to be addressed in supporting parallelism efficiently and flexibly is provided. The impact that parallelization of complex queries has on short transactions which have stringent response time c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • JOYCE+: model and language for multi-site distributed systems

    Publication Year: 1990, Page(s):160 - 170
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    The JOYCE+ model for multisite distributed systems is presented and the operational semantic of the asynchronous communication between processes is illustrated with Petri nets. The syntax of the JOYCE+ language is presented in terms of the Guarded Commands language. The expressive power of the JOYCE+ language in distributed synchronization problems with timeout handling is illustrated through exam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical approach to concurrency control for multidatabases

    Publication Year: 1990, Page(s):202 - 210
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Hierarchical concurrency control has been proposed as one possible approach for multidatabase systems. However, to apply this approach, some restrictions must be imposed on the local concurrency control algorithms. The restriction is identified. Based on this restriction, the hierarchical concurrency control approach is formalized and its correctness is proven. A novel global concurrency control a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An effective algorithm for parallelizing sort merge joins in the presence of data skew

    Publication Year: 1990, Page(s):103 - 115
    Cited by:  Papers (21)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    A parallel sort-merge-join algorithm that uses a divide-and-conquer approach to address the data skew problem is proposed. The algorithm adds an extra scheduling phase to the usual sort, transfer and join phases. During the scheduling phase, a parallelizable optimization algorithm, using the output of the sort phase, attempts to balance the load across the multiple processors in the subsequent joi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards an efficient management of objects in a distributed environment

    Publication Year: 1990, Page(s):181 - 190
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A prototype of an object-oriented system implemented in CProlog is described. Its main objective is to demonstrate system features that would support efficient management of objects and object-oriented databases in a persistent and distributed environment. Mechanisms at the low level of the system were considered to support object distribution, mobility control and configuration management in a si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experimental performance study of a pipelined recursive query processing strategy

    Publication Year: 1990, Page(s):30 - 43
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    The run-time performance of a strategy (previously proposed by the authors, J. Shao et al., 1989) for processing recursive queries in deductive database system is studied. The algorithm, introduced informally by examples, is coded in occam2 and runs on a network of transputers. A wide range of recursive queries and database structures are used as benchmarks. Both the speedup factors achieved and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel handling of integrity constraints on fragmented relations

    Publication Year: 1990, Page(s):138 - 145
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A short introduction to the important aspects of the PRISMA DBMS (database management system) and to the notation and terminology used is presented. It is shown how integrity constraints formulated in terms of global relations can be translated into a fragmented form. The strategy for constraint enforcement at a conceptual level is discussed. The implementation issues for this strategy are discuss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concepts and methods for the optimization of distributed data processing

    Publication Year: 1990, Page(s):171 - 180
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    A model of distributed data processing is introduced and discussed. For this purpose, a typical application system is analyzed and divided into subapplications. To fulfil the task of the global application, the subapplications must communicate in an appropriate manner by exchanging data. In the proposed model the communication between subapplications is split up into two steps: the offering of inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correcting execution of distributed queries

    Publication Year: 1990, Page(s):192 - 201
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    A low overhead delay method for deciding when to correct a strategy is presented. Sampling is used to estimate the size relations and alternative heuristic strategies prepared in a background mode are used to decide when to correct. Correction is made only if lower overall delay is achieved, including correction time. Evaluation using a model of a distributed database indicates that the heuristic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using join operations as reducers in distributed query processing

    Publication Year: 1990, Page(s):116 - 123
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Semijoin has traditionally been relied upon for reducing the communication cost required for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the communication cost. In view of this fact, the approach of using join operations, in addition to semijoins, as reducers in distributed query processing is explored. It is shown that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outerjoin optimization in multidatabase systems

    Publication Year: 1990, Page(s):211 - 218
    Cited by:  Papers (11)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    Outerjoin is used in distributed relational multidatabase systems for integrating local schemas to a global schema. Queries against the global schema need to be modified, optimized, and decomposed into subqueries at local sites for processing. Since outerjoin combines local relations in different databases to form a global relation, it is expensive to process. Based on the structure of the query a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-join on parallel processors

    Publication Year: 1990, Page(s):92 - 102
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A preliminary evaluation of some multijoin strategies and their performances on parallel hardware is described. The hardware used was a Sequent (under Unix) with 11 usable processors, each with shared and private primary memory. A multijoin was broken down into a series of single joins which were then allocated to clusters, each cluster being a collection of parallel processors. The results of sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of functional disk system with nonuniform data distribution

    Publication Year: 1990, Page(s):80 - 89
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    The performance of a functional disk system with relational database engine (FDS-RII) for a nonuniform data distribution is analyzed. FDS-RII is a relational storage system, designed to accelerate relational algebraic operations which uses a hash-based algorithm to process relational operations. In the has-based algorithm, a relation is first partitioned into several clusters by a split function. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transitive closure and magic functions machine

    Publication Year: 1990, Page(s):44 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    An extended version of the SIMD (single-instruction, multiple-data) relational algebraic processor is presented. In addition to the usual relational and set operations the machine has the ability to recycle its responder sets internally. This allows it to perform repeated joins, for example, without external intervention and so achieve operations such as path discovery and transitive closure in gr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.