Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
We demonstrate the IPL B+ -tree prototype, which has been designed as a flash-aware index structure by adopting the in-page logging (IPL) scheme. The IPL scheme has been proposed ...
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...