A study of modified interpolation search in compressed, fully transposed, ordered files

  • Magnus Andersson
  • Per Svensson
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 339)


The CFTOF storage structure, introduced by one of the authors in 1979 and used in the data analysis system Cantor, and a modified interpolation search algorithm, presented in this paper, are combined to solve a conjunctive query search problem. The average complexity of the resulting method is analyzed, and the analytical performance model is compared with testbed experiments and an implementation in the Cantor system.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. 1.
    Andersson M: Using interpolation search for box search problems in compressed fully transposed ordered files (in Swedish). Swedish Defence Research Establishment (FOA), 1988.Google Scholar
  2. 2.
    Batory D S: On searching transposed files. ACM Trans. on Database Systems, Vol 4, No 4, December 1979, pp 531–544.Google Scholar
  3. 3.
    Gonnet G H, Rogers L D & George J A: An Algorithmic and Complexity Analysis of Interpolation Search. Acta Informatica, Vol 13, 1980, pp 39–52.Google Scholar
  4. 4.
    Karasalo I & Svensson P: The design of Cantor — a new system for data analysis. Proc. Third Int. Workshop on Scientific and Statistical Database Management, Luxembourg July 24–26, 1986.Google Scholar
  5. 5.
    Knuth D E: The Art of Computer Programming, Vol 3, Sorting and Searching. Addison-Wesley, Reading, Mass. 1973.Google Scholar
  6. 6.
    Li Z J & Wong H K T: Further Results on Interpolation Searching of Databases. Lawrence Berkeley Laboratory Technical Report LBL-20708, February 1986.Google Scholar
  7. 7.
    Li Z J & Wong H K T: Batched Interpolation Searching on Databases. Lawrence Berkeley Laboratory Technical Report LBL-22848, February 1987.Google Scholar
  8. 8.
    van der Nat M: On Interpolation Search. Communications of the ACM, Vol 22, No 12, December 1979, p 681.Google Scholar
  9. 9.
    Perl Y, Itai A & Avni H: Interpolation Search — A Log Log N Search. Communications of the ACM, Vol 21, No 7, July 1978, pp 550–553.Google Scholar
  10. 10.
    Perl Y & Reingold E M: Understanding the Complexity of Interpolation Search. Information Processing Letters, Vol 6, No 6, December 1977, pp 219–222.Google Scholar
  11. 11.
    Peterson W W: Addressing for Random-Access Storage. IBM Journal of Research and Development 1, 1957, pp 131–132.Google Scholar
  12. 12.
    Piwowarski, M: Comments on batched searching of sequential and tree-structured files. ACM Trans. on Database Systems, Vol 10, No 2, June 1985, pp 285–287.Google Scholar
  13. 13.
    Santoro N & Sidney J B: Interpolation-Binary search. Information Processing Letters 20, 1985, pp 179–181.Google Scholar
  14. 14.
    Svensson P: On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files. Proceedings of the Fifth International Conference on Very Large Databases, IEEE Inc, New York 1979, pp 155–163.Google Scholar
  15. 15.
    Svensson P: Performance Evaluation of a Prototype Relational Data Base Handler for Technical and Scientific Data Processing. FOA Rapport C-20281-D8, Swedish Defence Research Institute, December 1978.Google Scholar
  16. 16.
    Willard D E: Searching Unindexed and Nonuniformly Generated Files in Log Log N Time. SIAM J. Comput. Vol 14, No 4, November 1985, pp 1013–1029 December 1978.Google Scholar
  17. 17.
    Willard D E: Surprisingly efficient search algorithm for non-uniformly generated files. 21st Allerton Conf on Communication, Control, and Computing, 1983, pp 656–662.Google Scholar
  18. 18.
    Yao A C & Yao F F: The Complexity of Searching an Ordered Random Table. Proceedings of the Seventeenth Annual Symposium on Foundations of Computer Science 1976, pp 173–177.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Magnus Andersson
    • 1
  • Per Svensson
    • 1
  1. 1.Swedish Defence Research EstablishmentStockholmSweden

Personalised recommendations