Broadword implementation of rank/select queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5038 LNCS, Issue , 2008, Pages 154-168

  Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BASIC (PROGRAMMING LANGUAGE); EVOLUTIONARY ALGORITHMS; FILE ORGANIZATION; INTEGER PROGRAMMING; KETONES; NUMERICAL METHODS; SET THEORY; SPACE RESEARCH; STANDARDS;

ASYMPTOTICALLY OPTIMAL; BASIC BUILDING BLOCKS; BUILDING BLOCKS; EXPERIMENTAL ALGORITHMS; INTERNATIONAL (CO); LOWER BOUNDS; PRACTICAL APPLICATIONS; SUCCINCT DATA STRUCTURES;

DATA STRUCTURES;

EID: 45449089651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_12     Document Type: Conference Paper

References (15)

1. Jacobson, G.: Space-efficient static trees and graphs. In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, pp. 549-554. IEEE, Los Alamitos (1989)
2. Golynski, A.: Optimal lower bounds for rank and select indexes. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 370-381. Springer, Heidelberg (2006)
3. Gonz̀lez, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA 2005), pp. 27-38. CTI Press, Ellinika Grammata (2005)
4. Knuth, D.E.: The Art of Computer Programming. Pre-Fascicle 1A. Draft of Section 7.1.3: Bitwise Tricks and Techniques (2007)
5. Fisher, R.J., Dietz, H.G.: Compiling for SIMD within a register. In: Carter, L., Ferrante, J., Sehr, D., Chatterjee, S., Prins, J.F., Li, Z., Yew, P.-C. (eds.) LCPC 1998. LNCS, vol. 1656, pp. 290-304. Springer, Heidelberg (1999)
6. Lamport, L.: Multiple byte processing with full-word instructions. Comm. ACM 18(8), 471-475 (1975)
7. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47(3), 424-436 (1993)
8. Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 159-172. Springer, Heidelberg (2004)
9. Dijkstra, E.W.: Why numbering should start at zero. EWD, p. 831 (1982)
10. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. of the Workshop on Algorithm Engineering and Experiments, ALENEX 2007, SIAM, Philadelphia (2007)
11. Elias, P.: Efficient storage and retrieval by content and address of static files. J. Assoc. Com-put. Mach. 21(2), 246-260 (1974)
12. Fano, R.M.: On the number of bits required to implement an associative memory. In: Memorandum 61, Computer Structures Group, Project MAC, MIT, Cambridge, Mass., n.d (1971)
13. Kim, D.K., Na, J.C., Kim, J.E., Park, K.: Efficient implementation of rank and select functions for succinct representation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 315-327. Springer, Heidelberg (2005)
14. Clark, D.R.: Compact Pat Trees. PhD thesis, University of Waterloo, Waterloo, Ont., Canada (1998)
15. Delpratt, O., Rahman, N., Raman, R.: Compressed prefix sums. In: van Leeuwen, J., Ital-iano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pĺ̌il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 235-247. Springer, Heidelberg (2007)