Jiefeng Cheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiefeng Cheng has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jeffrey Xu Yu
The Chinese University of Hong Kong, Hong Kong, China
3 shared publications - Bolin Ding
THE CHINESE UNIVERSITY OF HONG KONG, CHINA
1 shared publication - Byron Choi
Hong Kong Baptist University
1 shared publication - Haixun Wang
IBM T. J. Watson Research Center
1 shared publication - Philip S. Yu
University of Illinois Chicago
1 shared publication - Ramadhana Bramandia
Nanyang Technological University
1 shared publication
Latest Publications
- 16 April 2009
- Published by Springer Nature in The VLDB Journal
- Vol. 18 (6) , 1313-1333
Optimizing updates of recursive XML views of relations
- 16 April 2009
- Published by Springer Nature in The VLDB Journal
- Vol. 18 (6) , 1313-1333
Optimizing updates of recursive XML views of relations
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 913-922
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high expressive power to model complicated structures. The dominance of graphs in real-world applications asks for new graph data management so that users can access graph data effectively and efficiently. In this paper, we study a graph pattern matching problem over a large data graph. The problem is to find all patterns in a large data graph that match a user-given graph pattern. We propose a new two-step R-join (reachability join) algorithm with filter step and fetch step based on a cluster- based join-index with graph codes. We consider the filter step as an R-semijoin, and propose a new optimization approach by interleaving R-joins with R-semijoins. We conducted extensive performance studies, and confirm the efficiency of our proposed new approaches.
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 913-922
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high expressive power to model complicated structures. The dominance of graphs in real-world applications asks for new graph data management so that users can access graph data effectively and efficiently. In this paper, we study a graph pattern matching problem over a large data graph. The problem is to find all patterns in a large data graph that match a user-given graph pattern. We propose a new two-step R-join (reachability join) algorithm with filter step and fetch step based on a cluster- based join-index with graph codes. We consider the filter step as an R-semijoin, and propose a new optimization approach by interleaving R-joins with R-semijoins. We conducted extensive performance studies, and confirm the efficiency of our proposed new approaches.