By Topic

Parallel and Distributed Information Systems, 1991., Proceedings of the First International Conference on

Date 4-6 Dec. 1991

Filter Results

Displaying Results 1 - 25 of 43
  • Proceedings of the First International Conference on Parallel and Distributed Information Systems (Cat. No.91TH0393-4)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • Comparative performance of parallel join algorithms

    Publication Year: 1991, Page(s):78 - 88
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    The authors recently (1990, 1991) described two new join algorithms designed to address the data skew problem. These algorithms were based, respectively, on the traditional sort merge and hash join algorithms, and employed techniques borrowed from mathematical optimization theory. The current paper proposes significant improvements to both algorithms, increasing their effectiveness while simultane... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dataflow query execution in a parallel main-memory environment

    Publication Year: 1991, Page(s):68 - 77
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    The performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results are a step in the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others, synchronization issues are identified to limit the performance gain from parallelism. A new hash-join algorithm, called pipelining hash-j... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive parallel hash join in main-memory databases

    Publication Year: 1991, Page(s):58 - 67
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    Presents an algorithm for parallel hash-join computation on main-memory databases that adapts to data skew, and its implementation on the IBM RP3 multiprocessor. The algorithm exploits the random access capabilities of main memory databases to detect and counteract skew on the fly. Data skew is detected at run time by monitoring the observed frequencies of values of the join attribute and applying... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple wavefront algorithms for pattern-based processing of object-oriented databases

    Publication Year: 1991, Page(s):46 - 55
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    The authors have show previously (1989, 1991) that processing OODBs can be viewed as the manipulation of patterns of object associations. Parallel, multiple wavefront algorithms based on an identification approach for verifying association patterns have been introduced. The current paper presents an elimination approach for processing OODBs. The new approach allows more processors to operate concu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling control into database queries for parallel execution management

    Publication Year: 1991, Page(s):271 - 279
    Cited by:  Papers (3)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Parallel execution of database queries in a shared nothing multiprocessor environment, needs control mechanisms which guarantee a correct global execution of each query. In the authors system, the control is integrated into the query code at compile time. According to the required schedule for the query, the compilation process combines a set of basic control operations into a control graph mapped... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing highly parallel applications using database programming concepts

    Publication Year: 1991, Page(s):38 - 45
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The paper presents the specification language Vista, which incorporates a new parallel programming model strongly influenced by concepts originating in the field of object oriented database programming. Before introducing Vista, it first gives a brief overview of the problems related to existing parallel programming models, and shows that support for a higher level of abstraction is necessary. Fol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interconnecting shared-everything systems for efficient parallel query processing

    Publication Year: 1991, Page(s):262 - 270
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The most debated architectures for parallel database processing are Shared Nothing (SN) and Shared Everything (SE) structures. Although SN is considered to be most scalable, it is very sensitive to the data skew problem. On the other hand, SE allows the collaborating processors to share the work load more efficiently. It, however, suffers from the limitation of the memory and disk I/O band-width. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance issues of object-based buffering

    Publication Year: 1991, Page(s):30 - 37
    Cited by:  Papers (4)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Due to the nature of supported applications, object-oriented DBMSs need efficient mechanisms for the retrieval of complex objects and the navigation along semantic links among objects. Object clustering is effective when the primary access pattern follows the primary relationship used for clustering, but not so effective when multiple relationships are involved. Object buffering provides a possibl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient method for distributing search structures

    Publication Year: 1991, Page(s):159 - 166
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The paper presents a method for distributing search structures which have an index in shared memory multiprocessor multi-disk systems. It is shown that in comparison with currently used distribution methods, the new method generates distributed search structures having a much lower main memory space requirement, similar parallel execution capabilities, a similar execution cost per operation, and a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data partition: a practical parallel evaluation of datalog programs

    Publication Year: 1991, Page(s):98 - 105
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The authors analyse previous parallel evaluation strategies based on the partition of rule instantiations. They present a parallel evaluation strategy for general Datalog programs that is based on the partition of data and is more practical. A key issue is to determine a criterion of data transmission that reduces the amount of data transmitted and is tested efficiently. A notion of potential usef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prototyping DBS3, a shared-memory parallel database system

    Publication Year: 1991, Page(s):226 - 234
    Cited by:  Papers (11)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    DBS3 is a database system with extended relational capabilities designed for a shared-memory multiprocessor. This paper presents the design choices, architecture and performance evaluation of the current DBS3 prototype. The major contributions of DBS3 are: a parallel dataflow execution model based on data declustering, the compile-time optimization of both independent and pipelined parallelism, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing algorithms for parallel database processing on shared memory multiprocessors

    Publication Year: 1991, Page(s):210 - 217
    Cited by:  Papers (2)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    This paper describes new load balancing algorithms for parallel database processing on shared memory multiprocessors. The goal of load balancing is to reduce overhead as well as load imbalance, but there is a tradeoff between them in ordinary algorithms. Unfortunately, optimum performance can hardly be obtained using ordinary algorithms because their performances depend on several factors such as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Service interface and replica management algorithm for mobile file system clients

    Publication Year: 1991, Page(s):190 - 197
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Portable computers are now common, a fact that raises the possibility that file service clients might move on a regular basis. This new development requires rethinking some features of distributed file system design. The authors argue that existing approaches to file replica management would not cope well with the likely behavior of mobile clients, and they present their solution; a lazy server-ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal all-to-all broadcasting schemes in distributed systems

    Publication Year: 1991, Page(s):253 - 260
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Broadcasting, which refers to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcasting means the process by which every node broadcasts its certain piece of information to all other nodes. The authors develop optimal all-to-al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance study of three high availability data replication strategies

    Publication Year: 1991, Page(s):18 - 28
    Cited by:  Papers (8)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1068 KB)

    The paper studies the relative performance of chained declustering, mirrored disks, and interleaved declustering, in a shared nothing database machine environment. In particular, it examines the relative performance of the three strategies when no failures have occurred, the effect of load imbalance caused by a disk or processor failure on system throughput and response time, and the tradeoff betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAT: an execution model for concurrent full text search

    Publication Year: 1991, Page(s):151 - 158
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    An execution model based on concurrent frame signature file (CAT) is proposed for full text retrieval. The proposed method places emphasis on creating opportunities for concurrent access to the signature file, which resides on disks, without resorting to redundant storage. Thus, the advantage of low space overhead availed by signature file methods is retained, while the response time of retrieval ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Marker-passing on a parallel knowledge processing testbed

    Publication Year: 1991
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    The authors have been experimenting with knowledge representation and reasoning mechanisms suitable for parallel computation. Their primary domain is natural language understanding (NLU) using a semantic network representation and parallel marker-passing techniques. They have implemented a multiprocessor called the Semantic Network Array Processor (SNAP-1) for real-time processing of moderately-si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing datalog: function symbols make a difference

    Publication Year: 1991, Page(s):90 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    A Datalog program consists of function-free Horn clause rules. There are, however, some situations described more easily and more naturally by the use of general terms as arguments. A term is built up from variables, constants, and function symbols. A set of rules where the rules may contain function symbols is called a DatalogFun program. The paper discusses parallel processing of deco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel sorting on a shared-nothing architecture using probabilistic splitting

    Publication Year: 1991, Page(s):280 - 291
    Cited by:  Papers (19)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    The authors consider the problem of external sorting in a shared-nothing multiprocessor. A critical step in the algorithms the authors consider is to determine the range of sort keys to be handled by each processor. They consider two techniques for determining these ranges of sort keys: exact splitting, using a parallel version of the algorithm proposed by Iyer, Ricard, and Varman; and probabilist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Populating databases from multiple sources-the Hubble space telescope paradigm

    Publication Year: 1991
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Summary form only given. The Hubble space telescope (HST) Ingest program reads files representing external database tables of any topology, normalizes or joins the tables to the HST catalog database topology, parses and converts data values, and writes the tuples to the HST catalog. Ingest is driven by translation tables defining the interdatabase mapping and can be altered on-the-fly. Ingest has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining rule decomposition and data partitioning in parallel datalog program processing

    Publication Year: 1991, Page(s):106 - 115
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    There are two approaches to processing Datalog programs in parallel. One is to decompose the rules of a program into concurrent modules, and then assign them to processors. The other is to partition data between processors, so that each processor evaluates the same program, but with less data. The authors propose a third approach which combines the two methods in a single framework. In this approa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed catalog for heterogeneous distributed database resources

    Publication Year: 1991, Page(s):236 - 244
    Cited by:  Papers (2)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    To support a distributed, heterogeneous computing environment, an inter-system catalog protocol is needed so that remote resources can be located, used, and maintained with little human intervention. This paper describes a scalable catalog framework, which is an extension of previous work in a distributed relational DBMS research prototype called R*. This work builds on the R* concepts to accommod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of parallel query execution plans in XPRS

    Publication Year: 1991, Page(s):218 - 225
    Cited by:  Papers (28)  |  Patents (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The authors describe their approach to the optimization of query execution plans in XPRS, a multi-user parallel database machine based on a shared-memory multi-processor and a disk array. The main difficulties in this optimization problem are the compile-time unknown parameters such as available buffer size and number of free processors, and the enormous search space of possible parallel plans. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Policies for efficient memory utilization in a remote caching architecture

    Publication Year: 1991, Page(s):198 - 207
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The high performance networks in modern distributed systems enable a site to obtain cached objects from the main memory of other sites more quickly than the time needed to access local disks. In this environment, efficient mechanisms can be devised to support rapid request/response exchanges for objects that reside on remote sites. As a result, it becomes possible to use remote memory as an additi... View full abstract»

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