{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:41Z","timestamp":1725558881475},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245513"},{"type":"electronic","value":"9783540318422"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31842-2_4","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T15:50:41Z","timestamp":1278258641000},"page":"31-40","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Evaluation of Nearest-Neighbor Queries in Content-Addressable Networks"],"prefix":"10.1007","author":[{"given":"Erik","family":"Buchmann","sequence":"first","affiliation":[]},{"given":"Klemens","family":"B\u00f6hm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Proceedings of the ACM SIGCOMM 2001 Conference","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content- Addressable Network. In: Proceedings of the ACM SIGCOMM 2001 Conference. ACM Press, New York (2001)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45748-8_23","volume-title":"Peer-to-Peer Systems","author":"M. Harren","year":"2002","unstructured":"Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 242. Springer, Heidelberg (2002)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Buchmann, E., B\u00f6hm, K.: How to Run Experiments with Large Peer-to-Peer Data Structures. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium, Santa Fe, USA (2004)","DOI":"10.1109\/IPDPS.2004.1302938"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Tauscher, L., Greenberg, S.: How people revisit web pages: empirical findings and implications for the design of history systems. International Journal of Human-Computer Studies (1997)","DOI":"10.1006\/ijhc.1997.0125"},{"key":"4_CR5","volume-title":"Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data","author":"W. Litwin","year":"1993","unstructured":"Litwin, W., Neimat, M.A., Schneider, D.A.: LH* - Linear Hashing for Distributed Files. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C. ACM Press, New York (1993)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer- To-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM 2001 Conference (2001)","DOI":"10.1145\/383059.383071"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: IFIP\/ACM International Conference on Distributed Systems Platforms (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R., Raghavan, P., Vempala, S.: Locality-Preserving Hashing in Multidimensional Spaces. In: Proceedings of the Twenty-Ninth Annual ACMSymposium on Theory of Computing, El Paso, Texas (1997)","DOI":"10.1145\/258533.258656"},{"key":"4_CR9","volume-title":"Proceedings of the VLDB 1999","author":"A. Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the VLDB 1999. Morgan Kaufmann, San Francisco (1999)"},{"key":"4_CR10","unstructured":"Sattler, K.U., R\u00f6sch, P., Buchmann, E., B\u00f6hm, K.: A Physical Query Algebra for DHTbased P2P Systems. In: Proceedings of the 6thWorkshop on Distributed Data and Structures, Lausanne, Switzerland (2004)"}],"container-title":["Lecture Notes in Computer Science","From Integrated Publication and Information Systems to Information and Knowledge Environments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31842-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:41:56Z","timestamp":1619998916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31842-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245513","9783540318422"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31842-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}