Tracing the lineage of view data in a warehousing environment
ACM Transactions on Database Systems (TODS)
DBNotes: a post-it system for relational databases based on provenance
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
MONDRIAN: Annotating and Querying Databases through Colors and Blocks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Update exchange with mappings and provenance
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Believe it or not: adding belief annotations to databases
Proceedings of the VLDB Endowment
Provenance for aggregate queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment of Conjunctive Queries on Annotated Relations
Theory of Computing Systems
A general framework for representing, reasoning and querying with annotated Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Combining dependent annotations for relational algebra
Proceedings of the 15th International Conference on Database Theory
Interacting with digital cultural heritage collections via annotations: the CULTURA approach
Proceedings of the 2013 ACM symposium on Document engineering
| Hi-index | 0.00 |
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.