FAST: A generic framework for flash-aware spatial trees

Mohamed Sarwat, Mohamed Mokbel, Xun Zhou, Suman Nath

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

Spatial tree index structures are crucial components in spatial data management systems, 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 spatial 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 Spatial Trees) as a generic framework for flash-aware spatial 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 spatial tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through smart 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
Title of host publicationAdvances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings
Pages149-167
Number of pages19
DOIs
Publication statusPublished - 19 Sep 2011
Externally publishedYes
Event12th International Symposium on Advances in Spatial and Temporal Databases, SSTD 2011 - Minneapolis, MN, United States
Duration: 24 Aug 201126 Aug 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6849 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Symposium on Advances in Spatial and Temporal Databases, SSTD 2011
CountryUnited States
CityMinneapolis, MN
Period24/8/1126/8/11

Fingerprint

Flash memory
Flash
Flash Memory
Data storage equipment
Hard disk storage
Digital cameras
Mobile devices
Information management
Durability
Recovery
Data Partitioning
Framework
R-tree
External Memory
Sensors
Digital Camera
Spatial Structure
Spatial Data
Crash
Tree Structure

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sarwat, M., Mokbel, M., Zhou, X., & Nath, S. (2011). FAST: A generic framework for flash-aware spatial trees. In Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings (pp. 149-167). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6849 LNCS). https://doi.org/10.1007/978-3-642-22922-0_10

FAST : A generic framework for flash-aware spatial trees. / Sarwat, Mohamed; Mokbel, Mohamed; Zhou, Xun; Nath, Suman.

Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. 2011. p. 149-167 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6849 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sarwat, M, Mokbel, M, Zhou, X & Nath, S 2011, FAST: A generic framework for flash-aware spatial trees. in Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6849 LNCS, pp. 149-167, 12th International Symposium on Advances in Spatial and Temporal Databases, SSTD 2011, Minneapolis, MN, United States, 24/8/11. https://doi.org/10.1007/978-3-642-22922-0_10
Sarwat M, Mokbel M, Zhou X, Nath S. FAST: A generic framework for flash-aware spatial trees. In Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. 2011. p. 149-167. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22922-0_10
Sarwat, Mohamed ; Mokbel, Mohamed ; Zhou, Xun ; Nath, Suman. / FAST : A generic framework for flash-aware spatial trees. Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. 2011. pp. 149-167 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{df991c4d56844ea0b24dc8e6e22479be,
title = "FAST: A generic framework for flash-aware spatial trees",
abstract = "Spatial tree index structures are crucial components in spatial data management systems, 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 spatial 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 Spatial Trees) as a generic framework for flash-aware spatial 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 spatial tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through smart 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.",
author = "Mohamed Sarwat and Mohamed Mokbel and Xun Zhou and Suman Nath",
year = "2011",
month = "9",
day = "19",
doi = "10.1007/978-3-642-22922-0_10",
language = "English",
isbn = "9783642229213",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "149--167",
booktitle = "Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings",

}

TY - GEN

T1 - FAST

T2 - A generic framework for flash-aware spatial trees

AU - Sarwat, Mohamed

AU - Mokbel, Mohamed

AU - Zhou, Xun

AU - Nath, Suman

PY - 2011/9/19

Y1 - 2011/9/19

N2 - Spatial tree index structures are crucial components in spatial data management systems, 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 spatial 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 Spatial Trees) as a generic framework for flash-aware spatial 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 spatial tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through smart 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 - Spatial tree index structures are crucial components in spatial data management systems, 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 spatial 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 Spatial Trees) as a generic framework for flash-aware spatial 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 spatial tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through smart 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.

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

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

U2 - 10.1007/978-3-642-22922-0_10

DO - 10.1007/978-3-642-22922-0_10

M3 - Conference contribution

AN - SCOPUS:80052733715

SN - 9783642229213

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 149

EP - 167

BT - Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings

ER -