Logic and databases are inextricably intertwined. The relational model in particular is essentially just elementary predicate logic, tailored to fit the needs of database management. Now, if you're a database professional, I'm sure this isn't news to you; but you still might not realize just how much everything we do in the database world is - or should be! - affected by predicate logic. Logic is everywhere. So if you're a database professional you really owe it to yourself to understand the basics of formal logic, and you really ought to be able to explain (and perhaps defend) the connections between formal logic and database management. And that's what this book is about. What it does is show, through a series of partly independent and partly interrelate essays, just how various crucial aspects of database technology-some of them very familiar, others maybe less so- are solidly grounded in formal logic. It is divided into five parts: *Basic Logic *Logic and Database Management *Logic and Database Design *Logic and Algebra *Logic and the Third Manifesto There's also a lengthy appendix, containing a collection of frequently asked questions (and some answers) on various aspects of logic and database management. Overall, my goal is to help you realize the importance of logic in everything you do, and also- I hope- to help you see that logic can be fun.

The topic of logic programming and databases. has gained in creasing interest in recent years. Several events have marked the rapid evolution of this field: the selection, by the Japanese Fifth Generation Project, of Prolog and of the relational data model as the basis for the development of new machine archi tectures; the focusing of research in database theory on logic queries and on recursive query processing; and the pragmatic, application-oriented development of expert database systems and of knowledge-base systems. As a result, an enormous amount of work has been produced in the recent literature, coupled with the spontaneous growth of several advanced projects in this area. The goal of this book is to present a systematic overview of a rapidly evolving discipline, which is presently not described with the same approach in other books. We intend to introduce stu dents and researchers to this new discipline; thus we use a plain, tutorial style, and complement the description of algorithms with examples and exercises. We attempt to achieve a balance be tween theoretical foundations and technological issues; thus we present a careful introduction to the new language Datalog, but we also focus on the efficient interfacing of logic programming formalisms (such as Prolog and Datalog) with large databases.

Time is ubiquitous in information systems. Almost every enterprise faces the problem of its data becoming out of date. However, such data is often valu able, so it should be archived and some means to access it should be provided. Also, some data may be inherently historical, e.g., medical, cadastral, or ju dicial records. Temporal databases provide a uniform and systematic way of dealing with historical data. Many languages have been proposed for tem poral databases, among others temporal logic. Temporal logic combines ab stract, formal semantics with the amenability to efficient implementation. This chapter shows how temporal logic can be used in temporal database applica tions. Rather than presenting new results, we report on recent developments and survey the field in a systematic way using a unified formal framework [GHR94; Ch094]. The handbook [GHR94] is a comprehensive reference on mathematical foundations of temporal logic. In this chapter we study how temporal logic is used as a query and integrity constraint language. Consequently, model-theoretic notions, particularly for mula satisfaction, are of primary interest. Axiomatic systems and proof meth ods for temporal logic [GHR94] have found so far relatively few applications in the context of information systems. Moreover, one needs to bear in mind that for the standard linearly-ordered time domains temporal logic is not re cursively axiomatizable [GHR94]' so recursive axiomatizations are by necessity incomplete.

Modern algebra, which not long ago seemed to be a science divorced from real life, now has numerous applications. Many fine algebraic structures are endowed with meaningful contents. Now and then practice suggests new and unexpected structures enriching algebra. This does not mean that algebra has become merely a tool for applications. Quite the contrary, it significantly benefits from the new connections. The present book is devoted to some algebraic aspects of the theory of databases. It consists of three parts. The first part contains information about universal algebra, algebraic logic is the subject of the second part, and the third one deals with databases. The algebraic material of the flI'St two parts serves the common purpose of applying algebra to databases. The book is intended for use by mathematicians, and mainly by algebraists, who realize the necessity to unite theory and practice. It is also addressed to programmers, engineers and all potential users of mathematics who want to construct their models with the help of algebra and logic. Nowadays, the majority of professional mathematicians work in close cooperation with representatives of applied sciences and even industrial technology. It is neces sary to develop an ability to see mathematics in different particular situations. One of the tasks of this book is to promote the acquisition of such skills.

Foundations of Deductive Databases and Logic Programming focuses on the foundational issues concerning deductive databases and logic programming. The selection first elaborates on negation in logic programming and towards a theory of declarative knowledge. Discussions focus on model theory of stratified programs, fixed point theory of nonmonotonic operators, stratified programs, semantics for negation in terms of special classes of models, relation between closed world assumption and the completed database, negation as a failure, and closed world assumption. The book then takes a look at negation as failure using tight derivations for general logic programs, declarative semantics of logic programs with negation, and declarative semantics of deductive databases and logic programs. The publication tackles converting AND-control to OR-control by program transformation, optimizing dialog, equivalences of logic programs, unification, and logic programming and parallel complexity. Topics include parallelism and structured and unstructured data, parallel algorithms and complexity, solving equations, most general unifiers, systems of equations and inequations, equivalences of logic programs, and optimizing recursive programs. The selection is a valuable source of data for researchers interested in pursuing further studies on the foundations of deductive databases and logic programming.

This book touches on an area seldom explored: the mathematical underpinnings of the relational database. The topic is important, but far too often ignored. This is the first book to explain the underlying math in a way that’s accessible to database professionals. Just as importantly, if not more so, this book goes beyond the abstract by showing readers how to apply that math in ways that will make them more productive in their jobs. What’s in this book will "open the eyes" of most readers to the great power, elegance, and simplicity inherent in relational database technology.

Information Modeling and Relational Databases, Third Edition, provides an introduction to ORM (Object-Role Modeling) and much more. In fact, it is the only book to go beyond introductory coverage and provide all of the in-depth instruction you need to transform knowledge from domain experts into a sound database design. This book is intended for anyone with a stake in the accuracy and efficacy of databases: systems analysts, information modelers, database designers and administrators, and programmers. Dr. Terry Halpin and Dr. Tony Morgan, pioneers in the development of ORM, blend conceptual information with practical instruction that will let you begin using ORM effectively as soon as possible. The all-new Third Edition includes coverage of advances and improvements in ORM and UML, nominalization, relational mapping, SQL, XML, data interchange, NoSQL databases, ontological modeling, and post-relational databases. Supported by examples, exercises, and useful background information, the authors' step-by-step approach teaches you to develop a natural-language-based ORM model, and then, where needed, abstract ER and UML models from it. This book will quickly make you proficient in the modeling technique that is proving vital to the development of accurate and efficient databases that best meet real business objectives. "This book is an excellent introduction to both information modeling in ORM and relational databases. The book is very clearly written in a step-by-step manner and contains an abundance of well-chosen examples illuminating practice and theory in information modeling. I strongly recommend this book to anyone interested in conceptual modeling and databases." — Dr. Herman Balsters, Director of the Faculty of Industrial Engineering, University of Groningen, The Netherlands - Presents the most in-depth coverage of object-role modeling, including a thorough update of the book for the latest versions of ORM, ER, UML, OWL, and BPMN modeling. - Includes clear coverage of relational database concepts as well as the latest developments in SQL, XML, information modeling, data exchange, and schema transformation. - Case studies and a large number of class-tested exercises are provided for many topics. - Includes all-new chapters on data file formats and NoSQL databases.