Lu Qin

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

2023

Expanding Reverse Nearest Neighbors.

[BibT_eX]

[DOI]

Proc. VLDB Endow., December, 2023

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

[BibT_eX]

[DOI]

VLDB J., November, 2023

Balanced Clique Computation in Signed Networks: Concepts and Algorithms.

[BibT_eX]

[DOI]

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

Computing Significant Cliques in Large Labeled Networks.

[BibT_eX]

[DOI]

IEEE Trans. Big Data, June, 2023

Accelerating Graph Similarity Search via Efficient GED Computation.

[BibT_eX]

[DOI]

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

Accelerated butterfly counting with vertex priority on bipartite graphs.

[BibT_eX]

[DOI]

VLDB J., March, 2023

Discovering Significant Communities on Bipartite Graphs: An Index-Based Approach.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2023

Group-based Fraud Detection Network on e-Commerce Platforms.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Distributed Near-Maximum Independent Set Maintenance over Large-scale Dynamic Graphs.

[BibT_eX]

[DOI]

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

TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs.

[BibT_eX]

[DOI]

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

Flash: A Framework for Programming Distributed Graph Processing Algorithms.

[BibT_eX]

[DOI]

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

COCLEP: Contrastive Learning-based Semi-Supervised Community Search.

[BibT_eX]

[DOI]

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

Efficient and Effective Path Compression in Large Graphs.

[BibT_eX]

[DOI]

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

Efficient Maximum Relative Fair Clique Computation in Attributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2023

Balanced Hop-Constrained Path Enumeration in Signed Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2023

2022

General graph generators: experiments, analyses, and improvements.

[BibT_eX]

[DOI]

VLDB J., 2022

Span-reachability querying in large temporal graphs.

[BibT_eX]

[DOI]

VLDB J., 2022

Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs.

[BibT_eX]

[DOI]

VLDB J., 2022

Answering reachability and K-reach queries on large graphs with label constraints.

[BibT_eX]

[DOI]

VLDB J., 2022

Maximum and top-k diversified biclique search at scale.

[BibT_eX]

[DOI]

VLDB J., 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 Radius-Bounded Community Search in Geo-Social Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Periodic Communities Mining in Temporal Networks: Concepts and Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks.

[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

Efficient Shortest Path Counting on Large Road Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Mining Bursting Core in Large Temporal Graph.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Neural Subgraph Counting with Wasserstein Estimator.

[BibT_eX]

[DOI]

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

Reachability Labeling for Distributed Graphs.

[BibT_eX]

[DOI]

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

GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction.

[BibT_eX]

[DOI]

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

Computing Maximum Structural Balanced Cliques in Signed Graphs.

[BibT_eX]

[DOI]

Kai Yao

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

TMN: Trajectory Matching Networks for Predicting Similarity.

[BibT_eX]

[DOI]

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

Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching.

[BibT_eX]

[DOI]

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

Efficient Personalized Maximum Biclique Search.

[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

Manipulating Structural Graph Clustering.

[BibT_eX]

[DOI]

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

2021

Binarized graph neural network.

[BibT_eX]

[DOI]

World Wide Web, 2021

Efficient Hop-constrained s-t Simple Path Enumeration.

[BibT_eX]

[DOI]

VLDB J., 2021

EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search.

[BibT_eX]

[DOI]

VLDB J., 2021

Efficient structural node similarity computation on billion-scale graphs.

[BibT_eX]

[DOI]

VLDB J., 2021

Signed Clique Search in Signed Networks: Concepts and Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2021

Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

On Querying Historical K-Cores.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Discovering fortress-like cohesive subgraphs.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2021

Higher-Order Neighborhood Truss Decomposition.

[BibT_eX]

[DOI]

CoRR, 2021

DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

T3S: Effective Representation Learning for Trajectory Similarity Computation.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient and Effective Community Search on Large-scale Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

FAST: FPGA-based Subgraph Matching on Massive Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

A Framework to Quantify Approximate Simulation on Graph Data.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Manipulating Black-Box Networks for Centrality Promotion.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

A Cohesive Structure Based Bipartite Graph Analytics System.

[BibT_eX]

[DOI]

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Scaling Up Distance-generalized Core Decomposition.

[BibT_eX]

[DOI]

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020

Efficient (α, β)-core computation in bipartite graphs.

[BibT_eX]

[DOI]

VLDB J., 2020

Finding skyline communities in multi-valued networks.

[BibT_eX]

[DOI]

VLDB J., 2020

Correction: A survey of community search over big graphs.

[BibT_eX]

[DOI]

VLDB J., 2020

A survey of community search over big graphs.

[BibT_eX]

[DOI]

VLDB J., 2020

Answering Top-$k$ k Graph Similarity Queries in Graph Databases.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

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

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Maximum Biclique Search at Billion Scale.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Ordering Heuristics for k-clique Listing.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Scaling Up Distanced-generalized Core Decomposition.

[BibT_eX]

[DOI]

CoRR, 2020

Taming the Expressiveness and Programmability of Graph Analytical Queries.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Maximal Balanced Clique Enumeration in Signed Networks.

[BibT_eX]

[DOI]

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 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

GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Efficient Top-k Edge Structural Diversity Search.

[BibT_eX]

[DOI]

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

Efficiently Answering Span-Reachability Queries in Large Temporal Graphs.

[BibT_eX]

[DOI]

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

Efficient Bitruss Decomposition for Large-scale Bipartite Graphs.

[BibT_eX]

[DOI]

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

StructSim: Querying Structural Node Similarity at Billion Scale.

[BibT_eX]

[DOI]

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

Speeding Up GED Verification for Graph Similarity Search.

[BibT_eX]

[DOI]

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

Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation.

[BibT_eX]

[DOI]

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

AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

I/O Efficient Algorithm for c-Approximate Furthest Neighbor Search in High-Dimensional Space.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

When Structure Meets Keywords: Cohesive Attributed Community Search.

[BibT_eX]

[DOI]

Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019

Efficient community discovery with user engagement and similarity.

[BibT_eX]

[DOI]

VLDB J., 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

I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

Supergraph Search in Graph Databases via Hierarchical Feature-Tree.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

Fully Dynamic Depth-First Search in Directed Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Efficient Progressive Minimum k-core Search.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Distributed Subgraph Matching on Timely Dataflow.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Mining Bursting Communities in Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

A Survey and Experimental Analysis of Distributed Subgraph Matching.

[BibT_eX]

[DOI]

CoRR, 2019

Efficient (a,β)-core Computation: an Index-based Approach.

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

Scaling Distance Labeling on Small-World Networks.

[BibT_eX]

[DOI]

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

Efficient Maximal Spatial Clique Enumeration.

[BibT_eX]

[DOI]

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

Hierarchical Decomposition of Big Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 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

Mining Periodic Cliques in Temporal Networks.

[BibT_eX]

[DOI]

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

I-LSH: I/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space.

[BibT_eX]

[DOI]

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

Improved Algorithms for Maximal Clique Search in Uncertain Networks.

[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

Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Index-Based Densest Clique Percolation Community Search in Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2018

Distributed computing connected components with linear communication cost.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 2018

K-Connected Cores Computation in Large Dual Networks.

[BibT_eX]

[DOI]

Data Sci. Eng., 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

Skyline Community Search in Multi-valued Networks.

[BibT_eX]

[DOI]

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

ASTM: An Attentional Segmentation Based Topic Model for Short Texts.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining, 2018

Querying Cohesive Subgraphs by Keywords.

[BibT_eX]

[DOI]

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

Efficiently Reinforcing Social Networks over User Engagement and Tie Strength.

[BibT_eX]

[DOI]

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

Efficient Computing of Radius-Bounded k-Cores.

[BibT_eX]

[DOI]

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

Efficient Probabilistic K-Core Computation on Uncertain Graphs.

[BibT_eX]

[DOI]

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

Persistent Community Search in Temporal Networks.

[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

Efficient Signed Clique Search in Signed Networks.

[BibT_eX]

[DOI]

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

Discovering Strong Communities with User Engagement and Tie Strength.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

K-Connected Cores Computation in Large Dual Networks.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

External Topological Sorting in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

Towards Efficient Path Skyline Computation in Bicriteria Networks.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

2017

Finding influential communities in massive networks.

[BibT_eX]

[DOI]

VLDB J., 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

OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 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

Efficient MapReduce algorithms for triangle listing in billion-scale graphs.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 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

A Fast Order-Based Approach for Core Maintenance.

[BibT_eX]

[DOI]

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

Scalable Top-K Structural Diversity Search.

[BibT_eX]

[DOI]

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

Efficient Local Clustering Coefficient Estimation in Massive Graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2017

GMAlign: A new network aligner for revealing large conserved functional components.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Diversified top-k clique search.

[BibT_eX]

[DOI]

VLDB J., 2016

Effective and Efficient: Large-Scale Dynamic City Express.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2016

Optimal Multi-Meeting-Point Route Search.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 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 and Progressive Group Steiner Tree Search.

[BibT_eX]

[DOI]

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

Efficient Subgraph Matching by Postponing Cartesian Products.

[BibT_eX]

[DOI]

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

I/O efficient Core Graph Decomposition at web scale.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 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

Efficient Query Processing with Mutual Privacy Protection for Location-Based Services.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2016

Efficient triangle listing for billion-scale graphs.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2015

I/O efficient: computing SCCs in massive graphs.

[BibT_eX]

[DOI]

VLDB J., 2015

TRIP: An Interactive Retrieving-Inferring Data Imputation Approach.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2015

Influential Community Search in Large Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 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

Divide & Conquer: I/O Efficient Depth-First Search.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 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

On random walk based graph sampling.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Efficiently Computing Top-K Shortest Path Join.

[BibT_eX]

[DOI]

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

2014

Leveraging Graph Dimensions in Online Graph Search.

[BibT_eX]

[DOI]

Yuanyuan Zhu

Proc. VLDB Endow., 2014

Scalable big graph processing in MapReduce.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 2014

Querying k-truss community in large and dynamic graphs.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 2014

Contract & Expand: I/O Efficient SCCs Computing.

[BibT_eX]

[DOI]

Zhiwei Zhang

Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

2013

High efficiency and quality: large graphs matching.

[BibT_eX]

[DOI]

VLDB J., 2013

Computing weight constraint reachability in large networks.

[BibT_eX]

[DOI]

VLDB J., 2013

Top-K Nearest Keyword Search on Large Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Top-K Structural Diversity Search in Large Networks.

[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

Finding top-k similar graphs in graph databases.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Extending Database Technology, 2012

I/O cost minimization: reachability queries processing over massive graphs.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Extending Database Technology, 2012

Graph classification: a diversified discriminative feature selection approach.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

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

Keyword search in relational databases.

[BibT_eX]

[DOI]

PhD thesis, 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

Query translation from XPath to SQL in the presence of recursive DTDs.

[BibT_eX]

[DOI]

VLDB J., 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

2008

Monitoring Aggregate k-NN Objects in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2008

Finding time-dependent shortest paths over large graphs.

[BibT_eX]

[DOI]

Bolin Ding

Proceedings of the EDBT 2008, 2008

2007

Finding Top-k Min-Cost Connected Trees in Databases.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

<i>TwigList</i> : Make Twig Pattern Matching Fast.

[BibT_eX]

[DOI]