Evaluation of materialized view indexing in data warehousing environments

Ladjel Bellatreche; Kamalakar Karlapalem; Qing Li

Evaluation of materialized view indexing in data warehousing environments

Ladjel Bellatreche, Kamalakar Karlapalem, Qing Li

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

7 Citations (Scopus)

Abstract

Index selection is one of the most important decisions in designing a data warehouse (DW). In this paper, we present a framework for a class of graph join indices used for indexing queries defined on materialized views. We develop storage cost needed for these indices, and query processing strategies using them. We formulate the graph join index selection problem, and present algorithms which can provide good query performance under limited storage space for the indices. We also evaluate these algorithms to show their utilities by using an example taken from Informix white paper.

Original language	English
Title of host publication	Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings
Editors	Yahiko Kambayashi, A. Min Tjoa, Mukesh Mohania
Publisher	Springer-Verlag
Pages	57-66
Number of pages	10
ISBN (Print)	3540679804, 9783540679806
Publication status	Published - 1 Jan 2000
Externally published	Yes
Event	2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000 - London, United Kingdom Duration: 4 Sept 2000 → 6 Sept 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1874
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000
Country/Territory	United Kingdom
City	London
Period	4/09/00 → 6/09/00

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Cite this

Bellatreche, L., Karlapalem, K., & Li, Q. (2000). Evaluation of materialized view indexing in data warehousing environments. In Y. Kambayashi, A. M. Tjoa, & M. Mohania (Eds.), Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings (pp. 57-66). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1874). Springer-Verlag.

Bellatreche, Ladjel ; Karlapalem, Kamalakar ; Li, Qing. / Evaluation of materialized view indexing in data warehousing environments. Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings. editor / Yahiko Kambayashi ; A. Min Tjoa ; Mukesh Mohania. Springer-Verlag, 2000. pp. 57-66 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{744e8e0fbf994090978e68ddcd929ab7,

title = "Evaluation of materialized view indexing in data warehousing environments",

abstract = "Index selection is one of the most important decisions in designing a data warehouse (DW). In this paper, we present a framework for a class of graph join indices used for indexing queries defined on materialized views. We develop storage cost needed for these indices, and query processing strategies using them. We formulate the graph join index selection problem, and present algorithms which can provide good query performance under limited storage space for the indices. We also evaluate these algorithms to show their utilities by using an example taken from Informix white paper.",

author = "Ladjel Bellatreche and Kamalakar Karlapalem and Qing Li",

year = "2000",

month = jan,

day = "1",

language = "English",

isbn = "3540679804",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "57--66",

editor = "Yahiko Kambayashi and Tjoa, {A. Min} and Mukesh Mohania",

booktitle = "Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings",

note = "2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000 ; Conference date: 04-09-2000 Through 06-09-2000",

}

Bellatreche, L, Karlapalem, K & Li, Q 2000, Evaluation of materialized view indexing in data warehousing environments. in Y Kambayashi, AM Tjoa & M Mohania (eds), Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1874, Springer-Verlag, pp. 57-66, 2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000, London, United Kingdom, 4/09/00.

Evaluation of materialized view indexing in data warehousing environments. / Bellatreche, Ladjel; Karlapalem, Kamalakar; Li, Qing.
Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings. ed. / Yahiko Kambayashi; A. Min Tjoa; Mukesh Mohania. Springer-Verlag, 2000. p. 57-66 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1874).

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Evaluation of materialized view indexing in data warehousing environments

AU - Bellatreche, Ladjel

AU - Karlapalem, Kamalakar

AU - Li, Qing

PY - 2000/1/1

Y1 - 2000/1/1

N2 - Index selection is one of the most important decisions in designing a data warehouse (DW). In this paper, we present a framework for a class of graph join indices used for indexing queries defined on materialized views. We develop storage cost needed for these indices, and query processing strategies using them. We formulate the graph join index selection problem, and present algorithms which can provide good query performance under limited storage space for the indices. We also evaluate these algorithms to show their utilities by using an example taken from Informix white paper.

AB - Index selection is one of the most important decisions in designing a data warehouse (DW). In this paper, we present a framework for a class of graph join indices used for indexing queries defined on materialized views. We develop storage cost needed for these indices, and query processing strategies using them. We formulate the graph join index selection problem, and present algorithms which can provide good query performance under limited storage space for the indices. We also evaluate these algorithms to show their utilities by using an example taken from Informix white paper.

UR - http://www.scopus.com/inward/record.url?scp=84947553796&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

AN - SCOPUS:84947553796

SN - 3540679804

SN - 9783540679806

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 57

EP - 66

BT - Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings

A2 - Kambayashi, Yahiko

A2 - Tjoa, A. Min

A2 - Mohania, Mukesh

PB - Springer-Verlag

T2 - 2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000

Y2 - 4 September 2000 through 6 September 2000

ER -

Bellatreche L, Karlapalem K, Li Q. Evaluation of materialized view indexing in data warehousing environments. In Kambayashi Y, Tjoa AM, Mohania M, editors, Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings. Springer-Verlag. 2000. p. 57-66. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Evaluation of materialized view indexing in data warehousing environments

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this