Database Theory - ICDT '92
Springer Berlin (Verlag)
978-3-540-56039-5 (ISBN)
Joachim Biskup ist Professor für Informatik an der Universität Hildesheim, wo er die Arbeitsgruppe "Informationssysteme und Sicherheit" leitet. Er ist Autor und Koautor zahlreicher Veröffentlichungen über Berechenbarkeits- und Komplexitätstheorie, Informationssysteme und Sicherheit.
Combinatorial and algebraic results for database relations.- Semantics of disjunctive deductive databases.- Database theory in Russia (1979-1991) (an overview).- On the composition and decomposition of attributes and tuples.- Approximate dependency inference from relations.- Views and decompositions of databases from a categorical perspective.- Computing with infinitary logic.- Query languages with counters.- Naturally embedded query languages.- Optimizing incremental computation of datalog programs with non-deterministic semantics.- Optimizing active databases using the split technique (Preliminary Report).- Updating atomic information in labelled database systems (extended abstract).- Context-specific synchronization for atomic data types.- Hybrid atomicity for nested transactions.- Model and verification of a data manager based on ARIES.- Minimizing indefinite information in disjunctive deductive databases.- Well founded semantics and stable semantics of semi-strict programs.- On finding extensions of default theories.- Incremental evaluation of Datalog queries.- Decidability and undecidability of equivalence for linear Datalog, with applications to normal-form optimizations.- A paradox in database theory.- A hierarchy of faithful set creation in pure OODB's.- Identification, genericity and consistency in object-oriented databases.- Subsumption for complex object data models.- Semantic information connected with data.- Declarative foundations of secure deductive databases.- On materializing views and on-line queries.- Maintaining dictionaries: Space-saving modifications of B-trees.- Set-term matching in logic programming.
| Erscheint lt. Verlag | 5.10.1992 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | X, 454 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 672 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Schlagworte | Abfragen • algorithm • algorithms • Complexity • Complex objects • Concurrency • Database • Databases • data structure • Datenbank • Datenbanken • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • knowledge base • Knowledge Bases • Komplexe Objekte • Object Orientation • Objektorientierung • Optimization • Query • Wissensbanken • Wissensbasiertes System |
| ISBN-10 | 3-540-56039-4 / 3540560394 |
| ISBN-13 | 978-3-540-56039-5 / 9783540560395 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich