Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Andersson M: Using interpolation search for box search problems in compressed fully transposed ordered files (in Swedish). Swedish Defence Research Establishment (FOA), 1988.
Batory D S: On searching transposed files. ACM Trans. on Database Systems, Vol 4, No 4, December 1979, pp 531–544.
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.
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.
Knuth D E: The Art of Computer Programming, Vol 3, Sorting and Searching. Addison-Wesley, Reading, Mass. 1973.
Li Z J & Wong H K T: Further Results on Interpolation Searching of Databases. Lawrence Berkeley Laboratory Technical Report LBL-20708, February 1986.
Li Z J & Wong H K T: Batched Interpolation Searching on Databases. Lawrence Berkeley Laboratory Technical Report LBL-22848, February 1987.
van der Nat M: On Interpolation Search. Communications of the ACM, Vol 22, No 12, December 1979, p 681.
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.
Perl Y & Reingold E M: Understanding the Complexity of Interpolation Search. Information Processing Letters, Vol 6, No 6, December 1977, pp 219–222.
Peterson W W: Addressing for Random-Access Storage. IBM Journal of Research and Development 1, 1957, pp 131–132.
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.
Santoro N & Sidney J B: Interpolation-Binary search. Information Processing Letters 20, 1985, pp 179–181.
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.
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.
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.
Willard D E: Surprisingly efficient search algorithm for non-uniformly generated files. 21st Allerton Conf on Communication, Control, and Computing, 1983, pp 656–662.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Andersson, M., Svensson, P. (1989). A study of modified interpolation search in compressed, fully transposed, ordered files. In: Rafanelli, M., Klensin, J.C., Svensson, P. (eds) Statistical and Scientific Database Management. SSDBM 1988. Lecture Notes in Computer Science, vol 339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027506
Download citation
DOI: https://doi.org/10.1007/BFb0027506
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50575-4
Online ISBN: 978-3-540-46045-9
eBook Packages: Springer Book Archive