• Publications
  • Influence
Disk Shadowing
An analytic model is developed which shows that the seek time for a random read in a shadow set is a monotonic decreasing function of the number of disks in the set, and that intelligent device scheduling of shadowed disks increases the I/O rate.
Benchmarking Database Systems A Systematic Approach
A customized database and a comprehensive set of queries that can be used for systematic benchmarking of relational database systems and a first attempt in developing a scientific methodology for performance evaluation of database management systems are described.
Parallel algorithms for the execution of relational database operations
This paper presents and analyzes algorithms for parallel processing of relational database operations in a general multiprocessor framework, and introduces an analysis methodology which incorporates I/O, CPU, and message costs and which can be adjusted to fit different multiproprocessor architectures.
Duplicate record elimination in large data files
The issue of duplicate elimination for large data files in which many occurrences of the same record may appear is addressed. A comprehensive cost analysis of the duplicate elimination operation is
A measure of transaction processing power
These benchmarks measure the performance of diverse transaction processing systems and a standard system cost measure is stated and used to define price/performance metrics.
Enterprise information integration: successes, challenges and controversies
A collection of articles, by individuals who were involved in this industry in various ways, describes some of these experiences and points to the challenges ahead.
A taxonomy of parallel sorting
This paper analyzes the evolution of research on parallel sorting, from the earliest sorting networks to the shared memory algorithms and the VLSI sorters, and proposes a taxonomy of parallel sorting that includes a broad range of array and file sorting algorithms.
AS3AP - An ANSI SQL Standard Scaleable and Portable Benchmark for Relational Database Systems
The Wisconsin Benchmark was created in an attempt to compare backend database machine architectures to software relational database systems running on a general purpose computer.
Sorting Large Files on a Backend Multiprocessor
The results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three- and five-microprocessor configurations, provide a very cost-effective sort of large files.
Arm scheduling in shadowed disks
  • D. Bitton
  • Computer Science
    Digest of Papers. COMPCON Spring 89. Thirty…
  • 27 February 1989
The author focuses on the algorithm based on assigning a read request to the arm that is within the shortest seek distance of the target location, which decreases the expected seek time for reads by 50% and an analysis of seek time based on both a simulation and an analytic model.