Home > Store

Foundation for Future Database Systems: The Third Manifesto, 2nd Edition

Register your product to gain access to bonus material or receive a coupon.

Foundation for Future Database Systems: The Third Manifesto, 2nd Edition

Book

  • Sorry, this book is no longer in print.
Not for Sale

Description

  • Copyright 2000
  • Dimensions: 7-3/8x9-1/4
  • Pages: 576
  • Edition: 2nd
  • Book
  • ISBN-10: 0-201-70928-7
  • ISBN-13: 978-0-201-70928-5

A detailed study of the impact of objects and type theory on the relational model of data, including a comprehensive model of type inheritance!

"This book should be recommended reading for software engineers, database designers, graduate students, undergraduate students, data modelers--for just about anybody with a serious interest in database technology."
--Declan Brady, MBCS, Lead Systems Architect, ICL

"As a database application designer/architect, I'm interested in ideals as well as in currently available tools . . . This book is a rich source of worthy ideals. In particular, it provides good coverage of areas where SQL, and much commercial Object Orientation training material, are found lacking."
--Tom Pledger, Peace International Software

Foundation for Future Database Systems: The Third Manifesto is a proposal for the future direction of data and database management systems (DBMSs). It consists of a precise, formal definition of an abstract model of data, to be considered as a blueprint for the design of a DBMS and a database language. Among other things, it provides a rock-solid foundation for integrating relational and object technologies.

The proposed foundation represents an evolutionary step, not a revolutionary one; it builds on Codd's relational model of data and on the research that sprang from that work. It also incorporates a precise and comprehensive specification for a method of defining data types, including a comprehensive model of type inheritance, to address a lack that has been observed by many authorities; thus, it also builds on research in the field of object orientation. With a sound footing in both camps of the object/relational divide, therefore, the Manifesto is offered as a firm foundation for the DBMSs of the future.

Significant features of this new edition include:

  • Major extensions to the inheritance model
  • Significantly improved language proposals
  • Improved discussions of read-only vs. update operators, selectors, THE_ operators, tuple types vs. possible representations, grouping and ungrouping, first normal form, assignment, constraints, predicates, and many other topics
  • All SQL discussions upgraded to the level of the new SQL:1999 standard
  • Several new appendixes



0201709287B04062001

Sample Content

Table of Contents



Preface.

I. PRELIMINARIES.

1. Background and Overview.

What is The Third Manifesto?

Why Did We Write It?

Back to the Relational Future.

Some Guiding Principles.

Some Crucial Logical Differences.

Topics Deliberately Omitted.

The Third Manifesto: A Summary.

2. Objects and Relations.

Introduction.

What Problem are we Trying to Solve?

Relations vs. Relvars.

Domains vs. Object Classes.

Relvars vs. Object Classes.

A Note on Inheritance.

Concluding Remarks.

II. FORMAL SPECIFICATIONS.

3. The Third Manifesto.

RM Prescriptions.

RM Proscriptions.

OO Prescriptions.

OO Proscriptions.

RM Very Strong Suggestions.

OO Very Strong Suggestions.

4. A New Relational Algebra.

Introduction.

Motivation and Justification.

<REMOVE, <RENAME, and <COMPOSE.

Treating Operators as Relations.

Formal Definitions.

Transitive Closure.

5. Tutorial D.

Introduction.

Types and Expressions.

Scalar Definitions.

Tuple Definitions.

Relational Definitions.

Scalar Operations.

Tuple Operations.

Relational Operations.

Relations and Arrays.

Statements.

Syntax Summary.

Mapping the Relational Operations.

III. INFORMAL DISCUSSIONS AND EXPLANATIONS.

6. RM Prescriptions.

RM Prescription 1: Scalar Types.

RM Prescription 2: Scalar Values are Typed.

RM Prescription 3: Scalar Operators.

RM Prescription 4: Actual vs. Possible Representations.

RM Prescription 5: Expose Possible Representations.

RM Prescription 6: Type Generator TUPLE.

RM Prescription 7: Type Generator RELATION.

RM Prescription 8: Equality.

RM Prescription 9: Tuples.

RM Prescription 10: Relations.

RM Prescription 11: Scalar Variables.

RM Prescription 12: Tuple Variables.

RM Prescription 13: Relation Variables (relvars).

RM Prescription 14: Real vs. Virtual relvars.

RM Prescription 15: Candidate Keys.

RM Prescription 16: Databases.

RM Prescription 17: Transactions.

RM Prescription 18: Relational Algebra.

RM Prescription 19: Relvar Names, Relation Selectors, and Recursion.

RM Prescription 20: Relation-valued Operators.

RM Prescription 21: Assignments.

RM Prescription 22: Comparisons.

RM Prescription 23: Integrity Constraints.

RM Prescription 24: Relvar and Database Predicates.

RM Prescription 25: Catalog.

RM Prescription 26: Language Design.

7. RM Proscriptions.

RM Proscription 1: No Attribute Ordering.

RM Proscription 2: No Tuple Ordering.

RM Proscription 3: No Duplicate Tuples.

RM Proscription 4: No Nulls.

RM Proscription 5: No Nullological Mistakes.

RM Proscription 6: No Internal-level Constructs.

RM Proscription 7: No Tuple-level Operations.

RM Proscription 8: No Composite Attributes.

RM Proscription 9: No Domain Check Override.

RM Proscription 10: Not SQL.

8. OO Prescriptions.

OO Prescription 1: Compile-time Type Checking.

OO Prescription 2: Type Inheritance (conditional).

OO Prescription 3: Computational Completeness.

OO Prescription 4: Explicit Transaction Boundaries.

OO Prescription 5: Nested Transactions.

OO Prescription 6: Aggregate Operators and Empty Sets.

9. OO Proscriptions.

OO Proscription 1: Relvars Are not Domains.

OO Proscription 2: No Object IDs.

10. RM Very Strong Suggestions.

RM Very Strong Suggestion 1: System keys.

RM Very Strong Suggestion 2: Foreign keys.

RM Very Strong Suggestion 3: Candidate Key Inference.

RM Very Strong Suggestion 4: Transition Constraints.

RM Very Strong Suggestion 5: Quota Queries.

RM Very Strong Suggestion 6: Generalized Transitive Closure.

RM Very Strong Suggestion 7: User-defined Generic Operators.

RM Very Strong Suggestion 8: Special ("default") Values.

RM Very Strong Suggestion 9: SQL Migration.

11. OO Very Strong Suggestions.

OO Very Strong Suggestion 1: Type Inheritance.

OO Very Strong Suggestion 2: Types and Operators Unbundled.

OO Very Strong Suggestion 3: Collection Type Generators.

OO Very Strong Suggestion 4: Conversion to/from Relations.

OO Very Strong Suggestion 5: Single-level Store.

IV. SUBTYPING AND INHERITANCE.

12. Preliminaries.

Introduction.

Toward a Type Inheritance Model.

Single vs. Multiple Inheritance.

Scalars, Tuples, and Relations.

Summary.

13. The Inheritance Model.

Introduction.

IM Prescriptions.

14. Single Inheritance with Scalar Types.

Introduction.

IM Prescription 1: Types are Sets.

IM Prescription 2: Subtypes are Subsets.

IM Prescription 3: "Subtype of" is Reflexive.

IM Prescription 4: Proper Subtypes.

IM Prescription 5: "Subtype of" is Transitive.

IM Prescription 6: Immediate Subtypes.

IM Prescription 7: Types Disjoint Unless one a Subtype of the Other.

IM Prescription 8: Scalar Values with Inheritance.

IM Prescription 9: Scalar Variables with Inheritance.

IM Prescription 10: Specialization by Constraint.

IM Prescription 11: Assignment with Inheritance.

IM Prescription 12: Equality etc. with Inheritance.

IM Prescription 13: Join etc. with Inheritance.

IM Prescription 14: TREAT DOWN.

IM Prescription 15: Type Testing.

IM Prescription 16: Read-only Operator Inheritance and Value Substitutability.

IM Prescription 17: Operator Signatures.

IM Prescription 18: Read-only Parameters to Update Operators.

IM Prescription 19: Update Operator Inheritance and Variable Substitutability.

IM Prescription 20: Union, dummy, and Maximal and Minimal Types.

15. Multiple Inheritance with Scalar Types.

Introduction.

The Running Example.

IM Prescriptions 1-20 Revisited.

Least Specific Types Unique.

Most Specific Types Unique.

Type Testing with Multiple Inheritance.

Remarks on Operator Inheritance.

16. Inheritance with Tuple and Relation Types.

Introduction.

IM Prescription 21: Tuple/relation Subtypes and Supertypes.

IM Prescriptions 1-20 Still Apply.

IM Prescription 22: Tuple/relation Values with Inheritance.

IM Prescription 23: Maximal and Minimal tuple/relation Types.

IM Prescription 24: Tuple/relation most Specific Types.

IM Prescription 25: Tuple/relation Variables with Inheritance.

Specialization by Constraint.

Tuple/relation Assignment with Inheritance.

Tuple/relation Equality etc. with Inheritance.

Tuple/relation TREAT DOWN.

Tuple/relation Type Testing.

The Additional Prescriptions Summarized.

APPENDIXES.

Appendix A. A Relational Calculus Version of Tutorial D.

Introduction.

Boolean Expressions.

Builtin Relation Operator Invocations.

Free and Bound Range Variable References.

Relation UPDATE and DELETE Operators.

Examples.

Appendix B. The Two Great Blunders.

Introduction.

The First Great Blunder.

The Second Great Blunder.

Appendix D. A Design Dilemma?

Introduction.

Encapsulation.

Discussion.

Further Considerations.

Appendix D. Types and Units.

Introduction.

Type definition.

Selectors.

THE_ operators.

Computational Operators.

Display Operators.

Type Constraints.

A More Complex Example.

Appendix E. Subtables and Supertables.

Introduction.

Some General Observations.

The Terminology is Extremely Bad.

The Concept is not Type Inheritance.

Why?

Appendix F. More on Changing Semantics and Related Matters.

Introduction.

Analysis.

A Solution.

Another Example.

Appendix G. Specialization by Constraint and Related Matters.

Introduction.

The 3 out of 4 "Rule".

What Does Inheritance Really Mean?

Benefits of S by C.

Is a Colored Circle a Circle?

Object IDs Undermine Inheritance.

Why the Problem does not Arise with Foreign Keys.

Appendix H. A Comparison with SQL.

Introduction.

RM Prescriptions.

RM Proscriptions.

OO Prescriptions.

OO Proscriptions.

RM Very Strong Suggestions.

OO Very Strong Suggestions.

IM Prescriptions.

History of the Wrong Equation in SQL.

Appendix I. A Comparison with ODMG.

Introduction.

Overview.

RM Prescriptions.

RM Proscriptions.

OO Prescriptions.

OO Proscriptions.

RM Very Strong Suggestions.

OO Very Strong Suggestions.

IM Prescriptions.

Appendix J. The Next 25 Years of the Relational Model?

Remarks on Republication.

Introduction.

Background.

The Third Manifesto and SQL.

Technical Content.

More on SQL.

Miscellaneous Questions.

Appendix K. References and Bibliography.
Index. 0201709287T04062001

Preface

The Third Manifesto is a detailed proposal for the future direction of data and database management systems (DBMSs). Like Codd's original papers on the relational model, it can be seen as an abstract blueprint for the design of a DBMS and the language interface to such a DBMS. Among (many) other things, it lays the foundation for what we believe is the logically correct approach to integrating relational and object technologies--a topic of considerable interest at the present time, given the recent appearance in the marketplace of several "object/relational" DBMS products (sometimes called universal servers). Perhaps we should add immediately that we do not regard the idea of integrating relational and object technologies as "just another fad," soon to be replaced by some other briefly fashionable idea. On the contrary, we think that object/relational systems are in everyone's future--a fact that makes it even more important to get the logical foundation right, of course, while we still have time to do so.

The first version of the Manifesto was published informally in early 1994 (though we had been thinking about the idea of such a document for several years prior to that time), and the first "official" version appeared in 1995. Since then we have presented the material in a variety of forms and forums and discussed it with numerous people--indeed, we continue to do so to this day--and we have refined and expanded the original document many, many times. We would immediately like to stress, however, that those refinements and expansions have always been exactly that; nobody has ever shown us that we were completely on the wrong track, and development of the Manifesto has always proceeded in an evolutionary, not a revolutionary, manner. Now we feel it is time to make the material available in some more permanent form; hence the present book.

One reason we feel the time is ripe for wider dissemination of our ideas is as follows. As already indicated, we see a parallel between the Manifesto and Codd's original papers on the relational model; like those papers of Codd's, the Manifesto offers a foundation for what (we believe) the database systems of the future ought to look like. Also like those papers of Codd's, however, the Manifesto itself is, deliberately, fairly terse and not all that easy to read or understand.* Would it not have been nice to have had a book that documented and explained and justified Codd's ideas, back at the beginning of the relational era? Well, here we are at the beginning of "the object/relational era," and--modesty aside--we believe this book can play a role analogous to that of that hypothetical relational book. To that end, we have been careful to include not only the formal specifications of the Manifesto itself (of course), but also a great deal of supporting and explanatory material and numerous detailed examples.

By the way, we should make it clear that our ideas do rest very firmly in the relational tradition. Indeed, we would like our Manifesto to be seen, in large part, as a definitive statement of just what the relational model itself consists of at the time of writing** (for it too has undergone a certain amount of evolution over the years). Despite our remarks in the previous paragraph concerning "the object/relational era," therefore, the ideas expressed in the Manifesto must not be thought of as superseding those of the relational model, nor do they do so; rather, they use those ideas as a foundation and build on them. We believe strongly that the relational model is still highly relevant to database theory and practice and will remain so for the foreseeable future. Thus, we regard our Manifesto as being very much in the spirit of Codd's original work and continuing along the path he originally laid down. To repeat, we are talking evolution, not revolution.

There is another point to be made here, too. Given the current interest in object/relational systems, we can expect to see a flurry of books on such systems over the next few years. However, it is unlikely, if history is anything to go by, that those books will concern themselves very much with general principles or underlying theory; it is much more probable that they will be product-oriented, if not actually product-specific. The present book, by contrast, definitely is concerned with theoretical foundations rather than products; in other words, it allows you to gain a solid understanding of the underlying technology per se, thereby enabling you among other things to approach the task of evaluating commercial products from a position of conceptual strength.

While we are on the subject of commercial products, incidentally, we should make it clear that we ourselves have no particular commercial ax to grind. We regard ourselves as independent so far as the marketplace is concerned, and we are not trying to sell any particular product.*** The ax we do have to grind is that of logical correctness!--we want to do our best to ensure that the industry goes down the right path, not the wrong one.

*As Bertrand Russell has it: "Writing can be either readable or precise, but not at the same time" (quoted by John Sowa in his book Conceptual Structures: Information Processing in Mind and Machine, Addison-Wesley, 1984).
**Indeed, we even toyed at one time with the idea of calling the book A Relational Model of Data for Large Shared Data Banks.
***It is true that one of us, Hugh Darwen, works for a company that does have a product to sell, but the product in question is not mentioned by name anywhere in this book.

And in that connection, we would like to mention another reason we feel the book is timely: namely, the fact that the SQL standards bodies, both national and international, are currently at work on a proposal called SQL3 that addresses some of the same issues as our Manifesto does. An appendix to the present book gives a detailed set of comparisons between our ideas and those of the current SQL3 proposal.*

*SQL3 was ratified in late 1999. Its official name is now SQL:1999--and we use this latter name in preference to "SQL3" throughout this new edition (though we usually abbreviate both names to just plain "SQL," unqualified). The version of the standard that was current prior to the ratification of SQL:1999 was known formally asSQL:1992.

What is more, another body, the Object Data Management Group (ODMG), has also published a set of proposals that, again, address some of the same issues. Another appendix to this book therefore takes a look at the ODMG ideas as well. Two more special features of the book are the following:

  • We define a new and simplified relational algebra, called A, which emphasizes rather more than previous algebras have done its firm foundation in predicate logic.
  • We also define a database programming language called Tutorial D, which realizes the ideas of the Manifesto in concrete form and is used as the basis for examples and illustrations throughout the book.

We would also like to mention one further feature that we believe to be highly significant, and that is our proposal for a model of subtyping and inheritance. Many authorities have rightly observed that there is currently no consensus on any such model, and we offer our proposal for consideration in the light of this observation. Indeed, we believe we have some original--and, we also believe, logically sound and correct--thoughts to offer on this important subject. Part IV of the book (five chapters) is devoted to this topic.

Structure of the Book

The body of the book is divided into four major parts:

I. Preliminaries
II. Formal Specifications
III. Informal Discussions and Explanations
IV. Subtyping and Inheritance

Part I sets the scene by explaining in general terms what the Manifesto is all about and why we wrote it. It also contains an informal overview of two approaches to building an object/relational system, one of which is (we claim) right and the other wrong. We recommend that you read both of these chapters fairly carefully before moving on to later parts of the book.

Part II is the most formal part. It consists of three chapters:

  • Chapter 3 is the Manifesto itself--a "no frills" version, with virtually nil by way of illustration or further explanation. (For the benefit of anyone who might have seen earlier drafts of the Manifesto, we should explain that this "no frills" version consists essentially of just the formal text from those earlier drafts, with all commentary and suchlike material deleted.)
  • Chapter 4 contains the definition, mentioned above, of our new relational algebra ("A").
  • Chapter 5 defines the language Tutorial D. This language, which is (of course) based on the principles laid down in the Manifesto and on our new algebra A, serves as the basis for examples throughout the remainder of the book. It also serves to suggest what a DBMS supporting the ideas of the Manifesto might look like in actual practice.

Note: Most of the material of these three chapters is provided primarily for purposes of reference; it is not necessary, and probably not even a good idea, to study it exhaustively, at least not on a first reading.

Part III is the real heart of the book. It consists of six chapters, one for each of the six sections of the Manifesto as defined in Part II. (Again, for the benefit of anyone who might have seen earlier drafts of the Manifesto, this part of the book consists essentially of a hugely expanded version of the informal commentary from those earlier drafts.) Each chapter discusses the relevant section of the Manifesto in considerable detail, with examples, and thereby explains the motivations and rationale behind the formal proposals of Part II (especially those in Chapter 3). Note, therefore, that the Manifesto itself serves as the organizing principle for this, the major part of the book.

Finally, Part IV does for subtyping and inheritance what Parts I, II, and III do for the Manifesto proper. It consists of five chapters. Chapter 12 gives an overall introduction to the topic; Chapter 13 gives formal definitions; and Chapters 14, 15, and 16 give informal explanations and discussions of the ideas underlying those formal definitions. To be more specific, Chapter 14 covers single inheritance and scalar types (only); Chapter 15 then extends the material of Chapter 14 to address multiple inheritance; finally, Chapter 16 then extends those ideas still further to take tuple and relation types into account as well.

In addition to the foregoing, there are also several appendixes: one defining an alternative version of Tutorial D that is based on relational calculus instead of relational algebra, another discussing "subtables and supertables," another containing the text of an interview the present authors gave on the subject of the Manifesto in 1994, and so on. In particular, the SQL and ODMG comparisons can be found in this part of the book, as already mentioned. The final appendix (Appendix K) gives an annotated and consolidated list of references for the entire book.

Note: While we are on the subject of references to publications, we should explain that throughout the book such references take the form of numbers in square brackets. For example, the reference "3" refers to the third item in the list of references in Appendix K, viz., a paper by Malcolm P. Atkinson and O. Peter Buneman entitled "Types and Persistence in Database Programming Languages," published in ACM Computing Surveys, Volume 19, No. 2, in June 1987.

Last, we should say a word about our use of terminology. It is our experience that many of the terms in widespread use in the database field, and other related fields, are subject to a variety of different interpretations, and that communication suffers badly as a result. Examples seem superfluous (you can surely provide plenty of your own). We have therefore found it necessary to introduce our own terminology in certain places in the book (though we have tried to keep such cases to a minimum, of course, and we have not intentionally used familiar terms in unfamiliar ways). We apologize if this fact should cause you any unnecessary difficulties.

Intended Readership

Who should read this book? Well, in at least one sense the book is definitely not self-contained--it does assume you are professionally interested in database technology and are therefore reasonably well acquainted with classical database theory and practice. However, we have tried to define and explain, as carefully as we could, any concepts that might be thought novel; in fact, we have done the same for several concepts that really should not be novel at all but do not seem to be as widely understood as they ought to be ("candidate key" is a case in point). Thus, we have tried to make the book suitable for both reference and tutorial purposes, and we have indicated clearly those portions of the book that are more formal in style and are provided primarily for reference.

Our intended audience is, therefore, just about anyone with a serious interest in database technology, including but not limited to the following:

  • Database language designers and standardizers;
  • DBMS product implementers and other vendor personnel;
  • Data and database administrators;
  • "Information modelers" and database designers;
  • Database application designers and implementers;
  • Computer science professors specializing in database issues;
  • Database students, both graduate and undergraduate;
  • People responsible for DBMS product evaluation and acquisition;
  • People interested in any aspect of the "objects vs. relations" controversy, including especially anyone who might be involved in object/relational systems;
  • People interested in type theory and the topic of type inheritance.

For academic readers in particular (students as well as teachers), we should add that what we have tried to do is present the foundations of the database field in a way that is clear, precise, correct, and uncluttered by the baggage--not to mention mistakes--that usually (and regrettably) seem to accompany commercial products. Thus, we believe the book provides an opportunity to acquire a firm understanding of that crucial foundation material, without being distracted by irrelevancies. Perhaps we should say too that we believe there are several interesting (and, we hope, self-evident) teaching and research projects lurking just below the surface of certain portions of the material.

Acknowledgments

First of all, we are delighted to be able to acknowledge all of the numerous friends and colleagues who, over the past several years, have given encouragement, participated in discussions, and offered comments (both written and oral) on various drafts of The Third Manifesto or portions thereof: John Andrews, Tanj Bennett, Charley Bontempo, Declan Brady, Bob Brown, Rick Cattell, Linda DeMichiel, Vincent Dupuis, Bryon Ehlmann, Mark Evans, Ron Fagin, Oris Friesen, Ric Gagliardi, Ray Gates, Mikhail Gilula, Zaid Holmin, Michael Jackson, Achim Jung, John Kneiling, Adrian Larner, Bruce Lindsay, David Livingstone, Albert Maier, Carl Mattocks, Nelson Mattos, David McGoveran, Roland Merrick, Serge Miranda, Jim Panttaja, Mary Panttaja, Fabian Pascal, Ron Ross, Arthur Ryman, Alan Sexton, Mike Sykes, Stephen Todd, Rick van der Lans, Anton Versteeg, and Fred Wright (and we apologize if we have inadvertently omitted anyone from this list). We would also like to acknowledge the many conference and seminar attendees, too numerous to mention individually, who have expressed support for the ideas contained herein.

Second, we would like to thank our reviewers Charley Bontempo, Declan Brady, Rick Cattell, David Livingstone, and David McGoveran for their careful and constructive comments on the manuscript.

Third, we are--of course!--deeply indebted to our wives, Lindy Date and Lindsay Darwen, for their unfailing support throughout this project and so many others over the years.

Finally, we are, as always, grateful to our editor, Elydia Davis, and to the staff at Addison-Wesley for their assistance and their continually high standards of professionalism. It has been, as always, a pleasure to work with them.

Hugh Darwen adds: My gratitude to my colleague and friend, Chris Date, goes without saying. However, I would like to comment on something, significant to us, that you possibly haven't noticed. It concerns the book's attribution. In our previous joint productions our names have been linked by the preposition with, intended to distinguish the primary author from the contributing assistant. This time around we have thought it more appropriate to use the conjunction and, of whose commutativity we Relationlanders are especially conscious! We came to this conclusion despite the fact that, as usual, Chris has done the lion's share of the actual writing. That the writing so faithfully and agreeably records our joint thinking (often painfully wrought out) is therefore a source of great pleasure to me, especially in those cases where I can still identify the thinking in question as having arisen from ideas first placed into discussion by myself.

My own thinking has been molded, of course, with the aid of many mentors over the years, including Chris himself. Here I would like to single out just two other people for special mention: Adrian Larner for my relational thinking, and Nelson Mattos for my object-oriented thinking.

Chris Date adds: If Hugh feels he has learned from me over the years, I can assure you (and him) that I have most certainly learned a great deal from him!--a state of affairs for which I will always be grateful. As for the matter of the book's attribution, it is of course true that The Third Manifesto is a joint effort, but Hugh should really take the credit for being the original and prime mover on this project: It was he who came up with the idea of the Manifesto in the first place, and it was he who wrote the very first draft, early in 1994. Though I should immediately add that our thinking on the matters with which the Manifesto deals goes back very much further than that; in some respects, in fact, I think we could claim that it goes all the way back to the beginning of our respective careers in the database field.

C. J. Date, Healdsburg, California
Hugh Darwen, Shrewley, England
1998 (revised 2000)


0201709287P04062001

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020