Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Timothy C. Bell , John G. Cleary , Ian H. Witten, Text compression, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	2	Timothy C. Bell , Alistair Moffat , Craig G. Nevill-Manning , Ian H. Witten , Justin Zobel, Data compression in full-text retrieval systems, Journal of the American Society for Information Science, v.44 n.9, p.508-531, Oct. 1993  [doi>10.1002/(SICI)1097-4571(199310)44:9<508::AID-ASI2>3.0.CO;2-A]
	3	Bell T.C., Better OPM/L text compression, IEEE Trans. on Commun~catzons COM-34 (1986) 1176-1182.
	4	Brent R.P., A linear algorithm for data compression, The Auslrahan Computer Journal 19 (1987) 64-68.
	5	Y. Choueka , A. S. Fraenkel , S. T. Klein, Compression of concordances in full-text retrieval systems, Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval, p.597-612, May 1988, Grenoble, France  [doi>10.1145/62437.62500]
	6	A. S. Fraenkel , S. T. Klein , Y. Choueka , E. Segal, Improved hierarchical bit-vector compression in document retrieval systems, Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, p.88-96, September 1986, Palazzo dei Congressi, Pisa, Italy  [doi>10.1145/253168.253190]
	7	Dijkstra E.W., A note on two problems in connexion with graphs, Numemsche Mathematik 1 (1959) 269-271.
	8	Shimon Even, Graph Algorithms, W. H. Freeman & Co., New York, NY, 1979
	9	E. R. Fiala , D. H. Greene, Data compression with finite windows, Communications of the ACM, v.32 n.4, p.490-505, April 1989  [doi>10.1145/63334.63341]
	10	Huffman D., A method for the construction of minimum redundancy codes, Proc. of the IRE 40 (1952) 1098-1101.
	11	Debra A. Lelewer , Daniel S. Hirschberg, Data compression, ACM Computing Surveys (CSUR), v.19 n.3, p.261-296, Sept. 1987  [doi>10.1145/45072.45074]
	12	J. Katajainen , T. Raita, An approximation algorithm for space-optimal encoding of a text, The Computer Journal, v.32 n.3, p.228-237, June 1989  [doi>10.1093/comjnl/32.3.228]
	13	Jyrki Katajainen , Timo Raita, An analysis of the longest match and the greedy heuristics in text encoding, Journal of the ACM (JACM), v.39 n.2, p.281-294, April 1992  [doi>10.1145/128749.128751]
	14	Shmuel T. Klein , Abraham Bookstein , Scott Deerwester, Storing text retrieval systems on CD-ROM: compression and encryption considerations, ACM Transactions on Information Systems (TOIS), v.7 n.3, p.230-245, July 1989  [doi>10.1145/65943.65946]
	15	Schuegraf E.J., Heaps H.S., A comparison of algorithms for data base compression by use of fragments as language elements, Informatzon Stor. and Retr. 10 (1974) 309-319.
	16	James A. Storer, Data compression: methods and theory, Computer Science Press, Inc., New York, NY, 1987
	17	James A. Storer , Thomas G. Szymanski, Data compression via textual substitution, Journal of the ACM (JACM), v.29 n.4, p.928-951, Oct. 1982  [doi>10.1145/322344.322346]
	18	Robert Endre Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983
	19	Whiting D.L., George G.A., Ivey G.E., Data Compression Apparatus and Method, U.S. Patent 5,126,739 (1992).
	20	Williams R.N., An extremely fast Ziv-Lempel data compression algorithm, Proc. Data Compresszon Conference DCC-91, Snowbird, Utah (1991) 362-371.
	21	Ian H. Witten , Radford M. Neal , John G. Cleary, Arithmetic coding for data compression, Communications of the ACM, v.30 n.6, p.520-540, June 1987  [doi>10.1145/214762.214771]
	22	Ziv J., Lempel A., A universal algorithm for sequential data compression, IEEE Trans. on Inf. Th. IT-23 (1977) 337-343.
	23	Ziv J.~ Lexnpel A.~ Compression of individual sequences via variable-rate coding, IEEE Trans. on Inf. Th. IT-24 (1978) 530-536.

• M⁴: a metamodel for data preprocessing Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
  Anca Vaduva ,  Jörg-Uwe Kietz ,  Regina Zücker
  
  
• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein