Database Theory - ICDT '95
Springer Berlin (Verlag)
978-3-540-58907-5 (ISBN)
Besides two full invited papers and the abstracts of two tutorials, the book includes the revised full versions of 29 technical contributions selected from a total of 116 submissions. The papers address all current aspects of database theory; they are organized in sections on optimization, nonmonotonic semantics, query languages, concurrency control, advanced models, probabilistic methods, constraints and dependencies, and Datalog analysis.
Data on air - What's in it for the database theorist.- Spatial databases, The final frontier.- Tutorial on parallel database systems.- Languages for polynomial-time queries - An ongoing quest.- Distributed query optimization in loosely coupled multidatabase systems.- On the complexity of generating optimal left-deep processing trees with cross products.- Querying disjunctive databases through nonmonotonic logics.- DATALOG queries with stratified negation and choice: from P to D P.- On the Kolmogorov expressive power of boolean query languages.- On two forms of structural recursion.- ?-Languages for sets and sub-PTIME graph transformers.- Partial strictness in two-phase locking.- Unified transaction model for semantically rich operations.- The Dynamic Two Phase Commitment (D2PC) protocol.- Domain-independent queries on databases with external functions.- An algebra for pomsets.- On the power of stratified logic programs with value invention for expressing database transformations.- A stable model semantics for behavioral inheritance in deductive object oriented languages.- A rewriting technique for the analysis and the optimization of active databases.- Sorted HiLog: Sorts in higher-order logic data languages.- The average length of keys and functional dependencies in (random) databases.- Uniformly-distributed random generation of join orders.- A probabilistic view of Datalog parallelization.- A first step towards implementing dynamic algebraic dependencies.- Constraint-generating dependencies.- Optimization using tuple subsumption.- Dterministic and non-deterministic stable model semantics for unbound DATALOG queries.- Revision programming, database updates and integrity constraints.- Some positive results for boundedness of multiple recursive rules.- Incrementboundedness and nonrecursive incremental evaluation of datalog queries.- Approximation in databases.- Datalog queries of set constraint databases.- Space usage in functional query languages.
| Erscheint lt. Verlag | 3.1.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 460 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 613 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Schlagworte | Abfrageoptimierung • Abfragesprachen • Complexity • Concurrency • Database • Database Design • Database Semantics • Datenbank • Datenbankentwurf • Datenbanksemantik • Datenverarbeitung • Entwurf (EDV) • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Anwendungs-Software • HC/Informatik, EDV/Informatik • Information Retrieval • Logic • Optimization • parallel databases • Parallele Datenbanken • programming • Query Languages • query optimization • Semantics |
| ISBN-10 | 3-540-58907-4 / 3540589074 |
| ISBN-13 | 978-3-540-58907-5 / 9783540589075 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
