183:, 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.
211:. 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". In addition to their continuing use in Visage, they have been used as the basis of a number of significant research and large-scale production systems, most notably the US Army's
72:
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
54:
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.
80:, 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.
280:
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".
443:
208:
249:
51:
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).
29:
444:
http://www.biotech-online.com/fileadmin/artimg/the-universal-genetics-database_-information-sharing-in-genetics-and-beyond.pdf
295:
Ionescu, M.; Krebs, A. M. & Marsic, I. (2002). "Dynamic content and offline collaboration in synchronous groupware".
463:
468:
212:
200:
62:
196:
33:
265:
Michael
Higgins; Peter Lucas; Jeffrey Senn (October 24–29, 1999). "VisageWeb: Visualizing WWW Data in Visage".
311:
448:
396:. Dissertation submitted to the Graduate School—New Brunswick Rutgers, The State University of New Jersey.
367:
326:
297:
Paper
Presented at the Proceedings of the Collaborative Technologies Symposium (CTS 2002) San Antonio, TX
147:
58:
180:
164:
Each attribute has only one value (though the bytes may be interpreted to represent a vector of data)
66:
372:
331:
158:
344:
192:
25:
433:
245:
45:
438:
336:
241:
234:
143:
17:
362:
Ivan Marsic (July–August 2001). "Adaptive
Collaboration for Wired and Wireless Platforms".
388:
69:
relationships can be implemented by using a UUID, or multiple UUIDs, as attribute values.
76:
Although u-forms share certain design characteristics with serialization formats such as
428:
408:
457:
348:
312:"DISCIPLE: A Framework for Multimodal Col- laboration in Heterogeneous Environments"
282:
Proceedings of the 1996 IEEE Symposium on
Information Visualization (INFOVIS '96)
95:: Bind an attribute name to a value (replacing any existing binding to that name)
407:
Dominic
Widdows; Peter Lucas; David Holstius; Michael Higgins (June 15, 2007).
130:
is defined as an array of bytes that is intended to be unique in the
Universe.
409:"The Civium World Model: Spatial and Semantic Issues in Pervasive Computing"
167:
The number of attribute–value pairs is arbitrary and extensible at any time
101:: Unbind an attribute name from a value and remove the name from the u-form
73:
attribute–value model draws a clear distinction between identity and data.
340:
170:
The attribute–value pairs are treated as a set (i.e., they are unordered)
449:
https://books.google.com/books?id=oDYEAAAAMBAJ&q=u-form&pg=PA20
151:
88:
The operations defined for a u-form are similar to associative arrays:
267:
Proceedings of the 1999 IEEE Symposium on
Information Visualization
204:
236:
What Will Be: How the World of
Information Will Change Our Lives
135:
37:
77:
434:
http://www.bio-itworld.com/issues/2006/july-aug/infocommons/
179:
An important characteristic of u-forms, of significance to
138:
though those are examples of acceptable sources of UUIDs.
439:
http://www.asis.org/Bulletin/Jun-07/Bulletin_JunJul07.pdf
48:
augmented with a UUID and with keys limited to strings.
429:
http://www.maya.com/portfolio/maya-universal-database
134:
Note that these are not limited to the standards for
233:
107:: Find the value (if any) that is bound to a name.
390:INTERFACE HETEROGENEITY AND GROUP INTERACTION
157:Values are arbitrary-length arrays of bytes (
113:: Find all names that have a non-empty value.
8:
371:
330:
224:
197:Visage Information Visualization System
122:U-forms have the following properties:
7:
38:universally-unique identifier (UUID)
14:
161:, though not necessary "large")
232:Dertouzos, Michael L. (1997).
199:, a joint project of MAYA and
1:
387:DOROHONCEANU, BOGDAN (2004).
209:The Army Research Laboratory
181:distributed database systems
136:ISO, Microsoft, or DCE UUIDs
485:
213:Command Post of the Future
201:Carnegie Mellon University
191:U-forms were developed at
414:. Tech Report MAYA-07013.
44:essentially comprises an
364:IEEE Internet Computing
310:I. Marsic (June 1999).
240:. HarperOne. pp.
175:Copying vs replication
59:Navigational databases
341:10.1145/323216.323225
319:ACM Computing Surveys
34:attribute–value pairs
142:Attribute names are
464:Abstract data types
469:Unique identifiers
148:normalized strings
67:associative entity
36:associated with a
26:abstract data type
251:978-0-06-251479-0
46:associative array
476:
416:
415:
413:
404:
398:
397:
395:
384:
378:
377:
375:
359:
353:
352:
334:
316:
307:
301:
300:
292:
286:
285:
277:
271:
270:
262:
256:
255:
239:
229:
99:Delete_Attribute
18:computer science
484:
483:
479:
478:
477:
475:
474:
473:
454:
453:
425:
420:
419:
411:
406:
405:
401:
393:
386:
385:
381:
361:
360:
356:
314:
309:
308:
304:
294:
293:
289:
279:
278:
274:
264:
263:
259:
252:
231:
230:
226:
221:
195:as part of the
189:
177:
120:
111:List_Attributes
86:
12:
11:
5:
482:
480:
472:
471:
466:
456:
455:
452:
451:
446:
441:
436:
431:
424:
423:External links
421:
418:
417:
399:
379:
373:10.1.1.23.7523
354:
332:10.1.1.29.4734
302:
287:
272:
257:
250:
223:
222:
220:
217:
188:
185:
176:
173:
172:
171:
168:
165:
162:
155:
132:
131:
119:
116:
115:
114:
108:
102:
96:
85:
82:
13:
10:
9:
6:
4:
3:
2:
481:
470:
467:
465:
462:
461:
459:
450:
447:
445:
442:
440:
437:
435:
432:
430:
427:
426:
422:
410:
403:
400:
392:
391:
383:
380:
374:
369:
365:
358:
355:
350:
346:
342:
338:
333:
328:
325:(2es): 4–es.
324:
320:
313:
306:
303:
298:
291:
288:
283:
276:
273:
268:
261:
258:
253:
247:
243:
238:
237:
228:
225:
218:
216:
214:
210:
206:
202:
198:
194:
186:
184:
182:
174:
169:
166:
163:
160:
156:
153:
149:
145:
141:
140:
139:
137:
129:
125:
124:
123:
117:
112:
109:
106:
105:Get_Attribute
103:
100:
97:
94:
93:Set_Attribute
91:
90:
89:
83:
81:
79:
74:
70:
68:
64:
60:
56:
52:
49:
47:
43:
39:
35:
31:
28:comprising a
27:
23:
19:
402:
389:
382:
363:
357:
322:
318:
305:
296:
290:
281:
275:
266:
260:
235:
227:
190:
178:
133:
127:
121:
110:
104:
98:
92:
87:
75:
71:
57:
53:
50:
41:
21:
15:
193:MAYA Design
144:case-folded
458:Categories
219:References
203:funded by
154:characters
118:Properties
84:Operations
30:collection
368:CiteSeerX
366:: 26–35.
327:CiteSeerX
349:18240842
187:History
152:Unicode
370:
347:
329:
248:
63:Entity
42:U-form
24:is an
22:U-form
412:(PDF)
394:(PDF)
345:S2CID
321:. 2.
315:(PDF)
242:85–87
205:DARPA
159:BLOBs
40:. A
246:ISBN
207:and
146:and
128:UUID
65:and
20:, a
337:doi
150:of
78:XML
32:of
16:In
460::
343:.
335:.
323:31
317:.
244:.
215:.
126:A
61:,
376:.
351:.
339::
299:.
284:.
269:.
254:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.