{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:52:54Z","timestamp":1725511974094},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717027"},{"type":"electronic","value":"9783540717034"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71703-4_93","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T00:31:22Z","timestamp":1186014682000},"page":"1007-1012","source":"Crossref","is-referenced-by-count":3,"title":["Indexing Textual XML in P2P Networks Using Distributed Bloom Filters"],"prefix":"10.1007","author":[{"given":"Clement","family":"Jamard","sequence":"first","affiliation":[]},{"given":"Georges","family":"Gardarin","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"93_CR1","unstructured":"Abiteboul, S., Manolescu, I., Preda, N.: Sharing Content in Structured P2P Networks. In: BDA (2005)"},{"issue":"7","key":"93_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970), citeseer.ist.psu.edu\/bloom70spacetime.html","journal-title":"Communications of the ACM"},{"key":"93_CR3","unstructured":"Gardarin, G., Dragan, F., Yeh, L.: P2P Semantic Mediation of Web Sources. In: ICEIS. 1, pp. 7\u201315 (2006)"},{"key":"93_CR4","unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H.: BATON: A Balanced Tree Structure for Peer-to-Peer Networks. In: VLDB, pp. 661\u2013672 (2005)"},{"key":"93_CR5","doi-asserted-by":"crossref","unstructured":"Koloniari, G., Petrakis, Y., Pitoura, E.: Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters. In: DBISP2P, pp. 232\u2013247 (2003)","DOI":"10.1007\/978-3-540-24629-9_17"},{"key":"93_CR6","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A Scalable Content-addressable Network. In: SIGCOMM, pp. 161\u2013172 (2001)","DOI":"10.1145\/383059.383072"},{"key":"93_CR7","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, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"93_CR8","first-page":"149","volume-title":"Proceedings of the 2001 ACM SIGCOMM Conference","author":"I. Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149\u2013160. ACM Press, New York (2001), citeseer.ist.psu.edu\/stoica01chord.html"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases: Concepts, Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71703-4_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:55:02Z","timestamp":1619517302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71703-4_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717027","9783540717034"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71703-4_93","relation":{},"subject":[]}}