Melvin Earl Maron

From Wikipedia, the free encyclopedia
Melvin Earl Maron
Known for
Scientific career
FieldsComputer Science
InstitutionsUniversity of California, Berkeley

Melvin Earl "Bill" Maron (Jan 23, 1924 - September 28, 2016) was an American computer scientist and emeritis professor of University of California, Berkeley.[1] He studied mechanical engineering and physics at the University of Nebraska and received his Ph.D. in philosophy from the University of California in 1951.[2] Maron is best known for his work on probabilistic information retrieval which he published together with his friend and colleague Lary Kuhns.[3][4] Quite remarkably, Maron also pioneered relational databases, proposing a system called the Relational Data File in 1967, on which Ted Codd based his Relational model of data.[5]

References[edit]

  1. ^ "In Memory of Professor Emeritus Melvin "Bill" Maron". UC Berkeley School of Information. Retrieved 6 February 2017.
  2. ^ "Contributors". Transactions of the I.R.E. Professional Group on Electronic Computers. EC-3 (2): 50–51. 1954-06-01. doi:10.1109/IREPGELC.1954.6499422. ISSN 2168-1740.
  3. ^ Maron, Melvin E.; Kuhns, J. L. (1960). "On relevance, probabilistic indexing, and information retrieval". Journal of the ACM. 7 (3): 216–244. doi:10.1145/321033.321035. S2CID 11592162.
  4. ^ Maron, Melvin E. (2008). "An Historical Note on the Origins of Probabilistic Indexing" (PDF). Information Processing and Management. 44 (2): 971–972. doi:10.1016/j.ipm.2007.02.012.
  5. ^ Levein, Roger E.; Maron, Melvin E. (1967). "A computer system for inference execution and data retrieval". Communications of the ACM. 10 (11): 715–721. doi:10.1145/363790.363817. S2CID 14979585.