1. Efficient Top-k Matching for Publish/Subscribe Ride Hitching
- Author
-
Jianliang Xu, Hongyan Gu, Shangwei Guo, Mingliang Xu, Rui Chen, Yafei Li, and Junxiao Xue
- Subjects
Focus (computing) ,Matching (statistics) ,Service (systems architecture) ,business.industry ,Computer science ,Track (rail transport) ,GeneralLiterature_MISCELLANEOUS ,Computer Science Applications ,Mode (computer interface) ,Computational Theory and Mathematics ,Filter (video) ,Order (business) ,business ,Publication ,Information Systems ,Computer network - Abstract
With the continued proliferation of mobile Internet and geo-locating technologies, carpooling as a green transport mode is widely accepted and becoming tremendously popular worldwide. In this paper, we focus on a popular carpooling service called ride hitching, which is typically implemented using a publish/subscribe approach. In a ride hitching service, drivers subscribe ride orders published by riders and continuously receive matching ride orders until one is picked. The current systems (e.g., Didi Hitch) adopt a threshold-based approach to filter out ride orders. That is, a new ride order will be sent to all subscribing drivers whose planned trips can match the ride order within a pre-defined detour threshold. A limitation of this approach is that it is difficult for drivers to specify a reasonable detour threshold in practice. In addressing this problem, we propose a novel top-k subscription query called Top-k Ride Subscription (TkRS) query, which continuously returns the best k ride orders that match drivers' trip plans to them. We propose two efficient algorithms to enable the top-k results maintenance. We also design a novel hybrid index and a two-level buffer to efficiently track the top- $k$ results. Finally, extensive experiments on real-life datasets suggest that our algorithms can achieve desirable performance in practical settings.
- Published
- 2023