Efficient Processing method of OLAP Range-Sum Queries in a dynamic warehouse environment 


Vol. 10,  No. 3, pp. 427-438, Jun.  2003
10.3745/KIPSTD.2003.10.3.427


PDF
  Abstract

In a data warehouse, users typically search for trends, patterns, or unusual data behaviors by issuing queries interactively. The OLAP range-sum query is widely used in finding trends and in discovering relationships among attributes in the data warehouse. In a recent environment of enterprises, data elements in a data cube are frequently changed. The problem is that the cost of updating a prefix sum cube is very high. In this paper, we propose a novel algorithm which reduces the update cost significantly by an index structure called the Δ-tree. Also, we propose a hybrid method to provide either approximate or precise results to reduce the overall cost of queries. It is highly beneficial for various applications that need quick approximate answers rather than time consuming accurate ones, such as decision support systems. An extensive experiment shows that our method performs very efficiently on diverse dimensionalities, compared to other methods.

  Statistics
  Cite this article

[IEEE Style]

S. J. Chun and J. H. Lee, "Efficient Processing method of OLAP Range-Sum Queries in a dynamic warehouse environment," The KIPS Transactions:PartD, vol. 10, no. 3, pp. 427-438, 2003. DOI: 10.3745/KIPSTD.2003.10.3.427.

[ACM Style]

Seok Ju Chun and Ju Hong Lee. 2003. Efficient Processing method of OLAP Range-Sum Queries in a dynamic warehouse environment. The KIPS Transactions:PartD, 10, 3, (2003), 427-438. DOI: 10.3745/KIPSTD.2003.10.3.427.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals