{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:56:05Z","timestamp":1725494165293},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768364"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76837-1_23","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T10:25:50Z","timestamp":1194344750000},"page":"190-198","source":"Crossref","is-referenced-by-count":0,"title":["Pampoo: An Efficient Skip-Trie Based Query Processing Framework for P2P Systems"],"prefix":"10.1007","author":[{"given":"Li","family":"Meifang","sequence":"first","affiliation":[]},{"given":"Zhu","family":"Hongkai","sequence":"additional","affiliation":[]},{"given":"Shen","family":"Derong","sequence":"additional","affiliation":[]},{"given":"Nie","family":"Tiezheng","sequence":"additional","affiliation":[]},{"given":"Kou","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","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: SIGCOMM 2001 (2001)","DOI":"10.1145\/383059.383071"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Druschel, P., Rowstron, A.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Middleware (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4236.978370","volume":"6","author":"K. Aberer","year":"2002","unstructured":"Aberer, K., Punceva, M., Hauswirth, M., Schmidt, R.: Improving data access in P2P systems. IEEE Internet Computing\u00a06(1), 58\u201367 (2002)","journal-title":"IEEE Internet Computing"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Aberer, K., Cudr\u00e9-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: A Self organizing Structured P2P System. In: ACM SIGMOD Record (2003)","DOI":"10.1145\/945721.945729"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"23_CR6","unstructured":"Cuenca-Acuna, F.M., et al.: PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities. Technical Report DCS-TR-487, Rutgers University (September 2002)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., et al.: A scalable content-addressable network. In: SIGCOMM 2001 (2001)","DOI":"10.1145\/383059.383072"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Ramabhadran, S., Ratnasamy, S., Hellerstein, J., Shenker, S.: Brief Announcement: Prefix Hash Tree. In: Proc. of PODC 2004 (2004)","DOI":"10.1145\/1011767.1011823"},{"key":"23_CR9","volume-title":"Proc. ACM SIGCOMM 2001","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM 2001, ACM Press, New York (2001)"},{"key":"23_CR10","volume-title":"ACM PODC 2004","author":"J. Aspnes","year":"2004","unstructured":"Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancing and locality in range-queriable data structures. In: ACM PODC 2004, ACM Press, New York (2004)"},{"key":"23_CR11","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: ACM-SIAM Symposium on Discrete Algorithms(January 2003)"},{"key":"23_CR12","unstructured":"Harvey, N., et al.: SkipNet: A scalable overlay network with practical locality preserving properties. In: Proc.of 4th USENIX Symp. on Internet Technologies and Systems (2003)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Mei Li.DP-tree: A Balanced Tree-based Indexing Framework for Peer-to-Peer Systems. In Proc. Of icnp 2006 (2006)","DOI":"10.1109\/ICNP.2006.320194"},{"key":"23_CR14","unstructured":"Datta, A., et,: al. Range queries in trie-structured overlays. In: Proc. of P2P 2005 (2005)"},{"key":"23_CR15","first-page":"301","volume-title":"15th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"K.C. Zatloukal","year":"2004","unstructured":"Zatloukal, K.C., Harvey, N.J.A.: Family Trees:An ordered dictionary with optimal congestion, locality, degree, and search time. In: 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 301\u2013310. ACM Press, New York (2004)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Know thy neighbor\u2019s neighbor: Better routing in skip-graphs and small worlds. In: 3rd Int. Workshop on Peer-to-Peer Systems (2004)","DOI":"10.1007\/978-3-540-30183-7_26"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Abraham, I., Aspnes, J., Yuan, J.: Skip B-Trees. In: Proc. of Opodis 2005 (2005)","DOI":"10.1007\/11795490_28"},{"key":"23_CR18","unstructured":"Gupta, A., Agrawal, D., Abbadi, A.E.: Approximate Range Selection Queries in Peer-to-Peer Systems. In: CIDR 2003. 1st Biennial Conference on Innovative Data Systems Research (2003)"},{"key":"23_CR19","unstructured":"Sahin, O.D., Gupta, A., Agrawal, D., Abbadi., A.E., Peer-to-peer, A.: Framework for Caching Range Queries. In: 20th ICDE 2004 (2004)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: Proc. of VLDB 2004 (2004)","DOI":"10.1016\/B978-012088469-8.50041-3"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM\u00a033(6) (1990)","DOI":"10.1145\/78973.78977"},{"key":"23_CR22","unstructured":"Risson, J., Moors, T.: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods. Technical Report UNSW-EE-P2P-1-1, University of New South Wales, Sydney, Australia (September 2004)"}],"container-title":["Lecture Notes in Computer Science","Advanced Parallel Processing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76837-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:40:52Z","timestamp":1619520052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76837-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540768364"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76837-1_23","relation":{},"subject":[]}}