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

Invented about 40 years ago and called ubiquitous less than 10 years later, B-tree indexes
have been used in a wide variety of computing systems from handheld devices to …

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 …

Bitmap compression has been studied extensively in the database area and many efficient
compression schemes were proposed, eg, BBC, WAH, EWAH, and Roaring. Inverted list …

This paper details RDF/OWL storage and management in two popular Relational Database
Management Systems (RDBMSs): Oracle and Virtuoso. Popularity, sustainability, and …

As scientific instruments and computer simulations produce more and more data, the task of
locating the essential information to gain insight becomes increasingly difficult. FastBit is an …

Current access paradigms for the Web, ie, direct access via search engines or database
queries and navigational access via static taxonomies, have recently been criticized …

Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage.
To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based …

Data warehouses and online analytical processing (OLAP) are emerging key technologies
for enterprise decision support systems. They provide sophisticated technologies from data …

The ever-increasing number of intrusions in public and commercial networks has created
the need for high-speed archival solutions that continuously store streaming network data to …