Extending BCDM to cope with proposals and evaluations of updates
|Extending BCDM to cope with proposals and evaluations of updates|
|Author(s)||Anselma L., Bottrighi A., Montani S., Terenziani P.|
|Published in||IEEE Transactions on Knowledge and Data Engineering|
|Keyword(s)||database design, database semantics, modeling and management, Temporal databases (Extra: Basic properties, Conceptual data models, Database design, Relational algebra, Relational Model, Semantic approach, Temporal Database, Temporal relational database, Theoretical framework, Wikipedia, Data structures, Relational database systems, Semantics, Quality control)|
|Article||BASE, CiteSeerX, Google Scholar|
|Web||Ask, Bing, Google (PDF), Yahoo!|
|Download and mirrors|
|Local copy||Not available|
|Remote mirror(s)||Not available|
|Export and share|
|BibTeX, CSV, RDF, JSON|
|Browse properties · List of journal articles|
Extending BCDM to cope with proposals and evaluations of updates is a 2013 journal article written in English by Anselma L., Bottrighi A., Montani S., Terenziani P. and published in IEEE Transactions on Knowledge and Data Engineering.
The cooperative construction of data/knowledge bases has recently had a significant impulse (see, e.g., Wikipedia ). In cases in which data/knowledge quality and reliability are crucial, proposals of update/insertion/deletion need to be evaluated by experts. To the best of our knowledge, no theoretical framework has been devised to model the semantics of update proposal/evaluation in the relational context. Since time is an intrinsic part of most domains (as well as of the proposal/evaluation process itself), semantic approaches to temporal relational databases (specifically, Bitemporal Conceptual Data Model (henceforth, BCDM) ) are the starting point of our approach. In this paper, we propose BCDMPV, a semantic temporal relational model that extends BCDM to deal with multiple update/insertion/deletion proposals and with acceptances/rejections of proposals themselves. We propose a theoretical framework, defining the new data structures, manipulation operations and temporal relational algebra and proving some basic properties, namely that BCDMPV is a consistent extension of BCDM and that it is reducible to BCDM. These properties ensure consistency with most relational temporal database frameworks, facilitating implementations.
- This section requires expansion. Please, help!
Probably, this publication is cited by others, but there are no articles available for them in WikiPapers.