{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:13Z","timestamp":1725550513401},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309512"},{"type":"electronic","value":"9783540314455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601524_4","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T13:28:15Z","timestamp":1133443695000},"page":"58-73","source":"Crossref","is-referenced-by-count":14,"title":["Efficiently Enumerating Results of Keyword Search"],"prefix":"10.1007","author":[{"given":"Benny","family":"Kimelfeld","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: enabling keyword search over relational databases. In: SIGMOD Conference, p. 627 (2002)","DOI":"10.1145\/564691.564782"},{"key":"4_CR2","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":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, S., Kanza, Y., Kimelfeld, B., Sagiv, Y.: Interconnection semantics for keyword search in XML. In: CIKM (2005)","DOI":"10.1145\/1099554.1099674"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics\u00a032, 835\u2013859 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: HDMS (2003)","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: DISCOVER: Keyword search in relational databases. In: VLDB, pp. 670\u2013681 (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y., Balmin, A.: Keyword proximity search on XML graphs. In: ICDE, pp. 367\u2013378 (2003)","DOI":"10.1109\/ICDE.2003.1260806"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: Computing the K shortest paths: A new algorithm and an experimental comparison. Algorithm Engineering, 15\u201329 (1999)","DOI":"10.1007\/3-540-48318-7_4"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"4_CR10","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":"4_CR11","unstructured":"Kimelfeld, B., Sagiv, Y.: Efficient engines for keyword proximity search. In: WebDB, pp. 67\u201372 (2005)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Kimelfeld, B., Sagiv, Y.: Efficiently enumerating results of keyword search (2005), Available at Kimelfeld\u2019s home page http:\/\/www.cs.huji.ac.il\/~bennyk\/","DOI":"10.1007\/11601524_4"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Li, W.S., Candan, K.S., Vu, Q., Agrawal, D.: Retrieving and organizing Web pages by \u201cinformation unit\u201d. In: WWW, pp. 230\u2013244 (2001)","DOI":"10.1145\/371920.372057"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Database Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601524_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:09Z","timestamp":1619506929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601524_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309512","9783540314455"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11601524_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}