The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Performance of a database manager in a virtual memory system
ACM Transactions on Database Systems (TODS)
Performance evaluation of a relational associative processor
ACM Transactions on Database Systems (TODS)
Database buffer paging in virtual storage systems
ACM Transactions on Database Systems (TODS)
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Evaluation of database access paths
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
DIRECT - a multiprocessor organization for supporting relational data base management systems
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Embedding a relational data sublanguage in a general purpose programming language
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Logical, internal, and physical reference behavior in CODASYL database systems
ACM Transactions on Database Systems (TODS)
The Architecture of SM3: A Dynamically Partitionable Multicomputer System
IEEE Transactions on Computers
Analysis of retrieval performance for records and objects using optical disk technology
ACM Transactions on Database Systems (TODS)
A computer-aided benchmarking system for parallel and expandable database computers
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
Diversity in database reference behavior
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Integrating IR and RDBMS using cooperative indexing
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Empirical results on locality in database referencing
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Processor allocation strategies for multiprocessor database machines
ACM Transactions on Database Systems (TODS)
Performance enhancements to a relational database system
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
The effect of target applications on the design of database machines
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Characterization of database access pattern for analytic prediction of buffer hit probability
The VLDB Journal — The International Journal on Very Large Data Bases
An Analytical Method for Estimating and Interpreting Query Time
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Analysis of locking behavior in three real database systems
The VLDB Journal — The International Journal on Very Large Data Bases
A language for a scientific and engineering database system
DAC '82 Proceedings of the 19th Design Automation Conference
Fixing pages in a database buffer
ACM SIGMOD Record
Characteristics of production database workloads and the TPC benchmarks
IBM Systems Journal - End-to-end security
SARC: sequential prefetching in adaptive replacement cache
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Data base system performance prediction using an analytical model (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
| Hi-index | 0.00 |
The effect on the performance of data management systems of the use of extended storage devices, multiple processors and prefetching data blocks is analyzed with respect to one system, INGRES. Benchmark query streams, derived from user queries, were run on the INGRES system and their CPU usage and data reference patterns traced. The results show that the performance characteristics of two query types: data-intensive queries and overhead-intensive queries, are so different that it may be difficult to design a single architecture to optimize the performance of both types. It is shown that the random access model of data references holds only for overhead-intensive queries, and then only if references to system catalogs are not considered data references. Significant sequentiality of reference was found in the data-intensive queries. It is shown that back-end data management machines that distribute processing toward the data may be cost effective only for data-intensive queries. It is proposed that the best method of distributing the processing of the overhead-intensive query is through the use of intelligent terminals. A third benchmark set, multi-relation queries, was devised, and proposals are made for taking advantage of the locality of reference which was found.