James Cheng

Fg-index: towards verification-free query processing on graph databases

James Cheng, Yiping Ke, Wilfred Ng, An Lu
SIGMOD Conference
2007

Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to efficiently process… (More)

K-isomorphism: privacy preserving network publication against structural attacks

James Cheng, Ada Wai-Chee Fu, Jia Liu
SIGMOD Conference
2010

Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due to the diversity and… (More)

Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs

The rapid growth in the volume of many real-world graphs (e.g., social networks, web graphs, and spatial networks) has led to the development of various vertex-centric distributed graph computing… (More)

Truss Decomposition in Massive Networks

Jia Wang, James Cheng
PVLDB
2012

The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm… (More)

A model-based approach to attributed graph clustering

Zhiqiang Xu, Yiping Ke, Yi Wang, Hong Cheng, James Cheng
SIGMOD Conference
2012

Graph clustering, also known as community detection, is a long-standing problem in data mining. However, with the proliferation of rich attribute information available for objects in real-world… (More)

Xqzip: Querying compressed XML using structural indexing

James Cheng, Wilfred Ng
2004

TF-Label: a topological-folding labeling scheme for reachability querying in a large graph

James Cheng, Silu Huang, Huanhuan Wu, Ada Wai-Chee Fu
SIGMOD Conference
2013

Reachability querying is a basic graph operation with numerous important applications in databases, network analysis, computational biology, software engineering, etc. Although many indexes have been… (More)

Efficient core decomposition in massive networks

James Cheng, Yiping Ke, Shumo Chu, M. Tamer Özsu
IEEE 27th International Conference on Data…
2011

The k-core of a graph is the largest subgraph in which every vertex is connected to at least k other vertices within the subgraph. Core decomposition finds the k-core of the graph for every possible… (More)

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation

Massive graphs, such as online social networks and communication networks, have become common today. To efficiently analyze such large graphs, many distributed graph computing systems have been… (More)

Triangle listing in massive networks and its applications

Triangle listing is one of the fundamental algorithmic problems whose solution has numerous applications especially in the analysis of complex networks, such as the computation of clustering… (More)

Filter Results:

Publication Year

Publication Type

Co-author

Journals and Conferences