ACM Transactions on Computer Systems (TOCS)
Object management in POSTGRES using procedures
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Benchmarking Database Systems A Systematic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
A performance comparison of object and relational databases using the Sun Benchmark
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
ACM Transactions on Database Systems (TODS)
Working with Persistent Objects: To Swizzle or Not to Swizzle
IEEE Transactions on Software Engineering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A status report on the OO7 OODBMS benchmarking effort
OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Research directions in object-oriented database systems
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Outer Joins and Filters for Instantiating Objects from Relational Databases Through Views
IEEE Transactions on Knowledge and Data Engineering
Performance Comparison of Three Modern DBMS Architectures
IEEE Transactions on Software Engineering
ADMS: A Testbed for Incremental Access Methods
IEEE Transactions on Knowledge and Data Engineering
An Incremental Join Attachment for Starburst
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Fido: A Cache That Learns to Fetch
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Performance and Scalability of Client-Server Database Architectures
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
There are two widely-known benchmarks for database management systems the TP1 benchmarks (Anon et al [1985]), designed to measure transaction throughout, and the Wisconsin benchmarks (Bitton, Dewitt, & Turbyfil [1984]), designed to measure the performance of a relational query processor. In our work with databases on engineering workstations, we found neither of these benchmarks a suitable measure for our applications' needs. Instead, our requirements are for response time for simple queries. We propose benchmark measurements to measure response time, specifically designed for the simple, object-oriented queries that engineering database applications perform. We report results from running this benchmark against some database systems we use ourselves, and provide enough detail for others to reproduce the benchmark measurements on other relational, object-oriented, or specialized database systems. We discuss a number of factors that make an order of magnitude improvement in benchmark performance caching the entire database in main memory, avoiding query optimization overhead, using physical links for prejoins, and using an alternative to the generally-accepted database “server” architecture on distributed networks.