Block concatenated code word surrogate file for partial match retrieval

  • Soon Myoung Chung
Data And Software Engineering
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


In this paper, a block concatenated code word (BCCW) surrogate file scheme is developed to speed up partial match retrieval operations. A BCCW is generated for each block of the data file by hashing the attribute values in the data block. Then the BCCWs forms a surrogate file which is used as an index to the data file. For a partial match retrieval query, a block query code word (BQCW) is generated and compared with the BCCWs. Only those data blocks whose corresponding BCCWs match the BQCW are retrieved from secondary storage and compared with the actual query. The size of the BCCWs is usually less than 10% of the size of the data file and only a subset of each BCCW is accessed. Thus, we can obtain considerable speed up in partial match retrieval by using the BCCW surrogate file. The storage requirement and the performance of the BCCW surrogate file are evaluated and compared with those of other schemes.

Key Words

database partial match retrieval code words 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BER87]
    P. B. Berra, S. M. Chung, N. I. Hachem, "Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base," IEEE Computer Vol. 20, No. 3, 1987, pp. 25–32.Google Scholar
  2. [CAR75]
    A. F. Cardenas, "Analysis and Performance of Inverted Data Base Structures," Communications of the ACM, Vol. 18, No. 5, 1975, pp. 253–263.Google Scholar
  3. [CHU88]
    S. M. Chung, P. b. Berra, "A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases," Advances in Database Technology — EDBT'88, Proc. Int'l Conf. on Extending Database Technology, Springer-Verlag, 1988, pp. 364–387.Google Scholar
  4. [CHU90]
    S. M. Chung, "Block Code Words for Partial Match Retrieval in Very Large Databases," Technical Report WSU-CS-90-10, Dept. of Computer Science and Engineering, Wright State University, 1990.Google Scholar
  5. [PFA80]
    J. L. Pfaltz, W. J. Berman, and E. M. Cagley, "Partial-Match Retrieval Using Indexed Descriptor Files," Communications of the ACM, Vol. 23, No. 9, 1980, pp. 522–528.Google Scholar
  6. [ROB79]
    C. S. Roberts, "Partial Match Retrieval via the Method of Superimposed Codes," Proceedings of the IEEE, Vol. 67, No. 12, 1979, pp. 1624–1642.Google Scholar
  7. [SAC83]
    R. Sacks-Davis, K. Ramamohanarao, "A Two level Superimposed Coding Scheme for Partial Match Retrieval," Information Systems Vol. 8, No. 4, 1983, pp. 273–280.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Soon Myoung Chung
    • 1
  1. 1.Dept. of Computer Science and EngineeringWright State UniversityDaytonU. S. A.

Personalised recommendations