{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:15:00Z","timestamp":1742382900340},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407249"},{"type":"electronic","value":"9783540451723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45172-3_19","type":"book-chapter","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T18:40:01Z","timestamp":1295289601000},"page":"207-215","source":"Crossref","is-referenced-by-count":111,"title":["On the Feasibility of Peer-to-Peer Web Indexing and Search"],"prefix":"10.1007","author":[{"given":"Jinyang","family":"Li","sequence":"first","affiliation":[]},{"given":"Boon Thau","family":"Loo","sequence":"additional","affiliation":[]},{"given":"Joseph M.","family":"Hellerstein","sequence":"additional","affiliation":[]},{"given":"M. Frans","family":"Kaashoek","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Karger","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Morris","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Google Press Center: Technical Highlights, http:\/\/www.google.com\/press\/highlights.html","key":"19_CR1"},{"unstructured":"The Deep Web: Surfacing Hidden Value, http:\/\/www.press.umich.edu\/jep\/07-01\/bergman.html","key":"19_CR2"},{"unstructured":"Gnutella, http:\/\/gnutella.wego.com","key":"19_CR3"},{"unstructured":"Kazaa, http:\/\/www.kazza.com","key":"19_CR4"},{"unstructured":"Ingram: Record Industry Plays Hardball with Kazaa, http:\/\/www.globeandmail.com\/","key":"19_CR5"},{"unstructured":"Why Gnutella Can\u2019t Scale. No, Really, http:\/\/www.darkridge.com\/jpr5\/doc\/gnutella.html","key":"19_CR6"},{"doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM Conference, pp. 149\u2013160 (2001)","key":"19_CR7","DOI":"10.1145\/383059.383071"},{"doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalablen Content Addressable Network. In: Proceedings of the ACM SIGCOM Conference (2001)","key":"19_CR8","DOI":"10.1145\/383059.383072"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, p. 329. Springer, Heidelberg (2001)"},{"unstructured":"Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. UC Berkeley Technical Report (2001) UCB\/CSD-01-1141","key":"19_CR10"},{"doi-asserted-by":"crossref","unstructured":"Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching (2002) (unpublished manuscript)","key":"19_CR11","DOI":"10.1007\/3-540-44892-6_2"},{"unstructured":"Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information Retrieval in Structured Overlays. In: The First Workshop on Hot Topics in Networks, HotNets-I (2002)","key":"19_CR12"},{"doi-asserted-by":"crossref","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: 1st International Workshop on Peer-to-Peer Systems, IPTPS (2002)","key":"19_CR13","DOI":"10.1007\/3-540-45748-8_23"},{"unstructured":"Gnawali, O.D.: A Keyword Set Search System for Peer-to-Peer Networks. Master Thesis, Massachusetts Institute of Technology (2002)","key":"19_CR14"},{"unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Library Technologies Project (1998)","key":"19_CR15"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/65.642356","volume":"11","author":"K. Thompson","year":"1997","unstructured":"Thompson, K., Miller, G., Wilder, R.: Wide-area Traffic Patterns and Characteristics. IEEE Network\u00a011(6), 10\u201323 (1997)","journal-title":"IEEE Network"},{"unstructured":"Boardwatch Magazine\u2019s Directory of Internet Service Providers (1999)","key":"19_CR17"},{"doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Compressed Bloom Filters. In: Twentieth ACM Symposium on Principles of Distributed Computing (2001)","key":"19_CR18","DOI":"10.1145\/383962.384004"},{"unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images (1999)","key":"19_CR19"},{"unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Ian Munro, J.: Adaptive Set Intersections, Unions, and Differences. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000 (2000)","key":"19_CR20"},{"doi-asserted-by":"crossref","unstructured":"Hofmann, T.: Probabilistic Latent Semantic Analysis. In: Proceedings of Uncertainty in Artificial Intelligence (1999)","key":"19_CR21","DOI":"10.1145\/312624.312649"},{"doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal Aggregation Algorithms for Middleware. In: Symposium on Principles of Database Systems (2001)","key":"19_CR22","DOI":"10.1145\/375551.375567"},{"doi-asserted-by":"crossref","unstructured":"Hellerstein, J.M., Avnur, R., Chou, A., Olston, C., Raman, V., Roth, T., Hidber, C., Haas, P.: Interactive Data Analysis with CONTROL. IEEE Computer (1999)","key":"19_CR23","DOI":"10.1109\/2.781635"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45172-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T22:50:42Z","timestamp":1559947842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45172-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407249","9783540451723"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45172-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}