Articles by others on the same topic (1)

Abraham Silberschatz researches database management systems, operating systems and distributed computing, and coauthored the database text and teaching materials with Henry F. Korth and S. Sudarshan. His Yale profile identifies these research and teaching contributions.[ref]
Their relational model slides make the distinction between a mathematical query expression and a safely evaluable database query explicit. For example, asking for all values not appearing in a finite table can range over an unlimited universe unless the query restricts its results appropriately. Restricting candidate values to those occurring in stored data makes the intended finite computation visible. This is one reason database theory specifies a query's semantics rather than relying on suggestive notation alone.[ref]