Approximate queries on distributed data marts
by Francis A. Mendez Mediavilla, Hsun-Ming Lee
International Journal of Information and Decision Sciences (IJIDS), Vol. 1, No. 4, 2009

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.

Online publication date: Mon, 10-Aug-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Decision Sciences (IJIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com