A distributed maximal frequent itemset mining with multi agents system on bitmap join indexes selection
by Hamid Necir; Habiba Drias
International Journal of Information Technology and Management (IJITM), Vol. 14, No. 2/3, 2015

Abstract: The amount of information in a data warehouse tends to be extremely large and queries may involve several complex join and aggregate operations at the same time. By using the right indices, the database administrator can speed up these OLAP queries and dramatically shorten processing times. However, selection of an optimal set of indices is a very hard task because of the exponential number of attribute candidates that can be used in the selection process. Addressing this problem, we propose a new approach with two main phases. The first involves pruning the search space to reduce the number of indices candidates. To that end, we use a distributed maximal itemsets mining approach based on a multi agent system that can significantly reduce the complexity of the selection process. We also incorporate a convertible anti-monotone constraint that contains information on the profit of index. The second phase uses also a multi agent's architecture to select final indices using a subset of attribute candidates. This final configuration will provide benefit to OLAP queries, but will also respect the disk space constraint. We validate our proposed approach using an experimental evaluation.

Online publication date: Sat, 04-Apr-2015

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 Technology and Management (IJITM):
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