Comparing inverted files and signature files for searching a large lexicon

Information Processing and Management

Volumn 41, Issue 3, 2005, Pages 613-633

  Carterette, Ben ^a,b   Can, Fazli ^a  

^a MIAMI UNIVERSITY   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Compression; Dictionaries; Indexing methods; Performance evaluation; Personal digital assistants

Indexed keywords

DATA COMPRESSION; EVALUATION; FILE ORGANIZATION; GLOBAL POSITIONING SYSTEM; GLOSSARIES; INDEXING (OF INFORMATION); PERFORMANCE; PERSONAL DIGITAL ASSISTANTS;

INDEXING METHODS; INVERTED FILES; PERFORMANCE EVALUATION; SIGNATURE FILES;

INFORMATION RETRIEVAL;

EID: 10644296304     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipm.2003.12.003     Document Type: Article

References (45)

1. Adams, E., & Meltzer, A. (1993). Trigrams as index elements in full text retrieval: observations and experimental results. In Proceedings of the 1993 ACM conference on computer science (pp. 443-439).
2. Angell, R., Freund, G., & Willett, P. (1983). Automatic spelling correction using a trigram similarity measure. Information Processing and Management, 19(4), 305-316.
3. Aktug, D., & Can, F. (1993). Signature files: an integrated access method for formatted and unformatted databases. Working Paper 93-006, Systems Analysis Dept, Miami University, Oxford OH.
4. Baeza-Yates, R., & Ribeiro-Neto, B. (1999). Modern information retrieval. New York: ACM Press.
5. Bratley, P., & Choueka, Y. (1982). Processing truncated terms in document retrieval systems. Information Processing and Management, 18(5), 257-266.
6. Bell, T., Witten, I., & Cleary, J. G. (1989). Modeling for text compression. ACM Computing Surveys, 21(4), 557-591.
7. Buyukkokten, O., Kaljuvee, O., Garcia-Molina, H., Paepcke, A., & Winograd, T. (2002). Efficient web browsing on handheld devices using page and form summarization. ACM Transactions on Information Systems, 20(1), 82-115.
8. Cohen, J. (1997). Recursive hashing functions for n-grams. ACM Transactions on Information Systems, 15(3), 291-320.
9. Crane, G. (1996). Building a digital library: the Perseus project as a case study in the humanities. In Proceedings of the first annual conference on digital libraries (pp. 3-10).
10. Croft, W. B., & Savino, P. (1988). Implementing ranking strategies using text signatures. ACM Transactions on Office Information Systems, 6(1), 42-62.
11. Elias, P. (1975). Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21, 194-203.
12. Faloutsos, C. (1985). Access methods for text. ACM Computing Surveys, 17(1), 49-74.
13. Faloutsos, C. (1992). Signature files. In W. B. Frakes & R. Baeza-Yates (Eds.), Information retrieval data structures and algorithms (pp. 44-65). Englewood Cliffs, NJ: Prentice Hall.
14. Faloutsos, C., & Christodoulakis, S. (1987). Description and performance analysis of signature file methods for office filing. ACM Transactions on Office Information Systems, 5(3), 237-257.
15. Guthrie, L., Pustejovsky, J., Wilks, Y., & Slator, B. M. (1996). The role of lexicons in natural language processing. Communications of the ACM, 39, 63-72.
16. Harris, G., Forster, J., & Rankin, R. (1993). Basic blocks in unconstrained crossword puzzles. In Proceedings of the 1993 ACM/SIGAPP symposium on applied computing (pp. 257-262).
17. Harris, G., Roach, D., Smith, P. D., & Berghel, H. (1992). Dynamic crossword slot table implementation. In Proceedings of the 1992 ACM/SIGAPP symposium on applied computing (pp. 95-98).
18. Kaljuvee, O., Buyukkokten, O., Garcia-Molina, H., & Paepcke, A. (2001). Efficient web form entry on PDAs. In Proceedings of the 10th World Wide Web conference (pp. 663-672).
19. Kent, A. J., Sacks-Davis, R., & Ramamohanarao, K. (1990). A signature file scheme based on multiple organizations for indexing very large text databases. Journal of the American Society for Information Science, 41(7), 508-534.
20. Koçberber, S. (1996). Partial query evaluation for vertically partitioned signature files in very large unformatted databases. Ph.D. thesis, Bilkent University, Ankara, Turkey.
21. Koçberber, S., & Can, F. (1996). Partial evaluation of queries for bit-sliced signature files. Information Processing Letters, 60, 305-311.
22. Koçberber, S., & Can, F. (1997). Vertical framing of superimposed signature files using partial evaluation of queries. Information Processing and Management, 33(3), 353-376.
23. Koçberber, S., Can, F., & Patton, J. M. (1999). Optimization of signature file parameters for databases with varying record lengths. The Computer Journal, 42(1), 11-23.
24. Kukich, K. (1992). Techniques for automatically correcting words in text. ACM Computing Surveys, 24(4), 377-439.
25. Lee, D. L., Kim, Y. M., & Patel, G. (1995). Efficient signature file methods for text retrieval. IEEE Transactions on Knowledge and Data Engineering, 7(3), 423-435.
26. Lee, D. L., & Ren, L. (1996). Document ranking on weight-partitioned signature files. ACM Transactions on Information Systems, 14(2), 109-137.
27. Luk, R. W. P., & Chen, C. M. (2001). Document ranking for variable bit-block compression signatures. Information Processing and Management, 37(1), 39-51.
28. Manber, U., & Wu, S. (1993). GLIMPSE: a tool to search through entire file systems. In Proceedings of the 1994 Winter USENIX technical conference (pp. 23-32).
29. Moffat, A., & Zobel, J. (1996). Self-indexing inverted files for fast text retrieval. ACM Transactions on Information Systems, 14(4), 349-379.
30. Navarro, G. (2001). NR-grep: a fast and flexible pattern matching tool. Software - Practice and Experience, 31(13), 1265-1312.
31. Navarro, G., de Moura, E. S., Neubert, M., Ziviani, N., & Baeza-Yates, R. (2000). Adding compression to block addressing inverted index. Information Retrieval, 3, 49-77.
32. Noble, J., & Weir, C. (2001). Small memory software: patterns for systems with limited memory. Harlow, England: Addison-Wesley.
33. Owolabi, O., & McGregor, D. R. (1988). Fast approximate string matching. Software - Practice and Experience, 18(4), 387-393.
34. Palm, Inc. (2003). Palm OS programmer's companion. Available: http://www.palmos.com/dev/support/docs/palmos/CompanionTOC.html.
35. Rhodes, N., & McKeehan, J. (1999). Palm programming: the developer's guide. O'Reilly & Associates.
36. Roberts, C. S. (1979). Partial-match retrieval via the method of superimposed codes. Proceedings of the IEEE, 67(12), 1624-1642.
37. Robertson, A., & Willett, P. (1998). Applications of n-grams in textual information systems. Journal of Documentation, 54(1), 48-69.
38. Tousidou, E., Nanopoulos, A., & Manolopoulos, Y. (2000). Improved methods for signature-tree construction. The Computer Journal, 43(4), 301-314.
39. Ukkonen, E. (1992). Approximate string matching with q-grams and maximal matches. Theoretical Computer Science, 92, 191-211.
40. Witten, I. H., Moffat, A., & Bell, T. C. (1999). Managing gigabytes: compressing and indexing documents and images (2nd ed.). San Francisco: Morgan Kaufmann.
41. Zezula, P., Rabitti, F., & Tiberio, P. (1991). Dynamic partitioning of signature files. ACM Transactions on Information Systems, 9(4), 336-367.
42. Zobel, J., & Dart, P. (1994). Finding approximate matches in large lexicons. Software - Practice and Experience, 25(3), 331-345.
43. Zobel, J., Moffat, A., & Ramamohanarao, K. (1996). Guidelines for presentation and comparison of indexing techniques. ACM SIGMOD Record, 25(3), 10-15.
44. Zobel, J., Moffat, A., & Ramamohanarao, K. (1998). Inverted files versus signature files for text indexing. ACM Transactions on Database Systems, 23(4), 453-490.
45. Zobel, J., Moffat, A., & Sacks-Davis, R. (1993). Searching large lexicons for partially specified terms using compressed inverted files. In Proceedings of the 19th VLDB conference (pp. 290-301).