Visualization and analysis tools, techniques, and algorithms have undergone a rapid
evolution in recent decades to accommodate explosive growth in data size and complexity …

Bitmap indices are efficient for answering queries on low-cardinality attributes. In this article,
we present a new compression scheme called Word-Aligned Hybrid (WAH) code that makes …

It is well established that bitmap indices are efficient for read-only attributes with low attribute
cardinalities. For an attribute with a high cardinality, the size of the bitmap index can be very …

We study the effects of compression on bitmap indexes. The main operations on the bitmaps
during query processing are bitwise logical operations. Using the general purpose …

This paper analyzes the performance of concurrent (index) scan operations in both record
(NSM/PAX) and column (DSM) disk storage models and shows that existing scheduling …

The goal of this project is the development of a novel environment to support globally
distributed scientific exploration involving multi-PetaByte datasets. The project will devise …

The amount of scientific data generated by simulations or collected from large scale
experiments have reached levels that cannot be stored in the researcher's workstation or …

Many scientific applications generate large spatio-temporal datasets. A common way of
exploring these datasets is to identify and track regions of interest. Usually these regions are …

Many database applications make extensive use of bitmap indexing schemes. In this paper,
we study how to improve the efficiencies of these indexing schemes by proposing new …

Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data
warehousing and scientific applications. However, they suffer from the curse of cardinality …