Skip to main content
SpringerLink
Log in

Compression of clustered inverted files

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1978 (MFCS 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 64))

  • 120 Accesses

Abstract

One way to save memory space in inverted file organizations is to map each address list to a bit-vector and compress it by a suitable compression technique. Eight such techniques are discussed for nonuniformly distributed bit-vectors in this study. Occurrences of clusters with high 1-bit densities are simulated using a n-state bit-vector generating process. Experiments with a real life file are also reported.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.R. Bahl, H. Kobayashi: Image Data Compression by Predictive Coding II, IBM J. Res. Develop., Vol 18, pp 172–179, (1974).

    Google Scholar 

  2. S.D. Bradley: Optimizing a Scheme for Run Length Encoding, Proc. IEEE, Vol 57, pp 108–109, (1969).

    Google Scholar 

  3. A.F. Cardenas: Analysis and Performance of Inverted Data Base Management Systems, Comm. ACM, Vol 18, pp 253–263, (1975).

    Article  Google Scholar 

  4. S.W. Golomb: Run-Length Encodings, IEEE Trans. Inf. Theory, IT-12, pp 399–401, (1966).

    Article  Google Scholar 

  5. R.A. Howard: Dynamic Probabilistic Systems, Vol I: Markov Models, John Wiley & Sons, Inc., New York, (1971).

    Google Scholar 

  6. M. Jakobsson, O. Nevalainen: On the Compression of Inverted Files, Rept. B 14, Dept. of Comp. Sci., Univ. of Turku, Finland, (1977).

    Google Scholar 

  7. D.R. King: The Binary Vector as a Basis of an Inverted Index File, J. Libr. Autom., Vol 7, pp 307–315, (1974).

    Google Scholar 

  8. D. Lefkowitz: File Structures for On-line Systems, Spartan Books, New York, (1969).

    Google Scholar 

  9. E.J. Schuegraf: Compression of Large Inverted Files with Hyperbolic Term Distribution, Inf. Proc. Manag., Vol 12, pp 377–384, (1976).

    Google Scholar 

  10. L.H. Thiel, H.S. Heaps: Program Design for Retrospective Searches on Large Data Bases, Inf. Stor. Retr., Vol 8, No 1, (1972).

    Google Scholar 

  11. H. Wedekind, T. Härder: Datenbanksysteme II, B.I.-Wissenschaftswerlag Mannheim/Wien/Zürich, (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Turku, Turku, Finland

    O. Nevalainen, M. Jakobsson & R. Berg

Authors
  1. O. Nevalainen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Jakobsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Berg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nevalainen, O., Jakobsson, M., Berg, R. (1978). Compression of clustered inverted files. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation