Lijun Chang

Rashmika Gamage

Proc. VLDB Endow., July, 2024

Identifying Large Structural Balanced Cliques in Signed Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., March, 2024

Maximum k-Plex Computation: Theory and Practice.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, February, 2024

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance.

[BibT_eX]

[DOI]

CoRR, 2024

2023

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks.

[BibT_eX]

[DOI]

VLDB J., November, 2023

Efficient Maximum k-Defective Clique Computation with Improved Time Complexity.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, September, 2023

Accelerating Graph Similarity Search via Efficient GED Computation.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., May, 2023

ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2023

Verification-Free Approaches to Efficient Locally Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

On Directed Densest Subgraph Detection.

[BibT_eX]

[DOI]

Xin Yang

Proceedings of the Databases Theory and Applications, 2023

2022

Distance labeling: on parallelism, compression, and ordering.

[BibT_eX]

[DOI]

VLDB J., 2022

Cohesive Subgraph Search Using Keywords in Large Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Efficient Sink-Reachability Analysis via Graph Reduction.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Identifying Similar-Bicliques in Bipartite Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Efficient Maximum k-Plex Computation over Large Sparse Graphs.

[BibT_eX]

[DOI]

Mouyi Xu

Darren Strash

Proc. VLDB Endow., 2022

A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition.

[BibT_eX]

[DOI]

Zhiyi Wang

Proc. VLDB Endow., 2022

Anchored Densest Subgraph.

[BibT_eX]

[DOI]

Yizhou Dai

Miao Qiao

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

On Scalable Computation of Graph Eccentricities.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Computing Maximum Structural Balanced Cliques in Signed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021

Application of Fuzzy Comprehensive Evaluation Based on Genetic Algorithm in Psychological Measurement.

[BibT_eX]

[DOI]

Sci. Program., 2021

Efficient Size-Bounded Community Search over Large Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

2020

Efficient maximum clique computation and enumeration over large sparse graphs.

[BibT_eX]

[DOI]

VLDB J., 2020

Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System.

[BibT_eX]

[DOI]

CoRR, 2020

Deconstruct Densest Subgraphs.

[BibT_eX]

[DOI]

Miao Qiao

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Fast Algorithm for Distance Dynamics-Based Community Detection.

[BibT_eX]

[DOI]

Maram Alsahafy

Proceedings of the Web Information Systems Engineering - WISE 2020, 2020

Progressive Top-K Nearest Neighbors Search in Large Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

Scaling Up Distance Labeling on Graphs with Core-Periphery Properties.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

Speeding Up GED Verification for Graph Similarity Search.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficient Closest Community Search over Large Graphs.

[BibT_eX]

[DOI]

Mingshen Cai

Proceedings of the Database Systems for Advanced Applications, 2020

2019

Leveraging set relations in exact and dynamic set similarity join.

[BibT_eX]

[DOI]

VLDB J., 2019

Eccentricities on small-world networks.

[BibT_eX]

[DOI]

VLDB J., 2019

Supergraph Search in Graph Databases via Hierarchical Feature-Tree.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

Computing Maximum Independent Sets over Large Sparse Graphs.

[BibT_eX]

[DOI]

Maram Alsahafy

Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Scaling Distance Labeling on Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the 2019 International Conference on Management of Data, 2019

Efficient Maximum Clique Computation over Large Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Index-Based Densest Clique Percolation Community Search in Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Enumerating k-Vertex Connected Components in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Cohesive Subgraph Computation Over Large Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018

Index-Based Densest Clique Percolation Community Search in Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2018

Automatic Index Selection for Large-Scale Datalog Computation.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

An Optimal and Progressive Approach to Online Search of Top-K Influential Communities.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

Distributed computing connected components with linear communication cost.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 2018

When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Conference on Management of Data, 2018

Querying Cohesive Subgraphs by Keywords.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Exacting Eccentricity for Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017

Ranking weighted clustering coefficient in large dynamic graphs.

[BibT_eX]

[DOI]

World Wide Web, 2017

Scalable subgraph enumeration in MapReduce: a cost-oriented approach.

[BibT_eX]

[DOI]

VLDB J., 2017

pSCAN: Fast and Exact Structural Graph Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

Effective and Efficient Dynamic Graph Coloring.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Efficient Structural Graph Clustering: An Index-Based Approach.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Leveraging Set Relations in Exact Set Similarity Join.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition.

[BibT_eX]

[DOI]

CoRR, 2017

An Optimal and Progressive Approach to Online Search of Top-k Important Communities.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation.

[BibT_eX]

[DOI]

CoRR, 2017

Enumerating k-Vertex Connected Components in Large Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling.

[BibT_eX]

[DOI]

Wei Li

Wenjie Zhang

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Scalable Top-K Structural Diversity Search.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016

Diversified top-k clique search.

[BibT_eX]

[DOI]

VLDB J., 2016

I/O Efficient ECC Graph Decomposition via Graph Reduction.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Scalable Distributed Subgraph Enumeration.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Efficient Subgraph Matching by Postponing Cartesian Products.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Management of Data, 2016

Scalable supergraph search in large graph databases.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Computing Connected Components with linear communication cost in pregel-like systems.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

pSCAN: Fast and exact structural graph clustering.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015

Probabilistic n-of-N skyline computation over uncertain data streams.

[BibT_eX]

[DOI]

Wenjie Zhang

Aiping Li

Muhammad Aamir Cheema

Ying Zhang

World Wide Web, 2015

I/O efficient: computing SCCs in massive graphs.

[BibT_eX]

[DOI]

VLDB J., 2015

Scalable Subgraph Enumeration in MapReduce.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Optimal Enumeration: Efficient Top-k Tree Matching.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Locally Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Efficiently Computing Top-K Shortest Path Join.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Extending Database Technology, 2015

Efficient String Similarity Search: A Cross Pivotal Based Approach.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2015

2014

Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2014

Scalable big graph processing in MapReduce.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 2014

Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2014

2013

Computing weight constraint reachability in large networks.

[BibT_eX]

[DOI]

VLDB J., 2013

More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Fast Maximal Cliques Enumeration in Sparse Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2013

Efficiently computing k-edge connected components via graph decomposition.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

2012

The exact distance to destination in undirected world.

[BibT_eX]

[DOI]

VLDB J., 2012

Computing Structural Statistics by Keywords in Databases.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2012

Diversifying Top-K Results.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

2011

Uncertain data management.

[BibT_eX]

[DOI]

PhD thesis, 2011

Scalable keyword search on large data streams.

[BibT_eX]

[DOI]

VLDB J., 2011

Finding information nebula over large networks.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010

Ten Thousand SQLs: Parallel Keyword Queries Computing.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2010

Context-Sensitive Document Ranking.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2010

Keyword Search in Relational Databases: A Survey.

[BibT_eX]

[DOI]

IEEE Data Eng. Bull., 2010

Probabilistic ranking over relations.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2010, 2010

2009

Keyword Search in Databases

[BibT_eX]

[DOI]

Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-79426-1, 2009

Fast Probabilistic Ranking under x-Relation Model

[BibT_eX]

[DOI]

CoRR, 2009

Keyword search in databases: the power of RDBMS.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Scalable Keyword Search on Large Data Streams.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

Querying Communities in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

Query ranking in probabilistic XML data.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2009, 2009

2003

GAC-decomposition based soft decoding of block codes for multimedia data.

[BibT_eX]

[DOI]

Dongfeng Yuan

Chun-Yan Gao