{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:27:20Z","timestamp":1729614440766,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/ccgrid.2003.1199388","type":"proceedings-article","created":{"date-parts":[[2004,6,22]],"date-time":"2004-06-22T20:27:43Z","timestamp":1087936063000},"page":"359-366","source":"Crossref","is-referenced-by-count":15,"title":["Peer-to-peer keyword search using keyword relationship"],"prefix":"10.1109","author":[{"given":"K.","family":"Nakauchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Ishikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Morikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Aoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"Assessing thesaurus-based query expansion using the UMLS Metathesaurus","author":"hersh","year":"2000","journal-title":"Proc 2000 AMIA Annu Fall Symp"},{"year":"0","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/FTDCS.2003.1204290"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290995"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45518-3_18","article-title":"Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems","author":"rowstron","year":"2001","journal-title":"Proc Middleware 2001"},{"key":"14","article-title":"Complex queries in dht-based peer-to-peer networks","author":"huebsch","year":"2002","journal-title":"Proc IPTPS 2002"},{"key":"11","article-title":"Chord: A scalable peer-to-peer lookup service for internet applications","author":"stoica","year":"2001","journal-title":"Proceedings of ACM SIG-COMM 2001"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"journal-title":"The Deep Web Surfacing Hidden Value","year":"0","author":"bergman","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1038\/21987"},{"key":"1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1126\/science.280.5360.98","article-title":"Searching the world wide web","volume":"280","author":"lawrence","year":"1998","journal-title":"Science"},{"journal-title":"Tapestry An infrastructure for fault-tolerant wide-area location and routing","year":"2000","author":"zhao","key":"10"},{"year":"0","key":"7"},{"year":"0","key":"6"},{"year":"0","key":"5"},{"year":"0","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/774763.774778"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514206"}],"event":{"name":"CCGrid 2003. 3rd IEEE\/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","start":{"date-parts":[[2003,5,15]]},"location":"Tokyo, Japan","end":{"date-parts":[[2003,5,15]]}},"container-title":["CCGrid 2003. 3rd IEEE\/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8544\/27003\/01199388.pdf?arnumber=1199388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T08:15:28Z","timestamp":1497600928000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1199388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/ccgrid.2003.1199388","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}