Object Repositories for Digital Libraries

Digital libraries encompass an enormous range of functionality. One fundamental task of a digital library is to store digital content. Storage management in digital libraries is delegated conceptually to the repository component. As the amount and complexity of content continues to grow, the issue of scalability grows more pressing. Like traditional file systems, digital library repositories must be capable of scaling to billions of objects and petabytes (250 bytes) of total storage.

[1]  Barry M. Leiner,et al.  The NCSTRL Approach to Open Architecture for the Confederated Digital Library , 1998, D-Lib Magazine.

[2]  Jose Renato Santos,et al.  A parallel disk storage system for real‐time multimedia applications , 1998 .

[3]  Thomas Schwarz,et al.  LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes , 2000, SIGMOD 2000.

[4]  Witold Litwin,et al.  RP*: A Family of Order Preserving Scalable Distributed Data Structures , 1994, VLDB.

[5]  Carl Lagoze,et al.  A protocol and server for a distributed digital technical report library , 1994 .

[6]  Jeffrey B. Lotspiech,et al.  Safeguarding Digital Library Contents and Users: Assuring Convenient Security and Data Quality , 1997, D Lib Mag..

[7]  Andy Powell.  Resolving DOI Based URNs Using Squid: An Experimental System at UKOLN , 1998, D Lib Mag..

[8]  Jose Renato Santos,et al.  Performance analysis of the RIO multimedia storage system with heterogeneous disk configurations , 1998, MULTIMEDIA '98.

[9]  Larry Lannom,et al.  Handle System Overview , 2003, RFC.

[10]  Robert Devine,et al.  Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm , 1993, FODO.

[11]  Witold Litwin,et al.  LH*s: a high-availability and high-security scalable distributed data structure , 1997, Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications.

[12]  Garth A. Gibson,et al.  Active Disks: Remote Execution for Network-Attached Storage (CMU-CS-97-198) , 1997 .

[13]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[14]  Carl Lagoze,et al.  Distributed Active Relationships in the Warwick Framework , 1997, MD.

[15]  Sean Reilly,et al.  Handle System Namespace and Service Definition , 2003, RFC.

[16]  Sandra Payette,et al.  An Infrastructure for Open-Architecture Digital Libraries , 1998 .

[17]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[18]  Tore Risch,et al.  LH* Schemes with Scalable Availability , 1998 .

[19]  Klaus Meyer,et al.  The SICMA Multimedia Server and Virtual Museum Application , 1998, ECMAST.

[20]  Jeffrey B. Lotspiech,et al.  Safeguarding Digital Library Contents and Users: Protecting Documents Rather Than Channels , 1997, D Lib Mag..

[21]  Noga Alon,et al.  A linear time erasure-resilient code with nearly optimal recovery , 1996, IEEE Trans. Inf. Theory.

[22]  Kevin Chen-Chuan Chang,et al.  Using Distributed Objects to Build the Stanford Digital Library Infobus , 1999, Computer.

[23]  Witold Litwin,et al.  LH*—a scalable, distributed data structure , 1996, TODS.

[24]  Gerhard Weikum,et al.  Distributed file organization with scalable cost/performance , 1994, SIGMOD '94.

[25]  Norman Paskin,et al.  Toward unique identifiers , 1999, Proc. IEEE.

[26]  Kurt Maly,et al.  NCSTRL+: adding multi-discipline and multi-genre support to the Dienst protocol using clusters and buckets , 1998, Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-.

[27]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[28]  Eric Miller,et al.  An Introduction to the Resource Description Framework , 1998, D Lib Mag..

[29]  David A. Patterson,et al.  A case for intelligent disks (IDISKs) , 1998, SGMD.

[30]  Sandra Payette,et al.  Flexible and Extensible Digital Object and Repository Architecture (FEDORA) , 1998, ECDL.

[31]  Tore Risch,et al.  Design Issues for Scalable Availability LH* Schemes with Recor Grouping , 1999, WDAS.

[32]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[33]  Witold Litwin,et al.  High-availability LH* schemes with mirroring , 1996, Proceedings First IFCIS International Conference on Cooperative Information Systems.

[34]  Chaitanya K. Baru,et al.  Collection-Based Persistent Digital Archives - Part 1 , 2000, D Lib Mag..

[35]  Carl Lagoze,et al.  A Secure Repository Design for Digital Libraries , 1995, D-Lib Magazine.

[36]  Micah Beck,et al.  The Internet2 Distributed Storage Infrastructure Project: An Architecture for Internet Content Channels , 1998, Comput. Networks.

[37]  Hector Garcia-Molina,et al.  Archival storage for digital libraries , 1998, DL '98.

[38]  Witold Litwin,et al.  LH* - Linear Hashing for Distributed Files , 1993, SIGMOD Conference.

[39]  Tore Risch,et al.  LH*LH: A scalable High Performance Data Structure for Switched Multicomputers , 1996, EDBT.

[40]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[41]  Witold Litwin,et al.  Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.

[42]  Philip A. Bernstein,et al.  Proceedings of the 2000 ACM SIGMOD : International Conference on Management of Data, May 16-18, 2000, Dallas, Texas , 2000 .

[43]  Richard T. Snodgrass,et al.  Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data : SIGMOD '94, Minneapolis, Minnesota, May 24-27, 1994 , 1994, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[44]  Per-Åke Larson,et al.  Dynamic hash tables , 1988, CACM.

[45]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[46]  Edmund H. Durfee,et al.  The agent architecture of the Univercity of Michingan Digital Library , 1997, IEE Proc. Softw. Eng..

[47]  Joel H. Saltz,et al.  Active disks: programming model, algorithms and evaluation , 1998, ASPLOS VIII.

[48]  Peter Widmayer,et al.  Distributing a search tree among a growing number of processors , 1994, SIGMOD '94.

[49]  David Hutchison,et al.  Proceedings of the Third European Conference on Multimedia Applications, Services and Techniques , 1998 .

[50]  Richard R. Muntz,et al.  Randomized data allocation for real-time disk I/O , 1996, COMPCON '96. Technologies for the Information Superhighway Digest of Papers.

[51]  Harold Thiele.  The Dublin Core and Warwick Framework: A Review of the Literature, March 1995 - September 1997 , 1998, D Lib Mag..

[52]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[53]  Kurt Maly,et al.  Smart Objects, Dumb Archives: A User-Centric, Layered Digital Library Framework , 1999, D Lib Mag..

[54]  Clifford A. Lynch,et al.  The Warwick Framework: A Container Architecture for Aggregating Sets of Metadata , 1996 .

[55]  Gerhard O. Michler,et al.  Report on the retrodigitization project “Archiv der Mathematik” , 2001 .

[56]  William J. Bolosky,et al.  A large-scale study of file-system contents , 1999, SIGMETRICS '99.

[57]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[58]  Carl Lagoze,et al.  Dienst: Implementation Reference Manual , 1995 .

[59]  Marc Unangst,et al.  NASD Scalable Storage Systems , 1999 .

[60]  Roger L. Haskin,et al.  On extending the functions of a relational database system , 1982, SIGMOD '82.