2009
DOI: 10.14778/1687553.1687573
|View full text |Cite
|
Sign up to set email alerts
|

Efficient index compression in DB2 LUW

Abstract: In database systems, the cost of data storage and retrieval are important components of the total cost and response time of the system. A popular mechanism to reduce the storage footprint is by compressing the data residing in tables and indexes. Compressing indexes efficiently, while maintaining response time requirements, is known to be challenging. This is especially true when designing for a workload spectrum covering both data warehousing and transaction processing environments. DB2 Linux, UNIX, Windows (… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 31 publications
(25 citation statements)
references
References 20 publications
0
25
0
Order By: Relevance
“…Bhattacharjee et al [5] have introduced index compression techniques used in DB2. Ordulu and Tolmer [6] have proposed the adaptive padding method to reduce the compression overhead for insert-intensive workloads.…”
Section: Related Workmentioning
confidence: 99%
“…Bhattacharjee et al [5] have introduced index compression techniques used in DB2. Ordulu and Tolmer [6] have proposed the adaptive padding method to reduce the compression overhead for insert-intensive workloads.…”
Section: Related Workmentioning
confidence: 99%
“…Poess and Potapov [7] have presented compression techniques used in Oracle for data warehouses and OLAP systems where the majority of the accesses are read only. Bhattacharjee et al [2] have introduced index compression schemes used in DB2. Aghav [1] has introduced various compression techniques for difference domains of databases.…”
Section: Related Workmentioning
confidence: 99%
“…In such a case, the Indirection method needs to traverse only one index, and update one LID-to-RID mapping. 13 In contrast, the base method needs to traverse and update HDDresident pages for every index. Figure 10 shows that the performance improvement approaches 20X as the number of indexes increases from 1 to 16.…”
Section: Gist Implementationmentioning
confidence: 99%
“…These capabilities are often important for operational data stores [35]. For example, it is not uncommon to find tens of indexes to improve analytical and decision-making queries even in TPC benchmarks [20,19] or enterprise resource planning (ERP) scenarios [14,13].…”
Section: Introductionmentioning
confidence: 99%