{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:14:11Z","timestamp":1759133651557,"version":"3.41.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319198897"},{"type":"electronic","value":"9783319198903"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19890-3_19","type":"book-chapter","created":{"date-parts":[[2015,6,11]],"date-time":"2015-06-11T05:31:58Z","timestamp":1434000718000},"page":"287-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Keyword Pattern Graph Relaxation for Selective Result Space Expansion on Linked Data"],"prefix":"10.1007","author":[{"given":"Ananya","family":"Dass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cem","family":"Aksoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aggeliki","family":"Dimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Theodoratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,10]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Agresti, A.: Analysis of ordinal categorical data. John Wiley & Sons (2010)","DOI":"10.1002\/9780470594001"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-319-08010-9_24","volume-title":"Web-Age Information Management","author":"C Aksoy","year":"2014","unstructured":"Aksoy, C., Dass, A., Theodoratos, D., Wu, X.: Clustering query results to support keyword search on tree data. In: Li, F., Li, G., Hwang, S., Yao, B., Zhang, Z. (eds.) WAIM 2014. LNCS, vol. 8485, pp. 213\u2013224. Springer, Heidelberg (2014)"},{"key":"19_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0384-3","author":"C Aksoy","year":"2015","unstructured":"Aksoy, C., Dimitriou, A., Theodoratos, D.: Reasoning with patterns to effectively answer XML keyword queries. The VLDB Journal (2015). doi: 10.1007\/s00778-015-0384-3","journal-title":"The VLDB Journal"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-37487-6_24","volume-title":"Database Systems for Advanced Applications","author":"C Aksoy","year":"2013","unstructured":"Aksoy, C., Dimitriou, A., Theodoratos, D., Wu, X.: XReason: a semantic approach that reasons with patterns to answer XML keyword queries. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013, Part I. LNCS, vol. 7825, pp. 299\u2013314. Springer, Heidelberg (2013)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45876-X_32","volume-title":"Advances in Database Technology - EDBT 2002","author":"S Amer-Yahia","year":"2002","unstructured":"Amer-Yahia, S., Cho, S.R., Srivastava, D.: Tree pattern relaxation. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 496\u2013513. Springer, Heidelberg (2002)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using BANKS. In: ICDE, pp. 431\u2013440 (2002)","DOI":"10.1109\/ICDE.2002.994756"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Brodianskiy, T., Cohen, S.: Self-correcting queries for XML. In: CIKM (2007)","DOI":"10.1145\/1321440.1321445"},{"issue":"1","key":"19_CR8","first-page":"1189","volume":"1","author":"BB Dalvi","year":"2008","unstructured":"Dalvi, B.B., Kshirsagar, M., Sudarshan, S.: Keyword search on external memory data graphs. PVLDB 1(1), 1189\u20131204 (2008)","journal-title":"PVLDB"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-319-11749-2_34","volume-title":"Web Information Systems Engineering \u2013 WISE 2014","author":"A Dass","year":"2014","unstructured":"Dass, A., Aksoy, C., Dimitriou, A., Theodoratos, D.: Exploiting semantic result clustering to support keyword search on linked data. In: Benatallah, B., Bestavros, A., Manolopoulos, Y., Vakali, A., Zhang, Y. (eds.) WISE 2014, Part I. LNCS, vol. 8786, pp. 448\u2013463. Springer, Heidelberg (2014)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE, pp. 836\u2013845 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Elbassuoni, S., Blanco, R.: Keyword search over RDF graphs. In: CIKM (2011)","DOI":"10.1145\/2063576.2063615"},{"key":"19_CR12","unstructured":"Elbassuoni, S., Ramanath, M., Schenkel, R., Weikum, G.: Searching RDF graphs with sparql and keywords. IEEE Data Eng. Bull., 16\u201324 (2010)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Fu, H., Gao, S., Anyanwu, K.: Disambiguating keyword queries on RDF databases using \u201cDeep\u201d segmentation. In: ICSC, pp. 236\u2013243 (2010)","DOI":"10.1109\/ICSC.2010.90"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: SIGMOD, pp. 927\u2013940 (2008)","DOI":"10.1145\/1376616.1376708"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: ranked keyword search over XML documents. In: SIGMOD, pp. 16\u201327 (2003)","DOI":"10.1145\/872757.872762"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305\u2013316 (2007)","DOI":"10.1145\/1247480.1247516"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20(4), 422\u2013446 (2002)","journal-title":"ACM Trans. Inf. Syst."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-25856-5_8","volume-title":"Advanced Data Mining and Applications","author":"M Jiang","year":"2011","unstructured":"Jiang, M., Chen, Y., Chen, J., Du, X.: Interactive predicate suggestion for keyword search on RDF graphs. In: Tang, J., King, I., Chen, L., Wang, J. (eds.) ADMA 2011, Part II. LNCS, vol. 7121, pp. 96\u2013109. Springer, Heidelberg (2011)"},{"key":"19_CR19","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505\u2013516 (2005)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Kargar, M., An, A.: Keyword search in graphs: Finding r-cliques. VLDB (2011)","DOI":"10.14778\/2021017.2021025"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Kong, L., Gilleron, R., Mostrare, A.L.: Retrieving meaningful relaxed tightest fragments for XML keyword search. In: EDBT, pp. 815\u2013826 (2009)","DOI":"10.1145\/1516360.1516454"},{"issue":"11","key":"19_CR22","doi-asserted-by":"publisher","first-page":"2774","DOI":"10.1109\/TKDE.2014.2302294","volume":"26","author":"W Le","year":"2014","unstructured":"Le, W., Li, F., Kementsietsidis, A., Duan, S.: Scalable keyword search on large RDF data. IEEE Trans. Knowl. Data Eng. 26(11), 2774\u20132788 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: SIGMOD, pp. 903\u2013914 (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J.X., Chang, L., Tao, Y.: Querying communities in relational databases. In: ICDE, pp. 724\u2013735 (2009)","DOI":"10.1109\/ICDE.2009.67"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Tran, T., Wang, H., Rudolph, S., Cimiano, P.: Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.119"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-540-68234-9_43","volume-title":"The Semantic Web: Research and Applications","author":"H Wang","year":"2008","unstructured":"Wang, H., Zhang, K., Liu, Q., Tran, T., Yu, Y.: Q2Semantic: a lightweight keyword interface to semantic search. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021, pp. 584\u2013598. Springer, Heidelberg (2008)"},{"key":"19_CR27","unstructured":"Xu, K., Chen, J., Wang, H., Yu, Y.: Hybrid graph based keyword query interpretation on RDF. In: ISWC (2010)"}],"container-title":["Lecture Notes in Computer Science","Engineering the Web in the Big Data Era"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19890-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T14:02:58Z","timestamp":1748440978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19890-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319198897","9783319198903"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19890-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"10 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}