Name
Abstract | ||
|---|---|---|
Database updates have recently received much more attention than in the past. In this trend, a solid foundation is provided to the problem of updating databases through interfaces based on the weak instance model. Insertions and deletions of tuples are considered.As a preliminary tool, a lattice on states is defined, based on the information content of the various states.Potential results of an insertion are states that contain at least the information in the original state and that in the new tuple. Sometimes there is no potential result, and in the other cases there may be many of them. We argue that the insertion is deterministic if the state that contains the information common to all the potential results (the greatest lower bound, in the lattice framework) is itself a potential result. Effective characterizations for the various cases exist. A symmetric approach is followed for deletions, with fewer cases, since there are always potential results; determinism is characterized consequently. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1145/73721.73731 | PODS |
Keywords | Field | DocType |
weak instance model,database updates,original state,updating databases,potential result,information content,new tuple,various case,effective characterization,various state,fewer case,lattice framework,lower bound | Discrete mathematics,Lattice (order),Determinism,Upper and lower bounds,Tuple,Computer science,Theoretical computer science,Database | Conference |
ISBN | Citations | PageRank |
0-89791-308-6 | 27 | 17.51 |
References | Authors | |
22 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Atzeni | 1 | 77 | 60.41 |
| R. Torlone | 2 | 33 | 18.31 |