In this paper, we focus on accelerating a widely employed computing pattern---set
intersection, to boost a group of graph algorithms. Graph's adjacency-lists can be naturally …

Set intersection is a fundamental operation in information retrieval and database systems.
This paper introduces linear space data structures to represent sets such that their …

Set intersection is one of the most important operations for many applications such as Web
search engines or database management systems. This paper describes our new algorithm …

Major web search engines answer thousands of queries per second requesting information
about billions of web pages. The data sizes and query loads are growing at an exponential …

In this paper, we focus on sorted-set intersection which is an important part in many
algorithms, eg, RID-list intersection, inverted indexes, and others. In contrast to traditional …

Given two collections of set objects R and S, the R ⋈ _ ⊆ SR⋈⊆ S set containment join
returns all object pairs (r, s) ∈ R * S (r, s)∈ R× S such that r ⊆ sr⊆ s. Besides being a basic …

A lot of research has studied how to optimize inverted index structures in search engines
through suitable reassignment of document identifiers. This approach was originally …

In this paper we address the problem of efficiently evaluating containment (ie, subset,
equality, and superset) queries over set-valued data. We propose a novel indexing scheme …

Lists intersection is an important operation in modern web search engines. Many prior
studies have focused on the single-core or multi-core CPU platform or many-core GPU. In …

This paper studies how to design an index structure on a collection of sets to answer the
following queries: given distinct set ids, report where is a filtering function. We present a …