Please use this identifier to cite or link to this item:
Title: Approximate Query Answering Using Data Warehouse Striping
Authors: Bernardino, Jorge R. 
Furtado, Pedro S. 
Madeira, Henrique C. 
Issue Date: 2002
Citation: Journal of Intelligent Information Systems. 19:2 (2002) 145-167
Abstract: This paper presents and evaluates a simple but very effective method to implement large data warehouses on an arbitrary number of computers, achieving very high query execution performance and scalability. The data is distributed and processed in a potentially large number of autonomous computers using our technique called data warehouse striping (DWS). The major problem of DWS technique is that it would require a very expensive cluster of computers with fault tolerant capabilities to prevent a fault in a single computer to stop the whole system. In this paper, we propose a radically different approach to deal with the problem of the unavailability of one or more computers in the cluster, allowing the use of DWS with a very large number of inexpensive computers. The proposed approach is based on approximate query answering techniques that make it possible to deliver an approximate answer to the user even when one or more computers in the cluster are not available. The evaluation presented in the paper shows both analytically and experimentally that the approximate results obtained this way have a very small error that can be negligible in most of the cases.
DOI: 10.1023/A:1016551309288
Rights: openAccess
Appears in Collections:FCTUC Eng.Informática - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
obra.pdf940.83 kBAdobe PDFView/Open
Show full item record


checked on May 29, 2020


checked on May 29, 2020

Page view(s)

checked on Jun 3, 2020


checked on Jun 3, 2020

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.