AN IMPROVED VIEW SELECTION ALGORITHM IN DATA WAREHOUSES BY FINDING FREQUENT QUERIES

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.

SABBAGH GOL REYHANEH; Daneshpour Negin

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

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2017 | Volume:14 | Issue:1 SERIAL 31) Page(s): 29-40

Download Full-Text

Persian Verion

View:

604

Download:

Cites:

Information Journal Paper

Title

AN IMPROVED VIEW SELECTION ALGORITHM IN DATA WAREHOUSES BY FINDING FREQUENT QUERIES

Author(s)

SABBAGH GOL REYHANEH | Daneshpour Negin | Issue Writer Certificate

Keywords

DATA WAREHOUSEQ2

FREQUENT QUERIESQ1

VIEW MATERIALIZATIONQ2

CLUSTERINGQ1

Abstract

A DATA WAREHOUSE is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing FREQUENT QUERIES. Previously posed queries on the DATA WAREHOUSE have profitable information. These queries probably will be used in the future. So, previous queries are clustered using CLUSTERING algorithms. Then FREQUENT QUERIES are found using data mining algorithms. Therefore optimal queries are found in each cluster. In the last stage optimal queries are merged to produce one (query) view for each cluster, and materializes this view. This paper proposes an algorithm for materializing FREQUENT QUERIES. The algorithm finds profitable views using previously posed queries on the DATA WAREHOUSE. These views can answer the most of the queries being posed in the future. This paper uses Index-BittableFI algorithm for finding frequent views. Using this algorithm improves previous view selection algorithms and reduces the response time. The experiments show that the proposed algorithm has %23 improvement in response time and %50 improvement in storage space.

Cites

No record.

References

No record.

Cite

APA: Copy

SABBAGH GOL, REYHANEH, & Daneshpour, Negin. (2017). AN IMPROVED VIEW SELECTION ALGORITHM IN DATA WAREHOUSES BY FINDING FREQUENT QUERIES. SIGNAL AND DATA PROCESSING, 14(1 SERIAL 31) ), 29-40. SID. https://sid.ir/paper/160739/en

Vancouver: Copy

SABBAGH GOL REYHANEH, Daneshpour Negin. AN IMPROVED VIEW SELECTION ALGORITHM IN DATA WAREHOUSES BY FINDING FREQUENT QUERIES. SIGNAL AND DATA PROCESSING[Internet]. 2017;14(1 SERIAL 31) ):29-40. Available from: https://sid.ir/paper/160739/en

IEEE: Copy

REYHANEH SABBAGH GOL, and Negin Daneshpour, “AN IMPROVED VIEW SELECTION ALGORITHM IN DATA WAREHOUSES BY FINDING FREQUENT QUERIES,” SIGNAL AND DATA PROCESSING, vol. 14, no. 1 SERIAL 31) , pp. 29–40, 2017, [Online]. Available: https://sid.ir/paper/160739/en

Related Journal Papers