skip to main content
10.1145/313238.313249acmconferencesArticle/Chapter ViewAbstractPublication PagesjcdlConference Proceedingsconference-collections
Article
Free Access

A prototype implementation of archival Intermemory

Authors Info & Claims
Published:01 August 1999Publication History
First page image

References

  1. 1.N. Alon and M. Luby. A linear time erasure-resilient code with nearly optimal recovery. IEEE Transactions on Information Theory, 42(6):1732-1736, November 1996. Google ScholarGoogle ScholarCross RefCross Ref
  2. 2.R. J. Anderson. The eternity service. In Pragocrypt 96, pages 242-252. CTU Publishing, 1996.Google ScholarGoogle Scholar
  3. 3.M. Beck and T. Moore. The internet2 distributed storage infrastructure project: An architecture for internet content channels. University of Tennessee, Department of Computer Science, Technical Report, August 1998.Google ScholarGoogle Scholar
  4. 4.E. R. Berlekamp. Algebraic Coding Theory. McGraw-Hill, New York, 1968.Google ScholarGoogle Scholar
  5. 5.J. Bloemer, M. Kalfane, M. Karpinski, R. Karp, M. Luby, and D. Zukerman. An xor-based erasure-resilient coding scheme. Technical Report ICSI TR-59-048, International Computer Science Insitute, Berkeley, CA, 1995.Google ScholarGoogle Scholar
  6. 6.A. Crespo and H. Garcia-Molina. Archival storage for digital libraries. In Proceedings of the third ACM Conference on Digital libraries (DL '98), pages 69-78, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.J. Garrett, D. Waters, H. Gladney, P. Andre, H.Besser, N. Elkington, H. Gladney, M. Hedstrom, P. Hirtle, K. Hunter, R. Kelly, D. Kresh, M. Lesk, M. Levering, W. Lougee, C. Lynch, C. Mandel, S. Mooney, A. Okerson, J. Neal, S. Rosenblatt, and S. Weibe. Preserving digital information: Report of the task force on archiving of digital information. Technical report, Commission on Preservation and Access and the Research Libraries Group, Washington D.C. and Mountain View, CA, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.A.V. Goldberg and P. N. Yianilos. Towards and archival intermemory. In Proceedings of the IEEE Internationl Forum on Research and Technology Advances in Digital Libraries, pages 147-156, Santa Barbara CA, April 1998. IEEE, IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.B. Kahle. Preserving the internet. Scientific American, pages 82-83, March 1997.Google ScholarGoogle ScholarCross RefCross Ref
  10. 10.R. Kahn and R. Wilensky. A framework for distributed digital object services. Technical Report tn95-01, Corporation for National Research Initiatives (CNRI), May 1995.Google ScholarGoogle Scholar
  11. 11.D. M. Levy. Heroic measures: Reflections on the possibility and purpose of digital preservation. In Proceedings A CM Digital Libraries 98, pages 152-161, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, a6(2):aa5-a48, April 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.J. Rothenberg. Ensuring the longevity of digital documents. Scientific American, pages 42-47, January 1995.Google ScholarGoogle ScholarCross RefCross Ref
  14. 14.B. Schatz and H. Chen. Building large-scale digital libraries. Computer, 29(5):22-26, May 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A prototype implementation of archival Intermemory

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            DL '99: Proceedings of the fourth ACM conference on Digital libraries
            August 1999
            274 pages
            ISBN:1581131453
            DOI:10.1145/313238

            Copyright © 1999 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 August 1999

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            DL '99 Paper Acceptance Rate23of114submissions,20%Overall Acceptance Rate95of346submissions,27%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader