Verlag: Cambridge University Press, 2014
ISBN 10: 1107016169 ISBN 13: 9781107016163
Anbieter: AwesomeBooks, Wallingford, Vereinigtes Königreich
Hardcover. Zustand: USED_VERYGOOD. Foundations of Data Exchange This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. .
Verlag: Cambridge University Press, 2014
ISBN 10: 1107016169 ISBN 13: 9781107016163
Anbieter: Powell's Bookstores Chicago, ABAA, Chicago, IL, USA
Erstausgabe
Zustand: Used - Like New. 2014. 1st Edition. Hardcover. Fine.
Verlag: Springer, 2007
ISBN 10: 3540004289 ISBN 13: 9783540004288
Zustand: Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp.
Verlag: Springer, 1998
ISBN 10: 3540641998 ISBN 13: 9783540641995
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:9783540641995.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 86,48
Gebraucht ab EUR 29,38
Mehr entdecken Softcover
Verlag: Springer Verlag;, 2000
ISBN 10: 3540661514 ISBN 13: 9783540661511
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
gebundene Ausgabe. Zustand: Gut. 428 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Sprache: Englisch Gewicht in Gramm: 680.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 237,76
Gebraucht ab EUR 42,45
Mehr entdecken Hardcover
Verlag: Springer, 2000
ISBN 10: 3540661514 ISBN 13: 9783540661511
Anbieter: Besleys Books PBFA, Diss, Vereinigtes Königreich
Verbandsmitglied: PBFA
Erstausgabe
Hardcover. Zustand: Very Good. No Jacket. 1st Edition. Hardback, laminated pictorial boards. 428pp. Little sign of having been read. (Q12).
Verlag: Springer Berlin Heidelberg, 2013
ISBN 10: 3642399916 ISBN 13: 9783642399916
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut - Auflage 2013 | Seiten: 296 | Sprache: Englisch | Produktart: Bücher.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 82,21
Gebraucht ab EUR 77,57
Mehr entdecken Softcover
Verlag: Springer Berlin Heidelberg, 2004
ISBN 10: 3540242880 ISBN 13: 9783540242888
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume collects the papers presented at the 10th International Conference on Database Theory, ICDT 2005, held during January 5-7, 2005, in Edinburgh, UK. ICDT has now a long tra- tion of international conferences, providing a biennial scienti c forum for the communication of high-quality and innovative research results on theoretical - pects of all forms of database systems and database technology. The conference usually takes place in Europe, and has been held in Rome (1986), Bruges (1988), Paris (1990), Berlin (1992), Prague (1995), Delphi (1997), Jerusalem (1999), London (2001), and Siena (2003) so far. ICDT has merged with the Sym- sium on Mathematical Fundamentals of Database Systems (MFDBS), initiated in Dresden in 1987, and continued in Visegrad in 1989 and Rostock in 1991. ICDT had a two-stage submission process. First, 103 abstracts were subm- ted, which were followed a week later by 84 paper submissions. From these 84 submissions, the ICDT Program Committee selected 24 papers for presentation at the conference. Most of these papers were 'extended abstracts' and preli- nary reports on work in progress. It is anticipated that most of these papers will appear in a more polished form in scienti c journals.
Verlag: Springer Berlin Heidelberg, 2013
ISBN 10: 3642416594 ISBN 13: 9783642416590
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This Festschrift volume, published in honour of Peter Buneman, contains contributions written by some of his colleagues, former students, and friends. In celebration of his distinguished career a colloquium was held in Edinburgh, Scotland, 27-29 October, 2013. The articles presented herein belong to some of the many areas of Peter's research interests.
Verlag: Springer Berlin Heidelberg, 2004
ISBN 10: 3540212027 ISBN 13: 9783540212027
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE~s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es sentially first-order predicate calculus or its minor extensions.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE~s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es sentially first-order predicate calculus or its minor extensions.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642085423 ISBN 13: 9783642085420
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is the first comprehensive survey of the field of constraint databases. Constraint databases are a fairly new and active area of database research. The key idea is that constraints, such as linear or polynomial equations, are used to represent large, or even infinite, sets in a compact way. The ability to deal with infinite sets makes constraint databases particularly promising as a technology for integrating spatial and temporal data with standard re lational databases. Constraint databases bring techniques from a variety of fields, such as logic and model theory, algebraic and computational geometry, as well as symbolic computation, to the design and analysis of data models and query languages. The book is a collaborative effort involving many authors who have con tributed chapters on their fields of expertise. Despite this, the book is designed to be read as a whole, as opposed to a collection of individual surveys. In par ticular, the terminology and the style of presentation have been standardized, and there are multiple cross-references between the chapters. The idea of constraint databases goes back to the late Paris Kanellakis.