{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:59Z","timestamp":1750306919588,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"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":[[2012,10,29]]},"DOI":"10.1145\/2396761.2396794","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"235-244","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Density index and proximity search in large graphs"],"prefix":"10.1145","author":[{"given":"Nan","family":"Li","sequence":"first","affiliation":[{"name":"UC Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Xifeng","family":"Yan","sequence":"additional","affiliation":[{"name":"UC Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Zhen","family":"Wen","sequence":"additional","affiliation":[{"name":"IBM Research, Hawthorne, NY, USA"}]},{"given":"Arijit","family":"Khan","sequence":"additional","affiliation":[{"name":"UC Santa Barbara, Santa Barbara, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90022-Q"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/01969720601139041"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253302"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564731"},{"issue":"4","key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1080\/00031305.1995.10476177","article-title":"Understanding the Metropolis-Hastings algorithm","volume":"49","author":"Chib S.","year":"1995","unstructured":"S. Chib and E. Greenberg . Understanding the Metropolis-Hastings algorithm . The American Statistician , 49 ( 4 ): 327 -- 335 , Nov. 1995 . S. Chib and E. Greenberg. Understanding the Metropolis-Hastings algorithm. The American Statistician, 49(4):327--335, Nov. 1995.","journal-title":"The American Statistician"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2018243.2018278"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833840"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367738"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1123-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1128596.1128764"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_3_2_1_15_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_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021025"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.55"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376706"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.165464"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_3_2_1_22_1","volume-title":"LEDA: a platform for combinatorial and geometric computing","author":"Mehlhorn K.","year":"1999","unstructured":"K. Mehlhorn and S. N\u00e4her . LEDA: a platform for combinatorial and geometric computing . Cambridge University Press , 1999 . K. Mehlhorn and S. N\u00e4her. LEDA: a platform for combinatorial and geometric computing. Cambridge University Press, 1999."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.67"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390269"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"J. Tenenbaum V. Silva and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science (5500):2319--2323. J. Tenenbaum V. Silva and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science (5500):2319--2323.","DOI":"10.1126\/science.290.5500.2319"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.12.031"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408179908969808"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396794","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2396794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:18Z","timestamp":1750235718000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":27,"alternative-id":["10.1145\/2396761.2396794","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2396794","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}