{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:41Z","timestamp":1750307261585,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"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":[[2011,3,21]]},"DOI":"10.1145\/1982185.1982400","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"985-986","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact top-k keyword search on graph databases"],"prefix":"10.1145","author":[{"given":"Meirong","family":"Wang","sequence":"first","affiliation":[{"name":"The University of Electro-Communications, Chofugaoka, Chofu City, Tokyo, Japan"}]},{"given":"Lijun","family":"Jiang","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications, Chofugaoka, Chofu City, Tokyo, Japan"}]},{"given":"Liru","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications, Chofugaoka, Chofu City, Tokyo, Japan"}]},{"given":"Tadashi","family":"Ohmori","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications, Chofugaoka, Chofu City, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Finding Top-k Min-Cost Connected Trees in Databases. In proc. of the 23<sup>rd<\/sup> International Conference on Data engineering (ICDE'07)","author":"Ding B.","year":"2007","unstructured":"B. Ding , J. X. Yu , L. Qin , X. Zhang , and X. Lin . Finding Top-k Min-Cost Connected Trees in Databases. In proc. of the 23<sup>rd<\/sup> International Conference on Data engineering (ICDE'07) , 2007 , 836--845. B. Ding, J. X. Yu, L. Qin, X. Zhang, and X. Lin. Finding Top-k Min-Cost Connected Trees in Databases. In proc. of the 23<sup>rd<\/sup> International Conference on Data engineering (ICDE'07), 2007, 836--845."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1247480.1247516"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1376616.1376708"}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC'11","name":"SAC'11: The 2011 ACM Symposium on Applied Computing","location":"TaiChung Taiwan"},"container-title":["Proceedings of the 2011 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982400","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1982185.1982400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:37Z","timestamp":1750243957000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":3,"alternative-id":["10.1145\/1982185.1982400","10.1145\/1982185"],"URL":"https:\/\/doi.org\/10.1145\/1982185.1982400","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}