From: | elein <elein(at)varlena(dot)com> |
---|---|
To: | sfpug(at)postgresql(dot)org |
Cc: | elein <elein(at)varlena(dot)com> |
Subject: | Fwd: Upcoming Berkeley Distinguish Lecture: Michael Stonebraker |
Date: | 2009-10-13 20:36:34 |
Message-ID: | 16565446-4127-4D09-AC93-F432F2E21397@varlena.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | sfpug |
If you haven't heard Stonebraker speak, he is quite interesting and
entertaining. I don't know what he is going to speak about except
something about databases.
The lecture should be good.
--elein
Begin forwarded message:
> From: Joe Hellerstein <hellerstein(at)cs(dot)berkeley(dot)edu>
> Date: October 13, 2009 11:59:55 AM PDT
> To: dblunch(at)triplerock(dot)CS(dot)Berkeley(dot)EDU
> Subject: Upcoming Berkeley Distinguish Lecture: Michael Stonebraker
>
>
> Prof. Michael Stonebraker will return to Berkeley on Wednesday
> October 28 for a Distinguished Lecture in the EECS Colloquium.
> Please join us.
>
> Joe Hellerstein
>
> http://www.eecs.berkeley.edu/Colloquium/Archives/09-10/Fall2009/stonebraker.shtml
>
> Wednesday, October 28, 2009
> 306 Soda Hall (HP Auditorium)
> 4:00 - 5:00 pm
>
> Michael Stonebraker
> M.I.T. and Goby, Inc
>
> Abstract:
> Historically, search engines have focused on searching the entire
> web for objects of interest using a single “one-size-fits-all”
> keyword query system supported by word-oriented indexing. In a task-
> specific search application such as real estate values (Zillow.com)
> airline tickets (Kayak, et. al..) and comparison shopping, such
> general purpose information retrieval (IR) techniques can be
> drastically improved. One can leverage any or all of the following
> to generate a vastly improved search experience.
>
> a task-specific user-interface for queries
> a task-specific user interface for displaying results
> a task-specific data model for semantically organizing data
> a curation mechanism for deciding which sites have potentially
> valuable data
> a mechanism for searching such web sites and converting returned
> data to this data model (semantic data integration)
> a mechanism for searching for data that is behind HTML forms (the so-
> called deep web)
> a task-specific ranking system to order the presentation of returned
> data
> a task-specific mechanism for caching popular (static) returned data
> This talk describes a task-specific search engine, Morpheus, built
> at M.I.T. and explains how it solves the above issues. Then, we
> describe the changes that Goby made to Morpheus to produce a
> commercial product. We conclude with a demo of the Goby product.
>
> Biography
> Dr. Stonebraker has been a pioneer of data base research and
> technology for more than a quarter of a century. He was the main
> architect of the INGRES relational DBMS, and the object-relational
> DBMS, POSTGRES. These prototypes were developed at the University of
> California at Berkeley where Stonebraker was a Professor of Computer
> Science for twenty five years. More recently at M.I.T. he was a co-
> architect of the Aurora/Borealis stream processing engine, the C-
> Store column-oriented DBMS, the H-Store transaction engine, and the
> Morpheus search engine. Each has been commercialized by a venture-
> capital backed startups. Presently he serves as Chief Technology
> Officer of Vertica, which is commercializing C-Store, VoltDB which
> is commercializing H-Store, and Goby which is commercializing
> Morpheus. Professor Stonebraker is the author of scores of research
> papers on data base technology, operating systems and the
> architecture of system software services. He was awarded the ACM
> System Software Award in 1992, for his work on INGRES. Additionally,
> he was awarded the first annual ACM SIGMOD Innovation award.
>
elein
elein(at)varlena(dot)com
From | Date | Subject | |
---|---|---|---|
Next Message | Christophe Pettus | 2009-10-13 20:44:09 | SFPUG: Video from "Statistics and Postgres — How the Planner Sees Your Data" |
Previous Message | David Fetter | 2009-10-13 20:05:48 | Re: Oct 13 meeting is full, is everyone attending? |