Design and evaluation of signature file organization incorporating vertical and horizontal decomposition schemes

  • Hiroyuki Kitagawa
  • Noriyasu Watanabe
  • Yoshiharu Ishikawa
Information Retrieval 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)


Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and horizontal decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.


Query Processing Target Signature Storage Cost Information Retrieval System Query Signature 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. G. G. Cattell, editor. Object Database Standard: ODMG-93. Morgan Kaufmann, San Francisco, California, 1996. Rel. 1.2.Google Scholar
  2. 2.
    P. Ciaccia and P. Zezula. “Estimating Accesses in Partitioned Signature File Organizations,”. ACM Trans. Inf. Syst., 11(2):133–142, 1993.CrossRefGoogle Scholar
  3. 3.
    C. Faloutsos. “Access Methods for Text,”. ACM Comput. Surv., 17(1):49–74, 1985.CrossRefGoogle Scholar
  4. 4.
    C. Faloutsos. “Signature-Based Text Retrieval Methods: A Survey,”. IEEE Database Eng., 13(1):25–32, Mar. 1990.Google Scholar
  5. 5.
    C. Faloutsos and S. Christodoulakis. “Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation,”. ACM Trans. Off. Inf. Syst., 2(4):267–288, 1984.CrossRefGoogle Scholar
  6. 6.
    C. Faloutsos and S. Christodoulakis. “Description and Performance Analysis of Signature File Methods for Office Filing,”. ACM Trans. Off. Inf. Syst., 5(3):237–257, July 1987.CrossRefGoogle Scholar
  7. 7.
    Y. Ishikawa, H. Kitagawa, and N. Ohbo. “Evaluation of Signature Files as Set Access Facilities in OODBs,”. In Proc. ACM SIGMOD, pages 247–256, Washington, D.C., 1993.Google Scholar
  8. 8.
    J. K. Kim and J. W. Chang. “A Two-dimensional Dynamic Signature File Method,”. In Intl. Symp. on Advanced Database Technologies and Their Integration (ADTI'94), pages 63–70, Nara, Japan, 1994.Google Scholar
  9. 9.
    H. Kitagawa, Y. Fukushima, Y. Ishikawa, and N. Ohbo. “Estimation of False Drops in Set-valued Object Retrieval with Signature Files,”. In Proc. 4th Intl. Conf. on Foundations of Data Organization and Algorithms (FODO '93), pages 146–163, 1993.Google Scholar
  10. 10.
    D. L. Lee and C. Leng. “Partitioned Signature Files: Design Issues and Performance Evaluation,”. ACM Trans. Off. Inf. Syst., 7(2):158–180, 1989.CrossRefGoogle Scholar
  11. 11.
    W. Lee and D. L. Lee. “Signature File Methods for Indexing Object-Oriented Database Systems,”. In Intl. Computer Science Conf. (ICSC), pages 616–622, Hong Kong, 1992.Google Scholar
  12. 12.
    Z. Lin and C. Faloutsos. “Frame-Sliced Signature Files,”. IEEE Trans. Knowl. and Data Eng., 4(3):281–289, 1992.CrossRefGoogle Scholar
  13. 13.
    F. Rabitti and P. Savino. “Image Query Processing Based on Multi-level Signatures,”. In Proc. of 14th Annual Intl. ACM/SIGIR Conf. on Research and Development in Information Retrieval, pages 305–314, Chicago, Illinois, Oct. 1991.Google Scholar
  14. 14.
    K. Ramamohanarao and J. A. Shepherd. “A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases,”. In Proc. of the Third Intl. Conf. on Logic Programming, pages 569–576, London, 1986.Google Scholar
  15. 15.
    C. S. Roberts. “Partial-Match Retrieval via the Method of Superimposed Codes,”. Proc. IEEE, 67(12):1624–1642, Dec. 1979.Google Scholar
  16. 16.
    S. Stiassny. “Mathematical Analysys of Various Superimposed Coding Methods,”. American Documentation, 11(2):155–169, 1960.Google Scholar
  17. 17.
    P. Tiberio and P. Zezula. “Storage and Retrieval: Signature File Access,”. In A. Kent and J. G. Williams, editors, Encyclopedia of Microcomputers, volume 16, pages 377–403. Marcel Dekker, Inc., New York, 1995.Google Scholar
  18. 18.
    N. Watanabe and H. Kitagawa. “Design and Evaluation of Partitioned Bit-Sliced Signature File,”. IPS Japan SIGDBS, 95-DBS-104:1–8, July 1995. (in Japanese).Google Scholar
  19. 19.
    S. B. Yao. “Approximating Block Accesses in Database Organizations,”. CACM, 20(4):260–261, 1977.Google Scholar
  20. 20.
    H.-S. Yong, S. Lee, and H.-J. Kim. “Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases,”. In Proc. of 10th Intl. Conf. on Data Engineering, pages 518–525, Houston, Texas, Feb. 1994. IEEE.Google Scholar
  21. 21.
    P. Zezula, P. Ciaccia, and P. Tiberio. “Key-Based Partitioned Bit-Sliced Signature File,”. ACM SIGIR Forum, 29(2):20–34, Fall 1995.Google Scholar
  22. 22.
    P. Zezula, F. Rabitti, and P. Tiberio. “Dynamic Partitioning of Signature Files,”. ACM Trans. Inf. Syst., 9(4):336–369, 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Hiroyuki Kitagawa
    • 1
  • Noriyasu Watanabe
    • 2
  • Yoshiharu Ishikawa
    • 3
  1. 1.Institute of Information Sciences and ElectronicsUniversity of TsukubaJapan
  2. 2.Doctoral Degree Program in EngineeringUniversity of TsukubaJapan
  3. 3.Graduate Institute of Information ScienceNara Institute of Science and Technology (NAIST)Japan

Personalised recommendations