Biography:David L. Childs

From HandWiki
Short description: American computer scientist
David L. Childs
Known forModeling computer data as mathematical objects
Scientific career
FieldsComputer science
InstitutionsSet Theoretic Information Systems Corporation
Websitexsp.xegesis.org/Iisprof.pdf

David L. Childs is an American computer scientist noted for his work on his Extended Set Theoretic approach to data base management and cited by Edgar F. Codd in his key paper "A Relational Model of Data for Large Shared Data Banks".

Biography

The late 1960s saw Childs working on the CONCOMP project for Research in Conversational Use of Computers under project director Franklin H. Westervelt.[1]

Childs proposed the Extended Set Theoretic approach to database management in 1968 in his paper Feasibility of a Set-Theoretic Data Structure Based on a Reconstituted Definition of a Relation.[2][3][4] The MICRO Relational Database Management System which was implemented in 1970 was based on Childs' Set-Theoretic Data Structure (STDS) work.[citation needed]

In 1970 Codd in his key paper on relational databases, A Relational Model of Data for Large Shared Data Banks, cited one of Childs' 1968 papers as part of the basis for the work.[5]

In 1985 Childs formed Integrated Information Systems with object of focusing on the rapid integration and access of highly distributed disparate data and providing software and services to assist in handling this class of problem.[6]

References

Bibliography

  • {{cite encyclopedia|first1=David L.|last1=Childs|date=1968a|title=Description of a set-theoretic data structure
    |volume=Technical Report 3|encyclopedia=CONCOMP (Research in Conversational Use of Computers) Project|publisher=University of Michigan
    |url=https://deepblue.lib.umich.edu/bitstream/handle/2027.42/4163/bac0294.0001.001.pdf?sequence=5&isAllowed=y
    |archive-url  = https://web.archive.org/web/20200521082715/https://deepblue.lib.umich.edu/bitstream/handle/2027.42/4163/bac0294.0001.001.pdf
  • {{cite encyclopedia|first1=David L.|last1=Childs|date=1968b|title=Feasibility of a set-theoretic data structure: a general structure based on a reconstituted definition
    |volume=Technical Report 6|encyclopedia=CONCOMP (Research in Conversational Use of Computers) Project|publisher=University of Michigan
    |url=https://deepblue.lib.umich.edu/bitstream/handle/2027.42/4164/bac0293.0001.001.pdf?sequence=5&isAllowed=y
    |archive-url=https://web.archive.org/web/20200521013015/https://deepblue.lib.umich.edu/bitstream/handle/2027.42/4164/bac0293.0001.001.pdf;jsessionid=ACFF1474C8A5E16E10492B5ADA84A52F?sequence=5