We investigate the problem of processing a large amount of continuous spatial-keyword
queries over streaming data, which is essential in many applications such as location-based …

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

In many search applications related to passage retrieval, text entailment, and subgraph
search, the query and each'document'is a set of elements, with a document being relevant if …

Many applications need to process massive streams of spatio-textual data in real-time
against continuous spatio-textual queries. For example, in location-aware ad targeting …

We investigate the problem of efficiently supporting location-aware Publish/Subscribe
(Pub/Sub for short), which is essential in many applications such as location-based …

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 …

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 …

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 …