Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
<p>Provides a complete algebraic extension of the RDB systems for database mappings based on second-order tuple-generating dependencies</p>
<p>Discusses issues relating to the computational complexity w.r.t. the typed lambda calculus</p>
<p>Presents various definitions and formalizations for database mappings, data exchange, matching and merging</p>
The challenges of big data demand a clear theoretical and algebraicframework, extending the standard relational database (RDB) with more powerful features in order to manage the complex schema mappings.
This unique textbook/reference presents a novel approach to database concepts, describing a categorical logic for database schema mapping based on views, within a very general framework for database integration/exchange and peer-to-peer. Issues of database mappings, database programming languages (algebras), and denotational and operational semantics are discussed in depth. An analysis method is also developed that combines techniques from second order logic, data modeling, co-algebras, and functorial categorial semantics.
Topics and features:
Provides a concise, formal introduction to logics, (co-)algebras, databases, schema mappings and category theory
Describes the core concepts of big data integration theory, supported by a number of practical examples
Examines the computational properties of the DB category, compared to the extensions of Codd’s SPRJU relational algebra and structured query language (SQL)
Defines the abstract computational machine, the categorial RDB machine, able to support all DB computations by SQL embedding
Presents full operational semantics for database mappings (programs)
Discusses matching and merging operators (tensors) for databases, universal algebra considerations, and algebraic lattices of the databases
Explores the relationship of the database weak monoidal topos with respect to intuitionistic logic
This self-contained textbook is ideal for graduate courses on database engineering methods, and can also be used as a supplementary text for courses on co-algebras and category theory. Researchers and software engineers interested in databases and logics will also find the book to be a useful reference.
Content Level »Graduate
Keywords »Algebras for Database Mappings - Categorial Machines for Relational Database Management Systems - Denotational and Operational Semantics for Data Integration - Relational Database Integration - Topological Properties of Database Mappings