NDLI: A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary $B^{+}-trees$

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

A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary $B^{+}-trees$

Content Provider	ACM Digital Library
Author	Srinivasan, Jagannathan Das, Souripriya Chong, Eugene Inseok Krishnan, Ramkumar Jiang, Richard Jagannath, Mahesh Freiwald, Chuck Yalamanchi, Aravind Tran, Anh-Tuan
Abstract	Any auxiliary structure, such as a bitmap or a $B^{+}-tree$ index, that refers to rows of a table stored as a primary $B^{+}-tree$ (e.g., tables with clustered index in Microsoft SQL Server, or index-organized tables in Oracle) by their physical addresses would require updates due to inherent volatility of those addresses. To address this problem, we propose a mapping mechanism that 1) introduces a single mapping table, with each row holding one key value from the primary $B^{+}-tree,$ as an intermediate structure between the primary $B^{+}-tree$ and the associated auxiliary structures, and 2) augments the primary $B^{+}-tree$ structure to include in each row the physical address of the corresponding mapping table row. The mapping table row addresses can then be used in the auxiliary structures to indirectly refer to the primary $B^{+}-tree$ rows. The two key benefits are: 1) the mapping table shields the auxiliary structures from the volatility of the primary $B^{+}-tree$ row addresses, and 2) the method allows reuse of existing conventional table mechanisms for supporting auxiliary structures on primary $B^{+}-$ trees.This paper presents the mapping mechanism, its possible application in supporting various auxiliary structures on primary $B^{+}-trees,$ and a case study describing its use for supporting bitmap indexes on index-organized tables in Oracle9i. The case study demonstrates that the proposed mapping mechanism allows us to reuse existing bitmap index technologies with minimal changes. It also includes a comparison between bitmap and non-bitmap $(B^{+}-$ tree) index performance on index-organized tables for both single-table queries and star queries. The analytical and experimental studies show that the method is storage efficient, and (despite the mapping table overhead) provides performance benefits that are similar to those provided by bitmap indexes implemented on conventional tables.
Starting Page	78
Ending Page	88
Page Count	11
File Format	PDF
ISSN	01635808
DOI	10.1145/776985.777000
Journal	ACM SIGMOD Record (SGMD)
Volume Number	32
Issue Number	2
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-06-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Information Systems Software

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 mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary $B^{+}-trees$

A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary b +-trees.

Bitmap index design and evaluation

Comments on optimality of B-trees

An empirical comparison of B-trees, compact B-trees and multiway trees

Main-memory index structures with fixed-size partial keys

Optimizing Jan Jannink's Implementation of B+-tree deletion

Optimizing bitmap indices with efficient compression

Efficient locking for concurrent operations on B-trees

A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary $B^{+}-trees$

Similar Documents

A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary $B^{+}-trees$

A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary b +-trees.

Bitmap index design and evaluation

Comments on optimality of B-trees

An empirical comparison of B-trees, compact B-trees and multiway trees

Main-memory index structures with fixed-size partial keys

Optimizing Jan Jannink's Implementation of B+-tree deletion

Optimizing bitmap indices with efficient compression

Efficient locking for concurrent operations on B-trees

A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary $B^{+}-trees$