Very Large Data Bases · 1988 · 129 citations · 19 references
ComputingComputer ScienceComputer SystemsDatabasesOperating SystemsParallel ComputingConcurrency ControlData ParallelismDatabase ManagementParallel DatabasesQuery ProcessingTransaction ManagementHigh PerformanceOperating System ArchitectureParallel Database ArchitecturesParallel Database ProcessingParallel Database SystemsShared MemoryShared-disk ArchitectureTransaction Processing
The paper outlines building a high‑performance, highly available DBMS at Berkeley for transaction processing, complex ad‑hoc queries,.
1.1. High Performance This paper presents an overview of the techniques we are using to build a DBMS at Berkeley that will simultaneously provide high performance and high availability in transaction processing environments, in applications with complex ad-hoc queries and in applications with large objects such as images or CAD layouts. We plan to achieve these goals using a general purpose DBMS and operating system and a shared memory multiprocessor. The hardware and software tactics which we are using to accomplish these goals are described in this paper and include a novel “fast path” feature, a special purpose concurrency control scheme, a twodimensional file system, exploitation of parallelism and a novel method to efficiently mirror disks. We strive for high performance in three different application areas: 1) transaction processing 2) complex ad-hoc queries 3) management of large objects
19
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
M. M. Astrahan, Michael W. Blasgen, Donald D. Chamberlin et al. · ACM Transactions on Database Systems · 1976 · 1K citations · Full text
Michael Stonebraker, Lawrence A. Rowe · ACM SIGMOD Record · 1986 · 691 citations
Patrick Valduriez · ACM Transactions on Database Systems · 1987 · 504 citations · Full text