{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:35:54Z","timestamp":1754156154257,"version":"3.41.2"},"reference-count":28,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJWIS"],"published-print":{"date-parts":[[2023,7,12]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>This paper studies a keyword search over graph-structured data used in various fields such as semantic web, linked open data and social networks. This study aims to propose an efficient keyword search algorithm on graph data to find top-k answers that are most relevant to the query and have diverse content nodes for the input keywords.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>Based on an aggregative measure of diversity of an answer set, this study proposes an approach to searching the top-k diverse answers to a query on graph data, which finds a set of most relevant answer trees whose average dissimilarity should be no lower than a given threshold. This study defines a diversity constraint that must be satisfied for a subset of answer trees to be included in the solution. Then, an enumeration algorithm and a heuristic search algorithm are proposed to find an optimal solution efficiently based on the diversity constraint and an A* heuristic. This study also provides strategies for improving the performance of the heuristic search method.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The results of experiments using a real data set demonstrate that the proposed search algorithm can find top-k diverse and relevant answers to a query on large-scale graph data efficiently and outperforms the previous methods.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>This study proposes a new keyword search method for graph data that finds an optimal solution with diverse and relevant answers to the query. It can provide users with query results that satisfy their various information needs on large graph data.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ijwis-09-2022-0157","type":"journal-article","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T00:53:26Z","timestamp":1683766406000},"page":"19-41","source":"Crossref","is-referenced-by-count":2,"title":["Efficient keyword search on graph data for finding diverse and relevant answers"],"prefix":"10.1108","volume":"19","author":[{"given":"Chang-Sup","family":"Park","sequence":"first","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"key2023071009243454700_ref001","first-page":"431","article-title":"Keyword searching and browsing in databases using BANKS","volume-title":"Proceedings of IEEE International Conference on Data Engineering","year":"2002"},{"issue":"5","key":"key2023071009243454700_ref002","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/s10791-020-09379-9","article-title":"Robust keyword search in large attributed graphs","volume":"23","year":"2020","journal-title":"Information Retrieval Journal"},{"issue":"1","key":"key2023071009243454700_ref003","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10707-019-00373-y","article-title":"Spatial keyword search: a survey","volume":"24","year":"2020","journal-title":"GeoInformatica"},{"issue":"1","key":"key2023071009243454700_ref004","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.14778\/1453856.1453982","article-title":"Keyword search on external memory data graphs","volume":"1","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"key":"key2023071009243454700_ref005","first-page":"836","article-title":"Finding top-k min-cost connected trees in databases","volume-title":"Proceedings of the IEEE International Conference on Data Engineering","year":"2007"},{"key":"key2023071009243454700_ref006","first-page":"927","article-title":"Keyword proximity search in complex data graphs","volume-title":"Proceedings of ACM SIGMOD Conference on Management of Data","year":"2008"},{"key":"key2023071009243454700_ref007","first-page":"305","article-title":"BLINKS: ranked keyword searches on graphs","volume-title":"Proceedings of ACM SIGMOD Conference on Management of Data","year":"2007"},{"key":"key2023071009243454700_ref008","first-page":"505","article-title":"Bidirectional expansion for keyword search on graph databases","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases","year":"2005"},{"issue":"10","key":"key2023071009243454700_ref009","doi-asserted-by":"crossref","first-page":"681","DOI":"10.14778\/2021017.2021025","article-title":"Keyword search in graphs: finding r-cliques","volume":"4","year":"2011","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"7","key":"key2023071009243454700_ref010","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1109\/TKDE.2013.85","article-title":"Efficient duplication free and minimal keyword search in graphs","volume":"26","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2023071009243454700_ref011","first-page":"173","article-title":"Finding and approximating top-k answers in keyword proximity search","volume-title":"Proceedings of the 25th ACM symposium on Principles of database systems","year":"2006"},{"issue":"11","key":"key2023071009243454700_ref029","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1109\/TKDE.2014.2302294","article-title":"Scalable keyword search on large RDF data","volume":"26","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2023071009243454700_ref012","first-page":"903","article-title":"EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data","volume-title":"Proceedings of ACM SIGMOD Conference on Management of Data","year":"2008"},{"issue":"3","key":"key2023071009243454700_ref013","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s11280-015-0337-1","article-title":"Finding smallest k-compact tree set for keyword queries on graphs using map reduce","volume":"19","year":"2016","journal-title":"World Wide Web"},{"key":"key2023071009243454700_ref014","first-page":"1","article-title":"Coverage and diversity aware top-k query for spatio-temporal posts","volume-title":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","year":"2016"},{"issue":"2","key":"key2023071009243454700_ref015","first-page":"551","article-title":"Reducing redundancy in keyword query processing on graph databases","volume":"34","year":"2018","journal-title":"Journal of Information Science and Engineering"},{"issue":"3","key":"key2023071009243454700_ref016","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1108\/IJWIS-10-2017-0070","article-title":"Effective keyword search on graph data using limited root redundancy of answer trees","volume":"14","year":"2018","journal-title":"International Journal of Web Information Systems"},{"issue":"1","key":"key2023071009243454700_ref017","first-page":"42","article-title":"Efficient processing of keyword queries over graph databases for finding effective answers","volume":"51","year":"2016","journal-title":"Information Processing and Management"},{"issue":"11","key":"key2023071009243454700_ref018","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.14778\/2350229.2350233","article-title":"Diversifying top-k results","volume":"5","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"key":"key2023071009243454700_ref019","first-page":"724","article-title":"Querying communities in relational databases","volume-title":"Proceedings of IEEE International Conference on Data Engineering","year":"2009"},{"edition":"4th ed.","volume-title":"Artificial Intelligence: A Modern Approach","year":"2018","key":"key2023071009243454700_ref020"},{"issue":"2","key":"key2023071009243454700_ref021","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/s41019-021-00154-4","article-title":"Keyword search on large graphs: a survey","volume":"6","year":"2021","journal-title":"Data Science and Engineering"},{"issue":"1","key":"key2023071009243454700_ref022","first-page":"67","article-title":"Keyword search in relational databases: a survey","volume":"33","year":"2010","journal-title":"Bulletin of the IEEE CS on Data Engineering"},{"key":"key2023071009243454700_ref023","first-page":"367","article-title":"Diversified spatial keyword search on road networks","volume-title":"Proceedings of the 17th International Conference on Extending Database Technology","year":"2014"},{"key":"key2023071009243454700_ref024","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.ins.2019.10.021","article-title":"On efficiently diversified top-k geo-social keyword query processing in road networks","volume":"512","year":"2020","journal-title":"Information Sciences"},{"key":"key2023071009243454700_ref025","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-022-01118-y","article-title":"Continuous spatial keyword search with query result diversifications","year":"2022","journal-title":"World Wide Web"},{"key":"key2023071009243454700_ref026","first-page":"166","article-title":"Coverage-oriented diversification of keyword search results on graphs","volume-title":"Proceedings of International Conference on Database Systems for Advanced Applications","year":"2018"},{"key":"key2023071009243454700_ref027","first-page":"1324","article-title":"Querying cohesive subgraphs by keywords","volume-title":"Proceedings of the IEEE International Conference on Data Engineering","year":"2018"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-09-2022-0157\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-09-2022-0157\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:17Z","timestamp":1753395857000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/19\/1\/19-41\/160581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,12]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,5,12]]},"published-print":{"date-parts":[[2023,7,12]]}},"alternative-id":["10.1108\/IJWIS-09-2022-0157"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-09-2022-0157","relation":{},"ISSN":["1744-0084","1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"},{"type":"electronic","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2023,5,12]]}}}