{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:34:46Z","timestamp":1754156086683,"version":"3.41.2"},"reference-count":26,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2014,4,14]],"date-time":"2014-04-14T00:00:00Z","timestamp":1397433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,14]]},"abstract":"<jats:sec>\n               <jats:title content-type=\"abstract-heading\">Purpose<\/jats:title>\n               <jats:p> \u2013 The paper aims to propose an effective method to process keyword-based queries over graph-structured databases which are widely used in various applications such as XML, semantic web, and social network services. To satisfy users' information need, it proposes an extended answer structure for keyword queries, inverted list indexes on keywords and nodes, and query processing algorithms exploiting the inverted lists. The study aims to provide more effective and relevant answers to a given query than the previous approaches in an efficient way. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title>\n               <jats:p> \u2013 A new relevance measure for nodes to a given keyword query is defined in the paper and according to the relevance metric, a new answer tree structure is proposed which has no constraint on the number of keyword nodes chosen for each query keyword. For efficient query processing, an inverted list-style index is suggested which pre-computes connectivity and relevance information on the nodes in the graph. Then, a query processing algorithm based on the pre-constructed inverted lists is designed, which aggregates list entries for each graph node relevant to given keywords and identifies top-<jats:italic>k<\/jats:italic> root nodes of answer trees most relevant to the given query. The basic search method is also enhanced by using extend inverted lists which store additional relevance information of the related entries in the lists in order to estimate the relevance score of a node more closely and to find top-<jats:italic>k<\/jats:italic> answers more efficiently. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Findings<\/jats:title>\n               <jats:p> \u2013 Experiments with real datasets and various test queries were conducted for evaluating effectiveness and performance of the proposed methods in comparison with one of the previous approaches. The experimental results show that the proposed methods with an extended answer structure produce more effective top-<jats:italic>k<\/jats:italic> results than the compared previous method for most of the queries, especially for those with OR semantics. An extended inverted list and enhanced search algorithm are shown to achieve much improvement on the execution performance compared to the basic search method. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title>\n               <jats:p> \u2013 This paper proposes a new extended answer structure and query processing scheme for keyword queries on graph databases which can satisfy the users' information need represented by a keyword set having various semantics.<\/jats:p>\n            <\/jats:sec>","DOI":"10.1108\/ijwis-11-2013-0030","type":"journal-article","created":{"date-parts":[[2014,4,2]],"date-time":"2014-04-02T06:54:26Z","timestamp":1396421666000},"page":"65-84","source":"Crossref","is-referenced-by-count":1,"title":["Effective keyword query processing with an extended answer structure in large graph databases"],"prefix":"10.1108","volume":"10","author":[{"given":"Chang-Sup","family":"Park","sequence":"first","affiliation":[]},{"given":"Sungchae","family":"Lim","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2021010202232367500_b1","unstructured":"Amer-Yahia, S.\n                and \n                  Shanmugasundaram, J.\n                (2005), \u201cXML full-text search: challenges and opportunities\u201d, 31st Int. Conf. on Very Large Data Bases, p. -."},{"key":"key2021010202232367500_b2","unstructured":"Best, H.\n               , \n                  Majumdar, D.\n               , \n                  Schenkel, R.\n               , \n                  Theobald, M.\n                and \n                  Weikum, G.\n                (2006), \u201cIO-top-k: index-access optimized top-k query processing\u201d, 32nd Int. Conf. on Very Large Data Bases, pp. 475-486."},{"key":"key2021010202232367500_b3","doi-asserted-by":"crossref","unstructured":"Bhalotia, G.\n               , \n                  Hulgeri, A.\n               , \n                  Nakhe, C.\n               , \n                  Chakrabarti, S.\n                and \n                  Sudarshan, S.\n                (2002), \u201cKeyword searching and browsing in databases using BANKS\u201d, 18th Int. Conf. on Data Engineering, pp. 431-440.","DOI":"10.1109\/ICDE.2002.994756"},{"key":"key2021010202232367500_b4","doi-asserted-by":"crossref","unstructured":"Bruno, N.\n               , \n                  Gravano, L.\n                and \n                  Marian, A.\n                (2002), \u201cEvaluating top-k queries over web-accessible databases\u201d, 18th Int. Conf. on Data Engineering, pp. 369-380.","DOI":"10.1109\/ICDE.2002.994751"},{"key":"key2021010202232367500_b5","unstructured":"Buttcher, S.\n               , \n                  Clarke, C.\n                and \n                  Cormack, G.\n                (2010), Information Retrieval: Implementing and Evaluating Search Engine, MIT Press, Cambridge, MA."},{"key":"key2021010202232367500_b6","doi-asserted-by":"crossref","unstructured":"Chen, Y.\n               , \n                  Wang, W.\n               , \n                  Liu, Z.\n                and \n                  Lin, X.\n                (2009), \u201cKeyword search on structured and semi-structured data\u201d, 2009 ACM SIGMOD Int. Conf. on Management of Data, pp. 1005-1010.","DOI":"10.1145\/1559845.1559966"},{"key":"key2021010202232367500_b7","unstructured":"Cormen, T.H.\n               , \n                  Leiserson, C.E.\n               , \n                  Rivest, R.L.\n                and \n                  Stein, C.\n                (2001), Section 24.3: Dijkstra's Algorithm, Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA."},{"key":"key2021010202232367500_b8","doi-asserted-by":"crossref","unstructured":"Dalvi, B.B.\n               , \n                  Kshirsagar, M.\n                and \n                  Sudarshan, S.\n                (2008), \u201cKeyword search on external memory data graphs\u201d, The Proceedings of the VLDB Endowment, Vol. 1 No. 1, pp. 1189-1204.","DOI":"10.14778\/1453856.1453982"},{"key":"key2021010202232367500_b9","doi-asserted-by":"crossref","unstructured":"Ding, B.\n               , \n                  Yu, J.X.\n               , \n                  Wang, S.\n               , \n                  Qin, L.\n               , \n                  Zhang, X.\n                and \n                  Lin, X.\n                (2007), \u201cFinding top-k min-cost connected trees in databases\u201d, 23rd Int. Conf. on Data Engineering, pp. 836-845.","DOI":"10.1109\/ICDE.2007.367929"},{"key":"key2021010202232367500_b10","doi-asserted-by":"crossref","unstructured":"Fagin, R.\n               , \n                  Lotem, A.\n                and \n                  Naor, M.\n                (2003), \u201cOptimal aggregation algorithms for middleware\u201d, Journal of Computer and System Sciences, Vol. 66 No. 4, pp. 614-656.","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"key2021010202232367500_b11","doi-asserted-by":"crossref","unstructured":"Fredman, M.L.\n                and \n                  Tarjan, R.E.\n                (1987), \u201cFibonacci heaps and their uses in improved network optimization algorithms\u201d, Journal of the Association for Computing Machinery, Vol. 34 No. 2, pp. 596-615.","DOI":"10.1145\/28869.28874"},{"key":"key2021010202232367500_b12","doi-asserted-by":"crossref","unstructured":"Golenberg, K.\n               , \n                  Kimelfeld, B.\n                and \n                  Sagiv, Y.\n                (2008), \u201cKeyword proximity search in complex data graphs\u201d, 2008 ACM SIGMOD Int. Conf. on Management of Data, pp. 927-940.","DOI":"10.1145\/1376616.1376708"},{"key":"key2021010202232367500_b13","unstructured":"G\u00a8ntzer, U.\n               , \n                  Balke, W.-T.\n                and \n                  Kie\u00dfling, W.\n                (2001), \u201cTowards efficient multi-feature queries in heterogeneous environments\u201d, 2001 Int. Conf. on Inf. Tech., pp. 622-628."},{"key":"key2021010202232367500_b14","doi-asserted-by":"crossref","unstructured":"He, H.\n               , \n                  Wang, H.\n               , \n                  Yang, J.\n                and \n                  Yu, P.S.\n                (2007), \u201cBLINKS: ranked keyword searches on graphs\u201d, 2007 ACM SIGMOD Int. Conf. on Management of Data, pp. 305-316.","DOI":"10.1145\/1247480.1247516"},{"key":"key2021010202232367500_b16","unstructured":"Hristidis, V.\n                and \n                  Papakonstantinou, Y.\n                (2002), \u201cDiscover: keyword search in relational databases\u201d, 28th Int. Conf. on Very Large Data Bases, pp. 670-681."},{"key":"key2021010202232367500_b15","doi-asserted-by":"crossref","unstructured":"Hristidis, V.\n               , \n                  Gravano, L.\n                and \n                  Papakonstantinou, Y.\n                (2003), \u201cEfficient IR-style keyword search over relational databases\u201d, 29th Int. Conf. on Very Large Data Bases, pp. 850-861.","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"key2021010202232367500_b17","doi-asserted-by":"crossref","unstructured":"Hwang, F.K.\n                and \n                  Richards, D.S.\n                (1992), \u201cThe Steiner tree problem\u201d, Networks, Vol. 22 No. 1, pp. 55-89.","DOI":"10.1002\/net.3230220105"},{"key":"key2021010202232367500_b18","unstructured":"Kacholia, V.\n               , \n                  Pandit, S.\n               , \n                  Chakrabarti, S.\n               , \n                  Sudarshan, S.\n               , \n                  Desai, R.\n                and \n                  Karambelkar, H.\n                (2005), \u201cBidirectional expansion for keyword search on graph databases\u201d, 31st Int. Conf. on Very Large Data Bases, pp. 505-516."},{"key":"key2021010202232367500_b19","doi-asserted-by":"crossref","unstructured":"Kim, H.\n               , \n                  Park, C.-S.\n                and \n                  Lee, Y.J.\n                (2011), \u201cImproving keyword match for semantic search\u201d, IEICE Trans. Inf. & Syst., Vol. E94-D No. 2, pp. 375-378.","DOI":"10.1587\/transinf.E94.D.375"},{"key":"key2021010202232367500_b20","doi-asserted-by":"crossref","unstructured":"Li, G.\n               , \n                  Ooi, B.C.\n               , \n                  Feng, J.\n               , \n                  Wang, J.\n                and \n                  Zhou, L.\n                (2008), \u201cEASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data\u201d, 2008 ACM SIGMOD Int. Conf. on Management of Data, pp. 903-914.","DOI":"10.1145\/1376616.1376706"},{"key":"key2021010202232367500_b21","doi-asserted-by":"crossref","unstructured":"Luo, Y.\n               , \n                  Lin, X.\n               , \n                  Wang, W.\n                and \n                  Zhou, X.\n                (2007), \u201cSpark: top-k keyword query in relational databases\u201d, 2007 ACM SIGMOD Int. Conf. on Management of Data, pp. 115-126.","DOI":"10.1145\/1247480.1247495"},{"key":"key2021010202232367500_b22","doi-asserted-by":"crossref","unstructured":"Park, C.-S.\n                (2013), \u201cAn effective keyword search method for graph-structured data using extended answer structure\u201d, 13th Int. Conf. on Computational Science and its Applications, LNCS, pp. 620-635.","DOI":"10.1007\/978-3-642-39640-3_45"},{"key":"key2021010202232367500_b23","doi-asserted-by":"crossref","unstructured":"Qin, L.\n               , \n                  Yu, J.X.\n                and \n                  Chang, L.\n                (2009), \u201cKeyword search in databases: the power of RDBMS\u201d, 2009 ACM SIGMOD Int. Conf. on Management of Data, pp. 681-694.","DOI":"10.1145\/1559845.1559917"},{"key":"key2021010202232367500_b24","doi-asserted-by":"crossref","unstructured":"Theobald, M.\n               , \n                  Weikum, G.\n                and \n                  Schenkel, R.\n                (2004), \u201cTop-k query evaluation with probabilistic guarantees\u201d, 30th Int. Conf. on Very Large Data Bases, pp. 648-659.","DOI":"10.1016\/B978-012088469-8.50058-9"},{"key":"key2021010202232367500_b25","unstructured":"Yu, J.X.\n               , \n                  Chang, L.\n                and \n                  Tao, Y.\n                (2009), \u201cQuerying communities in relational databases\u201d, 25th Int. Conf. on Data Engineering, pp. 724-735."},{"key":"key2021010202232367500_b26","unstructured":"Yu, J.X.\n               , \n                  Qin, L.\n                and \n                  Chang, L.\n                (2010), \u201cKeyword search in relational databases: a survey\u201d, IEEE Data Engineering Bulletin, Vol. 33 No. 1, pp. 67-78."}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/IJWIS-11-2013-0030","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-11-2013-0030\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-11-2013-0030\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:22Z","timestamp":1753395862000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/10\/1\/65-84\/375148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,14]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,4,14]]}},"alternative-id":["10.1108\/IJWIS-11-2013-0030"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-11-2013-0030","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2014,4,14]]}}}