Big Data Integration Theory

This book presents a novel approach to database concepts, describing a categorical logic for database schema mapping based on views, within a framework for database integration and exchange and peer-to-peer computing. Includes practical examples.

Provides a complete algebraic extension of the RDB systems for database mappings based on second-order tuple-generating dependencies Discusses issues relating to the computational complexity w.r.t. the typed lambda calculus Presents various definitions and formalizations for database mappings, data exchange, matching and merging Includes supplementary material: sn.pub/extras

Autorentext

Dr. Zoran Majki is Chief Technology Advisor at Jumper Consulting Investment Ltd., Dublin, Ireland. He is also affiliated with the International Society for Research in Science and Technology, Tallahassee, FL, USA.

Klappentext

The challenges of big data demand a clear theoretical and algebraic**framework, 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 logicThis 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.

  Inhalt

Introduction and Technical Preliminaries.- Composition of Schema Mappings: Syntax and Semantics.- Definition of DB Category.- Functorial Semantics for Database Schema Mappings.- Extensions of Relational Codd's Algebra and DB Category.- Categorial RDB Machines.- Operational Semantics for Database Mappings.- The Properties of DB Category.- Weak Monoidal DB Topos.