Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
AutoAdmin “what-if” index analysis utility
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Selection of Indexes to Memory-Resident Entities for Semantic Data
IEEE Transactions on Knowledge and Data Engineering
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
DB2 Advisor: An Optimizer Smart Enough to Recommend its own Indexes
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Investigations in tree locking for compiled database applications
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
| Hi-index | 0.00 |
A compiled database application is a collection of modules in a software system that interact with a common database through a set of predefined transaction types. We call a compiled database application an embedded control program (ECP) if it is reasonable to consider the execution time of each transaction type to be either critical or non-critical. Usually, the common database for an ECP is referred to as the control data. In this paper, we consider the index selection problem for the control data of an ECP. We believe this is a novel problem because of the presence of real-time requirements. Unlike the objective of earlier work in index selection that aims to reduce the response time of queries, ours is to reduce storage requirements in a way that ensures efficient execution time for the critical query and update workload. We propose a solution that abstracts and manipulates the result requirements of the query component of the critical workload. The experiments we have conducted show that this approach can produce small physical structures that support fast execution of a workload with many updates.