Abstract
This chapter introduces the concepts of a tuple, a table, and a database predicate (using the meaning of predicate that was established in Chapter 1). You can use tuple, table, and database predicates to describe the data integrity constraints of a database design. The goal of this chapter is to establish these three different classes of predicates—which jointly we’ll refer to as data integrity predicates—and to give ample examples of predicates within each class.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Lex de Haan and Toon Koppelaars
About this chapter
Cite this chapter
(2007). Tuple, Table, and Database Predicates. In: Applied Mathematics for Database Professionals. Apress. https://doi.org/10.1007/978-1-4302-0348-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4302-0348-3_6
Publisher Name: Apress
Print ISBN: 978-1-59059-745-3
Online ISBN: 978-1-4302-0348-3
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books