With the prevalence of Internet access and online services, various big graphs are
generated in many real applications (eg, online social networks and knowledge graphs). An …

Set intersection is a fundamental operation in many applications, such as common neighbor
computation in graph-based algorithms, set similarity computation, item recommendation …

In the last few years, much effort has been devoted to developing join algorithms to achieve
worst-case optimality for join queries over relational databases. Towards this end, the …

Set containment search, which aims to retrieve all set records containing a specific query
set, has received considerable attention. Meanwhile, due to the dramatic growth of data …

Set containment operations form an important tool in various fields such as information
retrieval, AI systems, object-relational databases, and Internet applications. In the paper, a …

The main focus of this work is on large set intersection, which is a pivotal operation in
information retrieval, graph analytics and database systems. We aim to experimentally …

A set containment join operates on two set-valued attributes with a subset (⊆) relationship
as the join condition. It has many real-world applications, such as in publish/subscribe …

In this paper, we study the problem of set containment join. Given two collections R and S of
records, the set containment join R∞ I⊆ S retrieves all record pairs {(r, s)}∈ R× S such that …

This paper proposes a new data structure, multiset-trie, that is designed for storing and
efficiently processing a set of multisets. Moreover, multiset-trie can operate on a set of sets …

In this paper, we study the problem of set containment join. Given two collections RR and SS
of records, the set containment join R ⋈ _ ⊆ SR⋈⊆ S retrieves all record pairs {(r, s)\} ∈ R …