Peter Buneman

Last updated

Peter Buneman
Born
Oscar Peter Buneman

1943 (age 80–81)
NationalityBritish
Alma mater Gonville and Caius College, Cambridge [1]
University of Warwick
Known for
Awards
Scientific career
Fields Computer Science
Institutions
Thesis Models of Learning and Memory (1970)
Doctoral advisor Christopher Zeeman [9]
Doctoral students
Website homepages.inf.ed.ac.uk/opb

Oscar Peter Buneman, MBE , FRS , FRSE (born 1943) is a British computer scientist who works in the areas of database systems and database theory. [10] [11] [12] [13] [14] [15] [16]

Contents

Education

Buneman was educated at the University of Cambridge, where he was awarded a Bachelor of Arts while studying the Cambridge Mathematical Tripos from Gonville and Caius College, Cambridge. Buneman went on to study at the University of Warwick, where he received his PhD in 1970. [9]

Career

Following his PhD, Buneman worked briefly at the University of Edinburgh, followed by a professorship of computer science at the University of Pennsylvania, which he held for several decades. In 2002, he moved to the University of Edinburgh, where he built up the database research group. He is one of the founders and the Associate Director of Research of the UK Digital Curation Centre, [8] which is located in Edinburgh.

Buneman is known for his research in database systems and database theory, in particular for establishing connections between databases and programming language theory, [17] such as introducing monad-based query languages for nested relations and complex object databases. [18] He also pioneered research on managing semi-structured data, [19] [20] and, recently, research on data provenance, annotations, and digital curation.

In computational biology, he is known for his work on reconstructing phylogenetic trees [21] based on Buneman graphs, which are named in his honour.

Awards and honours

Buneman is a Fellow of the Royal Society, fellow of the ACM, a fellow of the Royal Society of Edinburgh, and has won a Royal Society Wolfson Research Merit Award. He has chaired both flagship research conferences in data management, SIGMOD (in 1993) and VLDB (in 2008), as well as the main database theory conference, PODS (in 2001).

Buneman was appointed Member of the Order of the British Empire (MBE) in the 2013 New Year Honours for services to data systems and computing. [22] His nomination for the Royal Society reads

Peter Buneman is distinguished for his advances in uniting programming languages and databases. On the theoretical side this has involved new results in types, monads and structural recursion including (with his student Ohori) type inference for record types, and (with Tannen et al) results that demonstrated a tight connection between monad-based languages and those based on the predicate calculus. On the application side, he used these techniques to demonstrate that – contrary to an assertion by the US Department of Energy – queries on existing non-relational genomic databases could be directly evaluated; fruitful collaboration with biologists ensued.

This research carries over into his recent study of the principles of semistructured or "web-like" data. He is a leading proponent of this new field, and co-author of the first text book in it. Another recent concern is with the provenance of data on the Web, where data is continually copied and transformed. Already, with Khanna et al. he has built an efficient archiving system for scientific databases; more fundamentally, he seeks a formal basis for tracing provenance.

In addition to his work in databases, Buneman's early work on mathematical phylogeny underlies most modern phylogenetic reconstruction techniques. [6]

Personal life

Buneman is the son of physicist Oscar Buneman.

Related Research Articles

<span class="mw-page-title-main">R-tree</span> Data structures used in spatial indexing

R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons. The R-tree was proposed by Antonin Guttman in 1984 and has found significant use in both theoretical and applied contexts. A common real-world usage for an R-tree might be to store spatial objects such as restaurant locations or the polygons that typical maps are made of: streets, buildings, outlines of lakes, coastlines, etc. and then find answers quickly to queries such as "Find all museums within 2 km of my current location", "retrieve all road segments within 2 km of my location" or "find the nearest gas station". The R-tree can also accelerate nearest neighbor search for various distance metrics, including great-circle distance.

Datalog is a declarative logic programming language. While it is syntactically a subset of Prolog, Datalog generally uses a bottom-up rather than top-down evaluation model. This difference yields significantly different behavior and properties from Prolog. It is often used as a query language for deductive databases. Datalog has been applied to problems in data integration, networking, program analysis, and more.

<span class="mw-page-title-main">MonetDB</span> Open source column-oriented relational database management system

MonetDB is an open-source column-oriented relational database management system (RDBMS) originally developed at the Centrum Wiskunde & Informatica (CWI) in the Netherlands. It is designed to provide high performance on complex queries against large databases, such as combining tables with hundreds of columns and millions of rows. MonetDB has been applied in high-performance applications for online analytical processing, data mining, geographic information system (GIS), Resource Description Framework (RDF), text retrieval and sequence alignment processing.

<span class="mw-page-title-main">Philip Wadler</span> American computer scientist

Philip Lee Wadler is a UK-based American computer scientist known for his contributions to programming language design and type theory. He is the chair of theoretical computer science at the Laboratory for Foundations of Computer Science at the School of Informatics, University of Edinburgh. He has contributed to the theory behind functional programming and the use of monads; and the designs of the purely functional language Haskell and the XQuery declarative query language. In 1984, he created the Orwell language. Wadler was involved in adding generic types to Java 5.0. He is also author of "Theorems for free!", a paper that gave rise to much research on functional language optimization.

Seymour Ginsburg was an American pioneer of automata theory, formal language theory, and database theory, in particular; and computer science, in general. His work was influential in distinguishing theoretical Computer Science from the disciplines of Mathematics and Electrical Engineering.

<span class="mw-page-title-main">Serge Abiteboul</span> French computer scientist

Serge Joseph Abiteboul is a French computer scientist working in the areas of data management, database theory, and finite model theory.

<span class="mw-page-title-main">Georg Gottlob</span> Austrian computer scientist

Georg Gottlob FRS is an Austrian-Italian computer scientist who works in the areas of database theory, logic, and artificial intelligence and is Professor of Informatics at the University of Calabria. He was Professor at the University of Oxford.

Dan Suciu is a full professor of computer science at the University of Washington. He received his Ph.D. from the University of Pennsylvania in 1995 under the supervision of Val Tannen. After graduation, he was a principal member of the technical staff at AT&T Labs until he joined the University of Washington in 2000. Suciu does research in data management, with an emphasis on Web data management and managing uncertain data. He is a co-author of an influential book on managing semistructured data.

<span class="mw-page-title-main">Joseph M. Hellerstein</span> American computer scientist

Joseph M. Hellerstein is an American professor of computer science at the University of California, Berkeley, where he works on database systems and computer networks. He co-founded Trifacta with Jeffrey Heer and Sean Kandel in 2012, which stemmed from their research project, Wrangler.

<span class="mw-page-title-main">Patricia Selinger</span> American computer scientist and IBM Fellow

Patricia G. Selinger is an American computer scientist and IBM Fellow, best known for her work on relational database management systems.

Differential privacy (DP) is an approach for providing privacy while sharing information about a group of individuals, by describing the patterns within the group while withholding information about specific individuals. This is done by making arbitrary small changes to individual data that do not change the statistics of interest. Thus the data cannot be used to infer much about any individual.

<span class="mw-page-title-main">Tomasz Imieliński</span> Polish-American computer scientist (born 1954)

Tomasz Imieliński is a Polish-American computer scientist, most known in the areas of data mining, mobile computing, data extraction, and search engine technology. He is currently a professor of computer science at Rutgers University in New Jersey, United States.

Victor Vianu is a computer scientist, a professor of computer science and engineering at the University of California, San Diego. He served as editor-in-chief of the Journal of the ACM from 2009 to 2015.

<span class="mw-page-title-main">Tova Milo</span> Israeli computer scientist

Tova Milo is a full Professor of Computer Science at Tel Aviv University and the Dean of the Faculty of Exact Sciences. She served as the head of the Computer Science Department from 2011 to 2014. Milo is the head of the data management group in Tel Aviv University, and her research focuses on Web data management. She received her PhD from the Hebrew University in 1992 under the supervision of Catriel Beeri, and was a postdoctoral fellow at the University of Toronto and INRIA, France, prior to joining Tel Aviv University.

<span class="mw-page-title-main">Martin L. Kersten</span> Dutch computer scientist (born 1953)

Martin L. Kersten was a computer scientist with research focus on database architectures, query optimization and their use in scientific databases. He was an architect of the MonetDB system, an open-source column store for data warehouses, online analytical processing (OLAP) and geographic information systems (GIS). He has been (co-) founder of several successful spin-offs of the Centrum Wiskunde & Informatica (CWI).

<span class="mw-page-title-main">Wenfei Fan</span> Chinese-British computer scientist

Wenfei Fan is a Chinese-British computer scientist and professor of web data management at the University of Edinburgh. His research investigates database theory and database systems.

Leonid Libkin is a computer scientist who works in data management, in particular in database theory, and in logic in computer science.

Laura M. Haas is an American computer scientist noted for her research in database systems and information integration. She is best known for creating systems and tools for the integration of heterogeneous data from diverse sources, including federated technology that virtualizes access to data, and mapping technology that enables non-programmers to specify how data should be integrated.

<span class="mw-page-title-main">Witold Lipski</span> Polish computer scientist

Witold Lipski Jr. was a Polish computer scientist, and an author of two books: Combinatorics for Programmers and (jointly with Wiktor Marek Combinatorial analysis. Lipski, jointly with his PhD student, Tomasz Imieliński, created foundations of the theory of incomplete information in relational databases.

Reverse data management describes a branch and set of research questions in relational database theory that aim to reverse the common focus of standard data management. Instead of focusing on the "forward" transformation of an input databases to an output table, which is the main focus of standard query evaluation, reverse data management reverses that focus and studies the possible input database transformations that would achieve a desired output. Usually the objective is to find an intervention of minimal size, in order to achieve a particular change in the output.

References

  1. ↑ "BUNEMAN, Prof. (Oscar) Peter". Who's Who 2014, A & C Black, an imprint of Bloomsbury Publishing plc, 2014; online edn, Oxford University Press.(subscription required)
  2. ↑ Buneman, P.; Khanna, S.; Wang-Chiew, T. (2001). "Why and Where: A Characterization of Data Provenance" . Database Theory — ICDT 2001. Lecture Notes in Computer Science. Vol. 1973. pp.  316. CiteSeerX   10.1.1.6.1848 . doi:10.1007/3-540-44503-X_20. ISBN   978-3-540-41456-8.
  3. ↑ Peter Buneman, Susan Davidson, James Frew. "Why Data Citation Is a Computational Problem". cacm.acm.org. ACM Press. Retrieved 15 February 2024.{{cite web}}: CS1 maint: multiple names: authors list (link)
  4. ↑ Buneman, Peter; Christie, Greig; Davies, Jamie A; Dimitrellou, Roza; Harding, Simon D; Pawson, Adam J; Sharman, Joanna L; Wu, Yinjun (1 January 2020). "Why data citation isn't working, and what to do about it". Database. doi:10.1093/databa/baaa022 . Retrieved 15 February 2024.
  5. ↑ Buneman, Peter; Dosso, Dennis; Lissandrini, Matteo; Silvello, Gianmaria (2021). "Data citation and the citation graph". Quantitative Science Studies. pp. 1399–1422. doi:10.1162/qss_a_00166 . Retrieved 15 February 2024.
  6. 1 2 "WebCite query result". Archived from the original on 14 January 2014.{{cite web}}: Cite uses generic title (help)
  7. ↑ ACM fellowship citation: http://fellows.acm.org/fellow_citation.cfm?id=1669316
  8. 1 2 Rusbridge, C.; Buneman, P.; Burnhill, P.; Giaretta, D.; Ross, S.; Lyon, L.; Atkinson, M. (2005). "The Digital Curation Centre: A Vision for Digital Curation" (PDF). 2005 IEEE International Symposium on Mass Storage Systems and Technology (PDF). p. 31. doi:10.1109/LGDI.2005.1612461. ISBN   978-0-7803-9228-1. S2CID   20810596.
  9. 1 2 3 Peter Buneman at the Mathematics Genealogy Project
  10. ↑ Peter Buneman author profile page at the ACM Digital Library
  11. ↑ Peter Buneman at DBLP Bibliography Server OOjs UI icon edit-ltr-progressive.svg
  12. ↑ Peter Buneman publications indexed by Microsoft Academic
  13. ↑ Peter Buneman's publications indexed by the Scopus bibliographic database. (subscription required)
  14. ↑ "Google Scholar".
  15. ↑ Atkinson, M. P.; Buneman, O. P. (1987). "Types and persistence in database programming languages". ACM Computing Surveys . 19 (2): 105. doi:10.1145/62070.45066. S2CID   11187867.
  16. ↑ Winslett, M. (2009). "Peter Buneman speaks out on phylogeny, the integration of databases and programming languages, curated databases, british plumbing, the value of talking to users, when to ignore the literature, and more" (PDF). ACM SIGMOD Record . 38 (2): 42–49. doi:10.1145/1815918.1815928. S2CID   33110461.
  17. ↑ Buneman, P.; Davidson, S.; Hillebrand, G.; Suciu, D. (1996). "A query language and optimization techniques for unstructured data". ACM SIGMOD Record. 25 (2): 505. CiteSeerX   10.1.1.33.1374 . doi:10.1145/235968.233368. S2CID   235496438.
  18. ↑ Buneman, P.; Naqvi, S.; Tannen, V.; Wong, L. (1995). "Principles of programming with complex objects and collection types". Theoretical Computer Science . 149: 3–48. doi: 10.1016/0304-3975(95)00024-Q .
  19. ↑ Buneman, P.; Davidson, S.; Fernandez, M.; Suciu, D. (1997). "Adding structure to unstructured data". Database Theory — ICDT '97. Lecture Notes in Computer Science. Vol. 1186. p. 336. doi:10.1007/3-540-62222-5_55. ISBN   978-3-540-62222-2. S2CID   2076813.
  20. ↑ Abiteboul, Serge; Buneman, Peter; Suciu, Dan (2000). Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann. ISBN   978-1558606227.
  21. ↑ Peter Buneman (1971), "The recovery of trees from measures of dissimilarity", in Hodson, F. R.; Kendall, D. G. & Tautu, P. T., Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press, pp. 387–395 .
  22. ↑ "No. 60367". The London Gazette (Supplement). 29 December 2012. p. 15.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.