DPDS

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 ...

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 ...

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 ...

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 ...

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, ...

We present parallel algorithms to compute the transitive closure of a database relation. These algorithms are applicable both on shared-memory and message-passing architectures. Experimental verification shows an almost linear speed-up with these ...

Bubba is a parallel computer system for data intensive applications under design at MCC. Bubba is intended as a replacement for mainframe systems providing scalable, continuous, high-performance-per-dollar access to large amounts of shared data for a ...

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 ...

A novel, high performance subsystem for information retrieval called JAS is introduced. The JAS subsystem sustains gigabyte per second comparison rates due to its “early-out” CMOS substring search processor. The complexity of each JAS unit is ...

We propose a non-traditional system architecture for backend database processing, i.e., a network of workstations. By moving data dynamically to otherwise idle workstations over a local area network, a high degree of processing parallelism could be ...

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 ...

Skew in the distribution of values taken by an attribute is identified as a major factor that can affect the performance of parallel architectures for relational joins. The effect of skew on the performance of two parallel architectures is evaluated ...

Complex objects to support non-standard database applications require the use of substantial computing resources because their powerful operations and their related integrity constraints must be performed and maintained in an interactive environment. ...

This paper examines heuristic algorithms for processing distributed queries using generalized joins. As this optimization problem is NP-hard heuristic algorithms are deemed to be justified. A heuristic algorithm to form/formulate strategies to process ...

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 ...

Using simulation and probabilistic analysis, we study the performance of an algorithm to read entire databases with locking concurrency control allowing multiple readers or an exclusive writer. The algorithm runs concurrently with the normal transaction ...

In this paper we describe an experiment designed to evaluate the potential transaction processing system performance achievable through the combination of multiple processors and massive memories. The experiment consisted of the design and ...

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 ...

Most work on database integration has considered only support for data retrieval, not support for updates, and often the use of a special semantically rich data model has been required. In this paper we present an approach to database integration which ...

In this paper, we examine the issue of robust transaction routing in distributed database systems. A class of dynamic routing strategies which use estimated response times to make routing decisions is studied in details. Since response time estimation ...