skip to main content
10.1145/3511808.3557213acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

PRID: An Efficient Pub/Sub Ride Hitching System

Published: 17 October 2022 Publication History

Abstract

As a convenient, economical and low carbon transport mode, ride hitching has gained tremendously prevalent in the globe. This paper presents PRID that offers an efficient ride hitching service with sufficient results analysis. In general, PRID is implemented by a publish/subscribe service, which provides a user-friendly web browser client that allows users (e.g., company managers and data analysts) to perform the performance analysis for ride hitching through simple interactive operations. Moreover, the server side of the PRID system consists of three modules including a top-k initialization module, an order dispatch module, and a top-k maintenance module, which can process the matching between drivers and riders efficiently. PRID system aims at continuously maintaining the update-to-date k best matched ride orders for each driver with less time cost, and monitoring their matching efficiency and effectiveness meanwhile. Finally, we demonstrate the PRID system on a real-world dataset, showing its good performance. The source code of the demonstration has been shared on https://github.com/wuqingshun/PRID.

Supplementary Material

MP4 File (CIKM22-demo174.mp4)
The title of this paper is PRID: An Efficient Pub/Sub Ride Hitching System. As a convenient, economical and low carbon transport mode, ride hitching has gained tremendously prevalent in the globe. In order to facilitate the company manager or data analyst to effectively analyze ride hitching results, we develop an efficient system for publish/subscribe ride hitching based on TkRS queries, called PRID. The PRID provides a user-friendly web browser client that allows users to perform the performance analysis for ride hitching through simple interactive operations.

References

[1]
Lisi Chen, Shuo Shang, Christian S Jensen, Jianliang Xu, Panos Kalnis, Bin Yao, and Ling Shao. 2020. Top-k term publish/subscribe for geo-textual data streams. VLDB 29, 5 (2020), 1101--1128.
[2]
Josh Angelo Escalona, Benjamin Manalo, and Wilbert Jethro R Limjoco. 2020. A Ride Sharing System based on An Expansive Search-Based Algorithm. In TENCON. 870--874.
[3]
Yafei Li, Rui Chen, Lei Chen, and Jianliang Xu. 2015. Towards social-aware ridesharing group query services. IEEE TSC 10, 4 (2015), 646--659.
[4]
Yafei Li, Hongyan Gu, Rui Chen, Jianliang Xu, Shangwei Guo, Junxiao Xue, and Mingliang Xu. 2021. Efficient Top-k Matching for Publish/Subscribe Ride Hitching. IEEE TKDE (2021).
[5]
Yafei Li, Ji Wan, Rui Chen, Jianliang Xu, Xiaoyi Fu, Hongyan Gu, Pei Lv, and Mingliang Xu. 2019. Top-k vehicle matching in social ridesharing: A price-aware approach. IEEE TKDE (2019).
[6]
Kyriakos Mouratidis, Spiridon Bakiras, and Dimitris Papadias. 2006. Continuous monitoring of top-k queries over sliding windows. In SIGMOD. ACM, 635--646.
[7]
Shohei Tsuruoka, Daichi Amagata, Shunya Nishio, and Takahiro Hara. 2020. Distributed spatial-keyword knn monitoring for location-aware pub/sub. In SIGSPATIAL. 111--114.
[8]
Libin Zheng, Peng Cheng, and Lei Chen. 2019. Auction-based order dispatch and pricing in ridesharing. In ICDE. 1034--1045.
[9]
Haojia Zuo, Bo Cao, Ying Zhao, Bilong Shen, Weimin Zheng, and Yan Huang. 2021. High-capacity ride-sharing via shortest path clustering on large road networks. J. Supercomput. 77, 4 (2021), 4081--4106.

Cited By

View all
  • (2023)Lotus: Serverless In-Transit Data Processing for Edge-based Pub/SubProceedings of the 6th International Workshop on Edge Systems, Analytics and Networking10.1145/3578354.3592869(31-35)Online publication date: 8-May-2023

Index Terms

  1. PRID: An Efficient Pub/Sub Ride Hitching System

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '22: Proceedings of the 31st ACM International Conference on Information & Knowledge Management
    October 2022
    5274 pages
    ISBN:9781450392365
    DOI:10.1145/3511808
    • General Chairs:
    • Mohammad Al Hasan,
    • Li Xiong
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 17 October 2022

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. demonstration
    2. location-based services
    3. optimization
    4. ride hitching

    Qualifiers

    • Short-paper

    Funding Sources

    • CPSF
    • NSFC
    • Henan NSF

    Conference

    CIKM '22
    Sponsor:

    Acceptance Rates

    CIKM '22 Paper Acceptance Rate 621 of 2,257 submissions, 28%;
    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)23
    • Downloads (Last 6 weeks)6
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Lotus: Serverless In-Transit Data Processing for Edge-based Pub/SubProceedings of the 6th International Workshop on Edge Systems, Analytics and Networking10.1145/3578354.3592869(31-35)Online publication date: 8-May-2023

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media