{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:58Z","timestamp":1750307038013,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1632\/12"],"award-info":[{"award-number":["1632\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2448496.2448500","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"21-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A personal perspective on keyword search over data graphs"],"prefix":"10.1145","author":[{"given":"Yehoshua","family":"Sagiv","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem Givat Ram, Jerusalem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Understanding Complex Answers of Queries on Graphs. Master's thesis","author":"Achiezra H.","year":"2009","unstructured":"H. Achiezra . Understanding Complex Answers of Queries on Graphs. Master's thesis , Hebrew University , Department of Computer Science, 2009 . H. Achiezra. Understanding Complex Answers of Queries on Graphs. Master's thesis, Hebrew University, Department of Computer Science, 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807308"},{"key":"e_1_3_2_1_3_1","series-title":"ASIS&T Monograph Series","volume-title":"Computerization Movements and Technology Diffusion: From Mainframes to Ubiquitous Computing","author":"Ackerman M. S.","year":"2006","unstructured":"M. S. Ackerman . The politics of design: Next generation computational environments . In K. Kraemer and M. Elliott, editors, Computerization Movements and Technology Diffusion: From Mainframes to Ubiquitous Computing , ASIS&T Monograph Series , 2006 . M. S. Ackerman. The politics of design: Next generation computational environments. In K. Kraemer and M. Elliott, editors, Computerization Movements and Technology Diffusion: From Mainframes to Ubiquitous Computing, ASIS&T Monograph Series, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564782"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063818"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871531"},{"key":"e_1_3_2_1_8_1","first-page":"739","volume-title":"VLDB","author":"Cohen S.","year":"2006","unstructured":"S. Cohen , I. Fadida , Y. Kanza , B. Kimelfeld , and Y. Sagiv . Full disjunctions: Polynomial-delay iterators in action . In VLDB , pages 739 -- 750 , 2006 . S. Cohen, I. Fadida, Y. Kanza, B. Kimelfeld, and Y. Sagiv. Full disjunctions: Polynomial-delay iterators in action. In VLDB, pages 739--750, 2006."},{"key":"e_1_3_2_1_9_1","first-page":"45","volume-title":"VLDB","author":"Cohen S.","year":"2003","unstructured":"S. Cohen , J. Mamou , Y. Kanza , and Y. Sagiv . Xsearch: A semantic search engine for xml . In VLDB , pages 45 -- 56 , 2003 . S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. Xsearch: A semantic search engine for xml. In VLDB, pages 45--56, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/319732.319735"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191908"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376708"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402739"},{"key":"e_1_3_2_1_14_1","unstructured":"K. Golenberg and Y. Sagiv. The architecture of a system for keyword search over data graphs. Manuscript in preparation.  K. Golenberg and Y. Sagiv. The architecture of a system for keyword search over data graphs. Manuscript in preparation."},{"key":"e_1_3_2_1_15_1","unstructured":"K. Golenberg and Y. Sagiv. A practically efficient algorithm for generating all answers to search queries over data graphs. Manuscript in preparation.  K. Golenberg and Y. Sagiv. A practically efficient algorithm for generating all answers to search queries over data graphs. Manuscript in preparation."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45194-5_7"},{"key":"e_1_3_2_1_17_1","first-page":"670","volume-title":"VLDB","author":"Hristidis V.","year":"2002","unstructured":"V. Hristidis and Y. Papakonstantinou . Discover: Keyword search in relational databases . In VLDB , pages 670 -- 681 , 2002 . V. Hristidis and Y. Papakonstantinou. Discover: Keyword search in relational databases. In VLDB, pages 670--681, 2002."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_1_19_1","first-page":"505","volume-title":"VLDB","author":"Kacholia V.","year":"2005","unstructured":"V. Kacholia , S. Pandit , S. Chakrabarti , S. Sudarshan , R. Desai , and H. Karambelkar . Bidirectional expansion for keyword search on graph databases . In VLDB , pages 505 -- 516 , 2005 . V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, pages 505--516, 2005."},{"key":"e_1_3_2_1_20_1","first-page":"67","volume-title":"WebDB","author":"Kimelfeld B.","year":"2005","unstructured":"B. Kimelfeld and Y. Sagiv . Efficient engines for keyword proximity search . In WebDB , pages 67 -- 72 , 2005 . B. Kimelfeld and Y. Sagiv. Efficient engines for keyword proximity search. In WebDB, pages 67--72, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11601524_4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142377"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.01.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989318"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448526"},{"key":"e_1_3_2_1_26_1","volume-title":"Management Science, 18(7)","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(7) , 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(7), 1972."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571994"},{"key":"e_1_3_2_1_28_1","first-page":"38","volume-title":"CIDR","author":"Mass Y.","year":"2011","unstructured":"Y. Mass , M. Ramanath , Y. Sagiv , and G. Weikum . IQ: The case for iterative querying for knowledge . In CIDR , pages 38 -- 44 , 2011 . Y. Mass, M. Ramanath, Y. Sagiv, and G. Weikum. IQ: The case for iterative querying for knowledge. In CIDR, pages 38--44, 2011."},{"key":"e_1_3_2_1_29_1","unstructured":"Y. Mass and Y. Sagiv. Language models for virtual documents in data graphs. Unpublished manuscript.  Y. Mass and Y. Sagiv. Language models for virtual documents in data graphs. Unpublished manuscript."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124340"},{"key":"e_1_3_2_1_31_1","volume-title":"Operations Research, 16(3)","author":"Murty K. G.","year":"1968","unstructured":"K. G. Murty . An algorithm for ranking all the assignments in order of increasing cost. Operations Research, 16(3) , 1968 . K. G. Murty. An algorithm for ranking all the assignments in order of increasing cost. Operations Research, 16(3), 1968."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291008"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237717"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582336"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/319983.319988"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.119"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984322"}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the 16th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448500","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448496.2448500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:51Z","timestamp":1750238451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":37,"alternative-id":["10.1145\/2448496.2448500","10.1145\/2448496"],"URL":"https:\/\/doi.org\/10.1145\/2448496.2448500","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}