Inverted files for text search engines

ACM Computing Surveys

Volumn 38, Issue 2, 2006, Pages

  Zobel, Justin ^a   Moffat, Alistair ^b  

^a RMIT UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Document database; Information retrieval; Inverted file indexing; Text retrieval; Web search engine

Indexed keywords

DATA ACQUISITION; INDEXING (OF INFORMATION); INFORMATION TECHNOLOGY; QUERY LANGUAGES; SEARCH ENGINES; WORLD WIDE WEB;

DOCUMENT DATABASE; INVERTED FILE INDEXING; TEXT RETRIEVAL; WEB SEARCH ENGINE;

INFORMATION RETRIEVAL;

EID: 33747729581     PISSN: 03600300     EISSN: 03600300     Source Type: Journal    
DOI: 10.1145/1132956/1132959     Document Type: Review

References (205)

1. ANH, V. N., DE KRETSER, O., AND MOFFAT, A. 2001. Vector-space ranking with effective early termination. In Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. New Orleans, LA. 35-42.
2. ANH, V. N. AND MOFFAT, A. 1998. Compressed inverted files with reduced decoding overheads. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Melbourne, Australia. 291-298.
3. ANH, V. N. AND MOFFAT, A. 2002. Impact transformation: Effective and efficient web retrieval. In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Tampere, Finland. 3-10.
4. ANH, V. N. AND MOFFAT, A. 2005. Inverted index compression using word-aligned binary codes. Kluwer International Journal of Information Retrieval 8, 1, 151-166.
5. ARUSU, A., CHO, J., GARCIA-MOLINA, H., PAEPCKE, A., AND RAGHAVAN, S. 2001. Searching the Web. ACM Trans. Internet Technol. 1, 1, 2-43.
6. BADUE, C., BAEZA-YATES, R., RIBEIRO-NETO, B., AND ZIVIANI, N. 2001. Distributed query processing using partitioned inverted files. In Proceedings of String Processing and Information Retrieval Symposium, Laguna de San Rafael, Chile. G. Navarro, Ed. IEEE Computer Society, 10-20.
7. BAEZA-YATES, R., MOFFAT, A., AND NAVARRO, G. 2002. Searching large text collections. In Handbook of Massive Data Sets, J. Abello, P. Pardalos, and M. Resende, Eds. Kluwer Academic Publishers, Boston, MA. 195-244.
8. BAEZA-YATES, R. AND RIBEIRO-NETO, B. 1999. Modern Information Retrieval. ACM Press, New York, NY.
9. BAEZA-YATES, R. A. AND NAVARRO, G. 2000. Block addressing indices for approximate text retrieval. J. Amer. Soc. Inform. Science 51, 1, 69-82.
10. BARBARA, D., MEHROTRA, S., AND VALLABHANENI, P. 1996. The Gold text indexing engine. In Proceedings of IEEE International Conference on Data Engineering, New Orleans, LA. S. Y. W. Su, Ed. IEEE Computer Society Press, Los Alamitos, CA. 172-179.
11. BARROSO, L. A., DEAN, J., AND HÖLZLE, U. 2003. Web search for a planet: The Google cluster architecture. IEEE Micro 23, 2 (April), 22-28.
12. BAYER, R. AND MCCREIGHT, R. 1972. Organization and maintenance of large ordered indexes. Acta Informatica 1, 173-189.
13. BEAULIEU, M., BAEZA-YATES, R., MYAENG, S. H., AND JÄRVELIN, K., EDS. 2002. Proceedings of the 26th Annual International ACM SIGIR Conf. on Research and Development in Information Retrieval. Tampere, Finland, ACM Press.
14. BELL, T. C., CLEARY, J. G., AND WITTEN, I. H. 1990. Text Compression. Prentice-Hall, Englewood Cliffs, NJ.
15. BELL, T. C., MOFFAT, A., NEVILL-MANNING, C. G., WITTEN, I. H., AND ZOBEL, J. 1993. Data compression in full-text retrieval systems. J. Amer. Soc. Inform. Science 44, 9 (Oct.), 508-531.
16. BERTINO, E., OOI, B. C., SACKS-UAVIS, R., TAN, K.-L., ZOBEL, J., SHIDLOVSKY, B., AND CATANIA, B. 1997. Indexing Techniques for Advanced Database Systems. Kluwer Academic Publishers, Boston, MA.
17. BIRD, R. M., NEWSBAUM, J. B., AND TREFFTZS, J. L. 1978. Text file inversion: An evaluation. In Proceedings of the 4th Workshop on Computer Architecture for Non-Numeric Processing. Blue Mountain Lake, NY, ACM Press, 42-50.
18. BIRD, R. M., TU, J. C., AND WORTHY, R. M. 1977. Associative/parallel processors for searching very large textual data bases. In Proceedings of the 3rd Non-Numeric Workshop. Syracuse, NY, ACM Press, 8-16.
19. BLANDFORD, D. AND BLELLOCH, G. 2002. Index compression through document reordering. In Proceedings of the IEEE Data Compression Conference, Snowbird, UT, J. A. Storer and M. Cohn, Eds. IEEE Computer Society Press, Los Alamitos, CA. 342-351.
20. BOOKSTEIN, A. AND KLEIN, S. T. 1990. Using bitmaps for medium sized information retrieval systems. Inform. Proces. Manag. 26, 525-533.
21. BOOKSTEIN, A. AND KLEIN, S. T. 1991a. Compression of correlated bit-vectors. Inform. Syst. 16, 4, 387-400.
22. BOOKSTEIN, A. AND KLEIN, S. T. 1991b. Flexible compression for bitmap sets. In Proceedings of the IEEE Data Compression Conference, Snowbird, UT, J. Storer and M. Cohn, Eds. IEEE Computer Society Press, Los Alamitos, CA. 402-410.
23. BOOKSTEIN, A. AND KLEIN, S. T. 1991c. Generative models for bitmap sets with compression applications. In Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Chicago, IL. A. Bookstein, Y. Chiaramella, G. Salton, and V. V. Raghavan, Eds. ACM Press, 63-71.
24. BOOKSTEIN, A. AND KLEIN, S. T. 1992. Models of bitmap generation: A systematic approach to bitmap compression. Inform. Proc. Manag. 28, 6, 735-748.
25. BOOKSTEIN, A., KLEIN, S. T., AND RAITA, T. 2000. Simple Bayesian model for bitmap compression. Kluwer Int. J. Inform. Retriev. 1, 4, 315-328.
26. BRIN, S. AND PAGE, L. 1998. The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30, 1-7, 107-117.
27. BRISABOA, N. R., FARINA, A., NAVARRO, G., AND ESTELLER, M. F. 2003. (S, C)-dense coding: An optimized compression code for natural language text databases. In Proceedings of String Processing and Information Retrieval Symposium, Manaus, Brazil, M. A. Nascimento, Ed. Springer, 122-136.
28. BROWN, E. W. 1995. Fast evaluation of structured queries for information retrieval. In Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, WA, E. A. Fox, P. Ingwersen, and R. Fidel, Eds. ACM Press, 30-38.
29. BROWN, E. W., CALLAN, J. P., AND CROFT, W. B. 1994. Fast incremental indexing for full-text information retrieval. In Proceedings of the International Conference on Very Large Databases, Santiago, Chile, J. B. Bocca, M. Jarke, and C. Zaniolo, Eds. Morgan Kaufmann, 192-202.
30. BROWN, E. W., CALLAN, J. P., CROFT, W. B., ELIOT, J., AND Moss, B. 1994. Supporting full-text information retrieval with a persistent object store. In Proceedings of the International Conference on Advances in Database Technology (EDBT), Cambridge, UK, M. Jarke, J. A. B. Jr., and K. G. Jeffery, Eds. Springer, 365-378.
31. BUCKLEY, C. AND LEWIT, A. F. 1985. Optimisation of inverted vector searches. In Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Montreal, Canada, 97-110.
32. BURKOWSKI, F. J. 1990. Surrogate subsets: a free space management strategy for the index of a text retrieval system. In Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Brussels, Belgium, 211-226.
33. BÜTTCHER, S. AND CLARKE, C. L. A. 2005. Indexing time vs. query time trade-offs in dynamic information retrieval systems. In Proceedings of the International Conference on Information and Knowledge Management, Bremen, Germany, A. Chowdhury, N. Fuhr, M. Ronthaler, H.-J. Schek, and W. Teiken, Eds. ACM Press, 317-318.
34. CACHEDA, F., PLACHOURAS, V., AND OUNIS, I. 2004. Performance analysis of distributed architectures to index one terabyte of text. In Proceedings of the European Conference on IR Research, Sunderland, UK, S. McDonald and J. Tait, Eds. 395-408. Lecture Notes in Computer Science, Springer, vol. 2997.
35. CAHOON, B. AND MCKINLEY, K. S. 1996. Performance evaluation of a distributed architecture for information retrieval. In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Zurich, Switzerland, 110-118.
36. CAHOON, B., MCKINLEY, K. S., AND LU, Z. 2000. Evaluating the performance of distributed architectures for information retrieval using a variety of workloads. ACM Trans. Inform. Syst. 18, 1 (Jan.) 1-43.
37. CAN, F. 1994. On the efficiency of best-match cluster searches. Inform. Proc. Manag. 30, 3, 343-361.
38. CARDENAS, A. 1975. Analysis and performance of inverted data base structures. Comm. ACM 18, 5, 253-263.
39. CARMEL, D., COHEN, D., FAGIN, R., FARCHI, E., HERSCOVICI, M., MAAREK, Y. S., AND SOFFER, A. 2001. Static index pruning for information retrieval systems. In Proceedings of the 24th Annual International Conference on Research and Development in Information Retrieval. New Orleans, LA. 43-50.
40. CHOUEKA, Y., FRAENKEL, A., KLEIN, S., AND SEGAL, E. 1987. Improved techniques for processing queries in full-text systems. In Proceedings of the 10th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, LA, C. T. Yu and C. J. V. Rijsbergen, Eds. ACM Press, 306-315.
41. CHOUEKA, Y, FRAENKEL, A. S., AND KLEIN, S. T. 1988. Compression of concordances in full-text retrieval systems. In Proceedings of the 11th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Grenoble, France, Y. Chiaramella, Ed. ACM Press, 597-612.
42. CHOUEKA, Y., FRAENKEL, A. S., KLEIN, S. T., AND SEGAL, E. 1986. Improved hierarchical bit-vector compression in document retrieval systems. In Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Pisa, Italy, 88-97.
43. CIACCIA, P., TIBERIO, P., AND ZEZULA, P. 1996. Declustering of key-based partitioned signature files. ACM Trans. Datab. Syst. 21, 3 (Sept.), 295-338.
44. CIACCIA, P. AND ZEZULA, P. 1993. Estimating accesses in partitioned signature file organizations. ACM Trans. Inform. Syst. 11, 2, 133-142.
45. CLARKE, C. L. A. AND CORMACK, G. V. 1995. Dynamic inverted indexes for a distributed full-text retrieval system. Tech. rep. MT-95-01, Department of Computer Science, University of Waterloo, Waterloo, Canada.
46. CLARKE, C. L. A. AND CORMACK, G. V. 2000. Shortest-substring retrieval and ranking. ACM Trans. Inform. Syst. 18, 1, 44-78.
47. CLARKE, C. L. A., CORMACK, G. V., AND BURKOWSKI, F. J. 1994. Fast inverted indexes with on-line update. Tech. rep. CS-94-40, Department of Computer Science, University of Waterloo, Waterloo, Canada.
48. CLARKE, C. L. A., CORMACK, G. V., AND TUDHOPE, E. A. 2000. Relevance ranking for one to three term queries. Inform. Proc. Manage. 36, 2, 291-311.
49. COUVREUR, T. R., BENZEL, R. N., MILLER, S. F., ZEITLER, D. N., LEE, D. L., SINGHAL, M., SHIVARATRI, N., AND WONG, W. Y. P. 1994. An analysis of performance and cost factors in searching large text databases using parallel search systems. J. Amer. Soc. Inform. Science 45, 7, 443-464.
50. CRINGEAN, J. K., ENGLAND, R., MANSON, G. A., AND WILLETT, P. 1990. Parallel text searching in serial files using a processor farm. In Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Brussels, Belgium, 429-453.
51. CROFT, W. B., HARPER, D. J., KRAFT, D. H., AND ZOBEL, J., EDS. 2001. Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, LA. ACM Press.
52. CROFT, W B. AND LAFFERTY, J. 2003. Language Modeling for Information Retrieval. Kluwer Academic Publishers, Dordrecht, The Netherlands.
53. CROFT, W. B., MOFFAT, A., VAN RIJSBERGEN, C. J., WILKINSON, R., AND ZOBEL, J., Eds. 1998. Proceedings of the 21th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Melbourne, Australia. ACM Press.
54. CROFT, W. B. AND SAVINO, P. 1988. Implementing ranking strategies using text signatures. ACM Trans. Office Inform. Syst. 6, 1, 42-62.
55. CULPEPPER, J. S. AND MOFFAT, A. 2005. Enhanced byte codes with restricted prefix properties. In Proceedings of the 12th International Symposium on String Processing and Information Retrieval. Buenos Aires, Argentina, M. P. Consens and G. Navarro, Eds. Lecture Notes in Computer Science, vol. 3772, Springer, 1-12.
56. CUTTING, D. AND PEDERSEN, J. 1990. Optimisations for dynamic inverted index maintenance. In Proceedings of the ACM-SIGIR International Conference on Research and Development in Information Retrieval. Brussels, Belgium, J.-L. Vidick, Ed. ACM Press, 405-411.
57. DE KRETSER, O. AND MOFFAT, A. 1999. Effective document presentation with a locality-based similarity heuristic. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. San Francisco, CA. 113-120.
58. DE KRETSER, O. AND MOFFAT, A. 2004. Seft: A search engine for text. Softw. - Prac. Exper. 34, 10 (Aug.), 1011-1023.
59. DE KRETSER, O., MOFFAT, A., SHIMMIN, T., AND ZOBEL, J. 1998. Methodologies for distributed information retrieval. In Proceedings of the IEEE International Conference on Distributed Computing Systems. Amsterdam, The Netherlands. M. P. Papazoglou, M. Takizawa, B. Takizawa, and S. Chanson, Eds. IEEE Computer Society Press, Los Alamitos, CA. 66-73.
60. EASTMAN, C. 1983. Current practice in the evaluation of multikey search algorithms. In Proceedings of the 6th International ACM SIGIR Conference on Research and Development in Information Retrieval. Washington DC. J. J. Kuehn, Ed. ACM Press. 197-204.
61. EDMUNDSON, H. P. AND WYLLYS, R. E. 1961. Automatic abstracting and indexing - survey and recommendations. Comm. ACM 4, 5 (May), 226-234.
62. ELIAS, P. 1975. Universal codeword sets and representations of the integers. IEEE Trans. Inform. Theory IT-21, 2 (March), 194-203.
63. FALOUTSOS, C. 1985a. Access methods for text. Comput. Surv. 17, 1, 49-74.
64. FALOUTSOS, C. 1985b. Signature files: Design and performance comparison of some signature extraction methods. In Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Montreal, Canada, 63-82.
65. FALOUTSOS, C. AND JAGADISH, H. V. 1992. Hybrid index organizations for text databases. In Proceedings of the International Conference on Extending Database Technology, Vienna, Austria, A. Pirotte, C. Delobel, and G. Gottlob, Eds. Lecture Notes in Computer Science, vol. 580, Springer, 310-327.
66. FALOUTSOS, C. AND OARD, D. W. 1995. A survey of information retrieval and filtering methods. Tech. rep., University of Maryland Institute for Advanced Computer Studies Report, University of Maryland at College Park, MD.
67. Fox, E. A. AND LEE, W. C. 1991. FAST-INV: A fast algorithm for building large inverted flies. Tech. rep. TR 91-10, Virginia Polytechnic Institute and State University, Blacksburg, VA.
68. FRAENKEL, A. S. AND KLEIN, S. T. 1985. Novel compression of sparse bit-strings - Preliminary report. In Combinatorial Algorithms on Words, Volume 12, A. Apostolico and Z. Galil, Eds. NATO ASI Series F. Springer, Berlin, Germany, 169-183.
69. FRAKES, W. B. AND BAEZA-YATES, R., EDS. 1992. Information Retrieval: Data Structures and Algorithms. Prentice-Hall, Englewood Cliffs, NJ.
70. FREI, H.-P., HARMAN, D., SCHÄUBLE, P., AND WILKINSON, R., EDS. 1996. Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Zurich, Switzerland. ACM Press.
71. GALLAGER, R. G. AND VAN VOORHIS, D. C. 1975. Optimal source codes for geometrically distributed integer alphabets. IEEE Trans. Inform. Theory IT-21, 2 (March), 228-230.
72. GARCIA, S., WILLIAMS, H. E., AND CANNANE, A. 2004. Access-ordered indexes. In Proceedings of the Australasian Computer Science Conference, Dunedin, New Zealand. V. Estivill-Castro, Ed. Australian Computer Society, 7-14.
73. GOLOMB, S. W. 1966. Run-length encodings. IEEE Trans. Inform. Theory IT-12, 3 (July), 399-401.
74. GRABS, T., BÖHM, K., AND SCHEK, H.-J. 2001. PowerDB-IR: Information retrieval on top of a database cluster. In Proceedings of the CIKM International Conference on Information and Knowledge Management, Atlanta, GA. H. Paques, L. Liu, and D. Grossman, Eds. ACM Press, 411-418.
75. GROSSMAN, D. A. AND FRIEDER, O. 2004. Information Retrieval: Algorithms and Heuristics, 2nd Ed. Kluwer Academic Publishers, Dordrecht, The Netherlands.
76. HARMAN, D., McCov, W., TOENSE, R., AND CANDELA, G. 1991. Prototyping a distributed information retrieval system using statistical ranking. Inform. Proc. Manag. 27, 5, 449-460.
77. HARMAN, D. K. 1992. Ranking algorithms. In Information Retrieval: Data Structures and Algorithms. W. B. Frakes and R. Baeza-Yates, Eds. Prentice Hall, Englewood Cliffs, NJ. 362-392.
78. HARMAN, D. K. AND CANDELA, G. 1990. Retrieving records from a gigabyte of text on a minicomputer using statistical ranking. J. Amer. Soc. Inform. Science 41, 8 (Aug.), 581-589.
79. HARPER, D. J. 1982. An evaluation of four information storage and retrieval packages. Tech. rep. 7, CSIRO Division of Computing Research, Canberra, Australia.
80. HASKIN, R. L. 1980. Hardware for searching very large text databases. In Proceedings of the Workshop on Computer Architecture for Non-Numeric Processing, Pacific Grove, CA, ACM Press, 49-56.
81. HAWKING, D. 1997. Scalable text retrieval for large digital libraries. In Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries, Pisa, Italy. C. Thanos, Ed. Lecture Notes in Computer Science, vol. 1324. Springer, 127-145.
82. HAWKING, D. 1998. Efficiency/effectiveness trade-offs in query processing. ACM SIOIR Forum 32, 2, 16-22.
83. HEAPS, H. S. 1978. Information Retrieval, Computational and Theoretical Aspects. Academic Press, New York, NY.
84. HEARST, M., GEY, F., AND TONG, R., EDS. 1999. Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, San Francisco. CA, ACM Press.
85. HEINZ, S. AND ZOBEL, J. 2003. Efficient single-pass index construction for text databases. J. Amer. Soc. Inform. Science Techn. 54, 8, 713-729.
86. IVIE, E. L. 1966. Search procedure based on measures of relatedness between documents. Ph.D. thesis. MIT, Cambridge, MA.
87. JAKOBSSON, M. 1978. Huffman coding in bit-vector compression. Inform. Pro. Let. 7, 6 (Oct.) 304-307.
88. JEONG, B. S. AND OMIECINSKI, E. 1995. Inverted file partitioning schemes in multiple disk systems. IEEE Tran. Parall. Distrib. Syst. 6, 2, 142-153.
89. JÓNSSON, B. T., FRANKLIN, M. J., AND SRIVASTAVA, D. 1998. Interaction of query evaluation and buffer management for information retrieval. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, Seattle, WA. ACM Press, 118-129.
90. KASZKIEL, M., ZOBEL, J., AND SACKS-UAVIS, R. 1999. Efficient passage ranking for document databases. ACM Trans. Inform. Syst. 17, 4 (Oct.), 406-439.
91. KENT, A. J., SACKS-DAVIS, R., AND RAMAMOHANARAO, K. 1990. A signature file scheme based on multiple organisations for indexing very large text databases. J. Amer. Soc. Inform. Science 41, 7, 508-534.
92. KLEIN, S. T., BOOKSTEIN, A., AND DEERWESTER, S. 1989. Storing text retrieval systems on CD-ROM: Compression and encryption considerations. ACM Trans. Office Inform. Syst. 7, 3, 230-245.
93. KLEINBERG, J. M. 1999. Authoritative sources in a hyper-linked environment. J. ACM 46, 5, 604-632.
94. KOBAYASHI, M. AND TAKEDA, K. 2000. Information retrieval on the web. Comput. Surv. 32, 2, 144-173.
95. KOCBERBERA, S. AND CAN, F. 1997. Vertical framing of superimposed signature files using partial evaluation of queries. Inform. Proc. Manag. 33, 3, 353-376.
96. LANCASTER, F. W. AND FAYEN, E. G. 1973. Information Retrieval OnLine. Melville, Los Angeles, CA.
97. LEE, D. L., KIM, Y. M., AND PATEL, G. 1995. Efficient signature file methods for text retrieval. IEEE Tran. Knowl. Data Eng. 7, 3 (June) 423-435.
98. LEE, D. L. AND LENG, C.-W. 1989. Partitioned signature files: Design issues and performance evaluation. ACM Trans. Inform. Syst. 7, 2, 158-180.
99. LEE, Y. K., Yoo, S. J., YOON, K., AND BERRA, P. B. 1996. Index structures for structured documents. In Proceedings of the ACM Digital Libraries, Bethesda, MD, E. A. Fox and G. Marchionini, Eds. ACM Press, 91-99.
100. LEMPEL, R. AND MORAN, S. 2003. Predictive caching and prefetching of query results in search engines. In Proceedings of the World Wide Web Conference. Budapest, Hungary. ACM Press, 19-28.
101. LEMPEL, R. AND MORAN, S. 2004. Optimal result prefetching in web search engines with segmented indices. ACM Trans. Internet Techn. 4, 1, 31-59.
102. LEMPEL, R. AND MORAN, S. 2005. Competitive caching of query results in search engines. Theoret. Comput. Science 324, 253-271.
103. LESTER, N., MOFFAT, A., WEBBER, W., AND ZOBEL, J. 2005. Space-limited ranked query evaluation using adaptive pruning. In Proceedings of the 6th International Conference on Web Informations Systems. Lecture Notes in Computer Science, vol. 3806, Springer, 470-477.
104. LESTER, N, MOFFAT, A., AND ZOBEL, J. 2005. Fast on-line index construction by geometric partitioning. In Proceedings of the CIKM International Conference on Information and Knowledge Management, Bremen, Germany, A. Chowdhury, N. Fuhr, M. Ronthaler, H.-J. Schek, and W. Teiken, Eds. ACM Press, 776-783.
105. LESTER, N., ZOBEL, J., AND WILLIAMS, H. E. 2006. Efficient online index maintenance for text retrieval systems. Inform. Proce. Manag. To appear.
106. LIM, L., WANG, M., PADMANABHAN, S., VITTER, J. S., AND AGARWAL, R. 2003. Dynamic maintenance of web indexes using landmarks. In Proceedings of the World-Wide Web Conference, Budapest, Hungary. Y.-F. R. Chen, L. Kovács, and S. Lawrence, Eds. ACM Press, 102-111.
107. LINOFF, G. AND STANFILL, C. 1993. Compression of indexes with full positional information in very large text databases. In Proceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Pittsburg, PA. R. Korfhage, E. Rasmussen, and P. Willett, Eds. ACM Press, 88-97.
108. LU, Z. AND MCKINLEY, K. S. 2003. Partial collection replication for information retrieval. Kluwer Int. J. Inform. Retrie. 6, 2, 159-198.
109. LUCARELLA, D. 1988. A document retrieval system based upon nearest neighbour searching. J. Inform. Science 14, 25-33.
110. LUHN, H. P. 1957. A statistical approach to mechanised encoding and searching of library information. IBM J. Resear. Develop. 1, 309-317.
111. MACFARLANE, A., MCCANN, J. A., AND ROBERTSON, S. E. 2000. Parallel search using partitioned inverted files. In Proceedings of the String Processing and Information Retrieval Symposium. A Coruña, Spain. P. de la Fuente, Ed. IEEE Computer Society Press, Los Alamitos, CA. 209-220.
112. MACLEOD, I. A., MARTIN, T. P., NORDIN, B., AND PHILLIPS, J. R. 1987. Strategies for building distributed information retrieval systems. Inform. Proc. Manag. 23, 6, 511-528.
113. MANBER, U. AND Wu, S. 1994. GLIMPSE: a tool to search through entire file systems. In USENIX Winter Technical Conference. San Francisco CA. USENIX Association, Berkeley, CA. 23-32.
114. MANNING, C. D. AND SCHÜTZE, H. 1999. Foundations of Statistical Natural Language Processing. MIT Press Cambridge, MA.
115. MARON, M. E. AND KUHNS, J. L. 1960. On relevance, probabilistic indexing and information retrieval. J. ACM 7, 3, 216-244.
116. MARTIN, T. P., MACLEOD, I. A., RUSSELL, J. I., LEESE, K., AND FOSTER, B. 1990. A case study of caching strategies for a distributed full text retrieval system. Inform. Proc. Manag. 26, 2, 227-247.
117. MARTIN, T. P. AND RUSSELL, J. I. 1991. Data caching strategies for distributed full text retrieval systems. Inform. Syst. 16, 1, 1-11.
118. MATTHEW, F. W. AND THOMSON, L. 1967. Weighted term search: a computer program for an inverted coordinate search on magnetic tape. J. Chem. Document. 7, 1, 49-56.
119. MCDONELL, K. J. 1977. An inverted index implementation. Comput. J. 20, 1, 116-123.
120. MELNIK, S., RAGHAVAN, S., YANG, B., AND GARCIA-MOLINA, H. 2001. Building a distributed full-text index for the web. ACM Trans. Inform. Syst. 19, 3, 217-241.
121. MOFFAT, A. 1992. Economical inversion of large text files. Comput. Syst. 5, 2, 125-139.
122. MOFFAT, A. AND BELL, T. A. H. 1995. In-situ generation of compressed inverted flies. J. Ame. Soci. Inform. Science 46, 7 (Aug.) 537-550.
123. MOFFAT, A. AND STUIVER, L. 2000. Binary interpolative coding for effective index compression. Kluwer Int. J. Inform. Retriev. 3, 1 (July) 25-47.
124. MOFFAT, A. AND TURPIN, A. 2002. Compression and Coding Algorithms. Kluwer Academic Publishers, Boston, MA.
125. MOFFAT, A., WEBBER, W., ZOBEL, J., AND BAEZA-YATES, R. 2005. A pipelined architecture for distributed text query evaluation. Submitted for publication.
126. MOFFAT, A. AND ZOBEL, J. 1992a. Coding for compression in full-text retrieval systems. In Proceedings of the IEEE Data Compression Conference, Snowbird, UT, J. A. Storer and M. Cohn, Eds. IEEE Computer Society Press, Los Alamitos, CA, 72-81.
127. MOFFAT, A. AND ZOBEL, J. 1992b. Parameterised compression for sparse bitmaps. In Proceedings of the 5th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Copenhagen, Denmaaank, N. J. Belkin, P. Ingwersen, and A. M. Pejtersen, Eds. ACM Press, 274-285.
128. MOFFAT, A. AND ZOBEL, J. 1996. Self-indexing inverted flies for fast text retrieval. ACM Trans. Informa. Syst. 14, 4 (Oct.) 349-379.
129. MOFFAT, A. AND ZOBEL, J. 2004. What does it mean to "measure performance"? In Proceedings of the 5th International Conference on Web Informations Systems, Brisbane, Australia. X. Zhou, S. Su, M. P. Papazoglou, M. E. Owlowska, and K. Jeffrey, Eds. Lecture Notes in Computer Science, vol. 3306. Springer, 1-12.
130. MOFFAT, A., ZOBEL, J., AND SACKS-DAVIS, R. 1994. Memory efficient ranking. Inform. Proc. Manag. 30, 6 (Nov.) 733-744.
131. MOTZKIN, D. 1994. On high performance of updates within an efficient document retrieval system. Inform. Proc. Manag. 30, 1, 93-118.
132. NAVARRO, G., DE MOURA, E., NEUBERT, M., ZIVIANI, N., AND BAEZA-YATES, R. 2000. Adding compression to block addressing inverted indexes. Kluwer Int. J. Inform. Retriev. 3, 1, 49-77.
133. NOREAULT, T., KOLL, M., AND MCGILL, M. J. 1977. Automatic ranked output from Boolean searches in SIRE. J. Amer, Soc. Inform. Science 28, 333-339.
134. PERRY, S. A. AND WILLETT, P. 1983. A review of the use of inverted files for best match searching in information retrieval systems. J. Inform. Science 6, 59-66.
135. PERSIN, M., ZOBEL, J., AND SACKS-DAVIS, R. 1996. Filtered document retrieval with frequency-sorted indexes. J. Amer. Soc. Inform. Science 47, 10, 749-764.
136. PONTE, J. M. AND CROFT, W.B. 1998. A language modelling approach to information retrieval. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Melbourne, Australia, 275-281.
137. RABITTI, F., Ed. 1986. In Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Pisa, Italy, ACM Press.
138. REDDAWAY, S. F. 1991. High speed text retrieval from large databases on a massively parallel processor. Inform. Proc. Manag. 27, 4, 311-316.
139. RIBEIRO-NETO, B. AND BARBOSA, R. 1998. Query performance for tightly coupled distributed digital libraries. In Proceedings of the ACM Digital Libraries, Pittsburgh, PA, I. Witten, R. Akscyn, and F. M. S. III, Eds. ACM Press, 182-190.
140. RIBERTO-NETO, B., DE MOURA, E. S., NEUBERT, M. S., AND ZIVIANI, N. 1999. Efficient distributed algorithms to build inverted files. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. San Francisco, CA, 105-112.
141. RICE, R. F. 1979. Some practical universal noiseless coding techniques. Tech. Rep. 79-22, Jet Propulsion Laboratory, Pasadena, CA.
142. ROBERTSON, S. E. 1977. The probability ranking principle in IR. J. Document. 33, 4 (Dec.) 294-304.
143. ROBERTSON, S. E., WALKER, S., JONES, S., HANCOCK-BEAULIEU, M. M., AND GATFORD, M. 1994. Okapi at TREC-3. In Overview of the 3rd TREC Text REtrieval Conference, Gaithersburg, MD, D. Harman, Ed. NIST, NIST Special Publication 500-226.
144. ROGERS, W., CANDELA, G., AND HARMAN, D. 1995. Space and time improvements for indexing in information retrieval. In Proceedings of the Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, NV, L. Spitz and D. D. Lewis, Eds.
145. SACKS-DAVIS, R., KENT, A. J., AND RAMAMOHANARAO, K. 1987. Multi-key access methods based on superimposed coding techniques. ACM Trans. Datab. Syst. 12, 4, 655-696.
146. SALOMON, D. 2000. Data Compression: The Complete Reference, 2nd Ed. Springer, Berlin, Germany.
147. SALTON, G. 1962. The use of citations as an aid to automatic content analysis. Tech. Rep. ISR-2, Section III, Harvard Computation Laboratory, Cambridge, MA.
148. SALTON, G. 1968. Automatic Index Organization and Retrieval. McGraw-Hill, New York, NY.
149. SALTON, G., Ed. 1971. The SMART Retrieval System: Experiments in Automatic Document Processing. Prentice-Hall, Englewood Cliffs, NJ.
150. SALTON, G. 1972. Dynamic document processing. Comm. ACM 15, 7, 658-668.
151. SALTON, G. 1989. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, Reading, MA.
152. SALTON, G. AND BUCKLEY, C. 1988a. Parallel text search methods. Comm. ACM 31, 2 (Feb.) 202-215.
153. SALTON, G. AND BUCKLEY, C. 1988b. Term-weighting approaches in automatic text retrieval. Inform. Proc. Manag. 24, 5, 513-523.
154. SALTON, G. AND MCGILL, M. J. 1983. Introduction to Modern Information Retrieval. McGraw-Hill, New York, NY.
155. SALTON, G., WONG, A., AND WANG, C.S. 1975. A vector space model for automatic indexing. Comm. ACM 18, 11 (Nov.) 613-620.
156. SARAIVA, P. C., DE MOURA, E. S., ZIVIANI, N, FONSECA, R., MEIRA, W., MURTA, C., AND RIBEIRO-NETO, B. 2001. Rank-preserving two-level caching for scalable search engines. In Proceedings of the 24th Annual International ACM SIOIR Conference on Research and Development in Information Retrieval. New Orleans, LA. 51-58.
157. SAYOOD, K. 2000. Introduction to Data Compression 2nd Ed. Morgan Kaufmann, San Francisco, CA.
158. SCHOLER, F., WILLIAMS, H. E., YIANNIS, J., AND ZOBEL, J. 2002. Compression of inverted indexes for fast query evaluation. In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Tampere, Finland. 222-229.
159. SCHUEGRAF, E. J. 1976. Compression of large inverted flies with hyperbolic term distribution. Inform. Proc. Manag. 12, 377-384.
160. SEGESTA, J. AND REID-GREEN, K. 2002. Harley Tillitt and computerized library searching. IEEE Ann. History Comput. 24, 3 (Sept.) 23-34.
161. SEVERANCE, D. G. AND CARLIS, J. V. 1977. A practical approach to selecting record access paths. Comput. Surv. 9, 4, 259-272.
162. SHIEH, W.-Y., CHEN, T.-F., AND CHUNG, C.-P. 2003. A tree-based inverted file for fast ranked-document retrieval. In Proceedings of the International Conference on Information and Knowledge Engineering. Las Vegas, NV. H. R. Arabnia, Ed. CSREA Press, 64-69.
163. SHIEH, W.-Y., CHEN, T.-F., SHANN, J. J.-J., AND CHUNG, C.-P. 2003. Inverted file compression through document identifier reassignment. Inform. Proc. Manag. 39, 1, 117-131.
164. SHIEH, W.-Y. AND CHUNG, C.-P. 2005. A statistics-based approach to incrementally update inverted files. Inform. Proc. Manag. 41, 2, 275-288.
165. SHIEH, W.-Y., SHANN, J. J.-J., AND CHUNG, C.-P. 2003. An inverted file cache for fast information retrieval. J. Inform. Science Eng. 19, 4, 681-695.
166. SHOENS, K., TOMASIC, A., AND GARCÍA-MOLINA, H. 1994. Synthetic workload performance analysis of incremental updates. In Proceedings of the 17th Annual International ACM SIOIR Conference on Research and Development in Information Retrieval. Dublin, Ireland, W. B. Croft and C. J. van Rijsbergen, Eds. ACM Press, 329-338.
167. SILVESTRI, F., ORLANDO, S., AND PEREGO, R. 2004. Assigning identifiers to documents to enhance the clustering property of fulltext indexes. In Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Sheffield, England, M. Sanderson, K. Järvelin, J. Allan, and P. Bruza, Eds. ACM Press, 305-312.
168. SINGHAL, A., BUCKLEY, C., AND MITRA, M. 1996. Pivoted document length normalization. In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Zurich, Switzerland, 21-29.
169. SMEATON, A. AND VAN RIJSBERGEN, C. J. 1981. The nearest neighbour problem in information retrieval. In Proceedings of the 4th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Oakland, CA, C. J. Crouch, Ed. ACM Press, 83-87.
170. SPARCK JONES, K., WALKER, S., AND ROBERTSON, S. E. 2000. A probabilistic model of information retrieval: development and comparative experiments, parts 1&2. Inform. Proc. Manag. 36, 6, 779-840.
171. SPARCK JONES, K. AND WILLETT, P., Eds. 1997. Readings in Information Retrieval. Academic Press/Morgan Kaufmann, San Francisco, CA.
172. SPINK, A., WOLFRAM, D., JANSEN, B. J., AND SARACEVIC, T. 2001. Searching the Web: The public and their queries. J. Amer. Soci. Inform. Science 62, 3, 226-234.
173. SPINK, A. AND Xu, J. L. 2000. Selected results from a large study of web searching: The Excite study. Inform. Resear. - Int. Electron. J. 6, 1.
174. STANFILL, C. 1990. Partitioned posting flies: a parallel inverted file structure for information retrieval. In Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Brussels, Belgium. 413-428.
175. STANFILL, C., THAU, R., AND WALTZ, D. 1989. A parallel indexed algorithm for information retrieval. In Proceedings of the 12th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.
176. STELLHORN, W H. 1977. An inverted file processor for information retrieval. IEEE Trans. Comput. 26, 12, 1258-1267.
177. STROHMAN, T., TURTLE, H., AND CROFT, W. B. 2005. Optimization strategies for complex queries. In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Salvador, Brazil, G. Marchionini, A. Moffat, J. Tate, R. Baeza-Yates, and N. Ziviani, Eds. ACM Press, 219-225.
178. TAGUE, J., Ed. 1985. Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Montreal, Canada, ACM Press.
179. TEUHOLA, J. 1978. A compression method for clustered bit-vectors. Inform. Proc. Lett. 7, 6 (Oct.) 308-311.
180. TOMASIC, A. AND GARCÍA-MOLINA, H. 1993. Performance of inverted indices in shared-nothing distributed text document information retrieval systems. In Proceedings of the International Conference on Parallel and Distributed Information Systems. San Diego, CA, M. J. Carey and P. Valduriez, Eds. IEEE Computer Society Press, 8-17.
181. TOMASIC, A. AND GARCÍA-MOLINA, H. 1996. Performance issues in distributed shared-nothing information-retrieval systems. Inform. Proc. Manag. 32, 6, 647-665.
182. TOMASIC, A., GARCÍA-MOLINA, H., AND SHOENS, K. 1994. Incremental updates of inverted lists for text document retrieval. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data. Minneapolis, MA, R. T. Snodgrass and M. Winslett, Eds. ACM Press, 289-300.
183. TROTMAN, A. 2003. Compressing inverted files. Kluwer Int. J. Inform. Retriev. 6, 5-19.
184. TURTLE, H. AND FLOOD, J. 1995. Query evaluation: strategies and optimizations. Inform. Proc. Manag. 31, 1 (Nov.), 831-850.
185. VAN RIJSBERGEN, C. J. 1979. Informat. Retriev., 2nd Ed. Butterworths, London, UK.
186. VASANTHAKUMAR, S. R., CALLAN, J. P., AND CROFT, W. B. 1996. Integrating INQUERY with an RDBMS to support text retrieval. Bull. Techn. Comm. Data Eng. 19, 1, 24-33.
187. VIDICK, J. L., Ed. 1990. Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Brussels, Belgium. ACM Press.
188. VOORHEES, E. M. 1986. The efficiency of inverted index and cluster searches. In Proceedings of the 9th Annual ACM SIGIR Conference on Research and Development in Information Retrieval. Pisa, Italy. 164-174.
189. VOORHEES, E. M. AND HARMAN, D. K. 2005. TREC: Experiment and evaluation in information retrieval. MIT Press, Cambridge, MA.
190. WILLIAMS, H. E. AND ZOBEL, J. 1999. Compressing integers for fast file access. Comput. J. 42, 3, 193-201.
191. WILLIAMS, H. E., ZOBEL, J., AND ANDERSON, P. 1999. What's next? Index structures for efficient phrase querying. In Proceedings of the Australasian Database Conference. Auckland, New Zealand. M. Orlowska, Ed. Australian Computer Society, 141-152.
192. WILLIAMS, H. E., ZOBEL, J., AND BAHLE, D. 2004. Fast phrase querying with combined indexes. ACM Trans. Inform. Syst. 22, 4, 573-594.
193. WITTEN, I. H., BELL, T. C., AND NEVILL, C. G. 1991. Models for compression in full-text retrieval systems. In Proceedings of the IEEE Data Compression Conference. Snowbird, UT, J. A. Storer and J. H. Reif, Eds. IEEE Computer Society Press, Los Alamitos, CA. 23-32.
194. WITTEN, I. H., MOFFAT, A., AND BELL, T. C. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd Ed. Morgan Kaufmann, San Francisco, CA.
195. WONG, W.Y.P. AND LEE, D. K. 1993. Implementations of partial document ranking using inverted files. Inform. Proc. Manag. 29, 5 (Sept.), 647-669.
196. XI, W., SORNIL, O., AND Fox, E. A. 2002a. Hybrid partition inverted files for large-scale digital libraries. In Proceedings of the Digital Library: IT Opportunities and Challenges in the New Millennium. Beijing Library Press, Beijing, China, 404-418.
197. XI, W., SORNIL, O., LUO, M., AND Fox, E. A. 2002b. Hybrid partition inverted files: Experimental validation. In Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries. Rome, Italy, M. Agosti and C. Thanos, Eds. Lecture Notes in Computer Science, vol. 2458, Springer, 422-413.
198. ZEZULA, P., RABITTI, F., AND TIBERIO, P. 1991. Dynamic partitioning of signature files. ACM Tran. Inform. Syst. 9, 4 (Oct.), 336-369.
199. ZOBEL, J. AND MOFFAT, A. 1998. Exploring the similarity space. SIGIR Forum 32, 1, 18-34.
200. ZOBEL, J., MOFFAT, A., AND RAMAMOHANARAO, K. 1996. Guidelines for presentation and comparison of indexing techniques. SIGMOD Record 25, 3 (Oct.), 10-15.
201. ZOBEL, J., MOFFAT, A., AND RAMAMOHANARAO, K. 1998. Inverted files versus signature files for text indexing. ACM Trans. Datab. Syst. 23, 4 (Dec.), 453-490.
202. ZOBEL, J., MOFFAT, A., AND SACKS-DAVIS, R. 1992. An efficient indexing technique for full-text database systems. In Proc. VLDB Int. Conf. on Very Large Databases, L.-Y. Yuan, Ed. Morgan Kaufmann, Vancouver, 352-362.
203. ZOBEL, J., MOFFAT, A., AND SACKS-UAVIS, R. 1993a. Searching large lexicons for partially specified terms using compressed inverted files. In Proceedings of the International Conference on Very Large Databases. Dublin, Ireland, R. Agrawal, S. Baker, and D. Bell, Eds. Morgan Kaufmann, 290-301.
204. ZOBEL, J., MOFFAT, A., AND SACKS-DAVIS, R. 1993b. Storage management for files of dynamic records. In Proceedings of the Australasian Database Conference. Brisbane, Australia, 26-38.
205. ZOBEL, J., MOFFAT, A., WILKINSON, R., AND SACKS-DAVIS, R. 1995. Efficient retrieval of partial documents. Inform. Proc. Manag. 31, 3, 361-377.