Home > Computing and Information Technology > Databases > Database software > Foundation for Object / Relational Databases: The Third Manifesto
48%
Foundation for Object / Relational Databases: The Third Manifesto

Foundation for Object / Relational Databases: The Third Manifesto

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

Second Edition now available! A detailed study of the impact of objects and type theory on the relational model of data, including a comprehensive proposal for type inheritance "This is the first attempt to describe what object/relational means. If you're interested in object/relational technology, this is the book to read." --Rick van der Lans Independent consultant, author of Introduction to SQL, and past member of the Dutch committee responsible for developing the International SQL Standard "This book is an excellent piece of work. It is very rare in computer science to come across a book that provides such a complete and precise theory that is systematically presented and compared to all of the other work in the area. Even those who find the conclusions controversial will admire this thoroughness." --Rick Cattell ODMG Chair, author of Object Data Management and JDBC Database Access with Java, and co-editor of the Object Database Standard: ODMG 2.0 Foundation for Object/Relational Databases: 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. In particular, it provides a rock-solid foundation for integrating relational and object technologies, a foundation conspicuously lacking in current approaches to such integration. 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 resulted from that work. Most notably, it 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, the Manifesto is offered as a firm foundation for true object/relational DBMSs. The authors combine precision and thoroughness of exposition with the approachability that readers familiar with their previous publications will recognize and welcome. This book is essential reading for database students and professionals alike. Hugh Darwen has been involved in software development since 1967 as an employee of IBM United Kingdom Ltd. He has been active in the relational database arena since 1978, and was one of the chief architects and developers of an IBM relational product called Business System 12--a product that faithfully embraced the principles of the relational model. His writings include notable contributions to Date's Relational Database Writings series (Addison-Wesley, 1990, 1992) and A Guide to the SQL Standard (4th edition, Addison-Wesley, 1997). He has been an active participant in the development of SQL international standards since 1988. C.J. Date is an independent consultant, author, lecturer, and researcher specializing in relational database systems. He was one of the first persons to recognize and support Codd's pioneering work on the relational model. Mr. Date was also involved in technical planning for the IBM products SQL/DS and DB2. He is best known for his books, in particular An Introduction to Database Systems (6th edition, Addison-Wesley, 1996), which has sold well over half a million copies worldwide. 0201309785B04062001

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. BREMOVE(c), BRENAME(c), and BCOMPOSE(c). 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: Single inheritance (conditional). OO Prescription 3: Multiple inheritance (conditional). OO Prescription 4: Computational completeness. OO Prescription 5: Explicit transaction boundaries. OO Prescription 6: Nested transactions. OO Prescription 7: Aggregates 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: Tuple and relation parameters. 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: Conversions 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. Formal Specifications. Introduction. IM Proposals. 14. Informal Discussions and Explanations. Introduction. IM Proposal 1: Types are sets. IM Proposal 2: Subtypes are subsets. IM Proposal 3: “Subtype of” is reflexive. IM Proposal 4: Proper subtypes. IM Proposal 5: “Subtype of” is transitive. IM Proposal 6: Immediate subtypes. IM Proposal 7: Single inheritance only. IM Proposal 8: Global root types. IM Proposal 9: Type hierarchies. IM Proposal 10: Subtypes can be proper subsets. IM Proposal 11: Types disjoint unless one a subtype of the other. IM Proposal 12: Scalar values (extended definition). IM Proposal 13: Scalar variables (extended definition). IM Proposal 14: Assignment with inheritance. IM Proposal 15: Comparison with inheritance. IM Proposal 16: Join etc. with inheritance. IM Proposal 17: TREAT DOWN. IM Proposal 18: TREAT UP. IM Proposal 19: Logical operator IS_T(SX). IM Proposal 20: Relational operator RX:IS_T(A). IM Proposal 21: Logical operator IS_MS_T(SX). IM Proposal 22: Relational operator RX:IS_MS_T(A). IM Proposal 23: THE_ pseudovariables. IM Proposal 24: Read-only operator inheritance and value substitutability. IM Proposal 25: Read-only parameters to update operators. IM Proposal 26: Update operator inheritance and variable substitutability. What about specialization by constraint? 15. Multiple Inheritance. Introduction. The running example. IM Proposals 1-26 revisited. Many supertypes per subtype. Type graphs. Least specific types unique. Most specific types unique. Comparison with multiple inheritance. Operator inheritance. 16. Tuple and Relation Types. Introduction. Tuple and relation subtypes and supertypes. IM Proposals 1-11 still apply. Tuple and relation values (extended definitions). Tuple and relation most specific types. Tuple and relation variables (extended definitions). Tuple and relation assignment. Tuple and relation comparison. Tuple and relation TREAT DOWN. IM Proposals 18-26 revisited. 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 Database Design Dilemma. Introduction. Encapsulation. Discussion. Further considerations. Appendix C. Specialization by Constraint. Introduction. A closer look. The “3 out of 4” rule. Can the idea be rescued? Appendix D. Subtables and Supertables. Introduction. Some general observations. The terminology is extremely bad. The concept is not type inheritance. Why? Appendix E. A Comparison with SQL3. Introduction. RM Prescriptions. RM Proscriptions. OO Prescriptions. OO Proscriptions. RM Very Strong Suggestions. OO Very Strong Suggestions. IM Proposals (scalar types, single inheritance). IM Proposals (scalar types, multiple inheritance). IM Proposals (tuple and relation types). History of the wrong equation in SQL3. Appendix F. A Comparison with ODMG. Introduction. Overview. RM Prescriptions. RM Proscriptions. OO Prescriptions. OO Proscriptions. RM Very Strong Suggestions. OO Very Strong Suggestions. IM Proposals (scalar types, single inheritance). IM Proposals (scalar types, multiple inheritance). IM Proposals (tuple and relation types). Appendix G. 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 H. References and Bibliography. Index. 0201309785T04062001


Best Sellers


Product Details
  • ISBN-13: 9780201309782
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Addison Wesley
  • Height: 191 mm
  • No of Pages: 520
  • Series Title: English
  • Sub Title: The Third Manifesto
  • Width: 241 mm
  • ISBN-10: 0201309785
  • Publisher Date: 22 Jul 1998
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Spine Width: 25 mm
  • Weight: 846 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Foundation for Object / Relational Databases: The Third Manifesto
Pearson Education (US) -
Foundation for Object / Relational Databases: The Third Manifesto
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Foundation for Object / Relational Databases: The Third Manifesto

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA