Near optimal multiple choice index selection for relational databases
نویسندگان
چکیده
منابع مشابه
Index Selection in Relational Databases
Intending to develop a tool which aims to support the physical design of relational databases can not be done without considering the problem of index selection. Generally the problem is split into a primary and secondary index selection problem and the selection is done per table. Whereas much attention has been paid on the selection of secondary indices relatively less is known about the sele...
متن کاملTowards Selection of Optimal Storage Architecture for Relational Databases
Requirements for database systems differ from small-scale stripped minimal database programs for embedded devices with minimal footprint to large-scale on-line analytical processing applications. For relational database management systems, two storage architectures have been introduced: a) row-oriented architecture and b) column-oriented architecture. In this paper, we present a query decomposi...
متن کاملOn the Selection of Optimal Index Configuration in OO Databases
Sunil Choenni1 Elisa Bertino2 Henk M. Blanken1 Thiel Chang3 1University of Twente 2University of Genova 3G.A.K. P.O. Box 217, 7500 AE Enschede, Via L.B. Alberti 4, 16132 Genova, P.O. Box 8300, 1005 CA Amsterdam, The Netherlands Italy The Netherlands Abstract An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same pat...
متن کاملMultiple Path Join for Nested Relational Databases
This paper presents a solution to the problem of how to eeciently process queries which include join operations in the nested relational model. We focus on the join operation, and introduce a new join operator called P-join. The P-join operator merges two scheme trees. It combines the advantages of the extended natural join and recursive join for eecient data access. The algebraic expression of...
متن کاملRelational Database Index Selection Algorithm
The Index Selection Problem (ISP) is an important element of research in the field of optimization of relational database systems. Commonly used commercial tools are based on a methodology that enables tables indexing for independent SQL queries. The article presents an original method, based on a genetic algorithm, for indexing tables for groups of queries in a relational database (MDI). Condu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1999
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(98)00256-9