OPTIMIZING OLAP QUERIES BY MAPPING DATA CUBE TO TWO DIMENSIONAL SPACE

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SOHRABI M.K.; ABD ELAHZADEH BARFOROUSH A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, A- MUHANDISI -I BARQ Year:2009 | Volume:6 | Issue:4 Page(s): 345-352

Download Full-Text

Persian Verion

View:

1,142

Download:

Cites:

Information Journal Paper

Title

OPTIMIZING OLAP QUERIES BY MAPPING DATA CUBE TO TWO DIMENSIONAL SPACE

Author(s)

SOHRABI M.K. | ABD ELAHZADEH BARFOROUSH A. | Issue Writer Certificate

Keywords

DATA WAREHOUSEQ2

ON-LINE ANALYTICAL PROCESSING (OLAP)Q3

MULTI-DIMENSIONAL DATA MODELQ3

DATA CUBEQ3

Abstract

DATA WAREHOUSE and OLAP are essential elements of decision support systems (DSS) and have been studied in database issues extensively. The requirements of decision support systems are different from on-line transactional processing systems. Query optimization and efficient DATA CUBE computation have primary roles in improving functionality of DSS.This paper presents a new method for query processing in DATA WAREHOUSEs and computing DATA CUBEs using bottom-up cube computation techniques. Results of implementation show that the proposed algorithm outperforms two best known algorithms (based on time criterion), and is much faster than them in answering to monotonic query with large volume of data. Furthermore, 2-dimensional view of ex-cube and transforming the DATA CUBE to a hyper graph structure, reduce the required space of the algorithm when we aggregate subsets of cube's dimension.

Cites

No record.

References

No record.

Cite

APA: Copy

SOHRABI, M.K., & ABD ELAHZADEH BARFOROUSH, A.. (2009). OPTIMIZING OLAP QUERIES BY MAPPING DATA CUBE TO TWO DIMENSIONAL SPACE. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), 6(4), 345-352. SID. https://sid.ir/paper/393847/en

Vancouver: Copy

SOHRABI M.K., ABD ELAHZADEH BARFOROUSH A.. OPTIMIZING OLAP QUERIES BY MAPPING DATA CUBE TO TWO DIMENSIONAL SPACE. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN)[Internet]. 2009;6(4):345-352. Available from: https://sid.ir/paper/393847/en

IEEE: Copy

M.K. SOHRABI, and A. ABD ELAHZADEH BARFOROUSH, “OPTIMIZING OLAP QUERIES BY MAPPING DATA CUBE TO TWO DIMENSIONAL SPACE,” NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), vol. 6, no. 4, pp. 345–352, 2009, [Online]. Available: https://sid.ir/paper/393847/en

Related Journal Papers