3 - Arrays
Published online by Cambridge University Press: 05 September 2016
- Type
- Chapter
- Information
- Compact Data StructuresA Practical Approach, pp. 39 - 63Publisher: Cambridge University PressPrint publication year: 2016
References
, , and (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley.
(1989). Programming Pearls. Addison-Wesley.
, , and (2013). DACs: Bringing direct access to variable-length codes. Information Processing and Management, 49(1), 392–404.Google Scholar
and (2010). Efficient set intersection for inverted indexing. ACM Transactions on Information Systems, 29(1), article 1.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 (2016). Practically efficient array initialization. Software Practice and Experience, 46(4), 435–467.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
(1984). Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science. Springer-Verlag.
(2014). Spaces, trees and colors: The algorithmic landscape of document retrieval on sequences. ACM Computing Surveys, 46(4), article 52.Google Scholar
and (2014). Partitioned Elias-Fano indexes. In Proc. 37th International Conference on Research and Development in Information Retrieval (SIGIR), pages 273–282.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
and (2007). Efficient document retrieval inmainmemory. In Proc. 30th Annual International Conference on Research and Development in Information Retrieval (SIGIR), pages 175–182.Google Scholar
and (2010). Engineering basic algorithms of an in-memory text search engine. ACM Transactions on Information Systems, 29(1), article 2.Google Scholar