{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:24:50Z","timestamp":1759134290470,"version":"3.41.2"},"reference-count":19,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"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":[[2018,8,20]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>This paper aims to propose a new keyword search method on graph data to improve the relevance of search results and reduce duplication of content nodes in the answer trees obtained by previous approaches based on distinct root semantics. The previous approaches are restricted to find answer trees having different root nodes and thus often generate a result consisting of answer trees with low relevance to the query or duplicate content nodes. The method allows limited redundancy in the root nodes of top-<jats:italic>k<\/jats:italic> answer trees to produce more effective query results.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>A measure for redundancy in a set of answer trees regarding their root nodes is defined, and according to the metric, a set of answer trees with limited root redundancy is proposed for the result of a keyword query on graph data. For efficient query processing, an index on the useful paths in the graph using inverted lists and a hash map is suggested. Then, based on the path index, a top-<jats:italic>k<\/jats:italic> query processing algorithm is presented to find most relevant and diverse answer trees given a maximum amount of root redundancy allowed for a set of answer trees.<\/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 real graph datasets show that the proposed approach can produce effective query answers which are more diverse in the content nodes and more relevant to the query than the previous approach based on distinct root semantics.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>This paper first takes redundancy in the root nodes of answer trees into account to improve the relevance and content nodes redundancy of query results over the previous distinct root semantics. It can satisfy the users\u2019 various information need on a large and complex graph data using a keyword-based query.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ijwis-10-2017-0070","type":"journal-article","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T19:09:36Z","timestamp":1532372976000},"page":"299-316","source":"Crossref","is-referenced-by-count":2,"title":["Effective keyword search on graph data using limited root redundancy of answer trees"],"prefix":"10.1108","volume":"14","author":[{"given":"Chang-Sup","family":"Park","sequence":"first","affiliation":[]}],"member":"140","reference":[{"first-page":"431","article-title":"Keyword searching and browsing in databases using BANKS","year":"2002","key":"key2020092717275707500_ref001"},{"volume-title":"Information Retrieval: implementing and Evaluating Search Engine","year":"2010","key":"key2020092717275707500_ref002"},{"issue":"1","key":"key2020092717275707500_ref003","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"},{"first-page":"836","article-title":"Finding top-k min-cost connected trees in databases","year":"2007","key":"key2020092717275707500_ref004"},{"issue":"4","key":"key2020092717275707500_ref005","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","article-title":"Optimal aggregation algorithms for middleware","volume":"66","year":"2003","journal-title":"Journal of Computer and System Sciences"},{"first-page":"927","article-title":"Keyword proximity search in complex data graphs","year":"2008","key":"key2020092717275707500_ref006"},{"first-page":"305","article-title":"BLINKS: ranked keyword searches on graphs","year":"2007","key":"key2020092717275707500_ref007"},{"issue":"1","key":"key2020092717275707500_ref008","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"The steiner tree problem","volume":"22","year":"1992","journal-title":"Networks"},{"first-page":"505","article-title":"Bidirectional expansion for keyword search on graph databases","year":"2005","key":"key2020092717275707500_ref009"},{"issue":"10","key":"key2020092717275707500_ref010","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":"key2020092717275707500_ref011","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"},{"issue":"11","key":"key2020092717275707500_ref012","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"},{"first-page":"903","article-title":"EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data","year":"2008","key":"key2020092717275707500_ref013"},{"issue":"3","key":"key2020092717275707500_ref014","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"},{"first-page":"18","article-title":"Keyword search over graph-structured data for finding effective and non-redundant answers","year":"2016","key":"key2020092717275707500_ref015"},{"issue":"1","key":"key2020092717275707500_ref016","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"},{"first-page":"724","article-title":"Querying communities in relational databases","year":"2009","key":"key2020092717275707500_ref017"},{"first-page":"405","article-title":"Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data","year":"2009","key":"key2020092717275707500_ref018"},{"issue":"1","key":"key2020092717275707500_ref019","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"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-10-2017-0070\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-10-2017-0070\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:20Z","timestamp":1753395860000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/14\/3\/299-316\/166993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,8,20]]}},"alternative-id":["10.1108\/IJWIS-10-2017-0070"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-10-2017-0070","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2018,8,20]]}}}