Compression of Boolean inverted files by document ordering

NLP-KE 2003 - 2003 International Conference on Natural Language Processing and Knowledge Engineering, Proceedings

Volumn , Issue , 2003, Pages 244-249

  Gelbukh, Alexander ^a,b   Han, SangYong ^b   Sidorov, Grigori ^a  

^a INSTITUTO POLITÉCNICO NACIONAL   (Mexico)

^b Chung Ang University   (South Korea)

Author keywords

Boolean search; Information retrieval; Inverted file size; Traveling salesman problem

Indexed keywords

COMPUTATIONAL LINGUISTICS; HAMMING DISTANCE; INFORMATION RETRIEVAL; INFORMATION RETRIEVAL SYSTEMS; KNOWLEDGE ENGINEERING; SEARCH ENGINES; TRAVELING SALESMAN PROBLEM;

BOOLEAN QUERIES; BOOLEAN SEARCH; DOCUMENT COLLECTION; INVERTED FILES; NEAR-OPTIMAL; STORAGE OVERHEAD;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 27644554778     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NLPKE.2003.1275907     Document Type: Conference Paper

References (5)

1. R. Baeza-Yates, B. Ribeiro-Neto: Modern Information Retrieval. ACM Press/Addison-Wesley 1999.
2. G. Cohen, S. Litsyn and G. Zémor, On the traveling salesman problem in binary Hamming spaces, IEEE Trans. Info. Theory, vol. 42, 1996, pp. 1274-1276, citeseer.nj.nec.com/cohen96traveling.html.
3. D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis II. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6(3):563-581, 1977.
4. Alizadeh,F., Karp,K., NewbergX., and Weisser,D. (1993). Physical mapping of chromosomes: A combinatorial problem in molecular biology. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 371-381. ACM Press.
5. Cystic Fibrosis text collection, cse.hanyang.ackr/~jmclioi/class-old/2001-1/ir/homeworks.html.