= Abraham Silberschatz
{c}
<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.https://engineering.yale.edu/research-and-faculty/faculty-directory/abraham-silberschatz[Research interests and textbook authorship]{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.<Relational Model slides for Database System Concepts by Abraham Silberschatz and others>[slides 3.82 and 3.86, Safety of Expressions]{ref}
\Image[https://engineering.yale.edu/application/files/thumbnails/custom_720x720_exact/9917/3099/0588/Abraham_Silberschatz_computer_science.webp]
{title=Portrait of <Abraham Silberschatz>}
{source=https://engineering.yale.edu/research-and-faculty/faculty-directory/abraham-silberschatz}
{width=240}
Back to article page
