{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:20:03Z","timestamp":1743135603262,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594152"},{"type":"electronic","value":"9783030594169"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59416-9_3","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:08:14Z","timestamp":1600704494000},"page":"36-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Discovering Real-Time Reachable Area Using Trajectory Connections"],"prefix":"10.1007","author":[{"given":"Ruiyuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huajun","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sijie","family":"Ruan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianfu","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongyuan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, vol. 19, no. 2, pp. 322\u2013331. ACM (1990)","DOI":"10.1145\/93605.98741"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802\u2013813 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, V., Gamper, J., Loperfido, R., Profanter, S., Putzer, S., Timko, I.: Computing isochrones in multi-modal, schedule-based transport networks. In: ACM SIGSPATIAL, pp. 1\u20132 (2008)","DOI":"10.1145\/1463434.1463524"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Wang, J., Gu, Q., Wu, J., Liu, G., Xiong, Z.: Traffic speed prediction and congestion source exploration: a deep learning method. In: ICDM, pp. 499\u2013508. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0061"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-32049-6_26","volume-title":"Database Systems for Advanced Applications","author":"D Wang","year":"2016","unstructured":"Wang, D., Cao, W., Xu, M., Li, J.: ETCPS: an effective and scalable traffic condition prediction system. In: Navathe, S.B., Wu, W., Shekhar, S., Du, X., Wang, X.S., Xiong, H. (eds.) DASFAA 2016. LNCS, vol. 9643, pp. 419\u2013436. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32049-6_26"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Lin, X., Wang, Y., Xiao, X., Li, Z., Bhowmick, S.S.: Path travel time estimation using attribute-related hybrid trajectories network. In: CIKM, pp. 1973\u20131982. ACM (2019)","DOI":"10.1145\/3357384.3357927"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Xie, Q., Guo, T., Chen, Y., Xiao, Y., Wang, X., Zhao, B.Y.: How do urban incidents affect traffic speed? A deep graph convolutional network for incident-driven traffic speed prediction, arXiv preprint arXiv:1912.01242 (2019)","DOI":"10.1145\/3340531.3411873"},{"key":"3_CR8","unstructured":"Skiena, S.: Dijkstra\u2019s algorithm. In: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, pp. 225\u2013227. Addison-Wesley, Reading (1990)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Wu, G., Ding, Y., Li, Y., Bao, J., Zheng, Y.: Mining spatio-temporal reachable regions over massive trajectory data. In: ICDE, pp. 1283\u20131294. IEEE (2017)","DOI":"10.1109\/ICDE.2017.171"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.artint.2018.03.002","volume":"259","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Zheng, Y., Qi, D., Li, R., Yi, X., Li, T.: Predicting citywide crowd flows using deep spatio-temporal residual networks. Artif. Intell. 259, 147\u2013166 (2018)","journal-title":"Artif. Intell."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ruan, S., Li, R., Bao, J., He, T., Zheng, Y.: CloudTP: a cloud-based flexible trajectory preprocessing framework. In: ICDE. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00186"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Bao, J., Li, R., Yi, X., Zheng, Y.: Managing massive trajectories on the cloud. In: SIGSPATIAL, p. 41. ACM (2016)","DOI":"10.1145\/2996913.2996916"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Li, R., Ruan, S., Bao, J., Zheng, Y.: A cloud-based trajectory data management system. In: ACM SIGSPATIAL, pp. 1\u20134 (2017)","DOI":"10.1145\/3139958.3139990"},{"key":"3_CR14","unstructured":"Li, R., et al.: Efficient path query processing over massive trajectories on the cloud. IEEE Trans. Big Data (2018)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Li, R., et al.: Just: JD urban spatio-temporal data engine. In: ICDE. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00138"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Li, R., et al.: TrajMesa: a distributed NoSQL storage engine for big trajectory data. In: ICDE. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00224"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, J., Zhou, S., Yu, J.X., Wei, H., Chen, Z., Tang, X.: Dag reduction: fast answering reachability queries. In: SIGMOD, pp. 375\u2013390. ACM (2017)","DOI":"10.1145\/3035918.3035927"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Valstar, L.D., Fletcher, G.H., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: SIGMOD, pp. 345\u2013358. ACM (2017)","DOI":"10.1145\/3035918.3035955"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-18579-4_14","volume-title":"Database Systems for Advanced Applications","author":"S Anirban","year":"2019","unstructured":"Anirban, S., Wang, J., Saiful Islam, M.: Multi-level graph compression for fast reachability detection. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds.) DASFAA 2019. LNCS, vol. 11447, pp. 229\u2013246. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18579-4_14"},{"issue":"3","key":"3_CR20","first-page":"683","volume":"29","author":"J Su","year":"2017","unstructured":"Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? TKDE 29(3), 683\u2013697 (2017)","journal-title":"TKDE"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Sarwat, M., Sun, Y.: Answering location-aware graph reachability queries on geosocial data. In: ICDE, pp. 207\u2013210. IEEE (2017)","DOI":"10.1109\/ICDE.2017.76"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. In: ICDE, pp. 145\u2013156. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498236"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-017-0468-3","volume":"27","author":"H Wei","year":"2017","unstructured":"Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. VLDB J. 27(1), 1\u201326 (2017). https:\/\/doi.org\/10.1007\/s00778-017-0468-3","journal-title":"VLDB J."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zheng, Y., Xue, Y.: Travel time estimation of a path using sparse trajectories. In: SIGKDD, pp. 25\u201334. ACM (2014)","DOI":"10.1145\/2623330.2623656"},{"issue":"3","key":"3_CR25","first-page":"85","volume":"10","author":"J Dai","year":"2016","unstructured":"Dai, J., Yang, B., Guo, C., Jensen, C.S., Hu, J.: Path cost distribution estimation using trajectory data. VLDB 10(3), 85\u201396 (2016)","journal-title":"VLDB"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-18579-4_10","volume-title":"Database Systems for Advanced Applications","author":"J Xu","year":"2019","unstructured":"Xu, J., Zhang, Y., Chao, L., Xing, C.: STDR: a deep learning method for travel time estimation. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds.) DASFAA 2019. LNCS, vol. 11447, pp. 156\u2013172. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18579-4_10"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Wang, D., Zhang, J., Cao, W., Li, J., Yu, Z.: When will you arrive? Estimating travel time based on deep neural networks. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11877"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59416-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:41:01Z","timestamp":1709811661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59416-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594152","9783030594169"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59416-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.81","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}