Combining dependent annotations for relational algebra
Annotation is some form of data that is added to an existing database. It could be additional data that for whatever reason cannot be stored in the original database, or it could be some form of metadata such as comments, probabilities, timestamps that are not normally regarded part of the basic dat...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Association for Computing Machinery
2012
|
| _version_ | 1797073216018055168 |
|---|---|
| author | Kostylev, E Buneman, P |
| author_facet | Kostylev, E Buneman, P |
| author_sort | Kostylev, E |
| collection | OXFORD |
| description | Annotation is some form of data that is added to an existing database. It could be additional data that for whatever reason cannot be stored in the original database, or it could be some form of metadata such as comments, probabilities, timestamps that are not normally regarded part of the basic database design. It has recently been observed that, in order to determine how annotations should be propagated through database queries, we need to have some structure on them. Although various forms of annotation have been considered in some detail, each form has been considered in isolation. In this paper we consider what happens when different forms of annotation are combined. We show that there are many cases in which annotations, for quite natural reasons, depend on one another. What is the appropriate structure to place on such annotations? We provide a method for combining different forms and provide a normal form which is useful in deciding whether two or more combined annotations are equivalent. |
| first_indexed | 2024-03-06T23:18:54Z |
| format | Conference item |
| id | oxford-uuid:6815b47b-aea0-45d6-9458-b34cdadacb53 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T23:18:54Z |
| publishDate | 2012 |
| publisher | Association for Computing Machinery |
| record_format | dspace |
| spelling | oxford-uuid:6815b47b-aea0-45d6-9458-b34cdadacb532022-03-26T18:42:29ZCombining dependent annotations for relational algebraConference itemhttp://purl.org/coar/resource_type/c_5794uuid:6815b47b-aea0-45d6-9458-b34cdadacb53Symplectic Elements at OxfordAssociation for Computing Machinery2012Kostylev, EBuneman, PAnnotation is some form of data that is added to an existing database. It could be additional data that for whatever reason cannot be stored in the original database, or it could be some form of metadata such as comments, probabilities, timestamps that are not normally regarded part of the basic database design. It has recently been observed that, in order to determine how annotations should be propagated through database queries, we need to have some structure on them. Although various forms of annotation have been considered in some detail, each form has been considered in isolation. In this paper we consider what happens when different forms of annotation are combined. We show that there are many cases in which annotations, for quite natural reasons, depend on one another. What is the appropriate structure to place on such annotations? We provide a method for combining different forms and provide a normal form which is useful in deciding whether two or more combined annotations are equivalent. |
| spellingShingle | Kostylev, E Buneman, P Combining dependent annotations for relational algebra |
| title | Combining dependent annotations for relational algebra |
| title_full | Combining dependent annotations for relational algebra |
| title_fullStr | Combining dependent annotations for relational algebra |
| title_full_unstemmed | Combining dependent annotations for relational algebra |
| title_short | Combining dependent annotations for relational algebra |
| title_sort | combining dependent annotations for relational algebra |
| work_keys_str_mv | AT kostyleve combiningdependentannotationsforrelationalalgebra AT bunemanp combiningdependentannotationsforrelationalalgebra |