Redundant data structures such as indexes have emerged as some of the improved query processing techniques for dealing with very large data volumes and fast response time requirements of a data warehouse. This paper investigates factors like the use of tuples specified in the criteria of a structured query language (SQL) query and their influence on the response time of a query in a data warehouse environment. Experience of the pioneers in the data warehouse industry in handling queries by using redundant data structures has already been well established. Since we are given very large data storage nowadays, redundant data structures are no longer a big issue. However, an intelligent way of managing storage or redundant data structures that can lead to fast access of data is the vital issue to be dealt with in this paper.
[1]
Raghu Ramakrishnan,et al.
Database Management Systems
,
1976
.
[2]
Patrick E. O'Neil,et al.
Improved query performance with variant indexes
,
1997,
SIGMOD '97.
[3]
W. H. Inmon,et al.
Building the data warehouse (2nd ed.)
,
1996
.
[4]
W. H. Inmon,et al.
Building the data warehouse
,
1992
.
[5]
Surajit Chaudhuri,et al.
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
,
1997,
VLDB.
[6]
Kamalakar Karlapalem,et al.
Some issues in design of data warehousing systems
,
2001
.
[7]
Yannis E. Ioannidis,et al.
Bitmap index design and evaluation
,
1998,
SIGMOD '98.
[8]
Surajit Chaudhuri,et al.
Database Technology for Decision Support Systems
,
2001,
Computer.