Increasing the Speed of Incremental View Maintenance Using the Cuckoo Algorithm

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.

KARIMI MOSADEGH AFIFEH; 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:3 (serial 33) Page(s): 113-126

Download Full-Text

Persian Verion

View:

674

Download:

Cites:

Information Journal Paper

Title

Increasing the Speed of Incremental View Maintenance Using the Cuckoo Algorithm

Author(s)

KARIMI MOSADEGH AFIFEH | Daneshpour Negin | Issue Writer Certificate

Keywords

data warehouseQ2

Cuckoo algorithmQ1

random searchQ1

optimization delta treeQ1

incremental view maintenanceQ1

Abstract

data warehouse is a repository of integrated data that is collected from various sources. data warehouse has the capability to maintain data from various sources in its view form. So the view should be maintained and during changes of the sources they should also be updated. Since the increase in updates may cause costly overhead, therefore it is necessary to update views with high accuracy. The algorithm presented in this paper is the combination of a grouping approach with Cuckoo heuristic Algorithm that reduces maintenance time of views and thus speed up maintenance time. Cuckoo optimization algorithm begins with an initial population. Trying to survive of the Cuckoo makes the base for optimization algorithm. The results show that the Cuckoo algorithm implementation compared with previous methods is faster in order to update its incremental view.

Cites

No record.

References

No record.

Cite

APA: Copy

KARIMI MOSADEGH, AFIFEH, & Daneshpour, Negin. (2017). Increasing the Speed of Incremental View Maintenance Using the Cuckoo Algorithm. SIGNAL AND DATA PROCESSING, 14(3 (serial 33) ), 113-126. SID. https://sid.ir/paper/160705/en

Vancouver: Copy

KARIMI MOSADEGH AFIFEH, Daneshpour Negin. Increasing the Speed of Incremental View Maintenance Using the Cuckoo Algorithm. SIGNAL AND DATA PROCESSING[Internet]. 2017;14(3 (serial 33) ):113-126. Available from: https://sid.ir/paper/160705/en

IEEE: Copy

AFIFEH KARIMI MOSADEGH, and Negin Daneshpour, “Increasing the Speed of Incremental View Maintenance Using the Cuckoo Algorithm,” SIGNAL AND DATA PROCESSING, vol. 14, no. 3 (serial 33) , pp. 113–126, 2017, [Online]. Available: https://sid.ir/paper/160705/en

Related Journal Papers