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 …

The set similarity join (SSJ) is core functionality in a range of applications, including data
cleaning, near-duplicate object detection, and data integration. Threshold-based SSJ …

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 …

Set superset query is widely used in e-commerce processing and many other domains,
particularly in cloud computing environments. Indexing is an efficient way to model e …

Set similarity search is a problem of central interest to a wide variety of applications such as
data cleaning and web search. Past approaches on set similarity search utilize either heavy …

Data clustering plays a significant role in geospatial data management and analytics. In this
light, we propose and study a novel geospatial data clustering method for multiple reference …

Sequential pattern analysis has become a mature topic with a lot of techniques for a variety
of sequential pattern mining-related problems. Moreover, tailored solutions for specific …

We study the top-k set similarity search problem using semantic overlap. While vanilla
overlap requires exact matches between set elements, semantic overlap allows elements …

Neighborhood inclusion, representing that all the neighbors of a vertex are also adjacent to
another vertex, has been recognized as an important relationship between two vertices in a …

This paper revisits set containment join (SCJ) problem, which uses the subset relationship
(ie, ⊆⊆) as condition to join set-valued attributes of two relations and has many …