Recent News

I am invited to be the Program Committee Co-chair of ACM CIKM 2021 (Demo Track).

Our survey on Advancing the DBMS Query Optimizer is available. This survey focuses on Cardinality Estimation, Cost Model, and Plan Enumeration.

Our work about triangle counting over graph data is accepted by TKDE.

Our paper on transit planning is directly accepted by SIGMOD 2021.

Our survey on “Trajectory data management, analytics, and learning” is accepted by ACM Computing Surveys.

It is an honor to be invited as a Senior PC member of KDD 2021.

I am invited to give a keynote speech at the Australasian Computer Science Week 2021.

Our work “Towards an Efficient Weighted Random Walk Domination” is accepted by PVLDB’21.

It is an honour to receive the Chris Wallace Award for Outstanding Research 2020, awarded by CORE (The Computing Research and Education Association of Australasia).

Our work “AOI-shapes: an efficient footprint algorithm to support visualization of user-defined urban areas of interest” is accepted by ACM TiiS. This work is a typical effort drawing inspirations between visualization and big data algorithm.

Our work “Towards an Optimal Bus Frequency Scheduling: When the Waiting Time Matters” is accepted by TKDE.

Our work “Towards Efficient Motif-based Graph Partitioning: An Adaptive Sampling Approach” is accepted by ICDE 2021. This is the first attempt to solve this problem without employing exact edge weight computations.

Our work “On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection” is accepted by PVLDB 2021.

How to effectivenly recommend indexes Using Deep Reinforcement Learning? Check our CIKM’20 work and the code.

Our Paper on traffic prediction is accepted by ICDE 2021.

Our system prototype on bus (re)scheduling assistant, FASTS, is online. Check our introductory video and details are available at our VLDB’20 demo paper “FASTS: A Satisfaction-Boosting Bus Scheduling Assistant”.

Our Paper “Incremental Preference Adjustment: a Graph Theoretical Approach” is accepted by VLDB Journal. Our proposed techniques can be applied to any vector embedding based preference learning model and incrementally adjust the preference for every single user via a few interactions. A very interesting case study has also been conducted. Check our spotlight talk.

It is an honor to serve the Registration Chair and the PC member of SIGMOD 2021.

“A Survey on Modern Deep Neural Network for Traffic Prediction: Trends, Methods and Challenges” is accepted by TKDE. Check an Early Access Version.

Our paper “Spatial Object Recommendation with Hints: When Spatial Granularity Matters” got accepted by SIGIR’20. This is a joint work with Baidu Research using real-world Baidu Maps user log data.

Our Paper “Effective Travel Time Estimation: When Historical Trajectories over Road Networks Matter” has been accepted by SIGMOD 2020.

We have one paper “Crowdsourced Collective Entity Resolution with Relational Match Propagation” accepted by IEEE ICDE 2020.

We get an ARC DP20 grant to support our research on building a next-generation map service for an interactive exploration of Massive Geo-spatial data. Thanks ARC!

I am promoted to Associate Professor, effective from Jan 1, 2020. Thanks for the recognition from the peers and the university promotion panel!

We have two papers “Online Anomalous Trajectory Detection with Deep Generative Sequence Modeling” and “Temporal Network Representation Learning via Historical Neighborhoods Aggregation” accpeted by IEEE ICDE 2020

Our paper “Optimizing Impression Counts for Outdoor Advertising” got the Best Paper Award Runner Up in ACM SIGKDD 2019

Our paper “Fast Large-Scale Trajectory Clustering” is accepted by PVLDB 2020

We are grateful to a new Google Research Award. Thanks Google!

Our paper ‘Trajectory-driven Influential Billboard Placement’ is selected as one of the Best Papers of SIGKDD