Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Parallel maintenance of materialized views on personal computer clusters

dc.contributor.authorLiang, Weifaen
dc.contributor.authorYu, Jeffrey X.en
dc.date.accessioned2026-01-01T07:41:36Z
dc.date.available2026-01-01T07:41:36Z
dc.date.issued2002en
dc.description.abstractA data warehouse is a repository of integrated information, which collects and maintains a large amount of data from multiple distributed, autonomous, and possibly heterogeneous data sources. Often the data are stored in the form of materialized views in order to provide fast access to the integrated data. How to maintain the warehouse data completely consistently with the remote source data is a challenging issue in a distributed environment. Transactions containing multiple updates at one or multiple sources further complicate this consistency issue. Due to the fact that a data warehouse usually contains a very large amount of data and its processing is time consuming, it becomes inevitable to introduce parallelism to data warehousing. The popularity and cost-effective parallelism brought by the PC cluster makes it a promising platform for this purpose. This article considers the complete consistency maintenance of select-project-join (SPJ) materialized views. Based on a PC cluster consisting of K personal computers, several parallel maintenance algorithms for the materialized views are presented. The key behind the proposed algorithms is how to trade off the work load among the PCs and how to balance the communications cost among the PCs as well as between the PC cluster and remote sources.en
dc.description.statusPeer-revieweden
dc.format.extent8en
dc.identifier.issn1206-2138en
dc.identifier.scopus0036975490en
dc.identifier.urihttps://hdl.handle.net/1885/733798826
dc.language.isoenen
dc.sourceInternational Journal of Parallel and Distributed Systems and Networksen
dc.subjectData warehousingen
dc.subjectIncremental maintenanceen
dc.subjectMaterialized view maintenanceen
dc.subjectParallel algorithmsen
dc.subjectPartitioningen
dc.subjectPC clusteren
dc.titleParallel maintenance of materialized views on personal computer clustersen
dc.typeJournal articleen
dspace.entity.typePublicationen
local.bibliographicCitation.lastpage154en
local.bibliographicCitation.startpage147en
local.contributor.affiliationLiang, Weifa; School of Computing, ANU College of Systems and Society, The Australian National Universityen
local.contributor.affiliationYu, Jeffrey X.; Chinese University of Hong Kongen
local.identifier.ariespublicationMigratedxPub4566en
local.identifier.citationvolume5en
local.identifier.pure2fb66ddf-2777-4a06-86a9-0aa723a279c3en
local.identifier.urlhttps://www.scopus.com/pages/publications/0036975490en
local.type.statusPublisheden

Downloads