Distributed database systems need commit processing so that transactions executing on them still preserve the ACID property. With the advance of main memory database systems which become possible due to dropping price and increasing capacity of the RAM and CPU, the database processing speed has been incresed in one order of magnitude. However, when it comes to distributed commit processing, it ...

A transaction is traditionally deened so as to provide the properties of atomicity, consistency, integrity, and durability (ACID) for any operation it performs. In order to ensure the atomicity of distributed transactions, an atomic commitprotocol needs to be followed by all sites participating in a transaction execution to agree on the nal outcome, that is, commit or abort. A variety of commit...

Improving the performance of a database system is one of the key research issues now a day. Distributed processing is an effective way to improve reliability and performance of a database system. Distribution of data is a collection of fragmentation, allocation and replication processes. Previous research works provided fragmentation solution based on empirical data about the type and frequency...

The work described in this article arises from two needs. First, there is still a need for providing more sophisticated database systems than just relational ones. Secondly, there is a growing need for distributed databases. These needs are adressed by fragmenting schemata of a generic object data model and providing an architecture for its implementation. Key features of the architecture are t...

In typical practice of data warehouse, the warehouse data is kept in a separate site from the operation data. Changes to the operation data to propagated to the warehouse site periodically, usually by shipping the new log entries in the operation site. When the operation site is a parallel a parallel DBMS, it is necessary to arrange the log entries into an coherent order for the warehouse data ...

Many concurrency control algorithms have been proposed for use in distributed database systems. Despite the large number of available algorithms, and the fact that distributed database systems are becoming a commercial reality, distributed concurrency control performance tradeoffs are still not well understood. In this paper we attempt to shed light on some of the important issues by studying f...

The paper considers the prcblem of sorting a file in a distributed system. The file is originally distributed on many sites, and the result of the sort is needed at another site called the “host”. The particular environment that we resume is a backend parallel database machine, but the work is applicable to distributed database systems as well. After discussing the drawbacks of several existing...

Future database applications will require database technology advancing to deal with large-scale distributed database systems (LDDBS) which have data distributed over wide area network and involve many sites such as more than a thousand. The goal of our research is to investigate the problems and their solutions for data replication in these LDDBS. When thousands of sites involve in a distribut...

In this paper, we address the issue of Distributed MultiMedia DBMS (DM2DBMS) where traditional metadatabase used to describe the database schema is no longer appropriate. The meta-database is the kernel of the DBMS and we do believe that new generation of meta-database is required for DM2DBMS. For this, we provide a multimedia meta-database model M2 able to improve multimedia management in DM2D...

In the past, many algorithms have been proposed for mining association rules from binary databases. Transactions with quantitative values are, however, also commonly seen in real-world applications. Each transaction in a quantitative database consists of items with their purchased quantities. The multiple fuzzy frequent pattern tree (MFFP-tree) algorithm was thus designed to handle a quantitati...