In-place differential file compression

Data Compression Conference Proceedings

Volumn 2003-January, Issue , 2003, Pages 263-272

  Shapira, Dana ^a   Storer, James A ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

Application software; Approximation algorithms; Computer science; Data compression; Decoding; Encoding; File systems; Software performance

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; DECODING; ENCODING (SYMBOLS); OPTIMIZATION;

APPLICATION SOFTWARES; CONSTANT FACTOR APPROXIMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DIFFERENTIAL FILE COMPRESSION; FILE SYSTEMS; LOW DECODING COMPLEXITY; SOFTWARE PERFORMANCE; TRADITIONAL APPROACHES;

DATA COMPRESSION;

EID: 35248853125     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2003.1194017     Document Type: Conference Paper

References (26)

1. M. Ajtai, R. Burns, R. Fagin, and D. D. E. Long [2002]. "Compactly Encoding Unstructured Inputs with Differential Compression", Journal of the ACM 49:3, 318-367.
2. R. C. Burns and D. D. E. Long [1998]. "In-place Reconstruction of Delta Compressed Files", Proceedings ACM Conference on the Principles of Distributed Computing (PODC).
3. R. C. Burns and D. D. E. Long [1997]. "A Linear Time, Constant Space Differencing Algorithm", Proceedings IEEE International Conference on Performance, Computing, and Communications.
4. R. C. Burns and D. D. E. Long [1997b]. "Efficient Distributed Backup and Restore with Delta Compression", Workshop on I/O in Parallel and Distributed Systems (IOPADS).
5. G. Cormode, M. Paterson, S. C. Sahinalp and U. Vishkin [2000]. "Communication complexity of Document Exchange", Proceedings of the 11th Symposium on Discrete Algorithms, 197-206
6. G. Cormode and S. Muthukrishnan [2002]. "The string Edit Distance Problem with Moves", Proceedings of the 13th Symposium on Discrete Algorithms, 667-676
7. F. Ergun and S. C. Sahinalp [2002]. "Approximate Pairwise and Self Similarity of Massive Strings", Manuscript Princeton and CWRU.
8. M. Factor, D. Sheinwald, and B. Yassour [2001]. "Software Compression in the Client/Server Environment", Proceedings Data Compression Conference, IEEE Computer Society Press, 233-242.
9. M. R. Garey and D. S. Johnson [1979]. Computers and Intractability, A guide to the Theory of NP-Completeness, W. H. Freeman Press.
10. D. Gusfield [1997]. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press.
11. R. W. Hamming [1980]. Coding and information Theory, Prentice Hall.
12. P. Heckel [1978]. "A Technique for Isolating Differences Between Files", Communications of the ACM 21:4, 264-268.
13. J. J. Hunt, K. P. Vo, and W. Tichy [1998]. "Delta algorithms: An Empirical Analysis", ACM Trans. on Software Engineering and Methodology 7, 192-214.
14. D. G. Korn and K. P. Vo [2002]. "The VCDIFF generic Differencing and Compression Data Format", Manuscript.
15. D. Liben-Nowell [1999]. "On the Structure of Syntenic Distance", Proceedings Symposium of Combinatorial Pattern Matching (CPM), Springer Lecture Notes in C.S., 50-65.
16. D. Lopresti and A. Tomkins [1997]. "Block Edit Models for Approximate String Matching", Theoretical Computer Science 181, 159-179
17. W. J. Masek and M. S. Paterson [1980]. "A faster algorithm computing string edit distances", Journal of Computer and System Sciences 20, 18-31
18. S. Muthukrishnan and Sahinalp [2000]. "Approximate Nearest Neighbors and Sequence Comparison with Block Operations", ACM Symposium on Theory of Computing (STOC), 416-424.
19. S. Muthukrishnan and Sahinalp [2002]. "Simple and Practical Sequence Nearest Neighbors with Block Operations", Symposium of Combinatorial Pattern Matching (CPM), Springer Lecture Notes in Computer Science, 262-278.
20. K. H. Rosen [2000]. Elementary Number Theory, Addison-Wesley.
21. T. F. Smith and M. S. Waterman [1981]. "Identification of Common Molecular Sequences", Journal of Molecular Biology 147, 195-197.
22. J. A. Storer [2002]. "An Introduction to Data Structures and Algorithms", Birkhauser - Springer.
23. J. A. Storer and T. G. Szymanski [1978]. "The Macro Model for Data Compression", Proceedings of the 10th Annual ACM Symposium of the Theory of Computing, San Diego, CA, 30-39.;
24. see also J. A. Storer and T. G. Szymanski [1982]. "Data Compression Via Textual Substitution", Journal of the ACM 29:4, 928-951.
25. W. F. Tichy [1984]. "The String to String Correction Problem with Block Moves", ACM Transactions on Computer Systems 2:4, 309-321.
26. P. Weiner [1973]. "Linear Pattern Matching Algorithms", Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, 1-11.