{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:42Z","timestamp":1772164062643,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T00:00:00Z","timestamp":1439769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,17]]},"DOI":"10.1145\/2785956.2787474","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T10:09:20Z","timestamp":1440410960000},"page":"57-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Poptrie"],"prefix":"10.1145","author":[{"given":"Hirochika","family":"Asai","sequence":"first","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}]},{"given":"Yasuhiro","family":"Ohara","sequence":"additional","affiliation":[{"name":"NTT Communications Corporation, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2015,8,17]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"WIDE Project. http:\/\/www.wide.ad.jp\/.  WIDE Project. http:\/\/www.wide.ad.jp\/."},{"key":"e_1_3_2_2_2_1","unstructured":"WIDE Project MAWI Working Group Traffic Archive. http:\/\/mawi.wide.ad.jp\/mawi\/.  WIDE Project MAWI Working Group Traffic Archive. http:\/\/mawi.wide.ad.jp\/mawi\/."},{"key":"e_1_3_2_2_3_1","unstructured":"Intel(R) 64 and IA-32 Architectures Software Developer Manuals (version 052) Sept. 2014.  Intel(R) 64 and IA-32 Architectures Software Developer Manuals (version 052) Sept. 2014."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2188643"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.850216"},{"key":"e_1_3_2_2_6_1","volume-title":"ETSI","author":"Chiosi M.","year":"2012"},{"key":"e_1_3_2_2_7_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","edition":"2"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263133"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629578"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997160"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251099"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662938"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851207"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080116"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.241"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/365628.365655"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/280635"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/354871.354874"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185355"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2537857.2537859"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v008.i14"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1993.253403"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486009"},{"key":"e_1_3_2_2_26_1","first-page":"9","volume-title":"USENIX ATC","author":"Rizzo L.","year":"2012"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413185"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2537857.2537864"},{"key":"e_1_3_2_2_29_1","volume-title":"Parts 1--4: Fundamentals, Data Structures, Sorting, Searching","author":"Sedgewick R.","year":"1997","edition":"3"},{"key":"e_1_3_2_2_30_1","first-page":"93","volume-title":"Tree-Based Packet Routing Table for Berkeley Unix. In USENIX Winter Conference","author":"Sklower K.","year":"1991"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/296502.296503"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2537857.2537861"},{"key":"e_1_3_2_2_33_1","unstructured":"University of Oregon. Route Views Project. http:\/\/www.routeviews.org\/.  University of Oregon. Route Views Project. http:\/\/www.routeviews.org\/."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263136"},{"key":"e_1_3_2_2_35_1","volume-title":"Hacker's delight. Pearson Education","author":"Warren H. S.","year":"2013"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626297"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208657"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378961"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.880171"}],"event":{"name":"SIGCOMM '15: ACM SIGCOMM 2015 Conference","location":"London United Kingdom","acronym":"SIGCOMM '15","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2785956.2787474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:42:38Z","timestamp":1750210958000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787474"}},"subtitle":["A Compressed Trie with Population Count for Fast and Scalable Software IP Routing Table Lookup"],"short-title":[],"issued":{"date-parts":[[2015,8,17]]},"references-count":39,"alternative-id":["10.1145\/2785956.2787474","10.1145\/2785956"],"URL":"https:\/\/doi.org\/10.1145\/2785956.2787474","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2829988.2787474","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,17]]},"assertion":[{"value":"2015-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}