By Topic

Parallel and Distributed Information Systems, 1993., Proceedings of the Second International Conference on

Date 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
    Save to Project icon | Request Permissions | PDF file iconPDF (23 KB)  
    Freely Available from IEEE
  • Satisfying response time goals in transaction processing

    Publication Year: 1993 , Page(s): 138 - 147
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | 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 Carnot for enterprise information integration

    Publication Year: 1993 , Page(s): 133 - 136
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (348 KB)  

    The Carnot Project, which addresses the problem of logically unifying physically distributed, enterprise-wide, heterogeneous information is discussed. Specifically, Carnot will provide a user with the means to navigate information efficiently and transparently, to update that information consistently, and to write applications easily for large, heterogeneous, distributed information systems. The C... 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)
    Save to Project icon | Request Permissions | 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.
  • Omega: a parallel object-based system

    Publication Year: 1993 , Page(s): 182 - 186
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (404 KB)  

    An overview is given of the Omega database machine and the techniques used in its implementation. Omega is a parallel object-based system that supports a functional data model and implements unique object identifiers, complex objects, a type hierarchy, inheritance, and user-defined methods. Key technical ideas that enable the architecture to scale to a large number of processors are discussed. Pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Issues in the design of multi-server file systems to cope with load skew

    Publication Year: 1993 , Page(s): 214 - 223
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (756 KB)  

    It is observed that a large number of operations in many environments are to the files that are mostly-read and rarely updated. Such operations can be served by any server without incurring a high coherency. Several dynamic load balancing algorithms of various degrees of complexity that achieve high reduction in load skew albeit reducing the server buffer hit probability are proposed. It is shown ... 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
    Save to Project icon | Request Permissions | 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.
  • An experience in the design of a reliable object based system

    Publication Year: 1993 , Page(s): 187 - 190
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | 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.
  • Recovering in large distributed systems with replicated data

    Publication Year: 1993 , Page(s): 39 - 47
    Cited by:  Papers (2)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (716 KB)  

    The problem of recovery in large-scale transaction-based distributed systems with replicated data is studied. In large distributed systems the cost of accessing data items may be considerably greater, because of the distances involved. It is thus important to exploit replication to reduce data-access times. Also, in large systems, failure events are much more frequent than in small systems. Theref... 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
    Save to Project icon | Request Permissions | 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.
  • Informix parallel data query (PDQ)

    Publication Year: 1993 , Page(s): 71 - 72
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | 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.
  • PANDA: a testbed for investigating strategies for parallel query execution

    Publication Year: 1993 , Page(s): 103 - 106
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB)  

    Strategies for data distribution, query optimization, and control of query processing are investigated by implementing a shared-nothing database system with reduced functionality. The testbed's special features are the support of several advanced data distribution strategies and the pipelined execution of parallel query execution plans. Data distribution and query execution plan editors support th... 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
    Save to Project icon | Request Permissions | 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.
  • Implementation and evaluation of relational algebra operations on the Connection Machine

    Publication Year: 1993 , Page(s): 251 - 254
    Save to Project icon | Request Permissions | 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 efficient and highly available read-one write-all protocol for replicated data management

    Publication Year: 1993 , Page(s): 56 - 65
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (836 KB)  

    A read-one write-all (ROWA) protocol for replicated data that allows a system to adjust to failures dynamically in order to keep the data available is proposed. If failures arrive mostly sequentially, the protocol keeps the data available as long as there is at least one operational replica. This is achieved by making the epoch mechanism, previously applicable to non-ROWA schemes only, usable with... 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 (1)  |  Patents (1)
    Save to Project icon | Request Permissions | 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.
  • Oracle parallel RDBMS on massively parallel systems

    Publication Year: 1993 , Page(s): 67 - 68
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | 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.
  • TOP END: distributed transaction processing for open systems

    Publication Year: 1993 , Page(s): 270 - 271
    Save to Project icon | Request Permissions | 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.
  • Multiprocessor file system interfaces

    Publication Year: 1993 , Page(s): 194 - 201
    Cited by:  Papers (13)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (768 KB)  

    The difficulties faced when using the conventional (UNIX-like) interface in parallel applications are described. Ways to extend the conventional interface to provide convenient access to the file for parallel programs, while retaining the traditional interface for programs that have no need to explicitly parallel file access, are described. The interface includes a single naming scheme, a multiope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing query execution for an advanced database programming language

    Publication Year: 1993 , Page(s): 163 - 171
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (820 KB)  

    A method for efficiently managing the execution of a query for an advanced database programming language is demonstrated. It is shown that the mechanism gracefully and efficiently manages control flow in both single-processor and multiprocessor environments. A prototype demonstrating the feasibility of this approach is operational on both single-processor and small-scale multiprocessor systems 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
    Save to Project icon | Request Permissions | 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.
  • Parallel query processing in DBS3

    Publication Year: 1993 , Page(s): 93 - 102
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | 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.
  • Supporting long-running tasks on an evolving multidatabase using interactions and events

    Publication Year: 1993 , Page(s): 125 - 132
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (764 KB)  

    An open nested multi-database transaction model called Interactions is proposed. Interactions sit above a layer that provide atomic, serializable global multidatabase transactions. It provides additional support for planning applications, which are long-running applications that may need to respond to changes in the underlying multidatabase. Interactions and the multidatabase architecture that the... 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 (16)
    Save to Project icon | Request Permissions | 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.
  • Replicated data in a distributed environment

    Publication Year: 1993 , Page(s): 227 - 228
    Cited by:  Patents (9)
    Save to Project icon | Request Permissions | 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.