{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T10:01:36Z","timestamp":1780999296820,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819573936","type":"print"},{"value":"9789819573943","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7394-3_25","type":"book-chapter","created":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:55:41Z","timestamp":1778457341000},"page":"361-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Reachability Queries: Empirical Evaluation and\u00a0Practical Guidelines"],"prefix":"10.1007","author":[{"given":"Huangleshuai","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1772-6863","authenticated-orcid":false,"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenke","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 253\u2013262 (1989)","DOI":"10.1145\/67544.66950"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Z., Chen, K., Wen, D., Yang, Z., Li, W., Zhang, Y.: Accelerating shortest path counting on road networks. In: 2025 IEEE 41st International Conference on Data Engineering (ICDE), pp. 3508\u20133521. IEEE (2025)","DOI":"10.1109\/ICDE65448.2025.00262"},{"issue":"11","key":"25_CR3","doi-asserted-by":"publisher","first-page":"6003","DOI":"10.3390\/app15116003","volume":"15","author":"Z Chen","year":"2025","unstructured":"Chen, Z., Liang, K., Yuan, L., Zhang, W., Yang, Z.: Recent advances in efficient dynamic graph processing. Appl. Sci. 15(11), 6003 (2025)","journal-title":"Appl. Sci."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Huang, S., Wu, H., Fu, A.W.C.: TF-label: a topological-folding labeling scheme for reachability querying in a large graph. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2013)","DOI":"10.1145\/2463676.2465286"},{"issue":"5","key":"25_CR5","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Dhia, I.B.: Access control in social networks: a reachability-based approach. In: Proceedings of the 2012 Joint EDBT\/ICDT Workshops, pp. 227\u2013232 (2012)","DOI":"10.1145\/2320765.2320828"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"He, H., et al.: A survey on efficient graph reachability queries. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 58\u201377. Springer, Singapore (2025)","DOI":"10.1007\/978-981-96-8295-9_4"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM (1962)","DOI":"10.1145\/368996.369025"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Li, X., Hao, K., Yang, Z., Cao, X., Zhang, W.: Hop-constrained S-T simple path enumeration in large uncertain graphs. In: Australasian Database Conference, pp. 115\u2013127. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15512-3_9"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: Hop-constrained S-T simple path enumeration in billion-scale labelled graphs. In: International Conference on Web Information Systems Engineering (2022)","DOI":"10.1007\/978-3-031-20891-1_5"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lyu, Q., Li, Y., He, B., Gong, B.: DBL: efficient reachability queries on dynamic graphs, pp. 761\u2013777 (2021)","DOI":"10.1007\/978-3-030-73197-7_52"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Merz, F., Sanders, P.: Preach: a fast lightweight reachability index using pruning and contraction hierarchies. In: Proceedings of the European Symposium on Algorithms, pp. 701\u2013712 (2014)","DOI":"10.1007\/978-3-662-44777-2_58"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Pang, Y., Zou, L., Liu, Y.: IFCA: index-free community-aware reachability processing over large dynamic graphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE) (2023)","DOI":"10.1109\/ICDE55515.2023.00172"},{"issue":"12","key":"25_CR14","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":"25_CR15","doi-asserted-by":"crossref","unstructured":"Scholz, B., Zhang, C., Cifuentes, C.: User-input dependence analysis via graph reachability. In: Proceedings of the 2008 8th IEEE International Working Conference on Source Code Analysis and Manipulation, pp. 25\u201334 (2008)","DOI":"10.1109\/SCAM.2008.22"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Sengupta, N., Bagchi, A., Ramanath, M., Bedathur, S.: ARROW: approximating reachability using random walks over web-scale graphs. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, pp. 470\u2013481. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00049"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S.J., Weikum, G.: Ferrari: flexible and efficient reachability range assignment for graph indexing. In: Proceedings of IEEE International Conference on Data Engineering 2013, pp. 1009\u20131020 (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"issue":"1\u20133","key":"25_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(88)90032-1","volume":"58","author":"K Simon","year":"1988","unstructured":"Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci. 58(1\u20133), 325\u2013346 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/TKDE.2016.2631160","volume":"29","author":"J Su","year":"2017","unstructured":"Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29, 683\u2013697 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR20","unstructured":"Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: answering graph reachability queries in constant time. In: Proceedings of IEEE 29th International Conference on Data Engineering (2006)"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-017-0468-3","volume":"27","author":"H Wei","year":"2018","unstructured":"Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. VLDB J. 27(1), 1\u201326 (2018)","journal-title":"VLDB J."},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Yano, Y., Akiba, T., Iwata, Y., Yoshida, Y.: Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. In: 22nd CIKM 2013: San Francisco, CA, USA (2013)","DOI":"10.1145\/2505515.2505724"},{"key":"25_CR23","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Dagger: a scalable index for reachability queries in large dynamic graphs (2013)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Cheng, J.: Graph reachability queries: a survey. In: Managing and Mining Graph Data, Advances in Database Systems, vol.\u00a040, pp. 181\u2013215. Springer (2010)","DOI":"10.1007\/978-1-4419-6045-0_6"},{"issue":"4","key":"25_CR25","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00778-011-0256-4","volume":"21","author":"H Y\u0131ld\u0131r\u0131m","year":"2012","unstructured":"Y\u0131ld\u0131r\u0131m, H., Chaoji, V., Zaki, M.J.: Grail: a scalable index for reachability queries in very large graphs. VLDB J. 21(4), 509\u2013534 (2012)","journal-title":"VLDB J."},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, C., Bonifati, A., \u00d6zsu, M.T.: An overview of reachability indexes on graphs. In: Companion of the 2023 International Conference on Management of Data, SIGMOD\/PODS 2023, pp. 61\u201368. ACM (2023)","DOI":"10.1145\/3555041.3589408"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach, pp. 1323\u20131334 (2014)","DOI":"10.1145\/2588555.2612181"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering - WISE 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7394-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T09:34:25Z","timestamp":1780997665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7394-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819573936","9789819573943"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7394-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","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":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2025.ficloud.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}