• Publications
  • Influence
Finding Top-k Min-Cost Connected Trees in Databases
TLDR
We study finding top-k minimum cost connected trees that contain at least one node in every subset Vi, and denote our problem as GST-k When k = 1, it is known as a minimum cost group Steiner tree problem. Expand
  • 337
  • 38
  • PDF
Statistical Database
TLDR
A statistical database is a database used for statistical analysis purposes. Expand
  • 377
  • 38
Distance-Constraint Reachability Computation in Uncertain Graphs
TLDR
In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call the distance-constraint reachability (DCR) problem. Expand
  • 153
  • 31
  • PDF
Swarm: Mining Relaxed Temporal Moving Object Clusters
TLDR
We propose the concept of swarm which captures the moving objects that move within arbitrary shape of clusters for certain timestamps that are possibly non-consecutive. Expand
  • 311
  • 28
  • PDF
TwigList : Make Twig Pattern Matching Fast
TLDR
We present a new algorithm, called TwigList, which is independently developed and shares similarity with Twig2Stack [9]. Expand
  • 108
  • 20
  • PDF
Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters
TLDR
We present a system that approximates the answer to complex ad-hoc queries in big-data clusters by injecting samplers on-the-fly and without requiring pre-existing samples. Expand
  • 102
  • 17
  • PDF
Blowfish privacy: tuning privacy-utility trade-offs using policies
TLDR
We present Blowfish, a class of privacy definitions inspired by the Pufferfish framework, that provides a rich interface for this trade-off. Expand
  • 126
  • 16
  • PDF
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
TLDR
We introduce the concept of repetitive support to measure how frequently a pattern repeats in the database. Expand
  • 101
  • 16
  • PDF
Mining periodic behaviors for moving objects
Periodicity is a frequently happening phenomenon for moving objects. Finding periodic behaviors is essential to understanding object movements. However, periodic behaviors could be complicated,Expand
  • 260
  • 14
  • PDF
Fast Set Intersection in Memory
TLDR
This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. Expand
  • 84
  • 14
  • PDF