Back to Search
Start Over
Efficient Top-k Matching for Publish/Subscribe Ride Hitching
- Source :
- IEEE Transactions on Knowledge and Data Engineering. 35:3808-3821
- Publication Year :
- 2023
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 2023.
-
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.
- 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
Subjects
Details
- ISSN :
- 23263865 and 10414347
- Volume :
- 35
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Knowledge and Data Engineering
- Accession number :
- edsair.doi...........2263335e9724bf0fff9d4378f7733576