Intersection in integer inverted indices

Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2007, Pages 71-83

  Sanders, Peter ^a   Transier, Frederik ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; INDEXING (OF INFORMATION); INTEGER PROGRAMMING; SPECTRUM ANALYSIS;

INTEGER KEYS; SPACE EFFICIENCY;

DATA STRUCTURES;

EID: 34547960908     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972870.7     Document Type: Conference Paper

References (10)

1. Hwang, F.K., Lin, S.: Optimal merging of 2 elements with n elements. Acta Informatica 1 (1971) 145-158
2. Baeza-Yates, R.: A fast set intersection algorithm for sorted sequences. In: 15th Symposium on Combinatorial Pattern Matching. Volume 3109 of LNCS. (2004) 400-408
3. Baeza-Yates, R.A., Salinger, A.: Experimental analysis of a fast intersection algorithm for sorted sequences. In: String Processing and Information Retrieval, 12th International Conference. Volume 3772 of LNCS., Springer (2005) 13-24
4. Barbay, J., López-Ortiz, A., Lu, T.: Faster adaptive set intersections for text searching. In Alvarez, C., Serna, M.J., eds.: Experimental Algorithms, 5th International Workshop, WEA. Volume 4007 of LNCS., Springer (2006) 146-157
5. Demaine, E.D., López-Ortiz, A., Munro, J.I.: Experiments on adaptive set intersections for text retrieval systems. In: Algorithm Engineering and Experimentation, 3rd International Workshop, ALENEX. Volume 2153 of LNCS., Springer (2001) 91-104
6. Moffat, A., Zobel, J.: Self-indexing inverted files for fast text retrieval. ACM Transactions on Information Systems 14 (1996) 349-379
7. Dementiev, R., Sanders, P.: Asynchronous parallel disk sorting. In: 15th ACM Symposium on Parallelism in Algorithms and Architectures, San Diego (2003) 138-148
8. Blandford, D.: Compact Data Structures for Fast Queries. PhD thesis, CMU (2005)
9. Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing 17 (1988) 373-386
10. Dementiev, R., Sanders, P., Schultes, D., Sibeyn, J.: Engineering an external memory minimum spanning tree algorithm. In: IFIP TCS, Toulouse (2004)