Database Theory - ICDT '95. Lecture Notes in Computer Science, Volume 893

Gottlob, Georg, & Moshe Y. Vardi, eds.

ISBN 10: 0387589074 / ISBN 13: 9780387589077

Published by Springer, 1995

About this Item

*Price HAS BEEN REDUCED by 10% until Monday, March 2 (sale item)* 454 pp., ex library, else textually clean and tight, softcover. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Seller Inventory # ZB341852

Bibliographic Details

• Title: Database Theory - ICDT '95. Lecture Notes in Computer Science, Volume 893
• Publisher: Springer
• Publication Date: 1995
• ISBN 10: 0387589074
• ISBN 13: 9780387589077
• Condition: Good

About this title

Synopsis

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 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 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.- Increment boundedness and nonrecursive incremental evaluation of datalog queries.- Approximation in databases.- Datalog queries of set constraint databases.- Space usage in functional query languages.