{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:11:56Z","timestamp":1757617916375,"version":"3.44.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:00:00Z","timestamp":1747872000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:00:00Z","timestamp":1747872000000},"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":["62276057"],"award-info":[{"award-number":["62276057"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Earth Sci Inform"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s12145-025-01909-7","type":"journal-article","created":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:18:40Z","timestamp":1747887520000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RDF-G*: An efficient RDF query answer engine based on graph model and star index"],"prefix":"10.1007","volume":"18","author":[{"given":"Shikang","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"1909_CR1","doi-asserted-by":"crossref","unstructured":"Ali W, Saleem M, Yao B (2022) A survey of RDF stores & SPARQL engines for querying knowledge graphs. The VLDB Journal. 31(3):1\u201326.","DOI":"10.1007\/s00778-021-00711-3"},{"key":"1909_CR2","doi-asserted-by":"crossref","unstructured":"Alu\u00e7 G, Hartig O, \u00d6zsu M T, et al (2014) Diversified stress testing of RDF data management systems. Proceedings of the 13th International Semantic Web Conference (ISWC). 197\u2013212.","DOI":"10.1007\/978-3-319-11964-9_13"},{"key":"1909_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H P, Schneider R, et al (1990) The R*-tree: an efficient and robust access method for points and rectangles. Proceedings of the 1990 ACM SIGMOD international conference on management of data (SIGMOD). 322\u2013331.","DOI":"10.1145\/93597.98741"},{"issue":"9","key":"1909_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"key":"1909_CR5","doi-asserted-by":"crossref","unstructured":"Carroll JJ, Dickinson I, Dollin C, et al (2004) Jena: implementing the semantic web recommendations. Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters (WWW). 74\u201383.","DOI":"10.1145\/1010432.1010446"},{"issue":"9","key":"1909_CR6","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1109\/TKDE.2006.146","volume":"18","author":"Y Chen","year":"2006","unstructured":"Chen Y, Chen Y (2006) On the signature tree construction and analysis. IEEE Transact Knowl Data Eng 18(9):1207\u20131224","journal-title":"IEEE Transact Knowl Data Eng"},{"key":"1909_CR7","doi-asserted-by":"crossref","unstructured":"Deppisch U (1986) S-tree: A dynamic balanced signature index for office retrieval. Proceedings of the 9th annual international ACM SIGIR conference on research and development in information retrieval (SIGIR). 77\u201387.","DOI":"10.1145\/253168.253189"},{"issue":"1","key":"1909_CR8","first-page":"3","volume":"35","author":"O Erling","year":"2012","unstructured":"Erling O (2012) Virtuoso, a hybrid RDBMS\/graph column store. IEEE Data Eng Bull 35(1):3\u20138","journal-title":"IEEE Data Eng Bull"},{"issue":"2\u20133","key":"1909_CR9","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 (2005) LUBM: a benchmark for OWL knowledge base systems. J Web Seman 3(2\u20133):158\u2013182","journal-title":"J Web Seman"},{"key":"1909_CR10","doi-asserted-by":"crossref","unstructured":"Han W S, Lee J, Lee J H (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD). 337\u2013348.","DOI":"10.1145\/2463676.2465300"},{"key":"1909_CR11","doi-asserted-by":"crossref","unstructured":"Han M, Kim H, Gu G, et al (2019) Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together. Proceedings of the 2019 International Conference on Management of Data (SIGMOD). 1429\u20131446.","DOI":"10.1145\/3299869.3319880"},{"issue":"13","key":"1909_CR12","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.3390\/rs13132511","volume":"13","author":"X Hao","year":"2021","unstructured":"Hao X, Ji Z, Li X et al (2021) Construction and application of a knowledge graph. Remote Sensing 13(13):2511","journal-title":"Remote Sensing"},{"key":"1909_CR13","unstructured":"Hasemann H, Kr\u00f6ller A, Pagel M (2014)\u00a0The wiselib tuplestore: a modular RDF database for the internet of things. arXiv preprint arXiv:1402.7228"},{"key":"1909_CR14","doi-asserted-by":"crossref","unstructured":"He H, Singh A K (2008) Graphs-at-a-time: query language and access methods for graph databases. Proceedings of the 2008 ACM SIGMOD international conference on management of data (SIGMOD). 405\u2013418.","DOI":"10.1145\/1376616.1376660"},{"key":"1909_CR15","doi-asserted-by":"crossref","unstructured":"Hoang-Vu T A, Vo H T, Freire J (2016) A unified index for spatio-temporal keyword queries. Proceedings of the 25th ACM International on Conference on Information and Knowledge Management (CIKM). 135\u2013144.","DOI":"10.1145\/2983323.2983751"},{"key":"1909_CR16","first-page":"321","volume":"4","author":"C Hoare","year":"1961","unstructured":"Hoare C (1961) FIND (Algorithm 65). Commun ACM 4:321\u2013322","journal-title":"Commun ACM"},{"issue":"4","key":"1909_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BF01952830","volume":"3","author":"P Houthuys","year":"1987","unstructured":"Houthuys P (1987) Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching. Vis Comput 3(4):236\u2013249","journal-title":"Vis Comput"},{"key":"1909_CR18","unstructured":"Ingalalli V, Ienco D, Poncelet P, et al (2016)\u00a0Querying RDF data using a multigraph-based approach. Proceedings of the 19th International Conference on Extending Database Technology (EDBT). 245\u2013256."},{"issue":"24","key":"1909_CR19","doi-asserted-by":"publisher","first-page":"e6441","DOI":"10.1002\/cpe.6441","volume":"33","author":"M Jia","year":"2021","unstructured":"Jia M, Zhang Y, Li D (2021) QRDF: an efficient RDF graph processing system for fast query. Concurr Comput Pract Exp 33(24):e6441","journal-title":"Concurr Comput Pract Exp"},{"key":"1909_CR20","doi-asserted-by":"crossref","unstructured":"Kim J, Shin H, Han WS (2015) Taming subgraph isomorphism for RDF query processing. arXiv preprint arXiv:1506.01973. Accessed\u00a0\u00a02024-5-15","DOI":"10.14778\/2809974.2809985"},{"key":"1909_CR21","first-page":"295","volume":"2012","author":"K Kyzirakos","year":"2012","unstructured":"Kyzirakos K, Karpathiotakis M, Koubarakis M (2012) Strabon: a semantic geospatial DBMS. ISWC 2012:295\u2013311","journal-title":"ISWC"},{"issue":"12","key":"1909_CR22","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.14778\/2732977.2733000","volume":"7","author":"J Liagouris","year":"2014","unstructured":"Liagouris J, Mamoulis N, Bouros P et al (2014) An effective encoding scheme for spatial RDF data. Proc VLDB Endow 7(12):1271\u20131282","journal-title":"Proc VLDB Endow"},{"key":"1909_CR23","doi-asserted-by":"crossref","unstructured":"Lyu X, Wang X, Li Y F, et al (2015) GraSS: an efficient method for RDF subgraph matching. 16th International Conference on Web Information Systems Engineering (WISE). 108\u2013122","DOI":"10.1007\/978-3-319-26190-4_8"},{"key":"1909_CR24","doi-asserted-by":"crossref","unstructured":"Neumann T, Moerkotte G (2011) Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. 2011 IEEE 27th International Conference on Data Engineering (ICDE). IEEE, 984\u2013994","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"1909_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T Neumann","year":"2010","unstructured":"Neumann T, Weikum G (2010) The RDF-3X engine for scalable management of RDF data. VLDB J 19:91\u2013113","journal-title":"VLDB J"},{"issue":"9","key":"1909_CR26","doi-asserted-by":"publisher","first-page":"3187","DOI":"10.1109\/TKDE.2020.2966609","volume":"33","author":"R Perego","year":"2020","unstructured":"Perego R, Pibiri GE, Venturini R (2020) Compressed indexes for fast search of semantic data. IEEE Transact Knowl Data Eng 33(9):3187\u20133198","journal-title":"IEEE Transact Knowl Data Eng"},{"key":"1909_CR27","doi-asserted-by":"crossref","unstructured":"Suchanek F M, Kasneci G, Weikum G (2007) YAGO: a core of semantic knowledge. Proceedings of the 16th international conference on World Wide Web (WWW). 697\u2013706","DOI":"10.1145\/1242572.1242667"},{"key":"1909_CR28","doi-asserted-by":"crossref","unstructured":"Sun S, Luo Q (2020) In-memory subgraph matching: an in-depth study. Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data (SIGMOD). 1083\u20131098","DOI":"10.1145\/3318464.3380581"},{"key":"1909_CR29","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10707-019-00361-2","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun Y, Sarwat M (2019) A spatially-pruned vertex expansion operator in the Neo4j graph database system. GeoInformatica 23:397\u2013423","journal-title":"GeoInformatica"},{"key":"1909_CR30","unstructured":"W3C Recommendation. SPARQL 1.1 Overview, [Online]. Available: https:\/\/www.w3.org\/TR\/sparql11-overview\/. Accessed\u00a02024-3-2"},{"key":"1909_CR31","unstructured":"W3C Working Group. RDF 1.1 Primer, [Online]. Available:http:\/\/www.w3.org\/TR\/2014\/NOTE-rdf11-primer-20140225\/. Accessed\u00a02024-2-26"},{"issue":"2","key":"1909_CR32","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1515\/dim-2017-0008","volume":"1","author":"D Wang","year":"2017","unstructured":"Wang D, Zou L, Zhao D (2017) g-store: querying large spatiotemporal RDF graphs. Data Inform Manag 1(2):84\u2013103","journal-title":"Data Inform Manag"},{"key":"1909_CR33","doi-asserted-by":"crossref","unstructured":"Yin P, Duan N, Kao B, et al (2015)\u00a0Answering questions with complex semantic constraints on open knowledge bases. Proceedings of the 24th ACM international on conference on information and knowledge management (CIKM). 1301\u20131310.","DOI":"10.1145\/2806416.2806542"},{"key":"1909_CR34","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s11704-018-7212-z","volume":"12","author":"L Zeng","year":"2018","unstructured":"Zeng L, Zou L (2018) Redesign of the gStore system. Front Comp Sci 12:623\u2013641","journal-title":"Front Comp Sci"},{"key":"1909_CR35","doi-asserted-by":"crossref","unstructured":"Zheng G, Ren T, Yang L, et al (2023) mStore: Schema Mining based-RDF Data Storage\/\/Companion Proceedings of the ACM Web Conference (WWW). 168\u2013171.","DOI":"10.1145\/3543873.3587339"},{"key":"1909_CR36","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s41019-016-0029-6","volume":"2","author":"L Zou","year":"2017","unstructured":"Zou L, \u00d6zsu MT (2017) Graph-based RDF data management. Data Sci Eng 2:56\u201370","journal-title":"Data Sci Eng"},{"issue":"8","key":"1909_CR37","doi-asserted-by":"publisher","first-page":"482","DOI":"10.14778\/2002974.2002976","volume":"4","author":"L Zou","year":"2011","unstructured":"Zou L, Mo J, Chen L et al (2011) gStore: answering SPARQL queries via subgraph matching. Proceedings of the VLDB Endowment 4(8):482\u2013493","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1909_CR38","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00778-013-0337-7","volume":"23","author":"L Zou","year":"2014","unstructured":"Zou L, \u00d6zsu MT, Chen L et al (2014) gStore: a graph-based SPARQL query engine. VLDB J 23:565\u2013590","journal-title":"VLDB J"}],"container-title":["Earth Science Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12145-025-01909-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12145-025-01909-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12145-025-01909-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T15:16:40Z","timestamp":1757171800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12145-025-01909-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,22]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1909"],"URL":"https:\/\/doi.org\/10.1007\/s12145-025-01909-7","relation":{},"ISSN":["1865-0473","1865-0481"],"issn-type":[{"type":"print","value":"1865-0473"},{"type":"electronic","value":"1865-0481"}],"subject":[],"published":{"date-parts":[[2025,5,22]]},"assertion":[{"value":"12 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2025","order":3,"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":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"412"}}