Show simple item record

dc.contributor.advisorRoussopoulos, Nicken_US
dc.contributor.authorLabrinidis, Alexandrosen_US
dc.contributor.authorRoussopoulos, Nicken_US
dc.date.accessioned2007-05-23T10:06:30Z
dc.date.available2007-05-23T10:06:30Z
dc.date.issued1998en_US
dc.identifier.urihttp://hdl.handle.net/1903/5988
dc.description.abstractData warehouse maintenance algorithms usually work off-line, making the warehouse unavailable tousers. However, since most organizations require continuous operation, we need to be able to performthe updates online, concurrently with user queries. To guarantee that user queries access a consistentview of the warehouse, online update algorithms introduce redundancy in order to store multipleversions of the data objects that are being changed. In this paper, we present an online warehouseupdate algorithm that stores multiple versions of data as separate rows (vertical redundancy). Wecompare our algorithm to another online algorithm that stores multiple versions within each tuple byextending the table schema (horizontal redundancy). We have implemented both algorithms on top ofan Informix Dynamic Server and measured their performance under varying workloads, focusing ontheir impact on query response times. Our experiments show that, except for a limited number ofcases, vertical redundancy is a better choice, with respect to storage, implementation overhead, andquery performance.en_US
dc.format.extent221188 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1998-63en_US
dc.relation.ispartofseriesCSHCN; TR 1998-17en_US
dc.subjectdata warehousesen_US
dc.subjectupdate algorithmsen_US
dc.subjectonline,en_US
dc.titleA Performance Evaluation of Online Warehouse Update Algorithmsen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record