{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:51:48Z","timestamp":1743079908184,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540795483"},{"type":"electronic","value":"9783540795490"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-79549-0_49","type":"book-chapter","created":{"date-parts":[[2008,5,5]],"date-time":"2008-05-05T19:12:23Z","timestamp":1210014743000},"page":"562-573","source":"Crossref","is-referenced-by-count":3,"title":["The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Behdadfar","sequence":"first","affiliation":[]},{"given":"Hossein","family":"Saidi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"14","key":"49_CR1","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 Practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM\u00a015(14), 514\u2013534 (1968)","journal-title":"Journal of the ACM"},{"issue":"1","key":"49_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/296502.296503","volume":"17","author":"V. Sirinivasan","year":"1999","unstructured":"Sirinivasan, V., Varghes, G.: Faster IP lookup using controlled prefix expansion. ACM Transactions on computer systems\u00a017(1), 1\u201340 (1999)","journal-title":"ACM Transactions on computer systems"},{"issue":"6","key":"49_CR3","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/49.772439","volume":"17","author":"S. Nilson","year":"1999","unstructured":"Nilson, S., Karlsson, G.: IP address lookup using LC-tries. IEEE Journal of selected Areas in communications\u00a017(6), 1083\u20131092 (1999)","journal-title":"IEEE Journal of selected Areas in communications"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Gupta, P., lin, S., McKeown, N.: Routing lookups in Hardware at Memory Access Speeds. In: Proceedings of IEEE Infocom, vol.\u00a03, pp. 1240\u20131247 (1998)","DOI":"10.1109\/INFCOM.1998.662938"},{"key":"49_CR5","unstructured":"Shad, D., Gupta, P.: Fast Incremental updates on ternary-CAMs for routing lookups and Packet classification. In: Proceedings of Hot Interconnects VIII. (2000), IEEE Micro. (2001)"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. In: Proceedings of IEEE Infocom, vol.\u00a03, pp. 1248\u20131256 (1998)","DOI":"10.1109\/INFCOM.1998.662939"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Yazdani, N., Min, P.: Prefix Trees: new Efficient Data Structures for Matching Strings of Different length. In: Ideas 2001, pp. 76\u201385 (2001)","DOI":"10.1109\/IDEAS.2001.938073"},{"key":"49_CR8","unstructured":"Behdadfar, M.: Review and Improvement of Longest Matching Prefix Problem in IP Network, MSC thesis, Isfahan University of Technology (2002)"},{"issue":"7","key":"49_CR9","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1109\/TC.2005.104","volume":"54","author":"H. Lu","year":"2005","unstructured":"Lu, H., Sahni, S.: A B-Tree Dynamic Router-Table Design. IEEE transactions on computers\u00a054(7), 813\u2013824 (2005)","journal-title":"IEEE transactions on computers"},{"key":"49_CR10","unstructured":"Sun, Q., Zhaho, X., Huang, X., Jiang, W., Ma, Y.: A Scalable Exact Matching in Balance Tree Scheme for IPv6 Lookup. In: ACM SIGCOMM 2007 data communication festival, IPv6 2007 (2007)"},{"key":"49_CR11","series-title":"Hill Book Company","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1999","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. Hill Book Company. McGraw-Hill, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79549-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T02:29:20Z","timestamp":1738204160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79549-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540795483","9783540795490"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79549-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}