By Topic

A compact index structure with high data retrieval efficiency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The B+-tree and its variants have been reported as the good index structures for retrieving data. However, their index schemes are short of optimizing data arrangement in the external structures. Improper handles adopted in the traditional splitting policies including pre-partition of data underlying space, node splitting by force, node splitting with unbalanced partition, and node splitting upon overflowed loading usually burden index structures with plenty of inefficient storage space and exceeding construction overhead. Consequentially, time and space efficiencies in conventional B+-tree and its variants remain much room for improvement. In this paper, a new index scheme is proposed to organize data into a more compactness via a better splitting policy. The new index scheme constantly compresses data in the external structure of an index tree and makes neighboring data more aggregative than traditional methods. The compact B+-trees elevate space utilization to a higher level which is near 90%. Both system efficiencies and data selectivity are remarkably improved by compact B+-trees.

Published in:

2008 International Conference on Service Systems and Service Management

Date of Conference:

June 30 2008-July 2 2008