Index structure for the fact table of a star-join schema and template query processing

Authors:
Anna Rozeva
Affiliations:
Department of Computer Systems and Informatics, University of Forestry Sofia
Venue:
CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning
Year:
2003

Citing 6
Cited 0

The interval B-tree

Information Processing Letters
The data warehouse toolkit: practical techniques for building dimensional data warehouses

The data warehouse toolkit: practical techniques for building dimensional data warehouses
Comparison of access methods for time-evolving data

ACM Computing Surveys (CSUR)
Data Abstraction and Problem Solving with C++: Walls and Mirrors

Data Abstraction and Problem Solving with C++: Walls and Mirrors
Access Methods for Bi-Temporal Databases

Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
An Algebra for a Temporal Object Data Model

DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Star-join is a database scheme designed for the purpose of data warehousing. A typical query on a star-join scheme as well as an algorithm for its processing has been examined. An index structure for the star-join fact table has been proposed with the aim of facilitating template query processing. A multilevel index for the fact table's composite key has been built having time_key as a top'level. Stream processing technique has been implemented for resolving query's application and join constraints as well as the aggregation step of the query processing algorithm.