Annotations are relative
Most systems that have been developed for annotation of data assume a two-level structure in which annotation is superimposed on, and separate from, the data. However there are many cases in which an annotation may itself be annotated. For example threads in e-mail and newsgroups allow the impositio...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
Association for Computing Machinery
2013
|
| _version_ | 1797100571632599040 |
|---|---|
| author | Buneman, P Kostylev, E Vansummeren, S |
| author_facet | Buneman, P Kostylev, E Vansummeren, S |
| author_sort | Buneman, P |
| collection | OXFORD |
| description | Most systems that have been developed for annotation of data assume a two-level structure in which annotation is superimposed on, and separate from, the data. However there are many cases in which an annotation may itself be annotated. For example threads in e-mail and newsgroups allow the imposition of one comment on another; belief annotations can be compounded; and valid time, regarded as an annotation can be freely mixed with belief annotations (at time t1, B1 believed that at time t2, B2 believed that...). In this paper we describe a hierarchical model of annotation in which there is no absolute distinction between annotation and data. First, we introduce a term model for annotations and, in order to express the fact that an annotation may apply to two or more data values with some shared structure, we provide a simple schema for annotation hierarchies. We then look at how queries can be applied to such hierarchies; in particular we ask the usual question of how annotations should propagate through queries. We take the view that the query together with schema describes a level in the hierarchy: everything below this level is treated as data to which the query should be applied; everything above it is annotation which should, according to certain rules, be propagated with the query. We also examine the representation of annotation hierarchies in conventional relational structures and describe a technique for annotating datalog programs. |
| first_indexed | 2024-03-07T05:39:25Z |
| format | Conference item |
| id | oxford-uuid:e50bf32e-ac61-4216-a4cd-e5152e801fbd |
| institution | University of Oxford |
| last_indexed | 2024-03-07T05:39:25Z |
| publishDate | 2013 |
| publisher | Association for Computing Machinery |
| record_format | dspace |
| spelling | oxford-uuid:e50bf32e-ac61-4216-a4cd-e5152e801fbd2022-03-27T10:21:07ZAnnotations are relativeConference itemhttp://purl.org/coar/resource_type/c_5794uuid:e50bf32e-ac61-4216-a4cd-e5152e801fbdSymplectic Elements at OxfordAssociation for Computing Machinery2013Buneman, PKostylev, EVansummeren, SMost systems that have been developed for annotation of data assume a two-level structure in which annotation is superimposed on, and separate from, the data. However there are many cases in which an annotation may itself be annotated. For example threads in e-mail and newsgroups allow the imposition of one comment on another; belief annotations can be compounded; and valid time, regarded as an annotation can be freely mixed with belief annotations (at time t1, B1 believed that at time t2, B2 believed that...). In this paper we describe a hierarchical model of annotation in which there is no absolute distinction between annotation and data. First, we introduce a term model for annotations and, in order to express the fact that an annotation may apply to two or more data values with some shared structure, we provide a simple schema for annotation hierarchies. We then look at how queries can be applied to such hierarchies; in particular we ask the usual question of how annotations should propagate through queries. We take the view that the query together with schema describes a level in the hierarchy: everything below this level is treated as data to which the query should be applied; everything above it is annotation which should, according to certain rules, be propagated with the query. We also examine the representation of annotation hierarchies in conventional relational structures and describe a technique for annotating datalog programs. |
| spellingShingle | Buneman, P Kostylev, E Vansummeren, S Annotations are relative |
| title | Annotations are relative |
| title_full | Annotations are relative |
| title_fullStr | Annotations are relative |
| title_full_unstemmed | Annotations are relative |
| title_short | Annotations are relative |
| title_sort | annotations are relative |
| work_keys_str_mv | AT bunemanp annotationsarerelative AT kostyleve annotationsarerelative AT vansummerens annotationsarerelative |