Abraham Silberschatz 2026-11-05
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]
https://engineering.yale.edu/research-and-faculty/faculty-directory/abraham-silberschatz. Research interests and textbook authorship
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]
Relational Model slides for Database System Concepts by Abraham Silberschatz and others. slides 3.82 and 3.86, Safety of Expressions
Portrait of Abraham Silberschatz
. Source. Data independence 2026-11-05
Data independence separates the logical meaning of stored data from details that an application need not know. Physical independence permits changing indexes, page layout or access paths without changing a query's meaning. Logical independence permits some changes in the database's logical organization while preserving the interface exposed to existing applications, often through views.
For example, a query asking for an employee's department should return the same answer after the database replaces a table scan with a B-tree index. An application that follows stored record addresses directly would instead depend on that representation. E. F. Codd's1970 relational model explicitly argued against dependencies on ordering, indexes and access paths.[ref] Independence does not mean every schema change is invisible: removing a field an application needs changes its contract unless another representation supplies equivalent information.
E. F. Codd 2026-11-05
E. F. Codd introduced the relational model in his 1970 paper on large shared data banks. Data is represented by relations rather than application-visible pointers and access paths, supporting data independence: changing physical organization need not change the meaning of a query.[ref]
The distinction is operationally important. A query can request tuples satisfying a predicate while the system chooses an index or scan. Applications specify the information they need instead of navigating one fixed storage layout. Mathematical relations also expose dependencies among attributes, providing a foundation for database normalization.
Henry F. Korth 2026-11-05
Henry F. Korth studies database management systems, including database transactions and database query processing in parallel and distributed settings. His Lehigh profile records these research areas and work on database storage and aggregation systems.[ref]
https://engineering.lehigh.edu/faculty/henry-hank-korth. Research contributions and database-system projects
With Abraham Silberschatz and S. Sudarshan, he coauthored teaching material on the relational model. A relation is a set of tuples, so mathematical projection removes repeated result tuples; a query language or implementation that retains duplicates has different semantics unless duplicate removal is requested. For example, projecting the department column of two employee records from the same department gives one tuple under set semantics. Keeping this distinction explicit helps connect a declarative query to its actual result.[ref]
Relational Model slides for Database System Concepts by Abraham Silberschatz and others. Relational Algebra, project operation and duplicate elimination
Portrait of Henry F. Korth
. Source. Solutions to all three questions of the examination dated 3 June 2015. The cover permits answers to two questions.[ref]
Use classical relational algebra with set semantics. Write for the paper's
Car, Sales, Customer and Salesperson database relations. A natural join between and matches serialnumber; joins involving a salesperson explicitly match salespersonid to empid. Identifiers, rather than names, distinguish customers and salespeople. The calculations use the ordinary non-null relational model; the SQL aggregate below also explains its empty-input behavior. Relational database 2026-10-31
Relational model Created 2026-10-31 Updated 2026-11-05
The relational model represents data as database relations, which are sets of database tuples over specified value domains. A relational schema names the database attributes and states database integrity constraints; an instance supplies their current values. Relational algebra describes operations on this logical data, while storage order, indexes and access paths belong to its implementation.
For example, the database relation
Reading(sample, value) can contain . A relational selection for values above five followed by relational projection onto sample identifiers returns . Changing the underlying file layout or adding an index need not change that query's meaning. Mathematical database relations have set semantics; SQL often uses bag semantics and has additional SQL NULL behavior.In his 1970 paper, E. F. Codd argued for data independence: application logic should not rely on particular stored orderings, indexes or navigational paths. His relational formulation made that separation central to database design.[ref]

