We study theta-joins in general and join predicates with conjunctions and disjunctions of
inequalities in particular, focusing on ranked enumeration where the answers are returned …

Finding patterns in graphs is a fundamental problem in databases and data mining. In many
applications, graphs are temporal and evolve over time, so we are interested in finding …

A common analysis task over a stream of time series is to find all pairs of windows whose
correlation is above a given threshold. For a large number of streams, doing so naively, ie …

Database queries can produce a huge output that is infeasible to compute, regardless of the
algorithm or system that processes them. This can often occur when the query joins large …

Continuous queries over unbounded data streams have emerged as an important query
type in a wide variety of applications. Due to the ubiquity of sensors and sensor networks …

Due to the ubiquity of sensors and sensor networks, the analysis of time series data in a
timely manner or (near) real-time has gained in importance. Time series data analysis can …

K-best enumeration, which asks to output k-best solutions without duplication, is a helpful
tool in data analysis for many fields. In such fields, graphs typically represent data. Thus …

In this thesis we are going to propose efficient algorithms and data structures to handle
similarity join queries over any number of constant relations in the dynamic setting with …

抄録 One way to measure the efficiency of enumeration algorithms is to evaluate it with
respect to the input size and the number of solutions. Since the number of solutions can be …