{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:57:00Z","timestamp":1743001020632,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319444055"},{"type":"electronic","value":"9783319444062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44406-2_33","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T09:35:51Z","timestamp":1470389751000},"page":"399-409","source":"Crossref","is-referenced-by-count":1,"title":["Constructing Data Graphs for Keyword Search"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Golenberg","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Achiezra, H., Golenberg, K., Kimelfeld, B., Sagiv, Y.: Exploratory keyword search on data graphs. In: SIGMOD Conference (2010)","DOI":"10.1145\/1807167.1807308"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bao, Z., Ling, T.W., Chen, B., Lu, J.: Effective XML keyword search with relevance oriented ranking. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.16"},{"key":"33_CR3","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 (2002)","DOI":"10.1109\/ICDE.2002.994756"},{"issue":"1","key":"33_CR4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/TKDE.2012.228","volume":"26","author":"J Coffman","year":"2014","unstructured":"Coffman, J., Weaver, A.C.: An empirical performance evaluation of relational keyword search techniques. IEEE Trans. Knowl. Data Eng. 26(1), 30\u201342 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"33_CR5","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":"33_CR6","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 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: SIGMOD Conference (2008)","DOI":"10.1145\/1376616.1376708"},{"issue":"11","key":"33_CR8","first-page":"1028","volume":"4","author":"K Golenberg","year":"2011","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Optimizing and parallelizing ranked enumeration. PVLDB 4(11), 1028\u20131039 (2011)","journal-title":"PVLDB"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Sagiv, Y.: Constructing data graphs for keyword search. arXiv: https:\/\/arxiv.org\/abs\/1605.07865 (2016)","DOI":"10.1007\/978-3-319-44406-2_33"},{"key":"33_CR10","unstructured":"Golenberg, K., Sagiv, Y.: A practically efficient algorithm for generating answers to keyword search over data graphs. In: ICDT (2016)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: ranked keyword search over XML documents. In: SIGMOD Conference (2003)","DOI":"10.1145\/872757.872762"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: ranked keyword searches on graphs. In: SIGMOD Conference (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y., Balmin, A.: Keyword proximity search on XML graphs. In: ICDE (2003)","DOI":"10.1109\/ICDE.2003.1260806"},{"key":"33_CR14","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB (2005)"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Kasneci, G., Ramanath, M., Sozio, M., Suchanek, F.M., Weikum, G.: STAR: steiner-tree approximation in relationship graphs. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.64"},{"key":"33_CR16","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 Conference (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"33_CR17","unstructured":"Mass, Y., Sagiv, Y.: Virtual documents and answer priors in keyword search over data graphs. In: Proceedings of the Workshops of the EDBT\/ICDT 2016 Joint Conference (2016)"},{"issue":"1","key":"33_CR18","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.ipm.2014.08.002","volume":"51","author":"C Park","year":"2015","unstructured":"Park, C., Lim, S.: Efficient processing of keyword queries over graph databases for finding effective answers. Inf. Process. Manage. 51(1), 42\u201357 (2015)","journal-title":"Inf. Process. Manage."},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Sagiv, Y.: A personal perspective on keyword search over data graphs. In: ICDT, pp. 21\u201332 (2013)","DOI":"10.1145\/2448496.2448500"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Xu, Y., Papakonstantinou, Y.: Efficient LCA based keyword search in XML data. In: EDBT (2008)","DOI":"10.1145\/1353343.1353408"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44406-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T03:06:28Z","timestamp":1568257588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44406-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319444055","9783319444062"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44406-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}