Lijun Chang

Orcid: 0000-0002-6830-3900

According to our database1, Lijun Chang authored at least 102 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient k-Clique Count Estimation with Accuracy Guarantee.
Proc. VLDB Endow., July, 2024

Identifying Large Structural Balanced Cliques in Signed Graphs.
IEEE Trans. Knowl. Data Eng., March, 2024

Maximum k-Plex Computation: Theory and Practice.
Proc. ACM Manag. Data, February, 2024

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

2023
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks.
VLDB J., November, 2023

Efficient Maximum k-Defective Clique Computation with Improved Time Complexity.
Proc. ACM Manag. Data, September, 2023

Accelerating Graph Similarity Search via Efficient GED Computation.
IEEE Trans. Knowl. Data Eng., May, 2023

ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing.
IEEE Trans. Knowl. Data Eng., 2023

Verification-Free Approaches to Efficient Locally Densest Subgraph Discovery.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract).
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

On Directed Densest Subgraph Detection.
Proceedings of the Databases Theory and Applications, 2023

2022
Distance labeling: on parallelism, compression, and ordering.
VLDB J., 2022

Cohesive Subgraph Search Using Keywords in Large Networks.
IEEE Trans. Knowl. Data Eng., 2022

Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach.
IEEE Trans. Knowl. Data Eng., 2022

Efficient Sink-Reachability Analysis via Graph Reduction.
IEEE Trans. Knowl. Data Eng., 2022

Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement.
Proc. VLDB Endow., 2022

Identifying Similar-Bicliques in Bipartite Graphs.
Proc. VLDB Endow., 2022

Efficient Maximum k-Plex Computation over Large Sparse Graphs.
Proc. VLDB Endow., 2022

A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition.
Proc. VLDB Endow., 2022

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

On Scalable Computation of Graph Eccentricities.
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.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Application of Fuzzy Comprehensive Evaluation Based on Genetic Algorithm in Psychological Measurement.
Sci. Program., 2021

Efficient Size-Bounded Community Search over Large Networks.
Proc. VLDB Endow., 2021

2020
Efficient maximum clique computation and enumeration over large sparse graphs.
VLDB J., 2020

Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees.
Proc. VLDB Endow., 2020

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

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

Fast Algorithm for Distance Dynamics-Based Community Detection.
Proceedings of the Web Information Systems Engineering - WISE 2020, 2020

Progressive Top-K Nearest Neighbors Search in Large Road Networks.
Proceedings of the 2020 International Conference on Management of Data, 2020

Scaling Up Distance Labeling on Graphs with Core-Periphery Properties.
Proceedings of the 2020 International Conference on Management of Data, 2020

Speeding Up GED Verification for Graph Similarity Search.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficient Closest Community Search over Large Graphs.
Proceedings of the Database Systems for Advanced Applications, 2020

2019
Leveraging set relations in exact and dynamic set similarity join.
VLDB J., 2019

Eccentricities on small-world networks.
VLDB J., 2019

Supergraph Search in Graph Databases via Hierarchical Feature-Tree.
IEEE Trans. Knowl. Data Eng., 2019

Computing Maximum Independent Sets over Large Sparse Graphs.
Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Scaling Distance Labeling on Small-World Networks.
Proceedings of the 2019 International Conference on Management of Data, 2019

Efficient Maximum Clique Computation over Large Sparse Graphs.
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).
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Enumerating k-Vertex Connected Components in Large Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Cohesive Subgraph Computation Over Large Sparse Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018
Index-Based Densest Clique Percolation Community Search in Networks.
IEEE Trans. Knowl. Data Eng., 2018

Automatic Index Selection for Large-Scale Datalog Computation.
Proc. VLDB Endow., 2018

An Optimal and Progressive Approach to Online Search of Top-K Influential Communities.
Proc. VLDB Endow., 2018

Distributed computing connected components with linear communication cost.
Distributed Parallel Databases, 2018

When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks.
Proceedings of the 2018 International Conference on Management of Data, 2018

Querying Cohesive Subgraphs by Keywords.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Exacting Eccentricity for Small-World Networks.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Ranking weighted clustering coefficient in large dynamic graphs.
World Wide Web, 2017

Scalable subgraph enumeration in MapReduce: a cost-oriented approach.
VLDB J., 2017

pSCAN: Fast and Exact Structural Graph Clustering.
IEEE Trans. Knowl. Data Eng., 2017

Effective and Efficient Dynamic Graph Coloring.
Proc. VLDB Endow., 2017

Efficient Structural Graph Clustering: An Index-Based Approach.
Proc. VLDB Endow., 2017

Leveraging Set Relations in Exact Set Similarity Join.
Proc. VLDB Endow., 2017

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

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

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

Enumerating k-Vertex Connected Components in Large Graphs.
CoRR, 2017

Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Scalable Top-K Structural Diversity Search.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016
Diversified top-k clique search.
VLDB J., 2016

I/O Efficient ECC Graph Decomposition via Graph Reduction.
Proc. VLDB Endow., 2016

Scalable Distributed Subgraph Enumeration.
Proc. VLDB Endow., 2016

Efficient Subgraph Matching by Postponing Cartesian Products.
Proceedings of the 2016 International Conference on Management of Data, 2016

Scalable supergraph search in large graph databases.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Computing Connected Components with linear communication cost in pregel-like systems.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

pSCAN: Fast and exact structural graph clustering.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015
Probabilistic n-of-N skyline computation over uncertain data streams.
World Wide Web, 2015

I/O efficient: computing SCCs in massive graphs.
VLDB J., 2015

Scalable Subgraph Enumeration in MapReduce.
Proc. VLDB Endow., 2015

Optimal Enumeration: Efficient Top-k Tree Matching.
Proc. VLDB Endow., 2015

Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

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

Efficiently Computing Top-K Shortest Path Join.
Proceedings of the 18th International Conference on Extending Database Technology, 2015

Efficient String Similarity Search: A Cross Pivotal Based Approach.
Proceedings of the Database Systems for Advanced Applications, 2015

2014
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme.
IEEE Trans. Knowl. Data Eng., 2014

Scalable big graph processing in MapReduce.
Proceedings of the International Conference on Management of Data, 2014

Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time.
Proceedings of the Databases Theory and Applications, 2014

2013
Computing weight constraint reachability in large networks.
VLDB J., 2013

More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks.
Proc. VLDB Endow., 2013

Fast Maximal Cliques Enumeration in Sparse Graphs.
Algorithmica, 2013

Efficiently computing k-edge connected components via graph decomposition.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

2012
The exact distance to destination in undirected world.
VLDB J., 2012

Computing Structural Statistics by Keywords in Databases.
IEEE Trans. Knowl. Data Eng., 2012

Diversifying Top-K Results.
Proc. VLDB Endow., 2012

2011
Uncertain data management.
PhD thesis, 2011

Scalable keyword search on large data streams.
VLDB J., 2011

Finding information nebula over large networks.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Ten Thousand SQLs: Parallel Keyword Queries Computing.
Proc. VLDB Endow., 2010

Context-Sensitive Document Ranking.
J. Comput. Sci. Technol., 2010

Keyword Search in Relational Databases: A Survey.
IEEE Data Eng. Bull., 2010

Probabilistic ranking over relations.
Proceedings of the EDBT 2010, 2010

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

Fast Probabilistic Ranking under x-Relation Model
CoRR, 2009

Keyword search in databases: the power of RDBMS.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Scalable Keyword Search on Large Data Streams.
Proceedings of the 25th International Conference on Data Engineering, 2009

Querying Communities in Relational Databases.
Proceedings of the 25th International Conference on Data Engineering, 2009

Query ranking in probabilistic XML data.
Proceedings of the EDBT 2009, 2009

2003
GAC-decomposition based soft decoding of block codes for multimedia data.
Proceedings of the IEEE 14th International Symposium on Personal, 2003


  Loading...