Dean Daniels
IBM
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Dean Daniels.
Query Processing in Database Systems | 1985
Guy M. Lohman; C. Mohan; Laura M. Haas; Dean Daniels; Bruce G. Lindsay; Patricia G. Selinger; Paul F. Wilms
This chapter describes how statements in the SQL language are processed by the R* distributed relational database management system. R* is an experimental adaptation of System R to the distributed environment. The R* prototype is currently operational on multiple machines running the MVS operating system, and is undergoing evaluation. The R* system is a confederation of autonomous, locally-administered databases that may be geographically dispersed, yet which appear to the user as a single database. Naming conventions permit R* to access tables at remote sites without resorting to a centralized or replicated catalog, and without the user having to specify either the current location of or the communication commands required to access that table. SQL data definition statements affecting remote sites are interpreted through a distributed recursive call mechanism. Tables may be moved physically to other databases without affecting existing SQL statements. SQL data manipulation statements are compiled at each site having a table referenced in the statement, coordinated by the site at which the statement originated. As part of compilation, the distributed optimization process chooses the best place and the best way to access tables and join them together. Optimization uses dynamic programming and careful pruning to minimize total estimated execution cost at all sites, which is a linear combination of CPU, I/O, and communications (both per-message and per-byte) costs.
Information Sciences | 1983
Patricia G. Selinger; Dean Daniels; Laura M. Haas; Bruce G. Lindsay; Pui Ng; Paul F. Wilms; Robert A. Yost
Abstract A distributed database management system (DDBMS) must simplify the users task of defining applications which manipulate shared data stored at multiple computing sites. To this end, the DDBMS must support transparent access to remote data. That is, any operation allowed on local data should also be possible on remote data. At the same time, because different computing sites are controlled by different individuals or organizations, the DDBMS must preserve each sites autonomy over its own data. This paper discusses some of the issues raised in the implementation of a DDBMS by the requirements of site autonomy. The issues will be discussed from the perspective of the R ∗ research project at IBMs San Jose Research Lab.
Archive | 1991
Dean Daniels; Wayne A. Sawdon; Roger L. Haskin
Archive | 1994
Dean Daniels; Thomas Freund; Roger L. Haskin; Robert Anthony Storey
JCDKB | 1982
R. Williams; Dean Daniels; Laura M. Haas; George Lapis; Bruce G. Lindsay; Pui Ng; Ron Obermarck; Patricia G. Selinger; Adrian Walker; Paul F. Wilms; Robert A. Yost
DDB | 1982
Dean Daniels; Patricia G. Selinger; Laura M. Haas; Bruce G. Lindsay; C. Mohan; Adrian Walker; Paul F. Wilms
very large data bases | 1984
Guy M. Lohman; Dean Daniels; Laura M. Haas; Ruth Kistler; Patricia G. Selinger
IEEE Data(base) Engineering Bulletin | 1982
Laura M. Haas; Patricia G. Selinger; Elisa Bertino; Dean Daniels; Bruce G. Lindsay; Guy M. Lohman; Yoshifumi Masunaga; C. Mohan; Pui Ng; Paul F. Wilms; Robert A. Yost
Operating Systems Review | 1991
Dean Daniels; Roger L. Haskin; Jon Reinke; Wayne A. Sawdon
Archive | 1992
Dean Daniels; Thomas Freund; Roger L. Haskin; Robert Anthony Storey