{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:13:31Z","timestamp":1781086411938,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031208904","type":"print"},{"value":"9783031208911","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20891-1_5","type":"book-chapter","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:03:02Z","timestamp":1667779382000},"page":"49-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Hop-Constrained s-t Simple Path Enumeration in Billion-Scale Labelled Graphs"],"prefix":"10.1007","author":[{"given":"Xia","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kongzhang","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Chen, Z., Yuan, L., Lin, X., Qin, L., Yang, J.: Efficient maximal balanced clique enumeration in signed networks. In: WWW 2020: The Web Conference 2020, Taipei, Taiwan, 20\u201324 April 2020, pp. 339\u2013349. ACM\/IW3C2 (2020)","DOI":"10.1145\/3366423.3380119"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Freitas, A., da Silva, J.C.P., Curry, E., Buitelaar, P.: A distributional semantics approach for selective reasoning on commonsense graph knowledge bases. In: M\u00e9tais, E., Roche, M., Teisseire, M. (eds.) NLDB 2014. LNCS, vol. 8455, pp. 21\u201332. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07983-7_3","DOI":"10.1007\/978-3-319-07983-7_3"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-77404-6_40","volume-title":"LATIN 2018: Theoretical Informatics","author":"R Grossi","year":"2018","unstructured":"Grossi, R., Marino, A., Versari, L.: Efficient algorithms for listing k disjoint st-paths in graphs. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 544\u2013557. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_40"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Hao, K., Yang, Z., Lai, L., Lai, Z., Jin, X., Lin, X.: PatMat: a distributed pattern matching engine with cypher. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, pp. 2921\u20132924 (2019)","DOI":"10.1145\/3357384.3357840"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.14778\/3489496.3489499","volume":"15","author":"K Hao","year":"2021","unstructured":"Hao, K., Yuan, L., Zhang, W.: Distributed hop-constrained s-t simple path enumeration at billion scale. Proc. VLDB Endow. 15(2), 169\u2013182 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s11280-012-0157-5","volume":"15","author":"Y Hao","year":"2012","unstructured":"Hao, Y., Zhang, Y., Cao, J.: A novel QoS model and computation framework in web service selection. World Wide Web 15(5), 663\u2013684 (2012)","journal-title":"World Wide Web"},{"issue":"8","key":"5_CR7","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1093\/bioinformatics\/btg113","volume":"19","author":"L Krishnamurthy","year":"2003","unstructured":"Krishnamurthy, L., et al.: Pathways database system: an integrated system for biological pathways. Bioinform. 19(8), 930\u2013937 (2003)","journal-title":"Bioinform."},{"issue":"10","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.14778\/3339490.3339494","volume":"12","author":"L Lai","year":"2019","unstructured":"Lai, L., et al.: Distributed subgraph matching on timely dataflow. Proc. VLDB Endow. 12(10), 1099\u20131112 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao, N., Cohen, W.W.: Relational retrieval using a combination of path-constrained random walks. Mach. Learn. 81(1), 53\u201367 (2010)","journal-title":"Mach. Learn."},{"key":"5_CR10","unstructured":"Leser, U.: A query language for biological networks. In: ECCB\/JBI 2005 Proceedings, Madrid, Spain, 28 September\u20131 October 2005, p. 39 (2005)"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s11280-011-0151-3","volume":"16","author":"L Li","year":"2013","unstructured":"Li, L., Xu, G., Yang, Z., Dolog, P., Zhang, Y., Kitsuregawa, M.: An efficient approach to suggesting topically related web queries using hidden topic model. World Wide Web 16(3), 273\u2013297 (2013)","journal-title":"World Wide Web"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (a, $$\\beta $$)-core computation: an index-based approach. In: The World Wide Web Conference, WWW 2019, San Francisco, CA, USA, 13\u201317 May 2019, pp. 1130\u20131141. ACM (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Mazumder, S., Liu, B.: Context-aware path ranking for knowledge base completion. In: Sierra, C. (ed.) IJCAI, pp. 1195\u20131201. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/166"},{"key":"5_CR14","first-page":"1","volume":"31","author":"Y Peng","year":"2021","unstructured":"Peng, Y., Lin, X., Zhang, Y., Zhang, W., Qin, L.: Answering reachability and K-reach queries on large graphs with label-constraints. VLDB J. 31, 1\u201325 (2021)","journal-title":"VLDB J."},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.14778\/3372716.3372720","volume":"13","author":"Y Peng","year":"2019","unstructured":"Peng, Y., Zhang, Y., Lin, X., Zhang, W., Qin, L., Zhou, J.: Hop-constrained s-t simple path enumeration: towards bridging theory and practice. Proc. VLDB Endow. 13(4), 463\u2013476 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.14778\/3229863.3229874","volume":"11","author":"X Qiu","year":"2018","unstructured":"Qiu, X., et al.: Real-time constrained cycle detection in large dynamic graphs. Proc. VLDB Endow. 11(12), 1876\u20131888 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-319-19315-1_28","volume-title":"Combinatorial Algorithms","author":"R Rizzi","year":"2015","unstructured":"Rizzi, R., Sacomoto, G., Sagot, M.-F.: Efficiently listing bounded length st-paths. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 318\u2013329. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19315-1_28"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s11280-022-01049-8","volume":"25","author":"R Sun","year":"2022","unstructured":"Sun, R., Chen, C., Liu, X., Xu, S., Wang, X., Lin, X.: Critical nodes identification in large networks: the inclined and detached models. World Wide Web 25(3), 1315\u20131341 (2022)","journal-title":"World Wide Web"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Sun, S., Chen, Y., He, B., Hooi, B.: PathEnum: towards real-time hop-constrained s-t path enumeration. In: Proceedings of SIGMOD, pp. 1758\u20131770 (2021)","DOI":"10.1145\/3448016.3457290"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Valstar, L.D.J., Fletcher, G.H.L., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: SIGMOD, pp. 345\u2013358. ACM (2017)","DOI":"10.1145\/3035918.3035955"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. 1\u201325 (2022)","DOI":"10.1007\/s00778-022-00746-0"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Qin, L., Zhou, A.: Efficient personalized maximum biclique search. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 498\u2013511. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00042"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Yang, Z., Lai, L., Lin, X., Hao, K., Zhang, W.: HUGE: an efficient and scalable subgraph enumeration system. In: Li, G., Li, Z., Idreos, S., Srivastava, D. (eds.) SIGMOD 2021: International Conference on Management of Data, Virtual Event, China, 20\u201325 June 2021, pp. 2049\u20132062. ACM (2021)","DOI":"10.1145\/3448016.3457237"},{"issue":"5","key":"5_CR24","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s11280-014-0307-z","volume":"18","author":"W Yao","year":"2015","unstructured":"Yao, W., He, J., Huang, G., Cao, J., Zhang, Y.: A graph-based model for context-aware recommendation using implicit feedback data. World wide web 18(5), 1351\u20131371 (2015)","journal-title":"World wide web"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Yue, D., Wu, X., Wang, Y., Li, Y., Chu, C.H.: A review of data mining-based financial fraud detection research. In: 2007 International Conference on Wireless Communications, Networking and Mobile Computing, pp. 5519\u20135522. IEEE (2007)","DOI":"10.1109\/WICOM.2007.1352"},{"issue":"3","key":"5_CR26","doi-asserted-by":"publisher","first-page":"686","DOI":"10.14778\/3494124.3494148","volume":"15","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Yuan, L., Li, W., Qin, L., Zhang, Y.: Efficient label-constrained shortest path queries on road networks: a tree decomposition approach. Proc. VLDB Endow. 15(3), 686\u2013698 (2021)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20891-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T07:30:36Z","timestamp":1678519836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20891-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031208904","9783031208911"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20891-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Biarritz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2022.sigappfr.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"94","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":"31","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":"13","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":"33% - 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.5","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":"2.5","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":"The proceedings include 3 demo 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)"}}]}}