Published in Sixteenth International Workshop on Description Logics, September 5-7, 2003 Rome, Italy, September 5, 2003, pages 9-19.
NOTE: At the time of publication, the author Lubomir Stanchev was not yet affiliated with Cal Poly.
We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries and updates, are predefined and can be classified as either critical or non-critical. In this paper, we focus on the critical part of the transaction workload for ECPs. More precisely, our problem input consists of a set of critical transaction types and a database schema. The goal is to find a minimum number of extended indices that enable every critical operation to be performed efficiently. The proposed solution is novel in that it entails the use of a description logic (DL) reasoner to find cases in which extended indices can be combined or simplified.
Number of Pages