A comparison of algorithms for data base compression by use of fragments as language elements

@article{Schuegraf1974ACO,
  title={A comparison of algorithms for data base compression by use of fragments as language elements},
  author={Ernst J. Schuegraf and H. S. Heaps},
  journal={Information Storage and Retrieval},
  year={1974},
  volume={10},
  pages={309-319}
}
The paper describes the advantages of using variable length equifrequent fragments as the language elements for compression coding of large data bases. The problem of finding the minimum space representation of the fragment compressed data base is equivalent to solving a shortest path problem. Three alternate algorithms for compression are described and their performance is tested on both word and text fragments. It is found that text fragments selected by a longest match algorithm produce the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
29 Citations
7 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

The identification of variable length equifrequent character strings in a natural language data base

  • E. M. COOK, M. F. LYNCH
  • Compur . J .
  • 1973

VEGH : Automatic Word Coding Techniques for Computer Language Processing

  • A.
  • NTIS Tech . Report AD 272401 , Washington
  • 1973

WAGNER : An algorithm for extracting phrases in a space optimal fashion

  • A. R.
  • Communs Ass . comput . Mach .
  • 1973

WAGNER : Common phrases and minimum text storage

  • A. R.
  • Communs Ass . comput . Mach .
  • 1972

Shortest path between start and end node of a network . ( Algorithm 22 )

  • J. E.
  • Comput . J .
  • 1966

MOORE : Variable length binary encodings

  • F. E.
  • Bell Syst . tech . J .
  • 1952

Similar Papers

Loading similar papers…