{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:12Z","timestamp":1725544032054},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_14","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T04:37:56Z","timestamp":1148013476000},"page":"158-169","source":"Crossref","is-referenced-by-count":8,"title":["Compressed Dictionaries: Space Measures, Data Sets, and Experiments"],"prefix":"10.1007","author":[{"given":"Ankur","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kai","family":"Hon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, A., Thorup, M.: Tight(er) worst-case bounds on dynamic searching and priority queues. In: Proceedings of the ACM Symposium on Theory of Computing (2000)","DOI":"10.1145\/335305.335344"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Beame, P., Fich, F.: Optimal bounds for the predecessor problem. In: Proceedings of the ACM Symposium on Theory of Computing (1999)","DOI":"10.1145\/301250.301323"},{"issue":"9","key":"14_CR3","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1002\/(SICI)1097-4571(199310)44:9<508::AID-ASI2>3.0.CO;2-A","volume":"44","author":"T.C. Bell","year":"1993","unstructured":"Bell, T.C., Moffat, A., Nevill-Manning, C.G., Witten, I.H., Zobel, J.: Data compression in full-text retrieval systems. Journal of the American Society for Information Science\u00a044(9), 508\u2013531 (1993)","journal-title":"Journal of the American Society for Information Science"},{"key":"14_CR4","unstructured":"Blandford, D., Blelloch, G.: Compact representations of ordered sets. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2004)"},{"issue":"5","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1137\/S0097539795294165","volume":"28","author":"A. Brodnik","year":"1999","unstructured":"Brodnik, A., Munro, I.: Membership in constant time and almost-minimum space. SIAM Journal on Computing\u00a028(5), 1627\u20131640 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"IT-21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory\u00a0IT-21, 194\u2013203 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Grossi, R., Sadakane, K.: Squeezing succinct data structures into entropy bounds. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2006)","DOI":"10.1145\/1109557.1109693"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hon, W., Shah, R., Vitter, J.: Compressed data structures: Dictionaries and data-aware measures. In: Proceedings of the IEEE Data Compression Conference (2006)","DOI":"10.1109\/DCC.2006.12"},{"key":"14_CR9","unstructured":"Jacobson, G.: Succinct static data structures. Technical Report CMU-CS-89-112, Carnegie-Mellon University (1989)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Klein, S.T., Shapira, D.: Searching in compressed dictionaries. In: Proceedings of the IEEE Data Compression Conference (2002)","DOI":"10.1109\/DCC.2002.999952"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume":"16","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I.: Tables. Foundations of Software Technology and Theoretical Computer Science\u00a016, 37\u201342 (1996)","journal-title":"Foundations of Software Technology and Theoretical Computer Science"},{"key":"14_CR12","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 233\u2013242 (2002)"},{"key":"14_CR13","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. Math. Systems Theory\u00a010, 99\u2013127 (1977)","journal-title":"Math. Systems Theory"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0022-0000(84)90020-5","volume":"28","author":"D.E. Willard","year":"1984","unstructured":"Willard, D.E.: New trie data structures which support very fast search operations. Journal of Computer and System Sciences\u00a028(3), 379\u2013394 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR15","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, San Francisco (1999)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:10:50Z","timestamp":1619493050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11764298_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}