“…Although many efforts have been devoted towards reducing the burden of updates for tree based indexes [3], [15], [13], [27], [37] and extend them to in-memory environments [11], [9], [24], [33], [34], [19], recent works [32], [24], [25] imply that, with in-memory settings, simple uniform grids are usually more efficient than tree based structures. The reason is that disk I/Os are eliminated for in-memory indexes, consequently, the sophisticated designs that aim to reduce disk I/O costs become cumbersome since they make update operations complicated and time consuming.…”