2025
Temporal Insights for Group-Based Fraud Detection on e-Commerce Platforms.
IEEE Trans. Knowl. Data Eng., February, 2025
2024
Constant-time Connectivity Querying in Dynamic Graphs.
Proc. ACM Manag. Data, December, 2024
Efficient algorithms for reachability and path queries on temporal bipartite graphs.
VLDB J., September, 2024
Maintaining Top-$t$ Cores in Dynamic Graphs.
IEEE Trans. Knowl. Data Eng., September, 2024
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs.
Proc. VLDB Endow., July, 2024
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs.
Proc. VLDB Endow., July, 2024
Efficient kNN Search in Public Transportation Networks.
Proc. VLDB Endow., July, 2024
Efficient Influence Minimization via Node Blocking.
Proc. VLDB Endow., June, 2024
Label-constrained shortest path query processing on road networks.
VLDB J., May, 2024
Identifying Large Structural Balanced Cliques in Signed Graphs.
IEEE Trans. Knowl. Data Eng., March, 2024
On Querying Historical Connectivity in Temporal Graphs.
Proc. ACM Manag. Data, 2024
Efficient Antagonistic k-plex Enumeration in Signed Graphs.
CoRR, 2024
Querying Numeric-Constrained Shortest Distances on Road Networks.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024
Efficient Maximal Temporal Plex Enumeration.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024
Relation-Aware Heterogeneous Graph Neural Network for Fraud Detection.
Proceedings of the Web and Big Data - 8th International Joint Conference, 2024
2023
Expanding Reverse Nearest Neighbors.
Proc. VLDB Endow., December, 2023
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks.
VLDB J., November, 2023
Balanced Clique Computation in Signed Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., November, 2023
Computing Significant Cliques in Large Labeled Networks.
IEEE Trans. Big Data, June, 2023
Accelerating Graph Similarity Search via Efficient GED Computation.
IEEE Trans. Knowl. Data Eng., May, 2023
Accelerated butterfly counting with vertex priority on bipartite graphs.
VLDB J., March, 2023
Discovering Significant Communities on Bipartite Graphs: An Index-Based Approach.
IEEE Trans. Knowl. Data Eng., March, 2023
ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing.
IEEE Trans. Knowl. Data Eng., 2023
Group-based Fraud Detection Network on e-Commerce Platforms.
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.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023
Flash: A Framework for Programming Distributed Graph Processing Algorithms.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023
COCLEP: Contrastive Learning-based Semi-Supervised Community Search.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023
Efficient and Effective Path Compression in Large Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023
Efficient Maximum Relative Fair Clique Computation in Attributed Graphs.
Proceedings of the Databases Theory and Applications, 2023
Balanced Hop-Constrained Path Enumeration in Signed Directed Graphs.
Proceedings of the Databases Theory and Applications, 2023
2022
General graph generators: experiments, analyses, and improvements.
VLDB J., 2022
Span-reachability querying in large temporal graphs.
VLDB J., 2022
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs.
VLDB J., 2022
Answering reachability and K-reach queries on large graphs with label constraints.
VLDB J., 2022
Maximum and top-k diversified biclique search at scale.
VLDB J., 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 Radius-Bounded Community Search in Geo-Social Networks.
IEEE Trans. Knowl. Data Eng., 2022
Periodic Communities Mining in Temporal Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., 2022
I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks.
IEEE Trans. Knowl. Data Eng., 2022
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement.
Proc. VLDB Endow., 2022
Efficient Shortest Path Counting on Large Road Networks.
Proc. VLDB Endow., 2022
Mining Bursting Core in Large Temporal Graph.
Proc. VLDB Endow., 2022
Neural Subgraph Counting with Wasserstein Estimator.
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
Reachability Labeling for Distributed Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022
GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022
Computing Maximum Structural Balanced Cliques in Signed Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022
TMN: Trajectory Matching Networks for Predicting Similarity.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022
Efficient Personalized Maximum Biclique Search.
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
Manipulating Structural Graph Clustering.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022
2021
Binarized graph neural network.
World Wide Web, 2021
Efficient Hop-constrained s-t Simple Path Enumeration.
VLDB J., 2021
EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search.
VLDB J., 2021
Efficient structural node similarity computation on billion-scale graphs.
VLDB J., 2021
Signed Clique Search in Signed Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., 2021
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach.
Proc. VLDB Endow., 2021
On Querying Historical K-Cores.
Proc. VLDB Endow., 2021
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs.
Proc. VLDB Endow., 2021
Discovering fortress-like cohesive subgraphs.
Knowl. Inf. Syst., 2021
Higher-Order Neighborhood Truss Decomposition.
CoRR, 2021
DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021
T3S: Effective Representation Learning for Trajectory Similarity Computation.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021
Efficient and Effective Community Search on Large-scale Bipartite Graphs.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021
FAST: FPGA-based Subgraph Matching on Massive Graphs.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021
A Framework to Quantify Approximate Simulation on Graph Data.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021
Manipulating Black-Box Networks for Centrality Promotion.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021
A Cohesive Structure Based Bipartite Graph Analytics System.
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.
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.
VLDB J., 2020
Finding skyline communities in multi-valued networks.
VLDB J., 2020
Correction: A survey of community search over big graphs.
VLDB J., 2020
A survey of community search over big graphs.
VLDB J., 2020
Answering Top-$k$ k Graph Similarity Queries in Graph Databases.
IEEE Trans. Knowl. Data Eng., 2020
Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems.
IEEE Trans. Knowl. Data Eng., 2020
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond.
Proc. VLDB Endow., 2020
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees.
Proc. VLDB Endow., 2020
Maximum Biclique Search at Billion Scale.
Proc. VLDB Endow., 2020
Ordering Heuristics for k-clique Listing.
Proc. VLDB Endow., 2020
Scaling Up Distanced-generalized Core Decomposition.
CoRR, 2020
Taming the Expressiveness and Programmability of Graph Analytical Queries.
CoRR, 2020
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System.
CoRR, 2020
Efficient Maximal Balanced Clique Enumeration in Signed Networks.
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.
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
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
Efficient Top-k Edge Structural Diversity Search.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020
Efficiently Answering Span-Reachability Queries in Large Temporal Graphs.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020
StructSim: Querying Structural Node Similarity at Billion Scale.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020
Speeding Up GED Verification for Graph Similarity Search.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020
Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020
AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing.
Proceedings of the Database Systems for Advanced Applications, 2020
I/O Efficient Algorithm for c-Approximate Furthest Neighbor Search in High-Dimensional Space.
Proceedings of the Database Systems for Advanced Applications, 2020
When Structure Meets Keywords: Cohesive Attributed Community Search.
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.
VLDB J., 2019
Leveraging set relations in exact and dynamic set similarity join.
VLDB J., 2019
Eccentricities on small-world networks.
VLDB J., 2019
I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering.
IEEE Trans. Knowl. Data Eng., 2019
Supergraph Search in Graph Databases via Hierarchical Feature-Tree.
IEEE Trans. Knowl. Data Eng., 2019
Fully Dynamic Depth-First Search in Directed Graphs.
Proc. VLDB Endow., 2019
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks.
Proc. VLDB Endow., 2019
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice.
Proc. VLDB Endow., 2019
Efficient Progressive Minimum k-core Search.
Proc. VLDB Endow., 2019
Distributed Subgraph Matching on Timely Dataflow.
,
,
,
,
,
,
,
,
,
,
,
,
Proc. VLDB Endow., 2019
Mining Bursting Communities in Temporal Graphs.
CoRR, 2019
A Survey and Experimental Analysis of Distributed Subgraph Matching.
,
,
,
,
,
,
,
,
,
,
,
,
CoRR, 2019
Efficient (a,β)-core Computation: an Index-based Approach.
Proceedings of the World Wide Web Conference, 2019
Scaling Distance Labeling on Small-World Networks.
Proceedings of the 2019 International Conference on Management of Data, 2019
Efficient Maximal Spatial Clique Enumeration.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019
Hierarchical Decomposition of Big Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 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
Mining Periodic Cliques in Temporal Networks.
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.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019
Improved Algorithms for Maximal Clique Search in Uncertain Networks.
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
Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019
2018
Index-Based Densest Clique Percolation Community Search in Networks.
IEEE Trans. Knowl. Data Eng., 2018
Distributed computing connected components with linear communication cost.
Distributed Parallel Databases, 2018
K-Connected Cores Computation in Large Dual Networks.
Data Sci. Eng., 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
Skyline Community Search in Multi-valued Networks.
Proceedings of the 2018 International Conference on Management of Data, 2018
ASTM: An Attentional Segmentation Based Topic Model for Short Texts.
Proceedings of the IEEE International Conference on Data Mining, 2018
Querying Cohesive Subgraphs by Keywords.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
Efficiently Reinforcing Social Networks over User Engagement and Tie Strength.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
Efficient Computing of Radius-Bounded k-Cores.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
Efficient Probabilistic K-Core Computation on Uncertain Graphs.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
Persistent Community Search in Temporal Networks.
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
Efficient Signed Clique Search in Signed Networks.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
Discovering Strong Communities with User Engagement and Tie Strength.
Proceedings of the Database Systems for Advanced Applications, 2018
K-Connected Cores Computation in Large Dual Networks.
Proceedings of the Database Systems for Advanced Applications, 2018
External Topological Sorting in Large Graphs.
Proceedings of the Database Systems for Advanced Applications, 2018
Towards Efficient Path Skyline Computation in Bicriteria Networks.
Proceedings of the Database Systems for Advanced Applications, 2018
2017
Finding influential communities in massive networks.
VLDB J., 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
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks.
Proc. VLDB Endow., 2017
When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks.
Proc. VLDB Endow., 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
Efficient MapReduce algorithms for triangle listing in billion-scale graphs.
Distributed Parallel Databases, 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
A Fast Order-Based Approach for Core Maintenance.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017
Scalable Top-K Structural Diversity Search.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017
Efficient Local Clustering Coefficient Estimation in Massive Graphs.
Proceedings of the Database Systems for Advanced Applications, 2017
GMAlign: A new network aligner for revealing large conserved functional components.
Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017
Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
2016
Diversified top-k clique search.
VLDB J., 2016
Effective and Efficient: Large-Scale Dynamic City Express.
IEEE Trans. Knowl. Data Eng., 2016
Optimal Multi-Meeting-Point Route Search.
IEEE Trans. Knowl. Data Eng., 2016
I/O Efficient ECC Graph Decomposition via Graph Reduction.
Proc. VLDB Endow., 2016
Scalable Distributed Subgraph Enumeration.
Proc. VLDB Endow., 2016
Efficient and Progressive Group Steiner Tree Search.
Proceedings of the 2016 International Conference on Management of Data, 2016
Efficient Subgraph Matching by Postponing Cartesian Products.
Proceedings of the 2016 International Conference on Management of Data, 2016
I/O efficient Core Graph Decomposition at web scale.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 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
Efficient Query Processing with Mutual Privacy Protection for Location-Based Services.
Proceedings of the Database Systems for Advanced Applications, 2016
Efficient triangle listing for billion-scale graphs.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016
2015
I/O efficient: computing SCCs in massive graphs.
VLDB J., 2015
TRIP: An Interactive Retrieving-Inferring Data Imputation Approach.
IEEE Trans. Knowl. Data Eng., 2015
Influential Community Search in Large Networks.
Proc. VLDB Endow., 2015
Scalable Subgraph Enumeration in MapReduce.
Proc. VLDB Endow., 2015
Optimal Enumeration: Efficient Top-k Tree Matching.
Proc. VLDB Endow., 2015
Divide & Conquer: I/O Efficient Depth-First Search.
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.
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
On random walk based graph sampling.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015
Efficiently Computing Top-K Shortest Path Join.
Proceedings of the 18th International Conference on Extending Database Technology, 2015
2014
Leveraging Graph Dimensions in Online Graph Search.
Proc. VLDB Endow., 2014
Scalable big graph processing in MapReduce.
Proceedings of the International Conference on Management of Data, 2014
Querying k-truss community in large and dynamic graphs.
Proceedings of the International Conference on Management of Data, 2014
Contract & Expand: I/O Efficient SCCs Computing.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014
2013
High efficiency and quality: large graphs matching.
VLDB J., 2013
Computing weight constraint reachability in large networks.
VLDB J., 2013
Top-K Nearest Keyword Search on Large Graphs.
Proc. VLDB Endow., 2013
Top-K Structural Diversity Search in Large Networks.
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
Finding top-k similar graphs in graph databases.
Proceedings of the 15th International Conference on Extending Database Technology, 2012
I/O cost minimization: reachability queries processing over massive graphs.
Proceedings of the 15th International Conference on Extending Database Technology, 2012
Graph classification: a diversified discriminative feature selection approach.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012
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
Keyword search in relational databases.
PhD thesis, 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
Query translation from XPath to SQL in the presence of recursive DTDs.
VLDB J., 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
2008
Monitoring Aggregate k-NN Objects in Road Networks.
Proceedings of the Scientific and Statistical Database Management, 2008
Finding time-dependent shortest paths over large graphs.
Proceedings of the EDBT 2008, 2008
2007
Finding Top-k Min-Cost Connected Trees in Databases.
Proceedings of the 23rd International Conference on Data Engineering, 2007
<i>TwigList</i> : Make Twig Pattern Matching Fast.
Proceedings of the Advances in Databases: Concepts, 2007
2006
TreeCluster: Clustering Results of Keyword Search over Databases.
Proceedings of the Advances in Web-Age Information Management, 2006
NUITS: A Novel User Interface for Efficient Keyword Search over Databases.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006