2010Microcomputer InformationRequires access

Parallel Star Join Strategy On Data Warehouses

Yongping Zhang

Open publisher page 0 citations

Abstract

In this paper,we are interested in developing strategies for improving query processing in data warehouses by exploring the applicability of parallel processing techniques.And,we propose a strategy which incorporates both task and data partitioning and present the Parallel Star Join Algorithm.

About this research paper

What this paper is about

In this paper,we are interested in developing strategies for improving query processing in data warehouses by exploring the applicability of parallel processing techniques.And,we propose a strategy which incorporates both task and data partitioning and present the Parallel Star Join Algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper,we are interested in developing strategies for improving query processing in data warehouses by exploring the applicability of parallel processing techniques.And,we propose a strategy which incorporates both task and data partitioning and present the Parallel Star Join Algorithm.

Key concepts: Computer science, Join (topology), Data warehouse, Star schema, Task (project management), Star (game theory), Data processing, Database

Related papers

Back to paper searchBrowse research topicsOriginal source
Parallel Star Join Strategy On Data Warehouses — Research Paper | ScholarLens