Heuristics for selecting robust database structures with dynamic query patterns

Heuristics for selecting robust database structures with dynamic query patterns

0.00 Avg rating0 Votes
Article ID: iaor20063022
Country: Netherlands
Volume: 168
Issue: 1
Start Page Number: 200
End Page Number: 220
Publication Date: Jan 2006
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: heuristics, simulation: applications
Abstract:

The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-making. Achieving such a ‘right time/right place’ duet depends directly on database performance. A database system has been a core component that supports modern business system such as enterprise resource planning (ERP) system that integrates and supports all enterprise processes including product designing and engineering, manufacturing, and other business functions to achieve highest efficiency and effectiveness of operations. We develop and demonstrate through a proof-of-concept case study, a new ‘query-driven’ heuristics for database design that seeks to identify database structures that perform robustly in dynamic settings with dynamic queries. Our focus is the design of efficient structures to process read-only queries in complex environments. Our heuristics begins with detailed analysis of relationships between diverse queries and the performance of different database structures. These relationships are then used in a series of steps that identify ‘robust’ database structures that maintain high performance levels for a wide range of query patterns. We conjecture that our heuristics can facilitate efficient operations and effective decision-making of companies in today's dynamic environment.

Reviews

Required fields are marked *. Your email address will not be published.