{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:11:03Z","timestamp":1781107863022,"version":"3.54.1"},"reference-count":51,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10,1]]},"abstract":"<p>Keyword searches based on the keywords-to-SPARQL translation is attracting more attention because of a growing number of excellent SPARQL search engines. Current approaches for keyword search based on the keywords-to-SPARQL translation suffer from returning incomplete answers or wrong answers due to a lack of underlying schema information. To overcome these difficulties, in this article, we propose a new keyword search paradigm by translating keyword queries into SPARQL queries for exploring RDF data. An inter-entity relationship summary with complete schema information is distilled from the RDF data graph for composing SPARQL queries. To avoid potentially wasteful summary graph expansion, we develop a new search prioritization scheme by combining the degree of a vertex with the distance from the original keyword element. Starting from the ordered priority list that is built in advance, we apply the forward path index to faster find the top-k subgraphs, which are relevant to the conjunction of the entering keywords. The experimental results show that our approach is efficient and scalable.<\/p>","DOI":"10.4018\/jdm.2018100101","type":"journal-article","created":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T07:53:37Z","timestamp":1554882817000},"page":"1-27","source":"Crossref","is-referenced-by-count":6,"title":["RDF Keyword Search by Query Computation"],"prefix":"10.4018","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7780-6473","authenticated-orcid":true,"given":"Zongmin","family":"Ma","sequence":"first","affiliation":[{"name":"Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoqing","family":"Lin","sequence":"additional","affiliation":[{"name":"Eastern Liaoning University, Dandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Yan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhen","family":"Zhao","sequence":"additional","affiliation":[{"name":"Bohai University, Jinzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"JDM.2018100101-0","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994756"},{"key":"JDM.2018100101-1","first-page":"54","article-title":"Sesame: A generic architecture for storing and querying RDF and RDF schema.","author":"J.Broekstra","year":"2002","journal-title":"International Semantic Web Conference"},{"key":"JDM.2018100101-2","first-page":"9","article-title":"Qakis: An open domain qa system based on relational patterns.","author":"E.Cabrio","year":"2012","journal-title":"International Semantic Web Conference (Posters & Demos)"},{"key":"JDM.2018100101-3","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559966"},{"key":"JDM.2018100101-4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48740-3_14"},{"issue":"1","key":"JDM.2018100101-5","first-page":"16","article-title":"Searching RDF graphs with SPARQL and keywords.","volume":"33","author":"S.Elbassuoni","year":"2010","journal-title":"A Quarterly Bulletin of the Computer Society of the IEEE Technical Committee on Data Engineering"},{"key":"JDM.2018100101-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.11.003"},{"key":"JDM.2018100101-7","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963291"},{"key":"JDM.2018100101-8","first-page":"656","article-title":"Casanova: RDF Keyword-based Query Technology Meets a Real-World Dataset.","author":"G.Garc\u00eda","year":"2017","journal-title":"Proceedings of the 20th International Conference on Extending Database Technology"},{"issue":"2","key":"JDM.2018100101-9","first-page":"35","article-title":"Efficient RDF storage and retrieval in jena2.","volume":"51","author":"L.Garrison","year":"2004","journal-title":"Exploiting Hyperlinks"},{"key":"JDM.2018100101-10","doi-asserted-by":"publisher","DOI":"10.1145\/2810355.2810357"},{"key":"JDM.2018100101-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"JDM.2018100101-12","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132957"},{"key":"JDM.2018100101-13","doi-asserted-by":"publisher","DOI":"10.1109\/LAWEB.2005.25"},{"key":"JDM.2018100101-14","first-page":"305","article-title":"Blinks: ranked keyword searches on graphs.","author":"H.He","year":"2007","journal-title":"ACM SIGMOD International Conference on Management of Data"},{"key":"JDM.2018100101-15","first-page":"431","article-title":"Keyword searching and browsing in databases using banks.","author":"A.Hulgeri","year":"2002","journal-title":"IEEE International Conference on Data Engineering"},{"key":"JDM.2018100101-16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98812-2_22"},{"key":"JDM.2018100101-17","first-page":"505","article-title":"Bidirectional expansion for keyword search on graph databases.","author":"V.Kacholia","year":"2005","journal-title":"International Conference on Very Large Data Bases"},{"key":"JDM.2018100101-18","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021025"},{"key":"JDM.2018100101-19","first-page":"868","article-title":"Star: steiner-tree approximation in relationship graphs.","author":"G.Kasneci","year":"2009","journal-title":"IEEE International Conference on Data Engineering"},{"key":"JDM.2018100101-20","author":"G.Klyne","year":"2004","journal-title":"Resource description framework (RDF): Concepts and abstract syntax"},{"key":"JDM.2018100101-21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13489-0_20"},{"key":"JDM.2018100101-22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2302294"},{"key":"JDM.2018100101-23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.12.014"},{"key":"JDM.2018100101-24","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376706"},{"key":"JDM.2018100101-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2013.08.001"},{"issue":"2","key":"JDM.2018100101-26","first-page":"489","article-title":"RDF Keyword Search Using a Type-based Summary.","volume":"34","author":"X. Q.Lin","year":"2018","journal-title":"Journal of Information Science and Engineering"},{"key":"JDM.2018100101-27","first-page":"563","article-title":"Effective keyword search in relational databases.","author":"F.Liu","year":"2006","journal-title":"ACM SIGMOD International Conference"},{"key":"JDM.2018100101-28","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-151745"},{"key":"JDM.2018100101-29","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888916000217"},{"key":"JDM.2018100101-30","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453927"},{"key":"JDM.2018100101-31","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920877"},{"key":"JDM.2018100101-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.03.002"},{"key":"JDM.2018100101-33","unstructured":"Prud\u2019hommeaux, E., & Seaborne, A. (2013). SPARQL 1.1 query language. W3C."},{"key":"JDM.2018100101-34","doi-asserted-by":"publisher","DOI":"10.4018\/JDM.2015040104"},{"key":"JDM.2018100101-35","doi-asserted-by":"publisher","DOI":"10.1145\/3216122.3216167"},{"key":"JDM.2018100101-36","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242713"},{"key":"JDM.2018100101-37","doi-asserted-by":"publisher","DOI":"10.4018\/jdm.2009070102"},{"key":"JDM.2018100101-38","first-page":"405","article-title":"Top-k exploration of query candidates for efficient keyword search on graphshaped (RDF) data.","author":"T.Tran","year":"2009","journal-title":"IEEE International Conference on Data Engineering"},{"key":"JDM.2018100101-39","doi-asserted-by":"publisher","DOI":"10.4018\/JDM.2015070102"},{"key":"JDM.2018100101-40","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-642-25008-8_4","article-title":"Path-Oriented Keyword Search Query over RDF","author":"R. D.Virgilio","year":"2012","journal-title":"Semantic Search over the Web"},{"key":"JDM.2018100101-41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35527-1_53"},{"key":"JDM.2018100101-42","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2011.08.002"},{"key":"JDM.2018100101-43","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453965"},{"key":"JDM.2018100101-44","first-page":"802","article-title":"KAT: Keywords-to-SPARQL Translation Over RDF Graphs.","author":"Y. L.Wen","year":"2018","journal-title":"Proceedings of the 23rd International Conference on Database Systems for Advanced Applications"},{"key":"JDM.2018100101-45","doi-asserted-by":"crossref","unstructured":"Wylot, M., Hauswirth, M., Cudr\u00e9-Mauroux, P. & Sakr, S. (2018). RDF Data Storage and Query Processing Schemes: A Survey. ACM Computing Surveys, 51(4), 84:1-84:36.","DOI":"10.1145\/3177850"},{"key":"JDM.2018100101-46","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-017-0554-9"},{"key":"JDM.2018100101-47","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2009.07.005"},{"key":"JDM.2018100101-48","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747648"},{"key":"JDM.2018100101-49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76298-0_50"},{"key":"JDM.2018100101-50","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610525"}],"container-title":["Journal of Database Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=227035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T16:25:02Z","timestamp":1651854302000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/JDM.2018100101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2018,10,1]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jdm.2018100101","relation":{},"ISSN":["1063-8016","1533-8010"],"issn-type":[{"value":"1063-8016","type":"print"},{"value":"1533-8010","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,1]]}}}