Toward a model of self-administering data

  • Authors:
  • ByungHoon Kang;Robert Wilensky0

  • Affiliations:
  • Division of Computer Science, UC Berkeley, Berkeley, CA;Division of Computer Science, UC Berkeley, Berkeley, CA

  • Venue:
  • Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a model of self-administering data. In this model, adeclarative description of how a data object should behave is attached to the object, either by a user or by a data input device. A widespread infrastructure of self-administering data handlers is presumed to exist; these handlers are responsible for carrying out the specifications attached to the data. Typically, the specifications express how and to whom the data should be transferred, how it should be incorporated when it is received, what rights recipients of the data will have with respect to it, and the kind of relation that should exist between distributed copies of the object. Functions such as distributed version control can be implemented on top of the basic handler functions. We suggest that this model can provide superior support for common cooperative functions. Because the model is declarative, users need only express their intentions once in creating a self-administering description, and need not be concerned with manually performing subsequent repetitious operations. Because the model is peer-to-peer, users are less dependent on additional, perhaps costly resources, at least when these are not critical.An initial implementation of the model has been created. We are experimenting with the model both as a tool to aid in digital library functions, and as a possible replacement for some server oriented functions.