A comparison of concatenated and superimposed code word surrogate files for very large data/knowledge bases

  • Soon Myoung Chung
  • P. Bruce Berra
Efficient Data Access
Part of the Lecture Notes in Computer Science book series (LNCS, volume 303)


Surrogate files are very useful as an index for very large knowledge bases to support multiple logic programming inference mechanisms because of their small size and simple maintenance requirement. In this paper, we analyse the superimposed code word (SCW) and concatenated code word (CCW) surrogate file techniques in terms of storage space and time to answer queries in various cases. One of the most important results of our analysis is that the size and the query response time of the CCW is smaller than those of the SCW when the average number of arguments specified in a query is small. It is also shown that most of the query response time is used for the surrogate file processing when the extensional database is very large. Therefore, if we use a special architecture to speed up the surrogate file processing, the total query response time can be reduced considerably.


Logic Programming Associative Memory Unique Identifier Retrieval Performance Binary Representation 
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. [AHU80]
    S. R. Ahuja, C. S. Roberts, "An Associative/Parallel Processor for Partial Match Retrieval Using Superimposed Codes," Proc. 7th Annual Symp. on Computer Architecture, May 1980, pp.218–227.Google Scholar
  2. [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, March 1987, pp.25–32.Google Scholar
  3. [BRA84]
    K. Bratbergsengen, "Hashing Methods and Relational Algebra Operations," Proc. VLDB, 1984, pp.323–333.Google Scholar
  4. [CAR75]
    A. F. Cardenas, "Analysis and Performance of Inverted Data Base Structures," CACM, Vol. 18, No. 5, 1975, pp.253–263.Google Scholar
  5. [DIG82]
    Digital Equipment Corporation, RA 81 Disk Drive User Guide, 1982Google Scholar
  6. [DU87]
    H. C. Du, S. Ghanta, et al., "An Efficient File structure for Document Retrieval in the Automated Office Environment," Proc. Int'l Conf. on Data Engineering, 1987, pp.165–172.Google Scholar
  7. [FAL84]
    C. Faloutsos, S. Christodoulakis, "Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation," ACM Trans. on Office Information Systems, Vol. 2, No. 4, 1984, pp.267–288.CrossRefGoogle Scholar
  8. [FAL85]
    C. Faloutsos, S. Christodoulakis, "Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies," Proc. VLDB, 1985, pp.165–170.Google Scholar
  9. [KIT83]
    M. Kitsuregawa, H. Tanaka, T. Moto-Oka, "Application of Hash to Data Base Machine and Its Architecture," New Generation Computing, Vol. 1, 1983, pp.63–74.Google Scholar
  10. [LAR82]
    P.-A. Larson, "Performance Analysis of Linear Hashing with Partial Expansions," ACM Trans. on Database Systems, Vol. 7, No. 4, 1982, pp.566–587.Google Scholar
  11. [LEE86]
    D. L. Lee, "A Word-Parallel, Bit-Serial Signature Processor for Superimposed Coding," Proc. Int'l Conf. on Data Engineering, 1986, pp.352–359.Google Scholar
  12. [MAR77]
    J. Martin, Computer Data Base Organization, second edition, Prentice-Hall, 1977Google Scholar
  13. [PFA80]
    J. L. Pfaltz, W.J. Berman, and E.M. Cagley, "Partial-Match Retrieval Using Indexed Descriptor Files," CACM, Vol. 23, No. 9, 1980, pp.522–528.Google Scholar
  14. [RAM86]
    K. Ramamohanarao, J. Shepherd, "A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases," Proc. 3rd Int'l Logic Programming Conference, 1986, pp.569–576.Google Scholar
  15. [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
  16. [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
  17. [SHI87]
    D. Shin, P. B. Berra, "An Architecture for Very Large Rule Bases Based on Surrogate Files," Proc. 5th Int'l Workshop on Database Machines, 1987, pp.555–568.Google Scholar
  18. [WAD87]
    M. Wada, Y. Morita, et al., "A Superimposed Code Scheme for Deductive Data-bases," Proc. 5th Int'l Workshop on Database Machines, 1987, pp.569–582.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Soon Myoung Chung
    • 1
  • P. Bruce Berra
    • 1
  1. 1.Dep't of Electrical and Computer EngineeringSyracuse UniversitySyracuseUSA

Personalised recommendations