This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient File Structure for Document Retrieval in the Automated Office Environment
June 1989 (vol. 1 no. 2)
pp. 258-273

A file system tailored to the general needs of the office environment is proposed. This system supports large numbers of a wide variety of documents and inexact fuzzy queries on the documents. The file system is based on a multilevel file structure that combines and extends multikey extendible hashing and signature files to create a document-retrieval system that is more time efficient than other previously proposed systems and is also space efficient.

[1] A. V. Aho and J. D. Ullman, "Optimal partial match retrieval when fields are independently specified,"ACM TODS, vol. 4, no. 2, pp. 168-179, June 1979.
[2] H. C. Du, S. Ghanta, K. J. Maly, and S. M. Sharrock, "A document retrieval system for the automated office environment," Dep. Comput. Sci., Univ. Minnesota, Minneapolis, Tech. Rep. TR-85-39.
[3] R. Fagan et al., "Extendible Hashing--A Fast-Access Method for Dynamic Files,"ACM Trans. Database Systems, Vol. 4, No. 3, Sept. 1979, pp. 315-344.
[4] C. Faloutsos and S. Christodoulakis, "Signature files: An access method for documents and its analytical performance evaluation,"ACM Trans. Office Inform. Syst., vol. 2, Oct. 1984.
[5] C. Faloutsos, "Access methods for text,"ACM Comput. Surveys, vol. 17, pp. 49-74, Mar. 1985.
[6] P. Larson, "Dynamic hashing,"BIT, vol. 18, pp. 184-201, 1978.
[7] P. Larson, "Linear hashing with partial expansions," inProc. 6th Conf. VLDB, 1980, pp. 224-232.
[8] W. Litwin, "Virtual hashing: A dynamically changing scheme," inProc. 4th Conf. VLDB, 1978, pp. 517-523.
[9] W. Litwin, "Linear hashing: A new tool for file and table addressing," inProc. 6th Conf. VLDB, 1980, pp. 212-223.
[10] J. Llyod and K. Ramamohanarao, "Partial match retrieval for dynamic files,"BIT, vol. 22, pp. 150-168, 1982.
[11] H. Mendelson, "Analysis of extendible hashing,"IEEE Trans. Software Eng., vol. SE-8, Nov. 1982.
[12] J. L. Pfaltz, W. H. Berman, and E. M. Cagley, "Partial match retrieval using indexed descriptor files,"Commun. ACM, vol. 23, no. 9, pp. 522-528, Sept. 1980.
[13] M. Scholl, "New file organizations based on dynamic hashing,"ACM Trans. Database Syst., vol. 6, Mar. 1981.
[14] T. Tsichritzis and S. Christodoulakis, "Message files,"ACM Trans. Office Inform. Syst., vol. 1, Jan. 1983.
[15] T. S. Yuen, "Dynamic hashing schemes," Ph.D. dissertation, Univ. Minnesota, Minneapolis, 1985.

Index Terms:
efficient file structure; document retrieval; automated office environment; file system; inexact fuzzy queries; multilevel file structure; multikey extendible hashing; signature files; time efficient; space efficient; data structures; information retrieval; office environment
Citation:
D.H.-C. Du, S. Ghanta, K.J. Maly, S.M. Sharrock, "An Efficient File Structure for Document Retrieval in the Automated Office Environment," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 2, pp. 258-273, June 1989, doi:10.1109/69.87965
Usage of this product signifies your acceptance of the Terms of Use.