[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems

20-22 Jan. 1993

Filter Results

Displaying Results 1 - 25 of 40
  • Proceedings of the Second International Conference on Parallel and Distributed Information Systems (Cat. No.93TH0493-7)

    Publication Year: 1993
    Request permission for commercial reuse | |PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Parallel features of NonStop SQL

    Publication Year: 1993, Page(s):69 - 70
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (168 KB)

    The authors describe how the NonStop SQL relational database management system has implemented parallelism in the areas of query support, index maintenance, and database utilities, to provide higher levels of performance. The authors demonstrated that the use of parallelism significantly improves the response time for query processing, as well as for utility operations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Informix parallel data query (PDQ)

    Publication Year: 1993, Page(s):71 - 72
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (148 KB)

    The PDQ project, which enables the Informix relational DBMS to perform parallel query evaluation on shared memory multiprocessors, is discussed. It is built on the Informix multithreaded server, which provides efficient creation and synchronization of parallel threads. The operators that are parallelized include scan, sort, join, and aggregate. Parallelization is achieved through the use of horizo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TOP END: distributed transaction processing for open systems

    Publication Year: 1993, Page(s):270 - 271
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (136 KB)

    An overview of the TOP END distributed transaction processing product is given. It is designed especially to meet the requirements of open systems processing. Its modularity, robustness, standards adherence, and system administration capabilities are highlighted View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Including the load balancing issue in the optimization of multi-way join queries for shared-nothing database computers

    Publication Year: 1993, Page(s):74 - 83
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (828 KB)

    Dynamic load balancing issues in multiway join operations is discussed. In particular, four multiway join query optimizers have been implemented and a simulator developed to investigate the effect of skewed tuple distribution on these techniques. Dynamic load balancing is found to very critical to the performance of shared-nothing (SN) systems, particularly when the system is large. Since load bal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replicated data in a distributed environment

    Publication Year: 1993, Page(s):227 - 228
    Cited by:  Papers (1)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (180 KB)

    Replication Server, a forthcoming product that dynamically maintains subsets of data in a distributed environment, providing several transaction models to maintain loose consistency, is contrasted with existing products which provide location-transparent reads and high-consistency coordinated commits. Replication Server makes it possible to build systems that are much more robust in the face of sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing multi-joint queries in parallel relational databases

    Publication Year: 1993, Page(s):84 - 92
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (792 KB)

    The authors determine a plan that makes the execution of an individual query very fast, with minimizing parallel execution time as the objective. This creates a circular dependence: a plan tree is needed for effective resource assignment, which is needed to estimate the parallel execution time, and which in turn is needed for the cost-based search for a good plan tree. A search heuristic that brea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of inverted indices in shared-nothing distributed text document information retrieval systems

    Publication Year: 1993, Page(s):8 - 17
    Cited by:  Papers (16)  |  Patents (33)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (820 KB)

    The impact on query processing performance of various physical organizations for inverted lists is compared. A probabilistic mode of the database and queries is introduced. Simulation experiments determine which variables most strongly influence response time and throughput. This leads to a set of design tradeoffs over a range of hardware configurations and new parallel query processing strategies View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation and evaluation of relational algebra operations on the Connection Machine

    Publication Year: 1993, Page(s):251 - 254
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB)

    The authors describe the implementation and analysis of relational algebra (RA) operators on a single instruction multiple data computer, the Connection Machine. Several traditional algorithms for RA operations are parallelized and reevaluated in this environment View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experience in the design of a reliable object based system

    Publication Year: 1993, Page(s):187 - 190
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (324 KB)

    The design and implementation of a reliable object-based system on top of a fault-tolerant multiprocessor machine based on stable storage technology, the FTM, are described. Each reliable object is characterized by its persistent state and methods. It is mapped onto a server which manages the object's persistent state and method calls. In order to recover a global consistent state of objects in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A common architecture for integrating distributed applications

    Publication Year: 1993, Page(s):110 - 115
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (472 KB)

    Efforts toward developing standardized solutions for distributed application integration in heterogeneous, multivendor, physically disparate local- and wide-area systems are described. Two requirements on specifications for these standards are that they be based on object technology and embodied in existing, commercially available products. Standards are then selected in a competitive, consensus-b... View full abstract»

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

    Publication Year: 1993, Page(s):230 - 242
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (972 KB)

    Four variants of parallel index nested loop algorithms are compared with the parallel hybrid hash algorithm. The conclusions of experiments both with an analytic model and with an implementation in the Gamma parallel database system are that overall, parallel hybrid hash is the method of choice, but there are cases where nested loops with index wins big enough that systems could profit from implem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel query processing in DBS3

    Publication Year: 1993, Page(s):93 - 102
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (784 KB)

    The authors describe an approach to the compile-time optimization and parallelization of queries for execution in DBS3, a shared-memory parallel database system. The approach makes possible exploring a search space large enough to include zigzag trees which are intermediate between left-deep and right-deep trees. Zigzag trees are shown to provide better response time than right-deep trees in the c... View full abstract»

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

    Publication Year: 1993, Page(s):18 - 25
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (540 KB)

    A method for achieving declustering for Cartesian product files on M units is proposed. The focus is on range queries, as opposed to partial match queries that older declustering methods have examined. The method uses a distance-preserving mapping, the Hilbert curve, to impose a linear ordering on the multidimensional points (buckets); then, it traverses the buckets according to this orde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Kendall Square Query Decomposer

    Publication Year: 1993, Page(s):36 - 37
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (540 KB)

    The Kendall Square Query Decomposer works in conjunction with the underlying ORACLE7 relational database management system to greatly speed the execution of decision support queries. Based on the data access strategy selected for a query by the ORACLE query optimizer, the Query Decomposer generates a number of subqueries to match the underlying physical data partitions of a table on disk. These su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor

    Publication Year: 1993, Page(s):255 - 259
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (424 KB)

    An experimental performance evaluation of three multithreaded database transitive closure algorithms on a shared memory multiprocessor is described. The algorithms are differentiated on the basis of the dataflow patterns among the threads, namely no dataflow, pipelined dataflow, and network dataflow. Close to linear speedup is achieved by the no dataflow algorithm when there is sufficiently large ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Satisfying response time goals in transaction processing

    Publication Year: 1993, Page(s):138 - 147
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (788 KB)

    Workload management algorithms for satisfying administration defined response time goals in transaction processing systems are presented. Each arriving transaction belongs to a predefined transaction class, and the system administrator defines an average response time goal for each transaction class. A dynamic transaction priority algorithm and a set of transaction routing algorithms for multiple ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using timestamping to optimize two phase commit

    Publication Year: 1993, Page(s):48 - 55
    Cited by:  Papers (2)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (772 KB)

    The two-phase commit (2PC) protocol is used to guarantee the serializability of distributed transactions. The message cost of the standard 2PC has led to efforts to optimize the protocol and reduce the number of messages required. The common optimizations require that each cohort of a transaction be terminated (finished with normal accessing of data) in order for these optimizations to lead to ser... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ACMS: Digital's open, distributed TP monitor

    Publication Year: 1993, Page(s):264 - 265
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (160 KB)

    The ACMS transaction processing (TP) monitor is discussed. ACMS enforces a unique, structured application programming style that makes it easy to develop/modify/reuse application modules. It supports a wide range of industry-standard clients. CMS's scalable architecture gives it best-in-industry price/performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On global transaction scheduling criteria in multidatabase systems

    Publication Year: 1993, Page(s):117 - 124
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (652 KB)

    A theoretical basis for global transaction scheduling to maintain global serializability in multidatabase systems is presented. Three correctness criteria are formulated to utilize the intrinsic characteristics of global transactions at the global level to determine the serialization order of global subtransactions at each local site. In particular, two new types of serializability, chain-conflict... View full abstract»

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

    Publication Year: 1993, Page(s):158 - 161
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (404 KB)

    The COMFORT project, which is intended to automate the performance tuning of database systems, is discussed. The project addresses several important tuning issues of parallel database systems in a multiuser environment, and it aims to develop general architectural principles for a self-tuning database system. The overall goals and the rationale are examined, and a brief overview of the current wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Oracle parallel RDBMS on massively parallel systems

    Publication Year: 1993, Page(s):67 - 68
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (156 KB)

    Oracle relational database technology implemented on massively parallel hardware architectures, which allows both OLTP and decision support on the same database image, is discussed. Both queries and transaction processing power scale linearly on massively parallel processor platforms. This technology delivers scalable relational database superservers View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed transaction processing with Encina

    Publication Year: 1993, Page(s):268 - 269
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (160 KB)

    The Encina family of distributed transaction processing software is discussed. The components of Encina and how they are used for implementing ACID properties, extending distributed computing environment (DCE) capabilities, and providing additional services in a transaction environment are examined. Monitor environments built on top of Encina are briefly considered View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database interoperability and portability through standards

    Publication Year: 1993, Page(s):225 - 226
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (156 KB)

    The author discusses relational database management system portability and interoperability through the use of standards. The SQL Access Group has accelerated ongoing standards activities to define a single portability and interoperability standard that can be used by RDBMS and application vendors. The current status of SQL Access work is discussed, and future work items are indicated View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A methodology for evaluating parallel graph algorithms and its application to single source reachability

    Publication Year: 1993, Page(s):243 - 250
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (796 KB)

    The authors consider parallel processing of a graph represented by a database relation. They propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at run-time one of several candidate strategies, depending on the hardware architecture and the input graph. They study the single-source reachability problem, namely, the problem of computing th... View full abstract»

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