B. Ding

Publications
Influence

Finding Top-k Min-Cost Connected Trees in Databases

B. Ding, J. X. Yu, S. Wang, Lu Qin, X. Zhang, X. Lin
Computer Science
IEEE 23rd International Conference on Data…
15 April 2007

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

Statistical Database

R. Topor, K. Salem, +173 authors T. Neumann
Computer Science
Encyclopedia of Database Systems
2009

A statistical database is a database used for statistical analysis purposes. Expand

Distance-Constraint Reachability Computation in Uncertain Graphs

R. Jin, L. Liu, B. Ding, H. Wang
Computer Science
Proc. VLDB Endow.
1 June 2011

In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call the distance-constraint reachability (DCR) problem. Expand

Swarm: Mining Relaxed Temporal Moving Object Clusters

Z. Li, B. Ding, Jiawei Han, R. Kays
Computer Science
Proc. VLDB Endow.
1 September 2010

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

TwigList : Make Twig Pattern Matching Fast

Lu Qin, J. X. Yu, B. Ding
Computer Science
DASFAA
9 April 2007

We present a new algorithm, called TwigList, which is independently developed and shares similarity with Twig2Stack [9]. Expand

Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters

S. Kandula, A. Shanbhag, +4 authors B. Ding
Computer Science
SIGMOD Conference
1 June 2016

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

Blowfish privacy: tuning privacy-utility trade-offs using policies

X. He, Ashwin Machanavajjhala, B. Ding
Computer Science
SIGMOD Conference
13 December 2013

We present Blowfish, a class of privacy definitions inspired by the Pufferfish framework, that provides a rich interface for this trade-off. Expand

Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database

B. Ding, D. Lo, Jiawei Han, S. Khoo
Computer Science
IEEE 25th International Conference on Data…
29 March 2009

We introduce the concept of repetitive support to measure how frequently a pattern repeats in the database. Expand

Mining periodic behaviors for moving objects

Z. Li, B. Ding, Jiawei Han, R. Kays, P. Nye
Mathematics, Computer Science
KDD '10
25 July 2010

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

Fast Set Intersection in Memory

B. Ding, A. König
Computer Science
Proc. VLDB Endow.
11 March 2011

This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. Expand

Recommended Authors