Generic and efficient framework for search trees on flash memory storage systems

Mohamed Sarwat, Mohamed Mokbel, Xun Zhou, Suman Nath

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Tree index structures are crucial components in data management systems. Existing tree index structure are designed with the implicit assumption that the underlying external memory storage is the conventional magnetic hard disk drives. This assumption is going to be invalid soon, as flash memory storage is increasingly adopted as the main storage media in mobile devices, digital cameras, embedded sensors, and notebooks. Though it is direct and simple to port existing tree index structures on the flash memory storage, that direct approach does not consider the unique characteristics of flash memory, i.e., slow write operations, and erase-before-update property, which would result in a sub optimal performance. In this paper, we introduce FAST (i.e., Flash-Aware Search Trees) as a generic framework for flash-aware tree index structures. FAST distinguishes itself from all previous attempts of flash memory indexing in two aspects: (1) FAST is a generic framework that can be applied to a wide class of data partitioning tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through memory flushing and crash recovery techniques. Extensive experimental results, based on an actual implementation of FAST inside the GiST index structure in PostgreSQL, show that FAST achieves better performance than its competitors.

Original languageEnglish
Pages (from-to)417-448
Number of pages32
JournalGeoInformatica
Volume17
Issue number3
DOIs
Publication statusPublished - 1 Jul 2013
Externally publishedYes

Fingerprint

Flash memory
Data storage equipment
Hard disk storage
Digital cameras
Mobile devices
Information management
Durability
indexing
Recovery
performance
Sensors
data management
durability
flushing
efficiency
partitioning
management
index
sensor

Keywords

  • Data
  • Flash memory
  • Index structure
  • Multi-dimensional
  • Spatial
  • Storage
  • System
  • Tree

ASJC Scopus subject areas

  • Geography, Planning and Development
  • Information Systems

Cite this

Generic and efficient framework for search trees on flash memory storage systems. / Sarwat, Mohamed; Mokbel, Mohamed; Zhou, Xun; Nath, Suman.

In: GeoInformatica, Vol. 17, No. 3, 01.07.2013, p. 417-448.

Research output: Contribution to journalArticle

Sarwat, Mohamed ; Mokbel, Mohamed ; Zhou, Xun ; Nath, Suman. / Generic and efficient framework for search trees on flash memory storage systems. In: GeoInformatica. 2013 ; Vol. 17, No. 3. pp. 417-448.
@article{06c1caff5b97432b800de61553231f6d,
title = "Generic and efficient framework for search trees on flash memory storage systems",
abstract = "Tree index structures are crucial components in data management systems. Existing tree index structure are designed with the implicit assumption that the underlying external memory storage is the conventional magnetic hard disk drives. This assumption is going to be invalid soon, as flash memory storage is increasingly adopted as the main storage media in mobile devices, digital cameras, embedded sensors, and notebooks. Though it is direct and simple to port existing tree index structures on the flash memory storage, that direct approach does not consider the unique characteristics of flash memory, i.e., slow write operations, and erase-before-update property, which would result in a sub optimal performance. In this paper, we introduce FAST (i.e., Flash-Aware Search Trees) as a generic framework for flash-aware tree index structures. FAST distinguishes itself from all previous attempts of flash memory indexing in two aspects: (1) FAST is a generic framework that can be applied to a wide class of data partitioning tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through memory flushing and crash recovery techniques. Extensive experimental results, based on an actual implementation of FAST inside the GiST index structure in PostgreSQL, show that FAST achieves better performance than its competitors.",
keywords = "Data, Flash memory, Index structure, Multi-dimensional, Spatial, Storage, System, Tree",
author = "Mohamed Sarwat and Mohamed Mokbel and Xun Zhou and Suman Nath",
year = "2013",
month = "7",
day = "1",
doi = "10.1007/s10707-012-0164-9",
language = "English",
volume = "17",
pages = "417--448",
journal = "GeoInformatica",
issn = "1384-6175",
publisher = "Kluwer Academic Publishers",
number = "3",

}

TY - JOUR

T1 - Generic and efficient framework for search trees on flash memory storage systems

AU - Sarwat, Mohamed

AU - Mokbel, Mohamed

AU - Zhou, Xun

AU - Nath, Suman

PY - 2013/7/1

Y1 - 2013/7/1

N2 - Tree index structures are crucial components in data management systems. Existing tree index structure are designed with the implicit assumption that the underlying external memory storage is the conventional magnetic hard disk drives. This assumption is going to be invalid soon, as flash memory storage is increasingly adopted as the main storage media in mobile devices, digital cameras, embedded sensors, and notebooks. Though it is direct and simple to port existing tree index structures on the flash memory storage, that direct approach does not consider the unique characteristics of flash memory, i.e., slow write operations, and erase-before-update property, which would result in a sub optimal performance. In this paper, we introduce FAST (i.e., Flash-Aware Search Trees) as a generic framework for flash-aware tree index structures. FAST distinguishes itself from all previous attempts of flash memory indexing in two aspects: (1) FAST is a generic framework that can be applied to a wide class of data partitioning tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through memory flushing and crash recovery techniques. Extensive experimental results, based on an actual implementation of FAST inside the GiST index structure in PostgreSQL, show that FAST achieves better performance than its competitors.

AB - Tree index structures are crucial components in data management systems. Existing tree index structure are designed with the implicit assumption that the underlying external memory storage is the conventional magnetic hard disk drives. This assumption is going to be invalid soon, as flash memory storage is increasingly adopted as the main storage media in mobile devices, digital cameras, embedded sensors, and notebooks. Though it is direct and simple to port existing tree index structures on the flash memory storage, that direct approach does not consider the unique characteristics of flash memory, i.e., slow write operations, and erase-before-update property, which would result in a sub optimal performance. In this paper, we introduce FAST (i.e., Flash-Aware Search Trees) as a generic framework for flash-aware tree index structures. FAST distinguishes itself from all previous attempts of flash memory indexing in two aspects: (1) FAST is a generic framework that can be applied to a wide class of data partitioning tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through memory flushing and crash recovery techniques. Extensive experimental results, based on an actual implementation of FAST inside the GiST index structure in PostgreSQL, show that FAST achieves better performance than its competitors.

KW - Data

KW - Flash memory

KW - Index structure

KW - Multi-dimensional

KW - Spatial

KW - Storage

KW - System

KW - Tree

UR - http://www.scopus.com/inward/record.url?scp=84878921912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878921912&partnerID=8YFLogxK

U2 - 10.1007/s10707-012-0164-9

DO - 10.1007/s10707-012-0164-9

M3 - Article

AN - SCOPUS:84878921912

VL - 17

SP - 417

EP - 448

JO - GeoInformatica

JF - GeoInformatica

SN - 1384-6175

IS - 3

ER -