Article

Index selection for compiled database applications in embedded control programs

Authors:

Lubomir Stanchev,

Grant WeddellAuthors Info & Claims

CASCON '02: Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research

Page 11

Published: 30 September 2002 Publication History

Get Access

Abstract

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.

References

[1]

{1} Surajit Chaudhuri and Vivek Narasayya. An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server. Proceedings of the 23rd VLDB Conference, pages 146-155, 1997.

Digital Library

Google Scholar

[2]

{2} Surajit Chaudhuri and Vivek R. Narasayya. AutoAdmin 'What-if' Index Analysis Utility. SIGMOD, pages 367-378, 1998.

Digital Library

Google Scholar

[3]

{3} S. Finkelstein, M. Schkolnick, and P. Tiberio. Physical Database Design for Relational Databases. ACM Transaction on Database Systems, 13(1):91-128, March 1988.

Digital Library

Google Scholar

[4]

{4} David Toman and Grant Weddell. On Attributes, Roles, and Dependencies in Description Logics and the Ackerman Case of Decision Problem. Proc. Description Logics, 2001.

Google Scholar

[5]

{5} Transaction processing performance Council, http://www.tpc.org. TPC-C OLTP.

Google Scholar

[6]

{6} Gray Valentin, Michael Zulian, Daniel C. Zilio, Guy Lohman, and Alan Skelley. DB2 Advisor: An Optimizer Smart Enough to Recommend its Own Indexes. Proceedings of the 16th International Conference on Data Engineering, pages 101-110, February 2000.

Digital Library

Google Scholar

[7]

{7} Grant Weddell. Selection of Indexes to memory-Resident Entities for Semantic Data Models. IEEE Transactions on Knowledge and Data Engineering, 1(2):274-284, June 1989.

Digital Library

Google Scholar

Cited By

View all

Yu HWeddell GWildberger MHalasz MLufiyya HSinger J(2004)Investigations in tree locking for compiled database applicationsProceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research10.5555/1034914.1034931(217-231)Online publication date: 4-Oct-2004
https://dl.acm.org/doi/10.5555/1034914.1034931

Index Terms

Index selection for compiled database applications in embedded control programs
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Physical data models
    2. Database management system engines
      1. Database query processing
      2. Database transaction processing
  2. Information retrieval
    1. Document representation
    2. Search engine architectures and scalability
      1. Search engine indexing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

A Tool for Automatic Index Selection in Database Management Systems
IS3C '14: Proceedings of the 2014 International Symposium on Computer, Consumer and Control

A task commonly undertaken by database administrators to speed up the performance of commands submitted to a DBMS is the selection of indexes for the tables. This paper introduces the concept of how to use the Database Management System (DBMS) Optimizer ...
Testing Database-Centric Applications for Causes of Database Deadlocks
ICST '13: Proceedings of the 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation

Many organizations deploy applications that use databases by sending Structured Query Language (SQL) statements to them and obtaining data that result from executions of these statements. Since applications often share the same databases concurrently, ...
Cracking in-memory database index: A case study for Adaptive Radix Tree index
Abstract
Indexes provide a method to access data in databases quickly. It can improve the response speed of subsequent queries by building a complete index in advance. However, it also leads to a huge overhead of the continuous updating during ...
Highlights
- In-memory database indexes have more extensive research and application space.
- ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CASCON '02: Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research

September 2002

182 pages

Conference Chairs:
Hershel Harris
Director of IBM Toronto Lab
,
Andrew Woodsworth
National Research Council Canada
,
Editors:
Darlene A. Stewart,
J. Howard Johnson
National Research Council Canada
,
Program Chairs:
Mark Vigder
National Research Council Canada
,
Johnny W. Wong
University of Waterloo

Publisher

IBM Press

Publication History

Published: 30 September 2002

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 24 of 90 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
126
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yu HWeddell GWildberger MHalasz MLufiyya HSinger J(2004)Investigations in tree locking for compiled database applicationsProceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research10.5555/1034914.1034931(217-231)Online publication date: 4-Oct-2004
https://dl.acm.org/doi/10.5555/1034914.1034931

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A Tool for Automatic Index Selection in Database Management Systems

Testing Database-Centric Applications for Causes of Database Deadlocks

Cracking in-memory database index: A case study for Adaptive Radix Tree index