By Topic

Query processing for selection and projection using inverted partitioned indexes

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
$31 $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

2 Author(s)
Teh Ying Wah ; Sch. of Art & Sci., Tunku Abdul Rahman Coll., Malaysia ; Yew Kok Meng

Very large data volumes and reading data from different information sources and updating data in local information sources make traditional indexing techniques such as the Record Identification (RID) index unsuitable for data warehouses. Bitmap indexes are a promising technique to replace RID at the selection level of query processing. We introduce a variant of the inverted partitioned index that materializes the secondary key of the base relation to the store primary key instead of RID. Query Processing for selection and projection using the inverted partitioned index can process relevant data at the index level without going through the base relation. We use a disk page for the criteria to analyse the inverted partitioned index compared with related techniques such as full scan, RID index and Bitmap Index. Our new inverted partitioned index is much better than these related techniques

Published in:

TENCON 2000. Proceedings  (Volume:1 )

Date of Conference:

2000