{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:55Z","timestamp":1773481975951,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306747","type":"print"},{"value":"9783031306754","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30675-4_15","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"217-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Index-Based Method for\u00a0Skyline Path Query over\u00a0Temporal Graphs with\u00a0Labels"],"prefix":"10.1007","author":[{"given":"Linlin","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Cai, T., et al.: Incremental graph computation: anchored vertex tracking in dynamic social networks. In: TKDE, pp. 1\u201314 (2022). https:\/\/doi.org\/10.1109\/TKDE.2022.3199494","DOI":"10.1109\/TKDE.2022.3199494"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Wang, K., Lin, X., Zhang, W., Qin, L., Zhang, Y.: Efficiently answering reachability and path queries on temporal bipartite graphs. In: PVLDB (2021)","DOI":"10.14778\/3467861.3467873"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00778-013-0346-6","volume":"23","author":"J Cheng","year":"2014","unstructured":"Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: Efficient processing of k-hop reachability queries. VLDB J. 23(2), 227\u2013252 (2014)","journal-title":"VLDB J."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205\u2013216 (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"15_CR5","unstructured":"Gong, Q., Cao, H.: Backbone index to support skyline path queries over multi-cost road networks. In: EDBT, pp. 2\u2013325 (2022)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Hassan, M.S., Aref, W.G., Aly, A.M.: Graph indexing for shortest-path finding over dynamic sub-graphs. In: SIGMOD, pp. 1183\u20131197 (2016)","DOI":"10.1145\/2882903.2882933"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: ICDE, pp. 261\u2013272 (2010)","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Li, M., Xin, J., Wang, Z., Liu, H.: Accelerating minimum temporal paths query based on dynamic programming. In: ADMA, pp. 48\u201362 (2019)","DOI":"10.1007\/978-3-030-35231-8_4"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Nicosia, V., Tang, J., Musolesi, M., Russo, G., Mascolo, C., Latora, V.: Components in time-varying graphs. Chaos Interdiscip. J. Nonlinear Sci. 22(2), 023101 (2012)","DOI":"10.1063\/1.3697996"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Noto, M., Sato, H.: A method for the shortest path search by extended Dijkstra algorithm. In: SMC, vol. 3, pp. 2316\u20132320 (2000)","DOI":"10.1109\/ICSMC.2000.886462"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Rice, M., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. In: PVLDB, vol. 4, pp. 69\u201380 (2010)","DOI":"10.14778\/1921071.1921074"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Shekelyan, M., Joss\u00e9, G., Schubert, M.: Linear path skylines in multicriteria networks. In: ICDE, pp. 459\u2013470 (2015)","DOI":"10.1109\/ICDE.2015.7113306"},{"key":"15_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110036","volume":"258","author":"X Song","year":"2022","unstructured":"Song, X., Li, J., Cai, T., Yang, S., Yang, T., Liu, C.: A survey on deep learning based knowledge tracing. Knowl.-Based Syst. 258, 110036 (2022)","journal-title":"Knowl.-Based Syst."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Tian, Y., Lee, K.C., Lee, W.C.: Finding skyline paths in road networks. In: SIGSPATIAL, pp. 444\u2013447 (2009)","DOI":"10.1145\/1653771.1653840"},{"key":"15_CR15","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 (2017)","DOI":"10.1145\/3035918.3035955"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, G., Tang, N.: Querying shortest paths on time dependent road networks. In: PVLDB, vol. 12, pp. 1249\u20131261 (2019)","DOI":"10.14778\/3342263.3342265"},{"issue":"11","key":"15_CR17","first-page":"2927","volume":"28","author":"H Wu","year":"2016","unstructured":"Wu, H., Cheng, J., Ke, Y., Huang, S., Huang, Y., Wu, H.: Efficient algorithms for temporal path computation. TKDE 28(11), 2927\u20132942 (2016)","journal-title":"TKDE"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Multi-cost optimal route planning under time-varying uncertainty. In: ICDE (2014)","DOI":"10.1109\/ICDE.2014.6816646"},{"key":"15_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109852","volume":"257","author":"S Yang","year":"2022","unstructured":"Yang, S., et al.: Robust cross-network node classification via constrained graph mutual information. Knowl.-Based Syst. 257, 109852 (2022)","journal-title":"Knowl.-Based Syst."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Yang, Y., Gao, H., Yu, J.X., Li, J.: Finding the cost-optimal path with time constraint over time-dependent graphs. In: PVLDB, vol. 7, pp. 673\u2013684 (2014)","DOI":"10.14778\/2732939.2732941"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Lian, X., Wang, G., Ma, Y., Wang, Y.: Constrained shortest path query in a large time-dependent graph. In: PVLDB, vol. 12, pp. 1058\u20131070 (2019)","DOI":"10.14778\/3339490.3339491"}],"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-031-30675-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T08:45:14Z","timestamp":1729241114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30675-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306747","9783031306754"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30675-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","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":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","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":"125","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":"66","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":"19% - 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","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":"7.3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}