A new dynamic signature file method in parallel processing environment

  • Jeong-Ki Kim
  • Jae-Woo Chang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 978)


The signature file method has widely been advocated as an efficient index scheme to handle new applications demanding a large amount of textual databases. Moreover, it has been recently extended to support multimedia data. In order to achieve good performance on handling the multimedia data. the signature file approach has been required to support parallel database processing. Therefore, in this paper we propose a horizontally-divided parallel signature file method (HPSF) using extendible hashing and frame-slicing techniques. In addition, we propose a heuristic processor allocation method so that we may assign a set of signatures into a given number of processors in a uniform way. To show the efficiency of HPSF, we evaluate the performance of HPSF in terms of retrieval time, storage overhead, and insertion time. Finally, we show from the performance results that HPSF outperforms the conventional parallel signature file methods on retrieval performance as well as a dynamic operating measure to combine both retrieval and insertion time.


dynamic signature files parallel databases extendible hashing frame-slicing technique performance evaluation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.W. Chang, J.H. Lee, and Y.J. Lee. “Multikey Access Methods Based on Term Discrimination and Signature Clustering”. In Proc. of 12th Ann Int'l SIGIR of ACM, pages 176–185, USA, June 1989.Google Scholar
  2. [2]
    P.B. Berra et al. “Architecture for Distributed Multimedia Database Systems”. Computer Communications, 13(4):217–231, May 1990.CrossRefGoogle Scholar
  3. [3]
    U. Deppish. “S-tree: A Dynamic Balanced Signature Indexed for Office Retrieval”. In Proc. of the ACM Conf. on RDIR, pages 77–87, Sept 1986.Google Scholar
  4. [4]
    P. Zezula, F. Rabitti, and P. Tiberio. “Dynamic Partitioning of Signature Files”. ACM Trans. on OIS, 9(4):336–369, Oct 1991.Google Scholar
  5. [5]
    J.K. Kim and J.W. Chang. “A Two-dimentional Dynamic Signature File Method”. In Proc.of Int'l Symp. on ADTI, pages 63–70, Nara, Japan, Oct 1994.Google Scholar
  6. [6]
    C. Faloutsos and S. Christodoulakis. “Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation”. ACM Trans. on OIS, 2(4):267–288, 1984.Google Scholar
  7. [7]
    K.A. Hua and C. Lee. “Handing Data Skew in Multiprocessor Database Computers Using Partition Tuning”. In Proc. of the 17th VLDB Conference, pages 525–535, Spain, Sept 1991.Google Scholar
  8. [8]
    J. Li, J. Srivastava, and D. Rotem. “CMD: A Multidimensional Declustering Method for Parallel Database Systems”. In Proc. of the 18th VLDB Conference. pages 3–14, Canada, 1992.Google Scholar
  9. [9]
    F. Grandi, P. Tiberio, and P. Zezula. “Frame-Sliced Partitioned Parallel Signature Files”. In Proc. of 15th Ann Int'l SIGIR of ACM, pages 286–297, Denmark, June 1992.Google Scholar
  10. [10]
    Z. Lin. “Concurrent Frame Signature Files”. Distributed and Parallel Databases, 1(3):231–249, July 1993.CrossRefGoogle Scholar
  11. [11]
    J.K. Kim and J.W. Chang. “Design and Performance Evaluation of a New Dynamic Signature File Method in Parallel Processing Environment”. DBLAB Technical Report, TM-95-01, Dept. of Computer Engineering, Chonbuk National University, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Jeong-Ki Kim
    • 1
  • Jae-Woo Chang
    • 1
  1. 1.Dept. of Computer EngineeringChonbuk National UniversityChonju, ChonbukKorea

Personalised recommendations