Grid-File: Towards to a Flash Efficient Multi-dimensional Index

Spatial indexes are of great importance for multidimensional query processing. Traditional data structures have been optimized for magnetic disks in the storage layer. In the recent years flash solid disks are widely utilized, as a result of their exceptional features. However, the specifics of flash memory (asymmetric read/write speeds erase before update, wear out) introduce new challenges. Algorithms and data structures designed for magnetic disks experience reduced performance in flash. Most research efforts for flash-aware spatial indexes concern R-tree and its variants. Distinguishing from previous works we investigate the performance of Grid File in flash and enlighten constrains and opportunities towards a flash efficient Grid File. We conducted experiments on mainstream and high performance SSD devices and Grid File outperforms R\(^*\)-tree in all cases.

[1]  Peiquan Jin,et al.  OR-Tree: An Optimized Spatial Tree Index for Flash-Memory Storage Systems , 2012, ICDKE.

[2]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[3]  Sang-Won Lee,et al.  B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives , 2011, Proc. VLDB Endow..

[4]  Ahmed Eldawy,et al.  A Demonstration of SpatialHadoop: An Efficient MapReduce Framework for Spatial Data , 2013, Proc. VLDB Endow..

[5]  Ramesh K. Sitaraman,et al.  Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices , 2009, Proc. VLDB Endow..

[6]  Philippe Bonnet,et al.  uFLIP: Understanding Flash IO Patterns , 2009, CIDR.

[7]  Suman Nath,et al.  FAST: A Generic Framework for Flash-Aware Spatial Trees , 2011, SSTD.

[8]  Yannis Manolopoulos,et al.  Grid File (and Family) , 2009, Encyclopedia of Database Systems.

[9]  Ling Yuan,et al.  Efficient implementation of a multi-dimensional index structure over flash memory storage systems , 2011, The Journal of Supercomputing.

[10]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[11]  Joonwon Lee,et al.  CFLRU: a replacement algorithm for flash memory , 2006, CASES '06.

[12]  Tei-Wei Kuo,et al.  An efficient B-tree layer implementation for flash-memory storage systems , 2007, TECS.

[13]  Klaus H. Hinrichs,et al.  Implementation of the grid file: Design concepts and experience , 1985, BIT.

[14]  Kwangjin Park,et al.  Location-based grid-index for spatial query processing , 2014, Expert Syst. Appl..

[15]  Tei-Wei Kuo,et al.  An efficient R-tree implementation over flash-memory storage systems , 2003, GIS '03.

[16]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[17]  Anastasia Ailamaki,et al.  BF-Tree: Approximate Tree Indexing , 2014, Proc. VLDB Endow..

[18]  Sungho Kim,et al.  AS B-tree: A Study of an Efficient B+-tree for SSDs , 2014, J. Inf. Sci. Eng..

[19]  Peiquan Jin,et al.  AD-LRU: An efficient buffer replacement algorithm for flash-based databases , 2012, Data Knowl. Eng..

[20]  Tilmann Rabl,et al.  DGFIndex for Smart Grid: Enhancing Hive with a Cost-Effective Multidimensional Range Index , 2014, Proc. VLDB Endow..

[21]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[22]  Maciej Pawlik,et al.  Implementation of the Aggregated R-Tree over Flash Memory , 2012, DASFAA Workshops.

[23]  Stratis Viglas,et al.  Spatial Data Management over Flash Memory , 2011, SSTD.

[24]  Jing Li,et al.  Log-Compact R-Tree: An Efficient Spatial Index for SSD , 2011, DASFAA Workshops.

[25]  Peiquan Jin,et al.  Optimizing R-tree for flash memory , 2015, Expert Syst. Appl..