{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:57:39Z","timestamp":1777705059111,"version":"3.51.4"},"reference-count":27,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,8,11]]},"abstract":"<jats:p>With the rapid development of Semantic Web, the retrieval of RDF data has become a research hotspot. As the main method of data retrieval, keyword search has attracted much attention because of its simple operation. The existing RDF keyword search methods mainly search directly on RDF graph, which is no longer applicable to RDF knowledge graph. Firstly, we propose to transform RDF knowledge graph data into type graph to prune the search space. Then based on type graph, we extract frequent search patterns and establish a list from frequent search patterns to pattern instances. Finally, we propose a method of the Bloom coding, which can be used to quickly judge whether the information our need is in frequent search patterns. The experiments show that our approach outperforms the state-of-the-art methods on both accuracy and response time.<\/jats:p>","DOI":"10.3233\/jifs-210950","type":"journal-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T12:54:19Z","timestamp":1626785659000},"page":"2239-2253","source":"Crossref","is-referenced-by-count":3,"title":["RDF knowledge graph keyword type search using frequent patterns"],"prefix":"10.1177","volume":"41","author":[{"given":"Wei","family":"Yan","sequence":"first","affiliation":[{"name":"School of Information, Liaoning University, Shenyang, China"},{"name":"School of Innovation and Entrepreneurship, Liaoning University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhan","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Information, Liaoning University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-210950_ref1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.is.2017.03.002","article-title":"Answering top-K query combined keywords and structural queries on RDF graphs","volume":"67","author":"Peng","year":"2017","journal-title":"Information Systems"},{"key":"10.3233\/JIFS-210950_ref2","unstructured":"Wu B. , Zhou Y. , Yuan P. , Liu L. and Jin H. , Scalable SPARQL querying using path partitioning, Proceedings of the 31st IEEE International Conference on Data Engineering, (2015), pp. 795\u2013806."},{"key":"10.3233\/JIFS-210950_ref3","unstructured":"Kasneci G. , Ramanath M. , Sozio M. , Suchanek F.M. and Weikum G. , STAR: steiner-tree approximation in relationship graphs, Proceedings of the 25th International Conference on Data Engineering, (2009), pp. 868\u2013879."},{"key":"10.3233\/JIFS-210950_ref4","unstructured":"Ding B. , Yu J.X. , Wang S. , Qin L. , Zhang X. and Lin X. , Finding top-k min-cost connected trees in databases, Proceedings of the 23rd International Conference on Data Engineering, (2007), pp. 836\u2013845."},{"key":"10.3233\/JIFS-210950_ref5","unstructured":"He H. , Wang H. , Yang J. and Yu P.S. , BLINKS: ranked keyword searches on graphs, Proceedings of the ACM SIGMOD International Conference on Management of Data, (2007), pp. 305\u2013316."},{"key":"10.3233\/JIFS-210950_ref6","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.websem.2013.08.001","article-title":"K-nearest keyword search in RDF graphs","volume":"22","author":"Lian","year":"2013","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/JIFS-210950_ref7","unstructured":"Gkirtzou K. , Papastefanatos G. and Dalamagas T. , RDF keyword search based on keywords-to-SPARQL translation, Proceedings of the First International Workshop on Novel Web Search Interfaces and Systems, (2015), pp. 3\u20135."},{"issue":"3","key":"10.3233\/JIFS-210950_ref8","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.websem.2009.07.005","article-title":"From keywords to semantic queries-incremental query construction on the semantic Web","volume":"7","author":"Zenz","year":"2009","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/JIFS-210950_ref11","doi-asserted-by":"crossref","unstructured":"Ladwig G. and Tran T. , Combining query translation with query answering for efficient keyword search, Proceedings of the Semantic Web: Research and Applications, 7th Extended Semantic Web Conference, 2010, pp. 288\u2013303.","DOI":"10.1007\/978-3-642-13489-0_20"},{"issue":"11","key":"10.3233\/JIFS-210950_ref12","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1109\/TKDE.2014.2302294","article-title":"Scalable keyword search on large RDF data","volume":"26","author":"Le","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/JIFS-210950_ref13","unstructured":"Bhalotia G. , Hulgeri A. , Nakhe C. , Chakrabarti S. and Sudarshan S. , Keyword searching and browsing in databases using BANKS, Proceedings of the 18th International Conference on Data Engineering, 2002, pp. 431\u2013440."},{"key":"10.3233\/JIFS-210950_ref14","unstructured":"Tran T. , Wang H. , Rudolph S. and Cimiano P. , Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data, Proceedings of the 25th International Conference on Data Engineering, (2009), pp. 405\u2013416."},{"issue":"4","key":"10.3233\/JIFS-210950_ref15","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1109\/TKDE.2018.2841389","article-title":"Adaptive distributed RDF graph fragmentation and allocation based on query workload","volume":"31","author":"Peng","year":"2019","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"10.3233\/JIFS-210950_ref16","doi-asserted-by":"crossref","first-page":"10:1","DOI":"10.1145\/3372750","article-title":"Content-based union and complement metrics for dataset search over RDF knowledge graphs","volume":"12","author":"Mountantonakis","year":"2020","journal-title":"Journal of Data and Information Quality"},{"key":"10.3233\/JIFS-210950_ref17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.datak.2017.02.001","article-title":"Constructing target-aware results for keyword search on knowledge graphs","volume":"110","author":"Shan","year":"2017","journal-title":"Data and Knowledge Engineering"},{"key":"10.3233\/JIFS-210950_ref18","unstructured":"Virgilio R.D. , Efficient and effective ranking in Top-k exploration for keyword search on RDF, Proceedings of the IEEE International Conference on Information Reuse and Integration, (2011), pp. 66\u201370."},{"issue":"2","key":"10.3233\/JIFS-210950_ref19","first-page":"489","article-title":"RDF keyword search using a type-based summary","volume":"34","author":"Lin","year":"2018","journal-title":"Journal of Information Science and Engineering"},{"issue":"2","key":"10.3233\/JIFS-210950_ref21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/SW-140134","article-title":"DBpedia - A large-scale, multilingual knowledge base extracted from Wikipedia","volume":"6","author":"Lehmann","year":"2015","journal-title":"Semantic Web"},{"issue":"3","key":"10.3233\/JIFS-210950_ref22","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1007\/s11280-019-00739-0","article-title":"Distributedpregel-based provenance-aware regular path query processing onRDF knowledge graphs","volume":"23","author":"Wang","year":"2020","journal-title":"World Wide Web:Internet and Web Information Systems"},{"issue":"11","key":"10.3233\/JIFS-210950_ref23","doi-asserted-by":"crossref","first-page":"840","DOI":"10.14778\/2983200.2983201","article-title":"Semantic SPARQL similarity search over RDF knowledge graphs","volume":"9","author":"Zheng","year":"2016","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"5","key":"10.3233\/JIFS-210950_ref24","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1007\/s00778-020-00610-z","article-title":"Diversified spatial keyword search on RDF data","volume":"29","author":"Cai","year":"2020","journal-title":"The VLDB Journal"},{"key":"10.3233\/JIFS-210950_ref25","unstructured":"Wang Q. , Peng P. , Tong T. , Tian Z. and Qin Z. , Keyword search over federated RDF systems, Proceedings of the Database Systems for Advanced Applications - 25th International Conference, (2020), pp. 613\u2013622."},{"key":"10.3233\/JIFS-210950_ref26","unstructured":"Kadilierakis G. , Fafalios P. , Papadakos P. and Tzitzikas Y. , Keyword search over RDF using document-centric information retrieval systems, Proceedings of the Semantic Web- 17th International Conference, (2020), pp. 121\u2013137."},{"key":"10.3233\/JIFS-210950_ref27","unstructured":"Menendez E.S. , Casanova M.A. , Leme L.A. and Boughanem M. , Novel node importance measures to improve keyword search over RDF graphs, Proceedings of the Database and Expert Systems Applications - 30th International Conferenc, (2019), pp. 143\u2013158."},{"key":"10.3233\/JIFS-210950_ref28","unstructured":"Dosso D. and Silvello G. , A scalable virtual document-based keyword search system for RDF datasets, Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, (2019), pp. 965\u2013968."},{"issue":"2-3","key":"10.3233\/JIFS-210950_ref29","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","article-title":"LUBM: A benchmark for OWL knowledge base systems","volume":"3","author":"Guo","year":"2005","journal-title":"Journal of Web Semantics"},{"issue":"1","key":"10.3233\/JIFS-210950_ref30","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/TKDE.2012.228","article-title":"An empirical performance evaluation of relational keyword search techniques","volume":"26","author":"Coffman","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:47Z","timestamp":1777455767000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":27,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210950","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,11]]}}}