activity
20122021
most citedK-Reach: Who is in Your Small World

3 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DB20212 cited

Version Reconciliation for Collaborative Databases

Nalin Ranjan, Zechao Shang, Aaron J. Elmore +1

We propose MindPalace, a prototype of a versioned database for efficient collaborative data management. MindPalace supports offline collaboration, where users work independently wi…

cs.DB20211 cited

Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing

Xi Liang, Stavros Sintos, Zechao Shang +1

Sample-based approximate query processing (AQP) suffers from many pitfalls such as the inability to answer very selective queries and unreliable confidence intervals when sample si…

cs.DB2020

Fast and Reliable Missing Data Contingency Analysis with Predicate-Constraints

Xi Liang, Zechao Shang, Aaron J. Elmore +2

Today, data analysts largely rely on intuition to determine whether missing or withheld rows of a dataset significantly affect their analyses. We propose a framework that can produ…

cs.DB20123 cited

K-Reach: Who is in Your Small World

James Cheng, Zechao Shang, Hong Cheng +2

We study the problem of answering k-hop reachability queries in a directed graph, i.e., whether there exists a directed path of length k, from a source query vertex to a target que…

cs.SI20121 cited

Estimating Node Influenceability in Social Networks

Rong-Hua Li, Jeffrey Xu Yu, Zechao Shang

Influence analysis is a fundamental problem in social network analysis and mining. The important applications of the influence analysis in social network include influence maximiza…