{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T08:12:38Z","timestamp":1778227958778,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203659","type":"print"},{"value":"9789819203666","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-92-0366-6_26","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:41:39Z","timestamp":1778226099000},"page":"421-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Reachability Queries on\u00a0Hypergraphs"],"prefix":"10.1007","author":[{"given":"Faming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjds\/s13688-020-00231-0","volume":"9","author":"SG Aksoy","year":"2020","unstructured":"Aksoy, S.G., Joslyn, C., Ortiz\u00a0Marrero, C., Praggastis, B., Purvine, E.: Hypernetwork science via high-order hypergraph walks. EPJ Data Sci. 9(1), 1\u201334 (2020). https:\/\/doi.org\/10.1140\/epjds\/s13688-020-00231-0","journal-title":"EPJ Data Sci."},{"issue":"7","key":"26_CR2","doi-asserted-by":"publisher","first-page":"796","DOI":"10.3390\/e23070796","volume":"23","author":"A Antelmi","year":"2021","unstructured":"Antelmi, A., Cordasco, G., Spagnuolo, C., Szufel, P.: Social influence maximization in hypergraphs. Entropy 23(7), 796 (2021)","journal-title":"Entropy"},{"issue":"8","key":"26_CR3","first-page":"1645","volume":"15","author":"X Chen","year":"2022","unstructured":"Chen, X., Peng, Y., Wang, S., Yu, J.X.: Dlcr: efficient indexing for label-constrained reachability queries on large dynamic graphs. VLDB 15(8), 1645\u20131657 (2022)","journal-title":"VLDB"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In: ICDE, pp. 893\u2013902 (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"26_CR5","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: SIGMOD, pp. 193\u2013204 (2013)","DOI":"10.1145\/2463676.2465286"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.endm.2015.06.077","volume":"49","author":"O Cooley","year":"2015","unstructured":"Cooley, O., Kang, M., Koch, C.: Evolution of high-order connected components in random hypergraphs. Electron. Notes Discrete Math. 49, 569\u2013575 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Ding, K., Wang, J., Li, J., Li, D., Liu, H.: Be more with less: Hypergraph attention networks for inductive text classification. In: EMNLP, pp. 4927\u20134936 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.399"},{"key":"26_CR8","unstructured":"Gao, J., Zhao, Q., Ren, W., Swami, A., Ramanathan, R., Bar-Noy, A.: Dynamic shortest path algorithms for hypergraphs. TON"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.aei.2017.06.004","volume":"33","author":"K Grzesiak-Kopec","year":"2017","unstructured":"Grzesiak-Kopec, K., Oramus, P., Ogorzalek, M.: Hypergraphs and extremal optimization in 3D integrated circuit design automation. Adv. Eng. Inf. 33, 491\u2013501 (2017)","journal-title":"Adv. Eng. Inf."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: SIGMOD, pp. 595\u2013608 (2008)","DOI":"10.1145\/1376616.1376677"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"36032","DOI":"10.1038\/s41598-025-19974-9","volume":"15","author":"B Kov\u00e1cs","year":"2025","unstructured":"Kov\u00e1cs, B., Benedek, B., Palla, G.: Community detection in hypergraphs through hyperedge percolation. Sci. Rep. 15(1), 36032 (2025)","journal-title":"Sci. Rep."},{"issue":"8","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3719002","volume":"57","author":"G Lee","year":"2025","unstructured":"Lee, G., Bu, F., Eliassi-Rad, T., Shin, K.: A survey on hypergraph mining: patterns, tools, and generators. ACM Comput. Surv. 57(8), 1\u201336 (2025)","journal-title":"ACM Comput. Surv."},{"issue":"11","key":"26_CR13","first-page":"2256","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee, G., Ko, J., Shin, K.: Hypergraph motifs: concepts, algorithms, and discoveries. VLDB 13(11), 2256\u20132269 (2020)","journal-title":"VLDB"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/15427951.2012.678151","volume":"9","author":"L Lu","year":"2013","unstructured":"Lu, L., Peng, X.: High-order random walks and generalized laplacians on hypergraphs. Internet Math. 9(1), 3\u201332 (2013)","journal-title":"Internet Math."},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s00778-022-00763-z","volume":"32","author":"Q Luo","year":"2023","unstructured":"Luo, Q., Yu, D., Cai, Z., Lin, X., Wang, G., Cheng, X.: Toward maintenance of hypercores in large-scale dynamic hypergraphs. VLDB J. 32(3), 647\u2013664 (2023)","journal-title":"VLDB J."},{"issue":"5","key":"26_CR16","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1007\/s00778-024-00851-2","volume":"33","author":"G Preti","year":"2024","unstructured":"Preti, G., De Francisci Morales, G., Bonchi, F.: Hyper-distance oracles in hypergraphs. VLDB J. 33(5), 1333\u20131356 (2024)","journal-title":"VLDB J."},{"issue":"5","key":"26_CR17","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/TCBB.2015.2459681","volume":"14","author":"AM Ritz","year":"2017","unstructured":"Ritz, A.M., Avent, B., Murali, T.M.: Pathway analysis with signaling hypergraphs. IEEE ACM Trans. Comput. Biol. Bioinform. 14(5), 1042\u20131055 (2017)","journal-title":"IEEE ACM Trans. Comput. Biol. Bioinform."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Ruggeri, N., Contisciani, M., Battiston, F., De\u00a0Bacco, C.: Community detection in large hypergraphs. Sci. Adv. 9(28), eadg9159 (2023)","DOI":"10.1126\/sciadv.adg9159"},{"issue":"2\u20133","key":"26_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00778-019-00548-x","volume":"29","author":"S Sahu","year":"2020","unstructured":"Sahu, S., Mhedhbi, A., Salihoglu, S., Lin, J., \u00d6zsu, M.T.: The ubiquity of large graphs and surprising challenges of graph processing: extended survey. VLDB J. 29(2\u20133), 595\u2013618 (2020)","journal-title":"VLDB J."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Shun, J.: Practical parallel hypergraph algorithms. In: PPoPP, pp. 232\u2013249 (2020)","DOI":"10.1145\/3332466.3374527"},{"issue":"3","key":"26_CR21","first-page":"683","volume":"29","author":"J Su","year":"2016","unstructured":"Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? TKDE 29(3), 683\u2013697 (2016)","journal-title":"TKDE"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM 31(2), 245\u2013281 (1984)","journal-title":"J. ACM"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Xia, X., Yin, H., Yu, J., Wang, Q., Cui, L., Zhang, X.: Self-supervised hypergraph convolutional networks for session-based recommendation. In: AAAI, pp. 4503\u20134511 (2021)","DOI":"10.1609\/aaai.v35i5.16578"},{"key":"26_CR24","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: CIKM, pp. 1601\u20131606 (2013)","DOI":"10.1145\/2505515.2505724"},{"issue":"2","key":"26_CR25","first-page":"1000","volume":"15","author":"P Yuan","year":"2022","unstructured":"Yuan, P., You, Y., Zhou, S., Jin, H., Liu, L.: Providing fast reachability query services with mgtag: a multi-dimensional graph labeling method. TSC 15(2), 1000\u20131011 (2022)","journal-title":"TSC"}],"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-981-92-0366-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:41:44Z","timestamp":1778226104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0366-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203659","9789819203666"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0366-6_26","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":"9 May 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}