On the design of relational database schemata
ACM Transactions on Database Systems (TODS)
Support for repetitive transactions and ad hoc queries in System R
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Performance evaluation of attribute-based tree organization
ACM Transactions on Database Systems (TODS)
On the estimation of the number of desired records with respect to a given query
ACM Transactions on Database Systems (TODS)
Sequentiality and prefetching in database systems
ACM Transactions on Database Systems (TODS)
Implementing a generalized access path structure for a relational database system
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
Algorithms for parsing search queries in systems with inverted file organization
ACM Transactions on Database Systems (TODS)
Performance of a database manager in a virtual memory system
ACM Transactions on Database Systems (TODS)
A clustering algorithm for hierarchical structures
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Minimum cost selection of secondary indexes for formatted files
ACM Transactions on Database Systems (TODS)
Performance evaluation of a relational associative processor
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Optimal policy for batch operations: backup, checkpointing, reorganization, and updating
ACM Transactions on Database Systems (TODS)
The determination of efficient record segmentations and blocking factors for shared data files
ACM Transactions on Database Systems (TODS)
Database buffer paging in virtual storage systems
ACM Transactions on Database Systems (TODS)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
Database Reorganization—Principles and Practice
ACM Computing Surveys (CSUR)
The Logical Record Access Approach to Database Design
ACM Computing Surveys (CSUR)
Balanced job bound analysis of queueing networks
Communications of the ACM
Analysis of locking policies in database management systems
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
A stochastic evaluation model for database organizations in data retrieval systems
Communications of the ACM
A practitioner's guide to addressing algorithms
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Evaluation and selection of file organization—a model and system
Communications of the ACM
The semantic data model: a modelling mechanism for data base applications
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
A mathematical modeling approach to the automatic selection of database designs
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Evaluation of database access paths
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Application of an analytical model to evaluate storage structures
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
A method for describing information required by the database design process
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Performance analysis of a relational data base management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Queueing network models for concurrent transaction processing in a database system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Evaluation of the size of a query expressed in relational algebra
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
DIAM II and Levels of Abstraction - The Physical Device Level: A General Model for Access Methods
Systems for Large Data Bases
Choosing an Efficient Internal Schema
Systems for Large Data Bases
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Application of Queueing Network Models in the Performance Evaluation of Database Designs
Electronic Notes in Theoretical Computer Science (ENTCS)
Database system performance evaluation models: A survey
Performance Evaluation
Efficient implementation of complex interventions in large scale epidemic simulations
Proceedings of the Winter Simulation Conference
Towards predicting query execution time for concurrent and dynamic database workloads
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Much progress has been made recently in developing strategies for data base design at both the logical and physical levels. Various approaches, some built into automated design aids, produce designs that are known to be "good" (or even "optimal" in some sense). The measurement criteria by which the designs are judged, however, are difficult to relate to some of the performance measures of importance to computer system managers and data base system users. Such performance measures include device utilizations, transaction throughputs, and the distribution of responsetimes. In this paper, we suggest an overall framework for assessing and predicting the effect on resource consumption, throughputs, and response times of a variety of physical and logical data base design decisions that affect performance. We use ananalytical model based, at the lowest level, on queueing network models. Queueing network models have already proven useful in understanding and predicting performance in many actual computer systems (with and without data base components). At higher levels of the analytical model, we establish a sequence of data base system workload descriptions, each one dependent on more performance related design decisions. By analytical techniques, the workload description at one level and a set of design choices are transformed into the workload description at the next lower (more fully specified) level. By this approach, many data base design alternatives can be represented by changes at a single level of the layered model. The design alternatives can be assessed with respect to their effect on a variety of performance measures, including record accesses, block accesses, physical disk transfers, throughputs, and mean response times. The presence of other workload components running concurrently on the same hardware configuration can also be taken into account.