JURNAL INTERNASIONAL
Journal of Theoritical and Apllied Information Technology
A large number of interactive queries are being excuted day by day. The user expects for an answer without no time after the execution. Even is scientific executions the user needs the intial query results for analysis without bwiting for the entire process to complete. The state pf art join algorthms are not ideal for this settings as most of the algorithms are hash/sort based algorithms, which requires some pre work before it can produce the results. We propose a new join algorithm, Maximized Result Rate Join Algorithm (MRR), which produces the first few results without much delay. It also producess the maximum join query results during tyhe early stage of the join operation this is achieved by exploiting the histogram, which is available in database statistic. Histogram provides the frequency of the attriburte in a table.
| B.03220035 | 004.0285 JATIT J JurnalInternasional | Perpus STMIK (Jurnal Internasional) | Tersedia |
Tidak tersedia versi lain