The HS file: A new dynamic signature file method for efficient information retrieval
Many works on the signature file methods have been made in the past, but they are mainly for static environments. However, many recent applications in practice require a dynamic information storage structure that effectively supports insertions, deletions and updates. Though there are a few signature file techiniques for dynamic environments, they suffer from serious performance degradation when query signature weights are light. In this paper, we propose a new dynamic signature file organization, called the hierarchical signature(HS) file, that solves the problem of light query signature weights. We perform simulation experiments by using wide range of parameter values. We show through performance comparison based on experiments that the HS file improves performance significantly in both the retrieval time and the storage over-head over the other dynamic signature file methods proposed earlier.
Keywordsinformation retrieval signature file performance evaluation dynamic environment
Unable to display preview. Download preview PDF.
- 1.J. W. Chang, J. H. Lee and Y. J. Lee, “Multikey Access Methods Based on Term Discrimination and Signature Clustering,” ACM SIGIR, 1989, pp. 176–185.Google Scholar
- 2.S. Christodoulakis and C. Faloutsos, “Design Considerations for a Message File Server,” IEEE Trans. on Soft. Eng., Vol. SE-10, No. 2, Mar. 1984, pp. 201–210.Google Scholar
- 3.U. Deppisch, “S-tree: A Dynamic Balanced Signature Index for Office Retrieval,” ACM SIGIR, 1986, pp. 77–87.Google Scholar
- 4.C. Faloutsos and S. Christodoulakis, “Description and Performance File Method for Office Filing,” ACM TOIS, Vol. 5, No. 3, 1987, pp. 237–257.Google Scholar
- 5.C. Faloutsos, “Signature-based Text Retrieval Methods: A Survey,” IEEE Computer Society Technical Committee on Data Engineering, Vol. 13, No. 1, Mar. 1990, pp. 25–32.Google Scholar
- 6.Z. Lin and C. Faloutsos, “Frame-Sliced Signature Files,” IEEE Trans. on Knowledge and Data Engineering, Vol. 4, No. 3, Jun. 1992, pp. 281–289.Google Scholar
- 7.C. S. Roberts, “Partial Match Retrieval via the Method of the Superimposed Codes,” Proc. IEEE 67, Dec. 1979, pp. 1624–1642.Google Scholar
- 8.R. Sacks-Davis and K. Ramamohanarao, “Multikey Access Methods based on Superimposed Coding Techniques,” ACM TODS, Vol. 12, No. 4, Dec. 1987, pp. 655–696.Google Scholar
- 9.J. S. Yoo, J. W. Chang, Y-J Lee and M. H. Kim, “Performance Evaluation of Signature-Based Access Mechanisms for Efficient Information Retrieval,” IEICE Trans. on Information and Systems, Vol. E76-D, No. 2, Feb. 1993, pp. 179–183.Google Scholar
- 10.P. Zezula, F. Rabitti and P. Tiberio, “Dynamic Partitioning of Signature Files,” ACM TOIS, Vol. 9, No. 4, Oct. 1991, pp. 336–369.Google Scholar