{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:48Z","timestamp":1740098928242,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319674278"},{"type":"electronic","value":"9783319674285"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67428-5_19","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:22:24Z","timestamp":1504560144000},"page":"221-233","source":"Crossref","is-referenced-by-count":7,"title":["Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5462-122X","authenticated-orcid":false,"given":"Shunsuke","family":"Kanda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Morita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Fuketa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/s00778-010-0183-9","volume":"19","author":"N Askitis","year":"2010","unstructured":"Askitis, N., Sinha, R.: Engineering scalable, cache and space efficient tries for strings. VLDB J. 19(5), 633\u2013660 (2010)","journal-title":"VLDB J."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11575832_11","volume-title":"String Processing and Information Retrieval","author":"N Askitis","year":"2005","unstructured":"Askitis, N., Zobel, J.: Cache-conscious collision resolution in string hash tables. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 91\u2013102. Springer, Heidelberg (2005). doi: 10.1007\/11575832_11"},{"unstructured":"Baskins, D.: Judy IV Shop Manual (2002)","key":"19_CR3"},{"doi-asserted-by":"crossref","unstructured":"Boldi, P., Codenotti, B., Santini, M., Vigna, S.: Ubicrawler: a scalable fully distributed web crawler. Softw. Pract. Exp. 34(8), 711\u2013726 (2004)","key":"19_CR4","DOI":"10.1002\/spe.587"},{"doi-asserted-by":"crossref","unstructured":"Darragh, J.J., Cleary, J.G., Witten, I.H.: Bonsai: a compact representation of trees. Softw. Pract. Exp. 23(3), 277\u2013291 (1993)","key":"19_CR5","DOI":"10.1002\/spe.4380230305"},{"doi-asserted-by":"crossref","unstructured":"Ferragina, P., Grossi, R., Gupta, A., Shah, R., Vitter, J.S.: On searching compressed string collections cache-obliviously. In: Proceedings of 27th Symposium on Principles of Database Systems (PODS), pp. 181\u2013190 (2008)","key":"19_CR6","DOI":"10.1145\/1376916.1376943"},{"unstructured":"Gonz\u00e1lez, R., Grabowski, S., M\u00e4kinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proceedings of 4th Workshop on Experimental and Efficient Algorithms (WEA), pp. 27\u201338 (2005)","key":"19_CR7"},{"doi-asserted-by":"crossref","unstructured":"Grossi, R., Ottaviano, G.: Fast compressed tries through path decompositions. ACM J. Exp. Algorithmics 19(1) (2014). Article 1.8","key":"19_CR8","DOI":"10.1145\/2656332"},{"issue":"2","key":"19_CR9","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. Web Semant. Sci. Serv. Agents World Wide Web 3(2), 158\u2013182 (2005)","journal-title":"Web Semant. Sci. Serv. Agents World Wide Web"},{"issue":"1","key":"19_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S1389-1286(00)00063-3","volume":"33","author":"J Hirai","year":"2000","unstructured":"Hirai, J., Raghavan, S., Garcia-Molina, H., Paepcke, A.: WebBase: a repository of web pages. Comput. Netw. 33(1), 277\u2013293 (2000)","journal-title":"Comput. Netw."},{"doi-asserted-by":"crossref","unstructured":"Hsu, B.J.P., Ottaviano, G.: Space-efficient data structures for top-k completion. In: Proceedings of 22nd International Conference on World Wide Web (WWW), pp. 583\u2013594 (2013)","key":"19_CR11","DOI":"10.1145\/2488388.2488440"},{"issue":"3","key":"19_CR12","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1007\/s10115-016-0999-8","volume":"51","author":"S Kanda","year":"2017","unstructured":"Kanda, S., Morita, K., Fuketa, M.: Compressed double-array tries for string dictionaries supporting fast lookup. Knowl. Inf. Syst. 51(3), 1023\u20131042 (2017)","journal-title":"Knowl. Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Kanda, S., Morita, K., Fuketa, M.: Practical string dictionary compression using string dictionary encoding. In: Proceedings of 3rd International Conference on Big Data Innovations and Applications (Innovate-Data), pp. 1\u20138 (2017)","key":"19_CR13","DOI":"10.1109\/Innovate-Data.2017.9"},{"key":"19_CR14","volume-title":"The Art of Computer Programming: Volume 3: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Volume 3: Sorting and Searching, 2nd edn. Addison Wesley, Redwood City (1998)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of IEEE 29th International Conference on Data Engineering (ICDE), pp. 38\u201349 (2013)","key":"19_CR15","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.is.2015.08.008","volume":"56","author":"MA Mart\u00ednez-Prieto","year":"2016","unstructured":"Mart\u00ednez-Prieto, M.A., Brisaboa, N., C\u00e1novas, R., Claude, F., Navarro, G.: Practical compressed string dictionaries. Inf. Syst. 56, 73\u2013108 (2016)","journal-title":"Inf. Syst."},{"doi-asserted-by":"publisher","unstructured":"Mavlyutov, R., Wylot, M., Cudre-Mauroux, P.: A comparison of data structures to manage URIs on the web of data. In: Gandon, F., Sabou, M., Sack, H., d\u2019Amato, C., Cudr\u00e9-Mauroux, P., Zimmermann, A. (eds.) ESWC 2015. LNCS, vol. 9088, pp. 137\u2013151. Springer, Cham (2015). doi: 10.1007\/978-3-319-18818-8_9","key":"19_CR17","DOI":"10.1007\/978-3-319-18818-8_9"},{"issue":"4","key":"19_CR18","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"DR Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA: practical algorithm to retrieve information coded in alphanumeric. J. ACM 15(4), 514\u2013534 (1968)","journal-title":"J. ACM"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-23826-5_31","volume-title":"String Processing and Information Retrieval","author":"A Poyias","year":"2015","unstructured":"Poyias, A., Raman, R.: Improved practical compact dynamic tries. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 324\u2013336. Springer, Cham (2015). doi: 10.1007\/978-3-319-23826-5_31"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-44543-4_17","volume-title":"Combinatorial Algorithms","author":"T Takagi","year":"2016","unstructured":"Takagi, T., Inenaga, S., Sadakane, K., Arimura, H.: Packed compact tries: a fast and efficient data structure for online string processing. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 213\u2013225. Springer, Cham (2016). doi: 10.1007\/978-3-319-44543-4_17"},{"issue":"3","key":"19_CR21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/comjnl\/42.3.193","volume":"42","author":"HE Williams","year":"1999","unstructured":"Williams, H.E., Zobel, J.: Compressing integers for fast file access. Comput. J. 42(3), 193\u2013201 (1999)","journal-title":"Comput. J."},{"unstructured":"Yoshinaga, N., Kitsuregawa, M.: A self-adaptive classifier for efficient text-stream processing. In: Proceedings of 24th International Conference on Computational Linguistics (COLING), pp. 1091\u20131102 (2014)","key":"19_CR22"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67428-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T23:59:43Z","timestamp":1570060783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67428-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674278","9783319674285"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67428-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}