{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T19:14:44Z","timestamp":1758309284834,"version":"3.44.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T00:00:00Z","timestamp":1752710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T00:00:00Z","timestamp":1752710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472311","62472311","62472311","62472311","62472311"],"award-info":[{"award-number":["62472311","62472311","62472311","62472311","62472311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11280-025-01365-9","type":"journal-article","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T04:19:01Z","timestamp":1752725941000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LD-RPQB: a benchmark for regular path queries based on length distribution"],"prefix":"10.1007","volume":"28","author":[{"given":"Menglu","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiheng","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiake","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,17]]},"reference":[{"issue":"9","key":"1365_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3434642","volume":"64","author":"S Sakr","year":"2021","unstructured":"Sakr, S., Bonifati, A., Voigt, H., Iosup, A., Ammar, K., Angles, R., Aref, W., Arenas, M., Besta, M., Boncz, P.A., et al.: The future is big graphs: a community view on graph processing systems. Commun. ACM 64(9), 62\u201371 (2021)","journal-title":"Commun. ACM"},{"issue":"5","key":"1365_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3104031","volume":"50","author":"R Angles","year":"2017","unstructured":"Angles, R., Arenas, M., Barcel\u00f3, P., Hogan, A., Reutter, J., Vrgo\u010d, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. (CSUR) 50(5), 1\u201340 (2017)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"4","key":"1365_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2389241.2389250","volume":"37","author":"P Barcel\u00f3","year":"2012","unstructured":"Barcel\u00f3, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. (TODS) 37(4), 1\u201346 (2012)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"1","key":"1365_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2559905","volume":"61","author":"P Barcel\u00f3","year":"2014","unstructured":"Barcel\u00f3, P., Libkin, L., Reutter, J.L.: Querying regular graph patterns. J. ACM (JACM) 61(1), 1\u201354 (2014)","journal-title":"J. ACM (JACM)"},{"key":"1365_CR5","doi-asserted-by":"crossref","unstructured":"Bagan, G., Bonifati, A., Groz, B.: A trichotomy for regular simple path queries on graphs. In: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 261\u2013272 (2013)","DOI":"10.1145\/2463664.2467795"},{"key":"1365_CR6","doi-asserted-by":"crossref","unstructured":"Bienvenu, M., Thomazo, M.: On the complexity of evaluating regular path queries over linear existential rules. In: International Conference on Web Reasoning and Rule Systems, pp. 1\u201317. Springer (2016)","DOI":"10.1007\/978-3-319-45276-0_1"},{"key":"1365_CR7","doi-asserted-by":"crossref","unstructured":"Casel, K., Schmid, M.L.: Fine-grained complexity of regular path queries. Log. Methods Comput. Sci. 19 (2023)","DOI":"10.46298\/lmcs-19(4:15)2023"},{"key":"1365_CR8","doi-asserted-by":"crossref","unstructured":"Wang, H., Wang, X., Ma, M., You, Y.: Rpqbench: A benchmark for regular path queries on graph data. In: International Conference on Web Information Systems Engineering, pp. 351\u2013367. Springer (2025)","DOI":"10.1007\/978-981-96-0567-5_25"},{"key":"1365_CR9","doi-asserted-by":"crossref","unstructured":"Schmidt, M., Hornung, T., Lausen, G., Pinkel, C.: Sp$$^{\\wedge }$$ 2bench: a sparql performance benchmark. In: 2009 IEEE 25th International Conference on Data Engineering, pp. 222\u2013233. IEEE (2009)","DOI":"10.1109\/ICDE.2009.28"},{"key":"1365_CR10","doi-asserted-by":"crossref","unstructured":"Demartini, G., Enchev, I., Wylot, M., Gapany, J., Cudr\u00e9-Mauroux, P.: Bowlognabench\u2014benchmarking rdf analytics. In: International Symposium on Data-Driven Process Discovery and Analysis, pp. 82\u2013102. Springer (2011)","DOI":"10.1007\/978-3-642-34044-4_5"},{"key":"1365_CR11","doi-asserted-by":"crossref","unstructured":"Alu\u00e7, G., Hartig, O., \u00d6zsu, M.T., Daudjee, K.: Diversified stress testing of rdf data management systems. In: The Semantic Web\u2013ISWC 2014: 13th International Semantic Web Conference, Riva del Garda, Italy, October 19-23, 2014. Proceedings, Part I 13, pp. 197\u2013212. Springer (2014)","DOI":"10.1007\/978-3-319-11964-9_13"},{"issue":"2","key":"1365_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer, C., Schultz, A.: The berlin sparql benchmark. Int. J. Semantic Web Inf. Syst. (IJSWIS) 5(2), 1\u201324 (2009)","journal-title":"Int. J. Semantic Web Inf. Syst. (IJSWIS)"},{"key":"1365_CR13","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s10270-016-0571-8","volume":"17","author":"G Sz\u00e1rnyas","year":"2018","unstructured":"Sz\u00e1rnyas, G., Izs\u00f3, B., R\u00e1th, I., Varr\u00f3, D.: The train benchmark: cross-technology performance evaluation of continuous model queries. Softw. Syst. Model. 17, 1365\u20131393 (2018)","journal-title":"Softw. Syst. Model."},{"issue":"4","key":"1365_CR14","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/TKDE.2016.2633993","volume":"29","author":"G Bagan","year":"2016","unstructured":"Bagan, G., Bonifati, A., Ciucanu, R., Fletcher, G.H., Lemay, A., Advokaat, N.: gmark: Schema-driven generation of graphs and queries. IEEE Trans. Knowl. Data Eng. 29(4), 856\u2013869 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1365_CR15","doi-asserted-by":"crossref","unstructured":"Erling, O., Averbuch, A., Larriba-Pey, J., Chafi, H., Gubichev, A., Prat, A., Pham, M.-D., Boncz, P.: The ldbc social network benchmark: Interactive workload. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 619\u2013630 (2015)","DOI":"10.1145\/2723372.2742786"},{"issue":"4","key":"1365_CR16","doi-asserted-by":"publisher","first-page":"877","DOI":"10.14778\/3574245.3574270","volume":"16","author":"G Sz\u00e1rnyas","year":"2022","unstructured":"Sz\u00e1rnyas, G., Waudby, J., Steer, B.A., Szak\u00e1llas, D., Birler, A., Wu, M., Zhang, Y., Boncz, P.: The ldbc social network benchmark: Business intelligence workload. Proc. VLDB Endow. 16(4), 877\u2013890 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"1365_CR17","doi-asserted-by":"crossref","unstructured":"Morsey, M., Lehmann, J., Auer, S., Ngonga\u00a0Ngomo, A.-C.: Dbpedia sparql benchmark\u2013performance assessment with real queries on real data. In: International Semantic Web Conference, pp. 454\u2013469. Springer (2011)","DOI":"10.1007\/978-3-642-25073-6_29"},{"key":"1365_CR18","unstructured":"Bail, S., Alkiviadous, S., Parsia, B., Workman, D., Van\u00a0Harmelen, M., Concalves, R., Garilao, C.: Fishmark: A linked data application benchmark. CEUR (2012)"},{"key":"1365_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/2041-1480-5-32","volume":"5","author":"H Wu","year":"2014","unstructured":"Wu, H., Fujiwara, T., Yamamoto, Y., Bolleman, J., Yamaguchi, A.: Biobenchmark toyama 2012: an evaluation of the performance of triple stores on biological data. J. Biomed. Semant. 5, 1\u201311 (2014)","journal-title":"J. Biomed. Semant."},{"key":"1365_CR20","doi-asserted-by":"crossref","unstructured":"Saleem, M., Mehmood, Q., Ngonga\u00a0Ngomo, A.-C.: Feasible: A feature-based sparql benchmark generation framework. In: The Semantic Web-ISWC 2015: 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part I 14, pp. 52\u201369. Springer (2015)","DOI":"10.1007\/978-3-319-25007-6_4"},{"key":"1365_CR21","doi-asserted-by":"crossref","unstructured":"Saleem, M., Akhter, A., Vahdati, S., Ngonga\u00a0Ngomo, A.-C.: $$\\mu $$-bench: Real-world micro benchmarking for sparql query processing over knowledge graphs. In: Proceedings of the 11th International Joint Conference on Knowledge Graphs, pp. 39\u201347 (2022)","DOI":"10.1145\/3579051.3579054"},{"issue":"2\u20133","key":"1365_CR22","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: Lubm: A benchmark for owl knowledge base systems. J. Web Semant. 3(2\u20133), 158\u2013182 (2005)","journal-title":"J. Web Semant."},{"key":"1365_CR23","doi-asserted-by":"publisher","first-page":"100614","DOI":"10.1016\/j.websem.2020.100614","volume":"65","author":"C Stadler","year":"2020","unstructured":"Stadler, C., Bin, S., Wenige, L., B\u00fchmann, L., Lehmann, J.: Schema-agnostic sparql-driven faceted search benchmark generation. J. Web Semant. 65, 100614 (2020)","journal-title":"J. Web Semant."},{"key":"1365_CR24","doi-asserted-by":"crossref","unstructured":"Warnke, B., Mantler, J., Groppe, S., Sehgelmeble, Y.C., Fischer, S.: A sparql benchmark for distributed databases in iot environments. In: Proceedings of the International Workshop on Big Data in Emergent Distributed Environments, pp. 1\u20136 (2022)","DOI":"10.1145\/3530050.3532929"},{"key":"1365_CR25","doi-asserted-by":"crossref","unstructured":"Dang, M.-H., Aimonier-Davat, J., Molli, P., Hartig, O., Skaf-Molli, H., Le\u00a0Crom, Y.: Fedshop: A benchmark for testing the scalability of sparql federation engines. In: International Semantic Web Conference, pp. 285\u2013301. Springer (2023)","DOI":"10.1007\/978-3-031-47243-5_16"},{"key":"1365_CR26","doi-asserted-by":"crossref","unstructured":"Mhedhbi, A., Lissandrini, M., Kuiper, L., Waudby, J., Sz\u00e1rnyas, G.: Lsqb: a large-scale subgraph query benchmark. In: Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), pp. 1\u201311 (2021)","DOI":"10.1145\/3461837.3464516"},{"key":"1365_CR27","unstructured":"World Wide Web Consortium (W3C): Resource Description Framework (RDF): Concepts and Abstract Syntax. http:\/\/www.w3.org\/TR\/rdf-concepts\/. W3C Recommendation (2004)"},{"key":"1365_CR28","unstructured":"World Wide Web Consortium (W3C): RDF Vocabulary Description Language 1.0: RDF Schema. W3C Recommendation, February 2004 (2004). http:\/\/www.w3.org\/TR\/rdf-schema\/"},{"key":"1365_CR29","unstructured":"Bizer, C., Cyganiak, R.: D2R Server Publishing the DBLP Bibliography Database (2007). http:\/\/www4.wiwiss.fu-berlin.de\/dblp\/. Accessed 04 Mar 2025"},{"issue":"21","key":"1365_CR30","doi-asserted-by":"publisher","first-page":"11149","DOI":"10.1073\/pnas.200327197","volume":"97","author":"LAN Amaral","year":"2000","unstructured":"Amaral, L.A.N., Scala, A., Barthelemy, M., Stanley, H.E.: Classes of small-world networks. Proc. Natl. Acad. Sci. 97(21), 11149\u201311152 (2000)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"1365_CR31","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s00778-019-00558-9","volume":"29","author":"A Bonifati","year":"2020","unstructured":"Bonifati, A., Martens, W., Timm, T.: An analytical study of large sparql query logs. VLDB J. 29(2), 655\u2013679 (2020)","journal-title":"VLDB J."},{"key":"1365_CR32","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., Hogan, A., Navarro, G., Rojas-Ledesma, J.: Time-and space-efficient regular path queries. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 3091\u20133105. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00277"},{"key":"1365_CR33","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez-Basulto, V., Ib\u00e1\u00f1ez-Garc\u00eda, Y., Jung, J.C.: Answering regular path queries over sq ontologies. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11539"},{"key":"1365_CR34","doi-asserted-by":"crossref","unstructured":"Nguyen, V.-Q., Nguyen, V.-H., Vu, H.-T., Nguyen, M.-Q., Huynh, Q.-T., Kim, K.: Accelerating parallel evaluation of regular path queries on large graphs by estimating joining cost of subqueries. In: The 9th International Conference on Smart Media and Applications, pp. 464\u2013469 (2020)","DOI":"10.1145\/3426020.3426169"},{"issue":"2","key":"1365_CR35","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s11280-022-01103-5","volume":"26","author":"X Wang","year":"2023","unstructured":"Wang, X., Hao, W., Qin, Y., Liu, B., Liu, P., Song, Y., Zhang, Q., Wang, X.: Fpirpq: Accelerating regular path queries on knowledge graphs. World Wide Web 26(2), 661\u2013681 (2023)","journal-title":"World Wide Web"},{"key":"1365_CR36","unstructured":"Apache Jena: The Apache Software Foundation: Jena \u2013 A Semantic Web Framework for Java. http:\/\/jena.sourceforge.net\/. Accessed 12 Mar 2025 (n.d.)"},{"key":"1365_CR37","doi-asserted-by":"crossref","unstructured":"Erling, O., Mikhailov, I.: Rdf support in the virtuoso dbms. In: Networked Knowledge-Networked Media: Integrating Knowledge Management, New Media Technologies and Semantic Systems, pp. 7\u201324. Springer, Berlin, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02184-8_2"},{"key":"1365_CR38","doi-asserted-by":"crossref","unstructured":"Thompson, B., Personick, M., Cutcher, M.: The bigdata\u00ae rdf graph database. In: Linked Data Management, pp. 221\u2013266. Chapman and Hall\/CRC, Boca Raton, Florida (2016)","DOI":"10.1201\/b16859-17"},{"key":"1365_CR39","doi-asserted-by":"crossref","unstructured":"Na, I., Moon, Y.-S., Yi, I., Whang, K.-Y., Hyun, S.J.: Regular path query evaluation sharing a reduced transitive closure based on graph reduction. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 1675\u20131686. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00171"},{"issue":"1","key":"1365_CR40","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00778-024-00885-6","volume":"34","author":"D Arroyuelo","year":"2025","unstructured":"Arroyuelo, D., G\u00f3mez-Brand\u00f3n, A., Navarro, G.: Evaluating regular path queries on compressed adjacency matrices. VLDB J. 34(1), 2 (2025)","journal-title":"VLDB J."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01365-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-025-01365-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01365-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T15:15:10Z","timestamp":1758294910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-025-01365-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,17]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1365"],"URL":"https:\/\/doi.org\/10.1007\/s11280-025-01365-9","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2025,7,17]]},"assertion":[{"value":"25 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"52"}}