U-form

In computer science, a U-form is an abstract data type comprising a collection of attribute-value pairs associated with a universally-unique identifier (UUID). A U-form essentially comprises an associative array augmented with a UUID and with keys limited to strings.

The UUID that is associated with a u-form is immutable, however all data "contained" in the u-form are mutable (including the keys/names).

The mutability of contained data combined with an immutable identifier make implementations of fully mutable, replicable digital objects possible. This has applications in distributed computing, non-relational database systems, information visualization, and knowledge representation systems.

Navigational databases, Entity and associative entity relationships can be implemented by using a UUID, or multiple UUIDs, as attribute values.

The u-form's design goals center around supporting an open, extensible distributed information space, emphasizing the unambiguous identity of data objects and the separation between data storage, data characterization, and schema development. The use of non-semantic UUIDs combined with a simple attribute-value model draws a clear distinction between identity and data.

Although u-forms share certain design characteristics with serialization formats such as XML, they should not be confused with such representational formats. Since u-forms are abstract, they do not specify any particular representational format. Indeed, they may be stored as or communicated via XML or other types of serialization.

Operations

The operations defined for a u-form are similar to associative arrays:

  • Set_Attribute: Bind an attribute name to a value (replacing any existing binding to that name)
  • Delete_Attribute: Unbind an attribute name from a value and remove the name from the u-form
  • Get_Attribute: Find the value (if any) that is bound to a name.
  • List_Attributes: Find all names that have a non-empty value.

Properties

U-forms have the following properties:

  • A UUID is defined as an array of bytes that is intended to be unique in the Universe.

Note that these are not limited to the standards for ISO, Microsoft, or DCE UUIDs though those are examples of acceptable sources of UUIDs.

  • Attribute names are case-folded and normalized strings of Unicode characters
  • Values are arbitrary-length arrays of bytes (BLOBs, though not necessary "large")
  • Each attribute has only one value (though the bytes may be interpreted to represent a vector of data)
  • The number of attribute-value pairs is arbitrary and extensible at any time
  • The attribute-value pairs are treated as a set (i.e., they are unordered)

Copying vs Replication

An important characteristic of u-forms, of significance to distributed database systems, is that they support a clear distinction between copying and replication of data objects. Copying a u-form involves the creation of a new u-form (i.e., one with a different UUID), but with all attribute-value pairs identical to those of the original u-form. Replicating a u-form involves creating a new instance of the u-form with the same UUID as the original. Note that in a distributed system, two instances of the same u-form may be inconsistent (i.e., they may contain different attribute-value pairs). However, the fact that they have the same UUID means that they are intended to eventually be identical.

History

U-forms were developed at MAYA Design as part of the Visage Information Visualization System, a joint project of MAYA and Carnegie Mellon University funded by DARPA and The Army Research Laboratory. The name "u-form" derives from the term "e-form", a hypothetical "electronic form" proposed by Michael Dertouzos in his 1997 book "What Will Be".[1] In addition to their continuing use in Visage,[2][3] they have been used as the basis of a number of significant research[4][5][6][7] [8] and large-scale production systems, most notably the US Army's Command Post of the Future.

gollark: Seriously? That's your problem with these rules, but your 3-rule ruleset is FINE?
gollark: There are 10 of them, look.
gollark: Also, we don't have evidence now, unless we go back a lot, but R10's new wording is recent and I doubt you would be in favour of retroactively punishing things.
gollark: I have read it, yes.
gollark: Scraping together public information into convenient "summary" data is stalkingy.

References
  1. Dertouzos, Michael L. (1997). What Will Be: How the World of Information Will Change Our Lives. HarperOne. pp. 85–87. ISBN 978-0-06-251479-0.
  2. Michael Higgins; Peter Lucas; Jeffrey Senn (October 24–29, 1999). "VisageWeb: Visualizing WWW Data in Visage". Proceedings of the 1999 IEEE Symposium on Information Visualization.
  3. S. F. Roth; P. Lucas; J. A. Senn; C. C. Gomberg; M. B. Burks; P. J. Stroffolino; A. J. Kolojechick; C. Dunmire (October 28–29, 1996). "Visage: a user interface environment for exploring information". Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96).
  4. Ionescu, M.; Krebs, A. M. & Marsic, I. (2002). "Dynamic content and offline collaboration in synchronous groupware". Paper Presented at the Proceedings of the Collaborative Technologies Symposium (CTS 2002) San Antonio, TX.
  5. I. Marsic (June 1999). "DISCIPLE: A Framework for Multimodal Col- laboration in Heterogeneous Environments" (PDF). ACM Computing Surveys. 2. 31 (2es): 4–es. CiteSeerX 10.1.1.29.4734. doi:10.1145/323216.323225.
  6. Ivan Marsic (July–August 2001). "Adaptive Collaboration for Wired and Wireless Platforms". IEEE Internet Computing: 26–35. CiteSeerX 10.1.1.23.7523.
  7. DOROHONCEANU, BOGDAN (2004). INTERFACE HETEROGENEITY AND GROUP INTERACTION (PDF). Dissertation submitted to the Graduate School—New Brunswick Rutgers, The State University of New Jersey.
  8. Dominic Widdows; Peter Lucas; David Holstius; Michael Higgins (June 15, 2007). "The Civium World Model: Spatial and Semantic Issues in Pervasive Computing" (PDF). Tech Report MAYA-07013.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.