## Optimal reflection of bidirectional view updates using information-based distance measures

Venue: | Roskilde University |

Citations: | 1 - 1 self |

### BibTeX

@INPROCEEDINGS{Hegner_optimalreflection,

author = {Stephen J. Hegner},

title = {Optimal reflection of bidirectional view updates using information-based distance measures},

booktitle = {Roskilde University},

year = {},

pages = {2009}

}

### OpenURL

### Abstract

Abstract. When a database view is to be updated, there are generally many choices for the new state of the main schema. One way of characterizing the best such choice is to minimize the distance between the old state of the main schema and the new one. In recent work, a means of representing such distance based upon semantics was forwarded in which the distance between two states is measured by the the difference of information between the two, with the information of a state defined as the set of sentences from a particular set which hold on that state. This approach proved to be highly useful in identifying optimal reflections of insertions and to a lesser extent deletions, provided that the reflections were themselves insertions or deletions. In this work, that investigation is extended to bidirectional view updates – those which involve both insertion and deletion. It is shown that the definition of distance must be crafted more carefully in such situations. Upon so doing, a result is obtained which provides update reflections which are information optimal for insertion and deletion optimal with respect to tuples but not necessarily information. 1

### Citations

453 |
Optimal implementation of conjunctive queries in relational data bases
- Chandra, Merlin
- 1977
(Show Context)
Citation Context ...are those of the set K consisting of all such symbols which occur in any of the current base state, the current view state, or the new view state. These sentences are just Boolean conjunctive queries =-=[5]-=-; i.e., conjunctive queries without free variables. A short example, adapted from that of [16, 1.3], will help illustrate the key ideas. For a more detailed presentation the reader is referred to that... |

432 | The Theory of Relational Databases - Maier - 1983 |

187 | Update semantics of relational views
- Bancilhon, Spyratos
- 1981
(Show Context)
Citation Context ...approaches often handle certain cases very well but lack the thread of a unifying theory. The second group has focused upon the constant-complement approach, first forwarded by Bancilhon and Spyratos =-=[3]-=- and subsequently developed in [14,15,22]. The approach provides an elegant theory within a limited scope, but the conservative nature of constant-complement-based strategies leaves uncovered many imp... |

51 | Distance measures for point sets and their computation
- Eiter, Mannila
- 1997
(Show Context)
Citation Context ...ed upon (pseudo-)distance measures such as those proposed in [19] and [24]. These may then be extended to sets of tuples (i.e., databases) using aggregated measures, such as that of Eiter and Mannila =-=[8]-=-. Despite their obvious positive aspects, these measures nevertheless maintain a largely syntactic flavor. In [17] 1 and [16], an alternative approach is forwarded, in which a semantic notion of dista... |

38 | Distance between Herbrand Interpretations: A Measure for Approximations to a Target Concept, in
- Nienhuys-Cheng
- 1997
(Show Context)
Citation Context ... tuples cannot recapture this. To address this issue, more sophisticated measures of distance have been proposed [1] which are based upon (pseudo-)distance measures such as those proposed in [19] and =-=[24]-=-. These may then be extended to sets of tuples (i.e., databases) using aggregated measures, such as that of Eiter and Mannila [8]. Despite their obvious positive aspects, these measures nevertheless m... |

33 |
clauses and database dependencies
- Horn
- 1982
(Show Context)
Citation Context ...fies the constraints of Closure〈Φ, Ψ〉 but no other constraints of Final version: 20090916 LID2009 page 4Ψ. Armstrong models have been studied extensively for database dependencies; see, for example, =-=[9]-=- and [11]. The construction within Υ D K is much simpler. For a finite set Φ, (almost) all that need be done is to rename variables so that all are distinct, remove the quantifiers, break the conjunct... |

27 | Data exchange: semantics and query answering. Theoretical Computer Science 336(1):89–124 - Fagin, Kolaitis, et al. - 2005 |

27 |
Metrics on Terms and Clauses
- Hutchinson
- 1997
(Show Context)
Citation Context ...ucture of tuples cannot recapture this. To address this issue, more sophisticated measures of distance have been proposed [1] which are based upon (pseudo-)distance measures such as those proposed in =-=[19]-=- and [24]. These may then be extended to sets of tuples (i.e., databases) using aggregated measures, such as that of Eiter and Mannila [8]. Despite their obvious positive aspects, these measures never... |

26 |
View updates in relational databases with an independent schema
- Langerak
- 1990
(Show Context)
Citation Context ...g updates to databases through views has long been one which has challenged researchers. Roughly speaking, the approaches may be considered to lie in one of three groups. The first, as represented by =-=[7, 20,21, 4]-=-, focus upon using the relational algebra, together with null values, to identify optimal or at least acceptable solutions. These approaches often handle certain cases very well but lack the thread of... |

24 | Introduction to lattices and order.” Cambridge University press - Davey, Priestley - 2002 |

20 |
The impact of the constant complement approach towards view updating
- Lechtenbörger
(Show Context)
Citation Context ...ses very well but lack the thread of a unifying theory. The second group has focused upon the constant-complement approach, first forwarded by Bancilhon and Spyratos [3] and subsequently developed in =-=[14,15,22]-=-. The approach provides an elegant theory within a limited scope, but the conservative nature of constant-complement-based strategies leaves uncovered many important situations. The third approach, de... |

18 | An order-based theory of updates for closed database views
- Hegner
(Show Context)
Citation Context ...ses very well but lack the thread of a unifying theory. The second group has focused upon the constant-complement approach, first forwarded by Bancilhon and Spyratos [3] and subsequently developed in =-=[14,15,22]-=-. The approach provides an elegant theory within a limited scope, but the conservative nature of constant-complement-based strategies leaves uncovered many important situations. The third approach, de... |

15 | Updating Relational Databases through Views
- Keller
- 1985
(Show Context)
Citation Context ...g updates to databases through views has long been one which has challenged researchers. Roughly speaking, the approaches may be considered to lie in one of three groups. The first, as represented by =-=[7, 20,21, 4]-=-, focus upon using the relational algebra, together with null values, to identify optimal or at least acceptable solutions. These approaches often handle certain cases very well but lack the thread of... |

14 |
Model theoretic approach to view updates in deductive databases
- Fernández, Grant, et al.
- 1996
(Show Context)
Citation Context ...rtant situations. The third approach, developed largely within the logic-programming community, is based upon using distance measures to find solutions which change the database as little as possible =-=[2,12,13]-=-. The core idea behind these approaches is to minimize the “distance” between the old state of the main schema and Final version: 20090916 LID2009 page 1the new state which reflects the view update. ... |

11 | The complexity of embedded axiomatization for a class of closed database views
- Hegner
(Show Context)
Citation Context ...ses very well but lack the thread of a unifying theory. The second group has focused upon the constant-complement approach, first forwarded by Bancilhon and Spyratos [3] and subsequently developed in =-=[14,15,22]-=-. The approach provides an elegant theory within a limited scope, but the conservative nature of constant-complement-based strategies leaves uncovered many important situations. The third approach, de... |

10 |
Armstrong databases for functional and inclusion dependencies
- Fagin, Vardi
- 1983
(Show Context)
Citation Context ... constraints of Closure〈Φ, Ψ〉 but no other constraints of Final version: 20090916 LID2009 page 4Ψ. Armstrong models have been studied extensively for database dependencies; see, for example, [9] and =-=[11]-=-. The construction within Υ D K is much simpler. For a finite set Φ, (almost) all that need be done is to rename variables so that all are distinct, remove the quantifiers, break the conjuncts into at... |

8 |
Computing repairs for inconsistent databases
- Greco, Zumpano
- 2001
(Show Context)
Citation Context ...rtant situations. The third approach, developed largely within the logic-programming community, is based upon using distance measures to find solutions which change the database as little as possible =-=[2,12,13]-=-. The core idea behind these approaches is to minimize the “distance” between the old state of the main schema and Final version: 20090916 LID2009 page 1the new state which reflects the view update. ... |

6 | Distance semantics for database repair
- Arieli, Denecker, et al.
- 2007
(Show Context)
Citation Context ...ither is to R(a3, b3, c3), but a measure which does not consider the inner structure of tuples cannot recapture this. To address this issue, more sophisticated measures of distance have been proposed =-=[1]-=- which are based upon (pseudo-)distance measures such as those proposed in [19] and [24]. These may then be extended to sets of tuples (i.e., databases) using aggregated measures, such as that of Eite... |

6 | Computational methods for database repair by signed formulae
- Arieli, Denecker, et al.
(Show Context)
Citation Context ...rtant situations. The third approach, developed largely within the logic-programming community, is based upon using distance measures to find solutions which change the database as little as possible =-=[2,12,13]-=-. The core idea behind these approaches is to minimize the “distance” between the old state of the main schema and Final version: 20090916 LID2009 page 1the new state which reflects the view update. ... |

6 |
Semantic bijectivity and the uniqueness of constant-complement updates in the relatiional context
- Hegner
(Show Context)
Citation Context ... 〈u+〉 + , IdealD(P)〉 is insertion optimal follows from Proposition 4.3. ✷ See Examples 3.8 for examples of the above construction. Discussion 4.7 (The optimality of constant-complement solutions). In =-=[18]-=-, constant-complement update strategies ([3], [14]) are investigated the context of information-based distance measures, with the main result [18, 4.23] establishing that all such strategies based upo... |

4 | Inversion de l’algèbre relationnelle et mises à jour
- Bentayeb, Laurent
- 1997
(Show Context)
Citation Context ...g updates to databases through views has long been one which has challenged researchers. Roughly speaking, the approaches may be considered to lie in one of three groups. The first, as represented by =-=[7, 20,21, 4]-=-, focus upon using the relational algebra, together with null values, to identify optimal or at least acceptable solutions. These approaches often handle certain cases very well but lack the thread of... |

4 |
Information-based distance measures and the canonical reflection of view updates
- Hegner
(Show Context)
Citation Context ...e., databases) using aggregated measures, such as that of Eiter and Mannila [8]. Despite their obvious positive aspects, these measures nevertheless maintain a largely syntactic flavor. In [17] 1 and =-=[16]-=-, an alternative approach is forwarded, in which a semantic notion of distance is employed, based upon the truth value of certain sentences rather than any syntactic characteristics of the atoms. The ... |

4 | Information-optimal reflections of view updates on relational database schemata - Hegner - 2008 |