NDLI logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Journal of Computer Science and Technology
  2. Journal of Computer Science and Technology : Volume 25
  3. Journal of Computer Science and Technology : Volume 25, Issue 3, May 2010
  4. Flash-Optimized B+-Tree
Loading...

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

Journal of Computer Science and Technology : Volume 32
Journal of Computer Science and Technology : Volume 31
Journal of Computer Science and Technology : Volume 30
Journal of Computer Science and Technology : Volume 29
Journal of Computer Science and Technology : Volume 28
Journal of Computer Science and Technology : Volume 27
Journal of Computer Science and Technology : Volume 26
Journal of Computer Science and Technology : Volume 25
Journal of Computer Science and Technology : Volume 25, Issue 6, November 2010
Journal of Computer Science and Technology : Volume 25, Issue 5, September 2010
Journal of Computer Science and Technology : Volume 25, Issue 4, July 2010
Journal of Computer Science and Technology : Volume 25, Issue 3, May 2010
Preface
Outlier Detection over Sliding Windows for Probabilistic Data Streams
Privacy-Preserving Data Sharing in Cloud Computing
Efficient Location Updates for Continuous Queries over Moving Objects
Towards Progressive and Load Balancing Distributed Computation: A Case Study on Skyline Analysis
Context-Sensitive Document Ranking
The Inverse Classification Problem
Annotation Based Query Answer over Inconsistent Database
HAPS: Supporting Effective and Efficient Full-Text P2P Search with Peer Dynamics
A Solution of Data Inconsistencies in Data Integration — Designed for Pervasive Computing Environment
Flash-Optimized B+-Tree
Efficient Distributed Skyline Queries for Mobile Applications
A Query Interface Matching Approach Based on Extended Evidence Theory for Deep Web
Dynamic Damage Recovery for Web Databases
Harmonic Field Based Volume Model Construction from Triangle Soup
Making Slide Shows with Zoomquilts
Model Transduction for Triangle Meshes
Feature Preserving Mesh Simplification Using Feature Sensitive Metric
Geometry Texture Synthesis Based on Laplacian Texture Image
Geometric Bone Modeling: From Macro to Micro Structures
Nonlocal-Means Image Denoising Technique Using Robust M-Estimator
Multilevel Threshold Based Image Denoising in Curvelet Domain
A New Classifier for Facial Expression Recognition: Fuzzy Buried Markov Model
Journal of Computer Science and Technology : Volume 25, Issue 2, March 2010
Journal of Computer Science and Technology : Volume 25, Issue 1, January 2010
Journal of Computer Science and Technology : Volume 24
Journal of Computer Science and Technology : Volume 23
Journal of Computer Science and Technology : Volume 22
Journal of Computer Science and Technology : Volume 21
Journal of Computer Science and Technology : Volume 20
Journal of Computer Science and Technology : Volume 19
Journal of Computer Science and Technology : Volume 18
Journal of Computer Science and Technology : Volume 17
Journal of Computer Science and Technology : Volume 16
Journal of Computer Science and Technology : Volume 15
Journal of Computer Science and Technology : Volume 14
Journal of Computer Science and Technology : Volume 13
Journal of Computer Science and Technology : Volume 12

Similar Documents

...
Prefetching J$^{+}$-Tree: A Cache-Optimized Main Memory Database Index Structure

Article

...
Next High Performance and Low Power Flash Memory Package Structure

Article

...
Tree Expressions for Information Systems

Article

...
Adaptive Indexing of Moving Objects with Highly Variable Update Frequencies

Article

...
Special announcement

Article

...
Formal Reasoning About Lazy-STM Programs

Article

...
Declarative XML Update Language Based on a Higher Data Model

Article

...
Calculi for concurrent processes

Article

...
Report from CSCWID'97

Report

Flash-Optimized B+-Tree

Content Provider SpringerLink
Author Tung On, Sai Hu, Haibo Li, Yu Xu, Jianliang
Copyright Year 2010
Abstract With the rapid increasing capacity of flash memory, flash-aware indexing techniques are highly desirable for flash devices. The unique features of flash memory, such as the erase-before-write constraint and the asymmetric read/write cost, severely deteriorate the performance of the traditional B+-tree algorithm. In this paper, we propose an optimized indexing method, called lazy-update B+-tree, to overcome the limitations of flash memory. The basic idea is to defer the committing of update requests to the B+-tree by buffering them in a segment of main memory. They are later committed in groups so that the cost of each write operation can be amortized by a bunch of update requests. We identify a victim selection problem for the lazy-update B+-tree and develop two heuristic-based commit policies to address this problem. Simulation results show that the proposed lazy-update method, along with a well-designed commit policy, greatly improves the update performance of the traditional B+-tree while preserving the query efficiency.
Starting Page 509
Ending Page 522
Page Count 14
File Format PDF
ISSN 10009000
Journal Journal of Computer Science and Technology
Volume Number 25
Issue Number 3
e-ISSN 18604749
Language English
Publisher Springer US
Publisher Date 2010-05-08
Publisher Place Boston
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword B+-tree flash memory indexing lazy update Information Systems Applications (incl.Internet) Artificial Intelligence (incl. Robotics) Data Structures, Cryptology and Information Theory Theory of Computation Software Engineering Computer Science
Content Type Text
Resource Type Article
Subject Theoretical Computer Science Computational Theory and Mathematics Computer Science Applications Software Hardware and Architecture
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
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
I will try my best to help you...
Cite this Content
Loading...