By Topic

Efficient interval indexing for content-based subscription e-commerce and e-service

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

4 Author(s)
Kun-Lung Wu ; IBM Thomas J. Watson Res. Center, NY ; Shyh-Kwei Chen ; Yu, P.S. ; Mei, M.

This paper presents a dynamic interval index for fast event matching against a large number of predicate intervals specified by content-based subscriptions. A set of virtual construct intervals (VCIs) are predefined, with a unique ID and an associated ID list. Each predicate interval is decomposed into one or more VCIs, which become activated by the predicate. The predicate ID is then inserted into the ID lists associated with the decomposed VCIs. To facilitate fast search, we start with a bitmap vector to indicate the activation of VCIs that cover an attribute value. Then, we study various techniques to reduce the storage cost, including logarithmic construct intervals (LCI), which reduce the total number of VCIs, bitmap clipping which prunes certain positions of a bitmap vector, and bitmap virtualization, which eliminates the bitmap. Simulations are conducted to evaluate and compare these techniques

Published in:

E-Commerce Technology for Dynamic E-Business, 2004. IEEE International Conference on

Date of Conference:

15-15 Sept. 2004