ICDT '88: 2nd International Conference on Database Theory, Bruges, Belgium, August 31-September 2, 1988. ProceedingsThis volume is the proceedings of the second International Conference on Database Theory (ICDT) held in Bruges, Belgium, August 31 - September 2, 1988. ICDT intends to provide a European forum for the international research community working on theoretical issues related to database and knowledge base systems. The proceedings of this conference contain all invited and accepted papers, which represent the latest results obtained in ongoing research in database theory worldwide. Most major themes of research in database theory are covered in ICDT '88: the relational model, logic and databases, object-oriented databases, deductive databases, conceptual models, analysis and design of data structures, query languages, concurrency control and updates and transactions. |
Contents
I | 1 |
II | 19 |
III | 41 |
IV | 72 |
V | 87 |
VI | 102 |
VII | 118 |
VIII | 129 |
XV | 239 |
XVI | 252 |
XVII | 267 |
XVIII | 281 |
XIX | 292 |
XX | 307 |
XXI | 322 |
XXII | 338 |
Common terms and phrases
actions algebra algorithm annotated atomic automata automaton behavior binary relation binary search tree calculus clause component Computer Science concurrency control consider construct contains correct data base Database Systems Datalog Deductive Databases defined definition deletion denoted disjunctive database domain independent edge elements entities equivalent example exists expressions EXPTIME fan-out SPV finite fixpoint formula function hyperplanes hypothetical idempotent implication graph input insertion instance integer integrity constraints isomorphism language Lemma Logic Programming mapping node notion operation optimization Pâ parallel transaction path polynomial predicate primary copies problem Proc proof PSPACE Q1 to Q2 query recursive relational computable relational model replicated restricted result rule schema semantics semi-typed semijoin sequence serial scheduler serializability set-objects specification structure Tâ tableau Theorem tokens transaction name transition graph translation tree tuple values variables version consistency vertex view update w-isa weighted path length