Efficient Spatial Data Management for Enabling True Ride-Sharing

Grant number: DP180103332 | Funding period: 2018 - 2022

Completed

Abstract

This data management project aims to examine ride-sharing as a model of a complex decision system that can be optimised to deliver better outcomes. Popular ride-sharing apps have quickly evolved into ride-sourcing services that are comparable to calling a taxi on a mobile phone. Such arrangements miss many of the key benefits of true ride-sharing for the society. The project will model incentives by helping people agree on points of interest rather than directly seeking trips from others to set destinations. It also aims to introduce privacy-aware dynamic matching of sharers, and expand to transportation at large, to generate new shared transportation services. The expected outcome of this p..

View full description

Related publications (16)

Scholarly works icon

TimeSAN: A Time-Modulated Self-Attentive Network for Next Point-of-Interest Recommendation

J He, J Qi, K Ramamohanarao

2020-09-28

Next Point-of-Interest (POI) recommendation aims to rank a list of POIs by their attractiveness to users based on the users' histo..

Scholarly works icon

Packing R-trees with Space-filling Curves: Theoretical Optimality, Empirical Efficiency, and Bulk-loading Parallelizability

Jianzhong Qi, Yufei Tao, Yanchuan Chang, Rui Zhang

2020-09-01

The massive amount of data and large variety of data distributions in the big data era call for access methods that are efficient ..

Scholarly works icon

GeoPrune: Efficiently Matching Trips in Ride-sharing Through Geometric Properties

Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic, Lars Kulik

2020-07-07

On-demand ride-sharing is rapidly growing. Matching trip requests to vehicles efficiently is critical for the service quality of r..

Scholarly works icon

A learning based approach to predict shortest-path distances

J Qi, W Wang, R Zhang, Z Zhao

2020-01-01

Shortest-path distances on road networks have many applications such as finding nearest places of interest (POI) for travel recomm..

Scholarly works icon

Sub-trajectory Similarity Join with Obfuscation

Yanchuan Chang, Jianzhong Qi, Egemen Tanin, Xingjun Ma, Hanan Samet

2020-01-01

User trajectory data is becoming increasingly accessible due to the prevalence of GPS-equipped devices such as smartphones. Many e..

Scholarly works icon

GOAL: a clustering-based method for the group optimal location problem

Fangshu Chen, Jianzhong Qi, Huaizhong Lin, Yunjun Gao, Dongming Lu

2019-11-01

Optimal location problems are important problems and are particularly useful for strategic planning of resources. However, existin..

Scholarly works icon

Moving kNN query processing in metric space based on influential sets

Chuanwen Li, Yu Gu, Jianzhong Qi, Rui Zhang, Ge Yu

2019-07-01

The moving k nearest neighbor query computes one's k nearest neighbor set and maintains it while at move. This query is gaining im..

Scholarly works icon

A joint context-aware embedding for trip recommendations

J He, J Qi, K Ramamohanarao

2019-04-01

© 2019 IEEE. Trip recommendation is an important location-based service that helps relieve users from the time and efforts for tri..

Scholarly works icon

Scalable Bottom-up Subspace Clustering using FP-Trees for High Dimensional Data

MT Doan, J Qi, S Rajasegarar, C Leckie

2019-01-22

© 2018 IEEE. Subspace clustering aims to find groups of similar objects (clusters) that exist in lower dimensional subspaces from ..

Scholarly works icon

Query-aware bayesian committee machine for scalable gaussian process regression

J He, J Qi, K Ramamohanarao

2019-01-01

Copyright © 2019 by SIAM. The Gaussian process (GP) model is a powerful tool for regression problems. However, the high computatio..

Scholarly works icon

A GPU accelerated update efficient index for κnn queries in road networks

C Li, Y Gu, J Qi, J He, Q Deng, G Yu

2018-10-24

© 2018 IEEE. The k nearest neighbor (kNN) query in road networks is a traditional query type in spatial databases. This query has ..

Scholarly works icon

CommuteShare: A Ridesharing Service for Daily Commuters Using Cross-Domain Urban Big Data

X Fan, C Xu, F Tang, J Qi, X Liu, L Chen, C Wang

2018-09-05

© 2018 IEEE. Existing ridesharing services have focused on on-demand trip matching, which resembles traditional taxi dispatching. ..

Scholarly works icon

K-Regret Queries Using Multiplicative Utility Functions

Jianzhong Qi, Fei Zuo, Hanan Samet, Jia Cheng Yao

2018-09-01

The k-regret query aims to return a size-k subset S of a database D such that, for any query user that selects a data object from ..

Scholarly works icon

Continuous Spatial Query Processing: A Survey of Safe Region Based Techniques

Jianzhong Qi, Rui Zhang, Christian S Jensen, Kotagiri Ramamohanarao, Jiayuan He

2018-07-01

In the past decade, positioning system-enabled devices such as smartphones have become most prevalent. This functionality brings t..

Scholarly works icon

Finding all nearest neighbors with a single graph traversal

Y Xu, J Qi, R Borovica-Gajic, L Kulik

2018-01-01

© Springer International Publishing AG, part of Springer Nature 2018. Finding the nearest neighbor is a key operation in data anal..

Scholarly works icon

Learning Datum-Wise Sampling Frequency for Energy-Efficient Human Activity Recognition

Weihao Cheng, Sarah Erfani, Rui Zhang, Kotagiri Ramamohanarao

2018-01-01

Continuous Human Activity Recognition (HAR) is an important application of smart mobile/wearable systems for providing dynamic ass..