4 - Bitvectors
Published online by Cambridge University Press: 05 September 2016
- Type
- Chapter
- Information
- Compact Data StructuresA Practical Approach, pp. 64 - 102Publisher: Cambridge University PressPrint publication year: 2016
References
and (2002). Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1), 38–72.Google Scholar
, , and (2009). Hash, displace, and compress. In 17th Annual European Symposium on Algorithms (ESA), LNCS 5757, pages 682–693.Google Scholar
, , , and (2011). Theory and practice of monotone minimal perfect hashing. ACM Journal of Experimental Algorithmics, 16(3), article 2.Google Scholar
and (2014). High-order entropy compressed bit vectors with rank/select. Algorithms, 7, 608–620.Google Scholar
, , and (2013). Practical perfect hashing in nearly optimal space. Information Systems, 38(1), 108–131.Google Scholar
and (1999). Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5), 1627–1640.Google Scholar
and (1979). Universal classes of hash functions. Journal of Computer and System Sciences, 18(2), 143–154.Google Scholar
, , , and (2004). The Bloomier filter: an efficient data structure for static support lookup tables. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 30–39.Google Scholar
(1996). Compact PAT Trees. Ph.D. thesis, University of Waterloo, Canada.
and (2008). Practical rank/select queries over arbitrary sequences. In Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS 5280, pages 176–187.Google Scholar
, , , and (2009). Introduction to Algorithms. MIT Press, 3rd edition.
(1966). Comments on ‘Sequence time coding for data compression.’
Proceedings of the IEEE (Corresp.), 54, 2010.Google Scholar
, , and (2006). Engineering the LOUDS succinct tree representation. In Proc. 5th International Workshop on Experimental Algorithms (WEA), LNCS 4007, pages 134–145.Google Scholar
, , , and (2004). Engineering a sorted list data structure for 32 bit key. In Proc. 6thWorkshop on Algorithm Engineering and Experiments (ALENEX), pages 142–151.Google Scholar
(1974). Efficient storage and retrieval by content and address of static files. Journal of the ACM, 21, 246–260.Google Scholar
(1971). On the number of bits required to implement an associative memory. Memo 61, Computer Structures Group, Project MAC, Massachusetts.
and (2007). A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science, 371(1), 115–121.Google Scholar
, , , and (2006). When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM Transactions on Algorithms, 2(4), 611–639.Google Scholar
, , and (1984). Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3), 538–544.Google Scholar
and (2014). Optimized succinct data structures for massive data. Software Practice and Experience, 44(11), 1287–1314.Google Scholar
(2007). Optimal lower bounds for rank and select indexes. Theoretical Computer Science, 387(3), 348–359.Google Scholar
, , , , and (2007). On the size of succinct indices. In Proc. 15th Annual European Symposium on Algorithms (ESA), LNCS 4698, pages 371–382.Google Scholar
, , , and (2014). Optimal indexes for sparse bit vectors. Algorithmica, 69(4), 906–924.Google Scholar
, , , and (2005). Practical implementation of rank and select queries. In Proc. Posters of 4th Workshop on Efficient and Experimental Algorithms (WEA), pages 27–38.Google Scholar
, , , and (2009). More haste, less waste: Lowering the redundancy in fully indexable dictionaries. In Proc. 26th International Symposium on Theoretical Aspects of Computer Science (STACS), LIPIcs 3, pages 517–528.Google Scholar
, , , and (2007). Compressed data structures: Dictionaries and data-aware measures. Theoretical Computer Science, 387(3), 313–331.Google Scholar
, , and (2011). Succinct data structures for searchable partial sums with optimal worst-case performance. Theoretical Computer Science, 412(39), 5176–5186.Google Scholar
(1989). Space-efficient static trees and graphs. In Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pages 549–554.Google Scholar
, , and (2014). Hybrid compression of bitvectors for the FMindex. In Proc. 24th Data Compression Conference (DCC), pages 302–311.Google Scholar
(2009). The Art of Computer Programming, volume 4: Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. Addison-Wesley Professional.
and (1990). Bounded ordered dictionaries in O(log logN) time and O(n) space. Information Processing Letters, 35(4), 183–189.Google Scholar
and (1995). Randomized Algorithms. Cambridge University Press.
and (2008). Comparing integer data structures for 32 and 64 bit keys. In Proc. 10th Workshop on Algorithm Engineering and Experiments (ALENEX), LNCS 5038, pages 28–42.Google Scholar
and (2012). Fast, small, simple rank/select on bitmaps. In Proc. 11th International Symposium on Experimental Algorithms (SEA), LNCS 7276, pages 295–306.Google Scholar
and (2007). Practical entropy-compressed rank/select dictionary. In Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 60–70.Google Scholar
(2001). Low redundancy in static dictionaries with constant query time. SIAM Journal of Computing, 31(2), 353–363.Google Scholar
(2008). Succincter. In Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 305–313.Google Scholar
and (2010). Cell-probe lower bounds for succinct partial sums. In Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 117–122.Google Scholar
, , and (2007). Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms, 3(4), article 43.Google Scholar
(2008). Broadword implementation of rank/select queries. In Proc. 7th International Workshop on Experimental Algorithms (WEA), LNCS 5038, pages 154–168.Google Scholar
, , and (2013). Space-efficient, high-performance rank and select structures on uncompressed bit sequences. In Proc. 12th International Symposium on Experimental Algorithms (SEA), LNCS 7933, pages 151–163.Google Scholar