Abstract
The emergence of more complex, data-intensive applications motivates a high demand of effective data modeling for graph databases to support efficient query answering. In this paper, we develop an intuitive graph data model for dynamic taxi ride sharing. We argue that our proposed data model meets the data needs imposed by three fundamental tasks associated with taxi ride sharing. An experiment consisting of a taxi ride sharing simulation with real-world data demonstrates the effectiveness of our modelling approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For simplicity, we assume in this work that each taxi has just one taxi shift.
- 2.
This change time is not considered in some publications on the DTRP even though it has severe implications on ride sharing efficiency, since picking up passengers causes a schedule delay even if the pickup location is on the taxi route.
- 3.
For a better overview, we show the graph model with its nodes and relationships, but do not visualize the properties stored for nodes and relationships.
- 4.
In the literature this term is often used based on travel distance. Road segments, however, can have different travel speeds which leads to the invalidity of the triangle inequality on the road network. The path with the lowest total travel distance between two locations might not necessarily be the shortest path between them.
References
Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223, 295–303 (2012)
Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comp. Surv. 40, 1 (2008)
Graves, M., Bergeman, E.R., Lawrence, C.B.: Graph database systems. IEEE Eng. Med. Biol. Mag. 14, 737–745 (1995)
Hou, Y., et al.: Towards efficient vacant taxis cruising guidance. In: IEEE GLOBECOM, pp. 54–59 (2013)
Huang, Y., Bastani, F., Jin, R., Wang, X.S.: Large scale real-time ridesharing with service guarantee on road networks. PVLDB 7(14), 2017–2028 (2014)
Joslyn, C., Choudhury, S., Haglin, D., Howe, B., Nickless, B., Olsen, B.: Massive scale cyber traffic analysis: a driver for graph database research. In: International Workshop Graph Data Management Experiences and Systems, p. 3. ACM (2013)
Lysenko, A., Roznovăţ, I.A., Saqi, M., Mazein, A., Rawlings, C.J., Auffray, C.: Representing and querying disease networks using graph databases. BioData Min. 9(1), 23 (2016)
Ma, S., Zheng, Y., Wolfson, O.: T-share: a large-scale dynamic taxi ridesharing service. In: IEEE ICDE, pp. 410–421 (2013)
Ma, S., Zheng, Y., Wolfson, O., et al.: Real-time city-scale taxi ridesharing. TKDE 27, 1782–1795 (2015)
Mishra, P., Eich, M.H.: Join processing in relational databases. ACM Comp. Surv. 24, 63–113 (1992)
Neo4j: Graph database use cases. https://neo4j.com/use-cases/
Neo4j: Neo4j GraphGists. https://neo4j.com/graphgists/
NYC Taxi & limousine commission: trip record data. http://www.nyc.gov/html/tlc/html/about/triprecorddata.shtml
Park, Y., Shankar, M., Park, B.H., Ghosh, J.: Graph databases for large-scale healthcare systems. In: IEEE ICDE Workshops, pp. 12–19 (2014)
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, Heidelberg (2016)
Qian, X., Zhang, W., Ukkusuri, S.V., Yang, C.: Optimal assignment and incentive design in the taxi group ride problem. Trans. Res. B: Meth. 103, 208–226 (2017)
Robinson, I., Webber, J., Eifrem, E.: Graph Databases. O’Reilly, Sebastopol (2013)
Sahu, S., Mhedhbi, A., Salihoglu, S., Lin, J., Özsu, M.T.: The ubiquity of large graphs and surprising challenges of graph processing. PVLDB 11, 420–431 (2017)
Santi, P., Resta, G., Szell, M., Sobolevsky, S., Strogatz, S.H., Ratti, C.: Quantifying the benefits of vehicle pooling with shareability networks. Proc. Nat. Acad. Sci. 111, 13290–13294 (2014)
Santos, D.O., Xavier, E.C.: Dynamic taxi and ridesharing: A framework and heuristics for the optimization problem. In: IJCAI, vol. 13, pp. 2885–2891 (2013)
solidIT: DB-engines ranking - popularity ranking of graph DBMS. https://db-engines.com/en/ranking/graph+dbms
Steinmetz, D., Dyballa, D., Ma, H., Hartmann, S.: Using a conceptual model to transform road networks from OpenStreetMap to a graph database. In: Trujillo, J.C., et al. (eds.) ER 2018. LNCS, vol. 11157, pp. 301–315. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00847-5_22
Vicknair, C., Macias, M., Zhao, Z., Nan, X., Chen, Y., Wilkins, D.: A comparison of a graph database and a relational database: a data provenance perspective. In: ACM Southeast Conference, p. 42 (2010)
Yuan, N.J., Zheng, Y., Zhang, L., Xie, X.: T-Finder: a recommender system for finding passengers and vacant taxis. IEEE TKDE 25, 2390–2403 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Steinmetz, D., Merz, F., Ma, H., Hartmann, S. (2019). A Graph Model for Taxi Ride Sharing Supported by Graph Databases. In: Laender, A., Pernici, B., Lim, EP., de Oliveira, J. (eds) Conceptual Modeling. ER 2019. Lecture Notes in Computer Science(), vol 11788. Springer, Cham. https://doi.org/10.1007/978-3-030-33223-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-33223-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33222-8
Online ISBN: 978-3-030-33223-5
eBook Packages: Computer ScienceComputer Science (R0)