NDLI: FB-tree: a $B^{+}-tree$ for flash-based SSDs

Please wait, while we are loading the content...

Aggregates and priorities in P2P data management systems

Databases on the web: national web domain survey

A family of graph-theory-driven algorithms for managing complex probabilistic graph data efficiently

Scalable queries for large datasets using cloud computing: a case study

An efficient local region and clustering-based ensemble system for intrusion detection

Addressing resource usage in stream processing systems: sizing window effect

Trajectory data analysis using complex networks

A new architectural paradigm for content-based web applications: Borè

A landmark-model based system for mining frequent patterns from uncertain data streams

A predictable storage model for scalable parallel DW

Efficient incremental breadth-depth XML event mining

Using an inference mechanism for helping the data integration

FB-tree: a $B^{+}-tree$ for flash-based SSDs

Semantics-enabled web APIs selection patterns

Query language constructs for provenance

Union rewritings for XPath fragments

Top-k query processing for combinatorial objects using Euclidean distance

Mining semantic data for solving first-rater and cold-start problems in recommender systems

M-TOP: multi-target operator placement of query graphs for data streams

Query answering on trajectory cuboids using prime numbers encodings

A data masking technique for data warehouses

A statically typed query language for property graphs

A clustering-based visualization of colocation patterns

Black-box determination of cost models' parameters for federated stream-processing systems

Scrubbing query results from probabilistic databases

Flexible approximate counting

Online outlier detection for data streams

Query optimization using column statistics in hive

Boosting tuple propagation in multi-relational classification

Answering complex structured queries over the deep web

SciQL: bridging the gap between science and relational DBMS

Cache-conscious data placement in an in-memory key-value store

Extend core UDF framework for GPU-enabled analytical query evaluation

Chimera: data sharing flexibility, shared nothing simplicity

ParallelGDB: a parallel graph database based on cache specialization

An approach towards automatic workflow composition through information retrieval

FB-tree: a $B^{+}-tree$ for flash-based SSDs

Content Provider	ACM Digital Library
Author	Rasmussen, René B. Šaltenis, Simonas Schjønning, Carsten Jørgensen, Martin V.
Abstract	Due to their many advantages, flash-based SSDs (Solid-State Drives) have become a mainstream alternative to magnetic disks for database servers. Nevertheless, database systems, designed and optimized for magnetic disks, still do not fully exploit all the benefits of the new technology. We propose the FB-tree: a combination of an adapted $B^{+}-tree,$ a storage manager, and a buffer manager, all optimized for modern SSDs. Together the techniques enable writing to SSDs in relatively large blocks, thus achieving greater overall throughput. This is achieved by the out-of-place writing, whereby every time a modified index node is written, it is written to a new address, clustered with some other nodes that are written together. While this constantly frees index nodes, the FB-tree does not introduce any garbage-collection overhead, instead relying on naturally occurring free-space segments of sufficient size. As a consequence, the FB-tree outperforms a regular $B^{+}-tree$ in all scenarios tested. For instance, the throughput of a random workload of 75% updates increases by a factor of three using only two times the space of the $B^{+}-tree.$
Starting Page	34
Ending Page	42
Page Count	9
File Format	PDF
ISBN	9781450306270
DOI	10.1145/2076623.2076629
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-09-21
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Buffer manager Ssds Storage manager B+-tree
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A group round robin based b-tree index storage scheme for flash memory devices

A flash-friendly $B^{+}-tree$ with endurance-awareness

A B-tree employing a cascade memory node on NAND flash SSDs

Multi-buffer manager: energy efficient buffer manager for databases on flash memory.

Turbocharging DBMS buffer pool using SSDs

1 AS B-tree: A study of an efficient B+-tree for SSDs

A Write-Optimized B-Tree Layer for NAND Flash Memory

Hotness-aware buffer management for flash-based hybrid storage systems

An adaptive write buffer management scheme for flash-based SSDs

FB-tree: a $B^{+}-tree$ for flash-based SSDs

Similar Documents

A group round robin based b-tree index storage scheme for flash memory devices

A flash-friendly $B^{+}-tree$ with endurance-awareness

A B-tree employing a cascade memory node on NAND flash SSDs

Multi-buffer manager: energy efficient buffer manager for databases on flash memory.

Turbocharging DBMS buffer pool using SSDs

1 AS B-tree: A study of an efficient B+-tree for SSDs

A Write-Optimized B-Tree Layer for NAND Flash Memory

Hotness-aware buffer management for flash-based hybrid storage systems

An adaptive write buffer management scheme for flash-based SSDs

FB-tree: a $B^{+}-tree$ for flash-based SSDs