Approximate queries on distributed data marts

Francis A. Mendez Mediavilla and Hsun-Ming Lee

International Journal of Information and Decision Sciences, 2009, vol. 1, issue 4, 366-381

Abstract: The global business deals with a large amount of business data that are stored in potentially hundreds of distributed systems. It is challenging to allow end-users issue online analytical processing (OLAP) queries to retrieve suitable information through a worldwide network. This article presents the idea of using statistical methods to model federated data marts. Once data marts are modelled, reduced sets of distributed data can be imported and used to approximately reconstruct a federated data mart. Approximate queries can then be obtained from the reconstructed federated data mart. Advantages of this design include: quick query responses without accessing external servers; user-defined accuracy of the approximate query answers and network-efficient method for periodical updates. A proof of concept is presented using large data sets used for marketing analysis purposes.

Keywords: approximate queries; federated data marts; data reduction; distributed systems; OLAP; online analytical processing; modelling; query response; marketing analysis. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=27757 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijidsc:v:1:y:2009:i:4:p:366-381

Access Statistics for this article

More articles in International Journal of Information and Decision Sciences from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().