IDEAS home Printed from
   My bibliography  Save this article

A distributed maximal frequent itemset mining with multi agents system on bitmap join indexes selection


  • Hamid Necir
  • Habiba Drias


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.

Suggested Citation

  • Hamid Necir & Habiba Drias, 2015. "A distributed maximal frequent itemset mining with multi agents system on bitmap join indexes selection," International Journal of Information Technology and Management, Inderscience Enterprises Ltd, vol. 14(2/3), pages 201-214.
  • Handle: RePEc:ids:ijitma:v:14:y:2015:i:2/3:p:201-214

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijitma:v:14:y:2015:i:2/3:p:201-214. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Carmel O'Grady). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.