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 …

Efficient subgraph queries in large databases are a time-critical task in many application
areas as eg biology or chemistry, where biological networks or chemical compounds are …

Object-oriented and object-relational DBMS support set valued attributes, which are a
natural and concise way to model complex information. However, there has been limited …

A new data structure set-trie for storing and retrieving sets is proposed. Efficient
manipulation of sets is vital in a number of systems including datamining tools, object …

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 …

The Semantic Web is commonly interpreted under the open-world assumption, meaning that
information available (eg, in a data source) captures only a subset of the reality. Therefore …

SQL declaratively specifies what the desired output of a query is. This work shows that a non-
standard interpretation of the SQL semantics can, instead, disclose where a piece of the …

Set-valued attributes frequently occur in contexts like market-basked analysis and stock
market trends. Late research literature has mainly focused on set containment joins and data …

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 …

Joins on set-valued attributes (set joins) have numerous database applications. In this paper
we propose PRETTI (PREfix Tree based seT joIn)–a suite of set join algorithms for …