{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T17:07:32Z","timestamp":1749056852779,"version":"3.40.2"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T00:00:00Z","timestamp":1691798400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T00:00:00Z","timestamp":1691798400000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11704-022-2368-y","type":"journal-article","created":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T04:01:50Z","timestamp":1691812910000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Answering reachability queries with ordered label constraints over labeled graphs"],"prefix":"10.1007","volume":"18","author":[{"given":"Daoliang","family":"He","sequence":"first","affiliation":[]},{"given":"Pingpeng","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,12]]},"reference":[{"key":"2368_CR1","doi-asserted-by":"crossref","unstructured":"Jin R, Hong H, Wang H, Ruan N, Xiang Y. Computing label-constraint reachability in graph databases. In: Proceedings of 2010 ACM SIGMOD International Conference on Management of Data. 2010, 123\u2013134","DOI":"10.1145\/1807167.1807183"},{"key":"2368_CR2","doi-asserted-by":"crossref","unstructured":"Zhu J, Nie Z, Liu X, Zhang B, Wen J. Statsnowball: a statistical approach to extracting entity relationships. In: Proceedings of the 18th International Conference on World Wide Web. 2009, 101\u2013110","DOI":"10.1145\/1526709.1526724"},{"issue":"12","key":"2368_CR3","doi-asserted-by":"crossref","first-page":"222101","DOI":"10.1007\/s11432-019-2739-2","volume":"64","author":"C Yang","year":"2021","unstructured":"Yang C, Liu G, Yan C, Jiang C. A clustering-based flexible weighting method in AdaBoost and its application to transaction fraud detection. Science China Information Sciences, 2021, 64(12): 222101","journal-title":"Science China Information Sciences"},{"key":"2368_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 2013 ACM SIGMOD International Conference on Management of Data. 2013, 193\u2013204","DOI":"10.1145\/2463676.2465286"},{"issue":"5","key":"2368_CR5","doi-asserted-by":"crossref","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 Journal on Computing, 2003, 32(5): 1338\u20131355","journal-title":"SIAM Journal on Computing"},{"key":"2368_CR6","doi-asserted-by":"crossref","unstructured":"Jin R, Ning R, Dey S, Xu J Y. SCARAB: scaling reachability computation on large graphs. In: Proceedings of 2012 ACM SIGMOD International Conference on Management of Data. 2012, 169\u2013180","DOI":"10.1145\/2213836.2213856"},{"key":"2368_CR7","doi-asserted-by":"crossref","unstructured":"Jin R, Xiang Y, Ruan N, Wang H. Efficiently answering reachability queries on very large directed graphs. In: Proceedings of 2008 ACM SIGMOD International Conference on Management of Data. 2008, 595\u2013608","DOI":"10.1145\/1376616.1376677"},{"issue":"4","key":"2368_CR8","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/s11280-016-0407-z","volume":"20","author":"L Li","year":"2017","unstructured":"Li L, Hua W, Zhou X. HD-GDD: high dimensional graph dominance drawing approach for reachability query. World Wide Web, 2017, 20(4): 677\u2013696","journal-title":"World Wide Web"},{"issue":"3","key":"2368_CR9","doi-asserted-by":"crossref","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 Transactions on Knowledge and Data Engineering, 2017, 29(3): 683\u2013697","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"12","key":"2368_CR10","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.14778\/2732977.2732992","volume":"7","author":"H Wei","year":"2014","unstructured":"Wei H, Yu J X, Lu C, Jin R. Reachability querying: an independent permutation labeling approach. Proceedings of the VLDB Endowment, 2014, 7(12): 1191\u20131202","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"2368_CR11","doi-asserted-by":"crossref","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. The VLDB Journal, 2018, 27(1): 1\u201326","journal-title":"The VLDB Journal"},{"issue":"2","key":"2368_CR12","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TSC.2020.2969898","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. IEEE Transactions on Services Computing, 2022, 15(2): 1000\u20131011","journal-title":"IEEE Transactions on Services Computing"},{"issue":"3","key":"2368_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J. Temporal networks. Physics Reports, 2012, 519(3): 97\u2013125","journal-title":"Physics Reports"},{"issue":"1","key":"2368_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TKDE.2016.2598561","volume":"29","author":"C Shi","year":"2017","unstructured":"Shi C, Li Y, Zhang J, Sun Y, Yu P S. A survey of heterogeneous information network analysis. IEEE Transactions on Knowledge and Data Engineering, 2017, 29(1): 17\u201337","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"2368_CR15","doi-asserted-by":"crossref","first-page":"812","DOI":"10.14778\/3380750.3380753","volume":"13","author":"Y Peng","year":"2020","unstructured":"Peng Y, Zhang Y, Lin X, Qin L, Zhang W. Answering billion-scale label-constrained reachability queries within microsecond. Proceedings of the VLDB Endowment, 2020, 13(6): 812\u2013825","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2368_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.is.2013.10.003","volume":"40","author":"L Zou","year":"2014","unstructured":"Zou L, Xu K, Yu J X, Chen L, Xiao Y, Zhao D. Efficient processing of label-constraint reachability queries in large graphs. Information Systems, 2014, 40: 47\u201366","journal-title":"Information Systems"},{"key":"2368_CR17","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: Proceedings of 2017 ACM International Conference on Management of Data. 2017, 345\u2013358","DOI":"10.1145\/3035918.3035955"},{"issue":"1","key":"2368_CR18","first-page":"7","volume":"36","author":"R Jin","year":"2011","unstructured":"Jin R, Ruan N, Xiang Y, Wang H. Path-tree: an efficient reachability indexing scheme for large directed graphs. ACM Transactions on Database Systems, 2011, 36(1): 7","journal-title":"ACM Transactions on Database Systems"},{"key":"2368_CR19","doi-asserted-by":"crossref","unstructured":"Chen Y, Chen Y. An efficient algorithm for answering graph reachability queries. In: Proceedings of the 24th IEEE International Conference on Data Engineering. 2008, 893\u2013902","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"2368_CR20","doi-asserted-by":"crossref","unstructured":"Van Schaik S J, De Moor O. A memory efficient reachability data structure through bit vector compression. In: Proceedings of 2011 ACM SIGMOD International Conference on Management of Data. 2011, 913\u2013924","DOI":"10.1145\/1989323.1989419"},{"key":"2368_CR21","doi-asserted-by":"crossref","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 the 22nd International Conference on Data Engineering (ICDE\u201906). 2006, 75","DOI":"10.1109\/ICDE.2006.53"},{"key":"2368_CR22","doi-asserted-by":"crossref","unstructured":"Chen Y. General spanning trees and reachability query evaluation. In: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering. 2009, 243\u2013252","DOI":"10.1145\/1557626.1557665"},{"key":"2368_CR23","doi-asserted-by":"crossref","unstructured":"Jin R, Xiang Y, Ruan N, Fuhry D. 3-HOP: a high-compression indexing scheme for reachability query. In: Proceedings of 2009 ACM SIGMOD International Conference on Management of Data. 2009, 813\u2013826","DOI":"10.1145\/1559845.1559930"},{"issue":"14","key":"2368_CR24","doi-asserted-by":"crossref","first-page":"1978","DOI":"10.14778\/2556549.2556578","volume":"6","author":"R Jin","year":"2013","unstructured":"Jin R, Wang G. Simple, fast, and scalable reachability oracle. Proceedings of the VLDB Endowment, 2013, 6(14): 1978\u20131989","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2368_CR25","doi-asserted-by":"crossref","unstructured":"Schenkel R, Theobald A, Weikum G. HOPI: an efficient connection index for complex xml document collections. In: Proceedings of the 9th International Conference on Extending Database Technology. 2004, 237\u2013255","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"2368_CR26","doi-asserted-by":"crossref","unstructured":"Cheng J, Yu J X, Lin X, Wang H, Philip S Y. Fast computation of reachability labeling for large graphs. In: Proceedings of the 10th International Conference on Extending Database Technology. 2006, 961\u2013979","DOI":"10.1007\/11687238_56"},{"key":"2368_CR27","doi-asserted-by":"crossref","unstructured":"Cai J, Poon C K. Path-hop: efficiently indexing large graphs for reachability queries. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management. 2010, 119\u2013128","DOI":"10.1145\/1871437.1871457"},{"key":"2368_CR28","doi-asserted-by":"crossref","unstructured":"Zhu A D, Lin W, Wang S, Xiao X. Reachability queries on large dynamic graphs: a total order approach. In: Proceedings of 2014 ACM SIGMOD International Conference on Management of Data. 2014, 1323\u20131334","DOI":"10.1145\/2588555.2612181"},{"key":"2368_CR29","doi-asserted-by":"crossref","unstructured":"Tr\u00dfI S, Leser U. Fast and practical indexing and querying of very large graphs. In: Proceedings of 2007 ACM SIGMOD International Conference on Management of Data. 2007, 845\u2013856","DOI":"10.1145\/1247480.1247573"},{"issue":"1\u20132","key":"2368_CR30","doi-asserted-by":"crossref","first-page":"276","DOI":"10.14778\/1920841.1920879","volume":"3","author":"H Yildirim","year":"2010","unstructured":"Yildirim H, Chaoji V, Zaki M J. Grail: scalable reachability index for large graphs. Proceedings of the VLDB Endowment, 2010, 3(1\u20132): 276\u2013284","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"2368_CR31","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00778-011-0256-4","volume":"21","author":"H Yildirim","year":"2012","unstructured":"Yildirim H, Chaoji V, Zaki M J. Grail: a scalable index for reachability queries in very large graphs. The VLDB Journal, 2012, 21(4): 509\u2013534","journal-title":"The VLDB Journal"},{"key":"2368_CR32","doi-asserted-by":"crossref","unstructured":"Seufert S, Anand A, Bedathur S, Weikum G. FERRARI: flexible and efficient reachability range assignment for graph indexing. In: Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE). 2013, 1009\u20131020","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"2368_CR33","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G D Battista","year":"1999","unstructured":"Battista G D, Eades P, Tamassia R, Tollis I G. Graph Drawing: Algorithms for the Visualization of Graphs. New Jersey: Prentice Hall, 1999"},{"key":"2368_CR34","unstructured":"Veloso R R, Cerf L, Meira W Jr, Zaki M J. Reachability queries in very large graphs: a fast refined online search approach. In: Proceedings of the 17th International Conference on Extending Database Technology. 2014, 511\u2013522"},{"key":"2368_CR35","doi-asserted-by":"crossref","unstructured":"Sengupta N, Bagchi A, Ramanath M, Bedathur S. ARROW: approximating reachability using random walks over web-scale graphs. In: Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE). 2019, 470\u2013481","DOI":"10.1109\/ICDE.2019.00049"},{"key":"2368_CR36","doi-asserted-by":"crossref","unstructured":"Wadhwa S, Prasad A, Ranu S, Bagchi A, Bedathur S. Efficiently answering regular simple path queries on large labeled networks. In: Proceedings of 2019 International Conference on Management of Data. 2019, 1463\u20131480","DOI":"10.1145\/3299869.3319882"},{"issue":"7","key":"2368_CR37","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B H Bloom","year":"1970","unstructured":"Bloom B H. Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970, 13(7): 422\u2013426","journal-title":"Communications of the ACM"},{"issue":"2","key":"2368_CR38","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1109\/COMST.2018.2889329","volume":"21","author":"L Luo","year":"2019","unstructured":"Luo L, Guo D, Ma R T B, Rottenstreich O, Luo X. Optimizing bloom filter: challenges, solutions, and comparisons. IEEE Communications Surveys & Tutorials, 2019, 21(2): 1912\u20131949","journal-title":"IEEE Communications Surveys & Tutorials"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2368-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-022-2368-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2368-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T02:16:49Z","timestamp":1742696209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-022-2368-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,12]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["2368"],"URL":"https:\/\/doi.org\/10.1007\/s11704-022-2368-y","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"type":"print","value":"2095-2228"},{"type":"electronic","value":"2095-2236"}],"subject":[],"published":{"date-parts":[[2023,8,12]]},"assertion":[{"value":"19 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"181601"}}