MINER: An Improved Adaptive Join Algorithm | OMICS International | Abstract
ISSN: 2277-1891

International Journal of Advance Innovations, Thoughts & Ideas
Open Access

Our Group organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations
700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article

MINER: An Improved Adaptive Join Algorithm

C. Naga Pradeep Kumar1,*, Prof. A. Ananda Rao2

1Asst.Prof,IT Dept., SRIT, Anantapur, Andhra Pradesh

2Principal, JNTUACEA, Anantapur, Andhra Pradesh

*Corresponding Author:
C. Naga Pradeep Kumar
Asst.Prof,IT Dept
SRIT, Anantapur
Andhra Pradesh, India
E-mail: [email protected]


Adaptive join algorithms were created to overcome the drawbacks of traditional join algorithms in emerging data integration or online aggregation environments. The input relations to adaptive joins are continuously retrieved from remote sources. The main objective for designing these algorithms is to i) start producing the first output tuples as soon as possible ii) produce the remaining results at a fast rate. One of the early adaptive join algorithm Multiple Index Nested-loop Reactive join (MINER) is a multi-way join operator used for joining an arbitrary number of input sources. Here MINER was limited to chain joins. In this paper, MINER is extended to support snowflake joins, where each relation may participate in joins with more than two join attributes. It will improve producing result tuples at a significantly higher rate, while making better use of the available memory.