{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:02:21Z","timestamp":1771704141215,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T00:00:00Z","timestamp":1151280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,26]]},"DOI":"10.1145\/1142351.1142377","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"173-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":113,"title":["Finding and approximating top-k answers in keyword proximity search"],"prefix":"10.1145","author":[{"given":"Benny","family":"Kimelfeld","sequence":"first","affiliation":[{"name":"The Hebrew University, Jerusalem, Israel"}]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[{"name":"The Hebrew University, Jerusalem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2006,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564782"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/314613.314700"},{"key":"e_1_3_2_1_5_1","first-page":"1","author":"Dreyfus S.","year":"1972","unstructured":"S. Dreyfus and R. Wagner . The Steiner problem in graphs. Networks , 1 , 1972 . S. Dreyfus and R. Wagner. The Steiner problem in graphs. Networks, 1, 1972.","journal-title":"The Steiner problem in graphs. Networks"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3171-2","volume-title":"Advances in Steiner Trees","author":"Du D.-Z.","year":"2000","unstructured":"D.-Z. Du , J. Smith , and J. Rubinstein . Advances in Steiner Trees . Springer , 2000 . D.-Z. Du, J. Smith, and J. Rubinstein. Advances in Steiner Trees. Springer, 2000."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796501"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1096"},{"key":"e_1_3_2_1_10_1","volume-title":"An improved approximation scheme for the group Steiner problem. Networks, 37(1)","author":"Helvig C. S.","year":"2001","unstructured":"C. S. Helvig , G. Robins , and A. Zelikovsky . An improved approximation scheme for the group Steiner problem. Networks, 37(1) , 2001 . C. S. Helvig, G. Robins, and A. Zelikovsky. An improved approximation scheme for the group Steiner problem. Networks, 37(1), 2001."},{"key":"e_1_3_2_1_11_1","volume-title":"VLDB","author":"Hristidis V.","year":"2002","unstructured":"V. Hristidis and Y. Papakonstantinou . DISCOVER: Keyword search in relational databases . In VLDB , 2002 . V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, 2002."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260806"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083652"},{"key":"e_1_3_2_1_15_1","unstructured":"B. Kimelfeld and Y. Sagiv. New algorithms for computing Steiner trees for a fixed number of terminals. To be found in the first author's home page (http:\/\/www.cs.huji.ac.il\/~bennyk).  B. Kimelfeld and Y. Sagiv. New algorithms for computing Steiner trees for a fixed number of terminals. To be found in the first author's home page (http:\/\/www.cs.huji.ac.il\/~bennyk)."},{"key":"e_1_3_2_1_16_1","volume-title":"WebDB","author":"Kimelfeld B.","year":"2005","unstructured":"B. Kimelfeld and Y. Sagiv . Efficient engines for keyword proximity search . In WebDB , 2005 . B. Kimelfeld and Y. Sagiv. Efficient engines for keyword proximity search. In WebDB, 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11601524_4"},{"key":"e_1_3_2_1_18_1","first-page":"15","author":"Kou L.","year":"1981","unstructured":"L. Kou , G. Markowsky , and L. Berman . A fast algorithm for Steiner trees. Acta Inf. , 15 , 1981 . L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Inf., 15, 1981.","journal-title":"A fast algorithm for Steiner trees. Acta Inf."},{"key":"e_1_3_2_1_19_1","first-page":"18","author":"Lawler E. L.","year":"1972","unstructured":"E. L. Lawler . A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science , 18 , 1972 . E. L. Lawler. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18, 1972.","journal-title":"Management Science"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372057"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338638"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"e_1_3_2_1_23_1","first-page":"17","author":"Yen J. Y.","year":"1971","unstructured":"J. Y. Yen . Finding the k shortest loopless paths in a network. Management Science , 17 , 1971 . J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 17, 1971.","journal-title":"Management Science"},{"key":"e_1_3_2_1_24_1","volume-title":"Another algorithm for finding the k shortest loopless network paths. In \"Proc. 41st Mtg","author":"Yen J. Y.","year":"1972","unstructured":"J. Y. Yen . Another algorithm for finding the k shortest loopless network paths. In \"Proc. 41st Mtg . Operations Research Society of America \", volume 20 , 1972 . J. Y. Yen. Another algorithm for finding the k shortest loopless network paths. In \"Proc. 41st Mtg. Operations Research Society of America\", volume 20, 1972."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"A. Zelikovsky. An 11\/6-approximation algorithm for the network steiner problem. Algorithmica 9(5) 1993.  A. Zelikovsky. An 11\/6-approximation algorithm for the network steiner problem. Algorithmica 9(5) 1993.","DOI":"10.1007\/BF01187035"}],"event":{"name":"SIGMOD\/PODS06: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Chicago IL USA","acronym":"SIGMOD\/PODS06","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGAI ACM Special Interest Group on Artificial Intelligence","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142351.1142377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1142351.1142377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:11Z","timestamp":1750259171000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142351.1142377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,26]]},"references-count":25,"alternative-id":["10.1145\/1142351.1142377","10.1145\/1142351"],"URL":"https:\/\/doi.org\/10.1145\/1142351.1142377","relation":{},"subject":[],"published":{"date-parts":[[2006,6,26]]},"assertion":[{"value":"2006-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}