The Experts below are selected from a list of 52536 Experts worldwide ranked by ideXlab platform
H. N. Srinidhi - One of the best experts on this subject based on the ideXlab platform.
-
A suggestion for performance improvement in a relational Database Machine
Computers & Electrical Engineering, 1991Co-Authors: Nagarajan Ranganathan, H. N. SrinidhiAbstract:Abstract Database Machines are special purpose backend architectures that are designed to support efficiently Database management system operations. An important problem in the development of Database Machines has been that of increasing their performance. Earlier research on the performance evaluation of Database Machines has indicated that I/O operations constitute a principle performance bottleneck. This is increasingly the case with the advances in multiprocessing and a growth in the volume of data handled by a Database Machine. One possible strategy to improve the performance of such a system which handles huge volumes of data is to store the data in a compressed form. This can be achieved by introducing VLSI chips for data compression so that data can be compressed and decompressed “on-the-fly”. A set of hardware algorithms for data compression based on the Huffman coding scheme proposed in an earlier work is described. The main focus of this paper is the investigation conducted by the authors to study the effect of incorporating such hardware in a special purpose backend relational Database Machine. Detailed analytical models of a relational Database Machine and the analytical results that quantify the performance improvement due to compression hardware are presented.
-
PARBASE - Effect of data compression hardware on the performance of a relational Database Machine
Proceedings. PARBASE-90: International Conference on Databases Parallel Architectures and Their Applications, 1Co-Authors: Nagarajan Ranganathan, H. N. SrinidhiAbstract:The authors propose the use of data compression hardware to improve the performance of a relational Database Machine. They derive detailed analytical models of a specific relational Database Machine DELTA and report simulation results that quantify the improvement in its system performance due to compression hardware. The main contribution of the present work is the strategy of using compression hardware in the design of Database Machines to overcome the I/O bottleneck, thereby increasing their performance. The authors suggest the use of on-the-fly hardware to compress and decompress the data so that the time overhead due to compression is negligible. >
Romola Guiton - One of the best experts on this subject based on the ideXlab platform.
-
BNCOD - W-SQL: An Interface for Scalable, Highly Parallel Database Machines
Lecture Notes in Computer Science, 1995Co-Authors: Jon Kerridge, Dave Walter, Romola GuitonAbstract:The goal of any designer building a scalable Database Machine is to ensure that the interface between the relational processing part of the Machine and the storage system is independent of the actual storage media. The interface should be as high a level as possible to ensure that as much processing as possible can be encapsulated in the storage level components. The interface design should also consider such aspects as backup and recovery, concurrency management, mixed on-line processing and decision support, support for triggered actions and low-level support for the full range of SQL data manipulations. The W-SQL interface provides such an interface which has been demonstrated in operation with a specifically designed hardware component called a Data Access Component that provides the basic building block of a highly parallel scalable Database Machine.
Hidehiko Tanaka - One of the best experts on this subject based on the ideXlab platform.
-
Concurrency control of bulk access transactions on a parallel disk Database Machine: Concurrency control of bulk access transactions on a parallel disk Database Machine
Systems and Computers in Japan, 1991Co-Authors: Tadashi Ohmori, Masaru Kitsuregawa, Hidehiko TanakaAbstract:A scheme for concurrency control of bulk access transactions on a Shared-Nothing Database Machine is described. A “weighted transaction precedence graph” that expresses transaction cost as well as serializability and a cautions scheduler based on it are capable of producing serializable schedules with decreased data and resource contention. In simulations the new scheduler achieved throughout levels 1.3 to 2 times those attainable with conventional locking protocols.
Nagarajan Ranganathan - One of the best experts on this subject based on the ideXlab platform.
-
A suggestion for performance improvement in a relational Database Machine
Computers & Electrical Engineering, 1991Co-Authors: Nagarajan Ranganathan, H. N. SrinidhiAbstract:Abstract Database Machines are special purpose backend architectures that are designed to support efficiently Database management system operations. An important problem in the development of Database Machines has been that of increasing their performance. Earlier research on the performance evaluation of Database Machines has indicated that I/O operations constitute a principle performance bottleneck. This is increasingly the case with the advances in multiprocessing and a growth in the volume of data handled by a Database Machine. One possible strategy to improve the performance of such a system which handles huge volumes of data is to store the data in a compressed form. This can be achieved by introducing VLSI chips for data compression so that data can be compressed and decompressed “on-the-fly”. A set of hardware algorithms for data compression based on the Huffman coding scheme proposed in an earlier work is described. The main focus of this paper is the investigation conducted by the authors to study the effect of incorporating such hardware in a special purpose backend relational Database Machine. Detailed analytical models of a relational Database Machine and the analytical results that quantify the performance improvement due to compression hardware are presented.
-
PARBASE - Effect of data compression hardware on the performance of a relational Database Machine
Proceedings. PARBASE-90: International Conference on Databases Parallel Architectures and Their Applications, 1Co-Authors: Nagarajan Ranganathan, H. N. SrinidhiAbstract:The authors propose the use of data compression hardware to improve the performance of a relational Database Machine. They derive detailed analytical models of a specific relational Database Machine DELTA and report simulation results that quantify the improvement in its system performance due to compression hardware. The main contribution of the present work is the strategy of using compression hardware in the design of Database Machines to overcome the I/O bottleneck, thereby increasing their performance. The authors suggest the use of on-the-fly hardware to compress and decompress the data so that the time overhead due to compression is negligible. >
Soon M. Chung - One of the best experts on this subject based on the ideXlab platform.
-
ASAP - A Database Machine based on surrogate files
[1990] Proceedings of the International Conference on Application Specific Array Processors, 1Co-Authors: Soon M. ChungAbstract:Concatenated code word (CCW) surrogate files are useful as indexes for very large knowledge bases to support logic programming inference mechanisms because of their small size and simple maintenance requirements. A parallel back-end Database Machine is proposed to speed up relation operations based on the CCW surrogate files. The basic idea of the Machine is to reduce the amount of fact data to be transferred from the secondary storage systems to satisfy a query by performing relational operations on the CCW surrogate files first. The Database Machine consists of a number of surrogate file processors (SFPs) and extensional Database processors (EDBPs) operating in SIMD mode. The performance of the system for parallel relational operations is evaluated for various cases. >
-
IPPS - Optical Database Machine using spatial light rebroadcasters
[1991] Proceedings. The Fifth International Parallel Processing Symposium, 1Co-Authors: Soon M. ChungAbstract:An optical Database Machine using spatial light rebroadcasters (SLRs) is proposed to speed up relational operations on large Databases. A SLR is a nonvolatile memory device with large storage capacity and high read/write speed. Since most of the Database operations can be performed directly on the SLRs, one doesn't have the I/O bottleneck, which is a major problem in other Database Machine architecture. One can search data stored in the SLR in parallel by a single search operation. Parallel relational operation algorithms are developed for the proposed architecture, and the author evaluates the performance of the Machine for various cases. Compared to the other Database Machines, performance of the proposed architecture is at least a order of magnitude faster due to the parallel processing capability and high read/write speed of the SLR. >
