Hash-based symmetric data structure and join algorithm for OLAP applications

Motomichi Toyama, Akira Ohara

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

Star schema is often used in dimensional approaches applied to OLAP applications. The fact table in the star schema typically contains a huge amount of data. When some of the dimension tables are also very large, it may take too much time and storage to join the fact table with these dimension tables. The performance of join algorithm becomes critical under such a condition. The fluent join is a join algorithm that operates on relations organized as multidimensional linear hash files. Like a merge join on relations which are already sorted on the joining key, its execution reads each page in the operand relations no more than once and does not create intermediate result files. Unlike sorting, the multidimensional linear has can cluster records in several keys symmetrically. In this paper, the concept of the fluent join is applied to an OLAP system to cluster records in each table on the joining keys. As a result, the algorithm yields symmetric performances on joins with different dimension tables.

Original languageEnglish
Title of host publicationProceedings of the International Database Engineering and Applications Symposium, IDEAS
Pages231-238
Number of pages8
Publication statusPublished - 1999
EventProceedings of the 1999 International Database Engineering and Application Symposium, IDEAS'99 - Montreal, Que, Can
Duration: 1999 Aug 21999 Aug 4

Other

OtherProceedings of the 1999 International Database Engineering and Application Symposium, IDEAS'99
CityMontreal, Que, Can
Period99/8/299/8/4

Fingerprint

Data structures
Joining
Stars
Sorting

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Toyama, M., & Ohara, A. (1999). Hash-based symmetric data structure and join algorithm for OLAP applications. In Proceedings of the International Database Engineering and Applications Symposium, IDEAS (pp. 231-238)

Hash-based symmetric data structure and join algorithm for OLAP applications. / Toyama, Motomichi; Ohara, Akira.

Proceedings of the International Database Engineering and Applications Symposium, IDEAS. 1999. p. 231-238.

Research output: Chapter in Book/Report/Conference proceedingChapter

Toyama, M & Ohara, A 1999, Hash-based symmetric data structure and join algorithm for OLAP applications. in Proceedings of the International Database Engineering and Applications Symposium, IDEAS. pp. 231-238, Proceedings of the 1999 International Database Engineering and Application Symposium, IDEAS'99, Montreal, Que, Can, 99/8/2.
Toyama M, Ohara A. Hash-based symmetric data structure and join algorithm for OLAP applications. In Proceedings of the International Database Engineering and Applications Symposium, IDEAS. 1999. p. 231-238
Toyama, Motomichi ; Ohara, Akira. / Hash-based symmetric data structure and join algorithm for OLAP applications. Proceedings of the International Database Engineering and Applications Symposium, IDEAS. 1999. pp. 231-238
@inbook{67c0c47e80e7442c953296bdfc694453,
title = "Hash-based symmetric data structure and join algorithm for OLAP applications",
abstract = "Star schema is often used in dimensional approaches applied to OLAP applications. The fact table in the star schema typically contains a huge amount of data. When some of the dimension tables are also very large, it may take too much time and storage to join the fact table with these dimension tables. The performance of join algorithm becomes critical under such a condition. The fluent join is a join algorithm that operates on relations organized as multidimensional linear hash files. Like a merge join on relations which are already sorted on the joining key, its execution reads each page in the operand relations no more than once and does not create intermediate result files. Unlike sorting, the multidimensional linear has can cluster records in several keys symmetrically. In this paper, the concept of the fluent join is applied to an OLAP system to cluster records in each table on the joining keys. As a result, the algorithm yields symmetric performances on joins with different dimension tables.",
author = "Motomichi Toyama and Akira Ohara",
year = "1999",
language = "English",
pages = "231--238",
booktitle = "Proceedings of the International Database Engineering and Applications Symposium, IDEAS",

}

TY - CHAP

T1 - Hash-based symmetric data structure and join algorithm for OLAP applications

AU - Toyama, Motomichi

AU - Ohara, Akira

PY - 1999

Y1 - 1999

N2 - Star schema is often used in dimensional approaches applied to OLAP applications. The fact table in the star schema typically contains a huge amount of data. When some of the dimension tables are also very large, it may take too much time and storage to join the fact table with these dimension tables. The performance of join algorithm becomes critical under such a condition. The fluent join is a join algorithm that operates on relations organized as multidimensional linear hash files. Like a merge join on relations which are already sorted on the joining key, its execution reads each page in the operand relations no more than once and does not create intermediate result files. Unlike sorting, the multidimensional linear has can cluster records in several keys symmetrically. In this paper, the concept of the fluent join is applied to an OLAP system to cluster records in each table on the joining keys. As a result, the algorithm yields symmetric performances on joins with different dimension tables.

AB - Star schema is often used in dimensional approaches applied to OLAP applications. The fact table in the star schema typically contains a huge amount of data. When some of the dimension tables are also very large, it may take too much time and storage to join the fact table with these dimension tables. The performance of join algorithm becomes critical under such a condition. The fluent join is a join algorithm that operates on relations organized as multidimensional linear hash files. Like a merge join on relations which are already sorted on the joining key, its execution reads each page in the operand relations no more than once and does not create intermediate result files. Unlike sorting, the multidimensional linear has can cluster records in several keys symmetrically. In this paper, the concept of the fluent join is applied to an OLAP system to cluster records in each table on the joining keys. As a result, the algorithm yields symmetric performances on joins with different dimension tables.

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

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

M3 - Chapter

SP - 231

EP - 238

BT - Proceedings of the International Database Engineering and Applications Symposium, IDEAS

ER -