{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:06Z","timestamp":1760202606304},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_18","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T01:21:40Z","timestamp":1297300900000},"page":"170-181","source":"Crossref","is-referenced-by-count":5,"title":["Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Kniesburges","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, January 12-14, pp. 384\u2013393 (2003)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/872035.872053","volume-title":"Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, PODC 2003","author":"B. Awerbuch","year":"2003","unstructured":"Awerbuch, B., Scheideler, C.: Peer-to-peer systems for prefix search. In: Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 123\u2013132. ACM, New York (2003), http:\/\/doi.acm.org\/10.1145\/872035.872053"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/320521.320530","volume":"2","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Unterauer, K.: Prefix b-trees. ACM Trans. Database Syst.\u00a02(1), 11\u201326 (1977), doi:10.1145\/320521.320530","journal-title":"ACM Trans. Database Syst."},{"key":"18_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press\/McGraw-Hill (2001)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory\u00a010, 99\u2013127 (1977)","journal-title":"Mathematical Systems Theory"},{"key":"18_CR6","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn., vol.\u00a03. Addison Wesley, Reading (1997)","edition":"2"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Kumar, S., Turner, J.S., Crowley, P., Mitzenmacher, M.: Hexa: Compact data structures for faster packet processing. In: ICNP, pp. 246\u2013255 (2007)","DOI":"10.1109\/ICNP.2007.4375855"},{"key":"18_CR8","first-page":"19","volume-title":"SIGMOD Conference","author":"W. Litwin","year":"1981","unstructured":"Litwin, W.: Trie hashing. In: Lien, Y.E. (ed.) SIGMOD Conference, pp. 19\u201329. ACM Press, New York (1981)"},{"issue":"7","key":"18_CR9","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1109\/32.83904","volume":"17","author":"W. Litwin","year":"1991","unstructured":"Litwin, W., Roussopoulos, N., L\u00e9vy, G., Hong, W.: Trie hashing with controlled load. IEEE Trans. Software Eng.\u00a017(7), 678\u2013691 (1991)","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R.: Patricia\u2014practical algorithm to retrieve information coded in alphanumeric. J. ACM\u00a015(4), 514\u2013534 (1968)","journal-title":"J. ACM"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. CoRR abs\/cs\/0603043 (2006)","DOI":"10.1145\/1132516.1132551"},{"key":"18_CR12","unstructured":"Ramabhadran, S., Hellerstein, J., Ratnasamy, S., Shenker, S.: Prefix hash tree - an indexing data structure over distributed hash tables, http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.58.617"},{"key":"18_CR13","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.I.T. Rowstron","year":"2001","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001), http:\/\/portal.acm.org\/citation.cfm?id=646591.697650"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/383059.383071","volume-title":"SIGCOMM 2001: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","author":"I. Stoica","year":"2001","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: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149\u2013160. ACM, New York (2001)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/277697.277765","volume-title":"PODC 1998: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing","author":"M. Waldvogel","year":"1998","unstructured":"Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable best matching prefix lookups. In: PODC 1998: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, p. 312. ACM, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:47:56Z","timestamp":1559983676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}