Skip to main content

Table 1 Time and Space complexities of Algorithm 1 and 2

From: MuSe: a multi-level storage scheme for big RDF data using MapReduce

Algorithm Time Complexity Space Complexity
Algo 1 O[(n+nm)+(ij)] (Best Case) O[(n+nm)+(i+ij)] (Average Case) O(I) (Worst Case) O[(n-size)+(nm-size)] (Best and Average Case) O(I-size) (Worst Case)
Algo 2 O(ij) (Best Case) O(i+ij) (Average Case) O(I) (Worst Case) O(IR-size\(_1\)+IR-size\(_2\)+....+IR-size\(_i\)) (Best, Average and Worst Case)