{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:31:24Z","timestamp":1725550284031},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292357"},{"type":"electronic","value":"9783540320715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564621_12","type":"book-chapter","created":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T15:05:50Z","timestamp":1129129550000},"page":"112-117","source":"Crossref","is-referenced-by-count":1,"title":["pKSS: An Efficient Keyword Search System in DHT Peer-to-Peer Network"],"prefix":"10.1007","author":[{"given":"Yin","family":"Li","sequence":"first","affiliation":[]},{"given":"Fanyuan","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM 2001 (August 2001)","DOI":"10.1145\/383059.383071"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proc. Middleware (November 2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"12_CR3","unstructured":"Omprakash, D.G.: A Keyword-set Search System for Peer-to-Peer Networks. MIT\u2019s thesis Lib. (2002)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. Technical Report 2002, Duke University, CS Department (February 2002)","DOI":"10.1007\/3-540-44892-6_2"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_19","volume-title":"Peer-to-Peer Systems II","author":"J. Li","year":"2003","unstructured":"Li, J., Loo, B.T., et al.: On the Feasibility of Peer-to-Peer Web Indexing and Search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-30183-7_15","volume-title":"Peer-to-Peer Systems III","author":"S. Shi","year":"2005","unstructured":"Shi, S., Yang, G., Wang, D., Yu, J., Qu, S., Chen, M.: Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 151\u2013161. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Distributed and Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564621_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:53:12Z","timestamp":1605642792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564621_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292357","9783540320715"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11564621_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}