activity
20092022
most citedOptimal Algorithms for Crawling a Hidden Database in the Web

4 citations · 12 across the 9 of their papers we have counts for

collaborators
Showing cs.DBShow all

6 papers · 1 filter

cs.DB2022

Parallel Acyclic Joins with Canonical Edge Covers

Yufei Tao

In PODS'21, Hu presented an algorithm in the massively parallel computation (MPC) model that processes any acyclic join with an asymptotically optimal load. In this paper, we prese…

cs.DB2020★ 3 cited

A Near-Optimal Parallel Algorithm for Joining Binary Relations

Bas Ketsman, Dan Suciu, Yufei Tao

We present a constant-round algorithm in the massively parallel computation (MPC) model for evaluating a natural join where every input relation has two attributes. Our algorithm a…

cs.DB2012★ 4 cited

Optimal Algorithms for Crawling a Hidden Database in the Web

Cheng Sheng, Nan Zhang, Yufei Tao +1

A hidden database refers to a dataset that an organization makes accessible on the web by allowing users to issue queries through a search interface. In other words, data acquisiti…

cs.DB2012★ 1 cited

A Scalable Algorithm for Maximizing Range Sum in Spatial Databases

Dong-Wan Choi, Chin-Wan Chung, Yufei Tao

This paper investigates the MaxRS problem in spatial databases. Given a set O of weighted points and a rectangular region r of a given size, the goal of the MaxRS problem is to fin…

cs.DB2010★ 2 cited

Transparent Anonymization: Thwarting Adversaries Who Know the Algorithm

Xiaokui Xiao, Yufei Tao, Nick Koudas

Numerous generalization techniques have been proposed for privacy preserving data publishing. Most existing techniques, however, implicitly assume that the adversary knows little a…

cs.DB2009

The Hardness and Approximation Algorithms for L-Diversity

Xiaokui Xiao, Ke Yi, Yufei Tao

The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, where…