http:^^epoch.cs.berkeley.edu:8000^personal^jmh^

来自「This data set contains WWW-pages collect」· EDU:8000^PERSONAL^JMH^ 代码 · 共 206 行

EDU:8000^PERSONAL^JMH^
206 行
字号 
Date: Thu, 21 Nov 1996 19:58:16 GMT
Server: NCSA/1.5.2
Last-modified: Fri, 15 Nov 1996 03:59:43 GMT
Content-type: text/html
Content-length: 6903

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN"><HTML><HEAD>   <TITLE>Joseph M. Hellerstein</TITLE>   <META NAME="GENERATOR" CONTENT="Mozilla/3.0Gold (WinNT; I) [Netscape]"></HEAD><BODY TEXT="#F5C574" BGCOLOR="#000000" LINK="#00FF00" VLINK="#A8A8FF" ALINK="#FF8040" rgb="#000000"><H1><!WA0><IMG SRC="http://epoch.cs.berkeley.edu:8000/personal/jmh/jmh.small.gif" HEIGHT=187 WIDTH=150> </H1><H1>Joseph M. Hellerstein</H1><P>Assistant Professor<BR>Office: 685 Soda Hall<BR>Phone: (510) 643-4011<BR>Fax: (510) 642-5615<BR>Email: <!WA1><A HREF="mailto:jmh@cs.berkeley.edu">jmh@cs.berkeley.edu<BR></A>Address:</P><P>University of California, Berkeley<BR><!WA2><A HREF="http://www.cs.berkeley.edu/">EECS Computer Science Division<BR></A>387 Soda Hall #1776<BR>Berkeley CA 94720-1776<BR></P><P><HR></P><H2>Research Interests: Database Systems</H2><H3>Current Projects</H3><UL><P><!WA3><A HREF="http://gist.cs.berkeley.edu/"><!WA4><IMG SRC="http://gist.cs.berkeley.edu/lilgist.gif" HEIGHT=62 WIDTH=81></A><B><!WA5><A HREF="http://gist.cs.berkeley.edu/">TheGiST Indexing Project </A></B></P></UL><UL><UL><LI>Generalized Search Trees (GiSTs) for Database Systems and general use</LI><LI>Indexing for non-standard lookups and data domains</LI><LI>Indexability Theory</LI></UL></UL><UL><P><!WA6><A HREF="http://www.cs.berkeley.edu/~jmh/online/online.html"><!WA7><IMG SRC="http://www.cs.berkeley.edu/~jmh/online/online.gif" HEIGHT=32 WIDTH=57></A><B><!WA8><A HREF="http://www.cs.berkeley.edu/~jmh/online/online.html">OnlineAggregation</A></B> </P><UL><LI>Query processing techniques for online aggregation. </LI><LI>User interfaces for online display and control of long-running queries</LI></UL></UL><H3>Other Research</H3><UL><P><B>Query Processing</B> </P></UL><UL><UL><LI>Queries with expensive predicates</LI><LI>Cost-based optimization of nested queries</LI><LI>Job scheduling &amp; query optimization </LI></UL><P><B>Active Databases &amp; Production Rule Systems</B> </P><UL><LI>Static analysis of production rule sets </LI><LI>Programming tools for rule systems </LI></UL></UL><P><HR></P><H2>Recent Papers </H2><P>Joseph M. Hellerstein, Peter J. Haas and Helen J. Wang.  <b>OnlineAggregation</b>.  Submitted for publication.  <!WA9><a href="http://epoch.cs.berkeley.edu:8000/personal/jmh/online/online.ps">Postscript</a> and  <!WA10><a href="http://epoch.cs.berkeley.edu:8000/personal/jmh/online/online.pdf">adobe pdf</a> are available.<P>Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, David E. Culler,Joseph M. Hellerstein and David A. Patterson.  <b>High-Performance Sorting onNetworks of Workstations.</b>  Submitted for publication.<!WA11><a href="http://www.cs.berkeley.edu/~dusseau/nowSort.ps">Postscript</a>is available.<p>Marcel Kornacker, C. Mohan and Joseph M. Hellerstein.  <b>Concurrencyand Recovery in Generalized Search Trees.</b>  Submitted for publication.<!WA12><a href="http://www.cs.berkeley.edu/~marcel/papers/gistconc.ps">Postscript</a>is available.<p>Joseph M. Hellerstein, Elias Koutsoupias, and Christos H. Papadimitriou.  <b>Towards a Theory of Indexability.</b>  Submitted for publication.<!WA13><a href="http://gist.cs.berkeley.edu/ability.ps">Postscript</a>, <!WA14><a href="http://gist.cs.berkeley.edu/ability.pdf">adobe pdf</a>, and<!WA15><a href="http://gist.cs.berkeley.edu/abilityabs.html">an HTMLabstract</a> are available.<hr><h2>Selected Publications</h2><P>Joseph M. Hellerstein and Jeffrey F. Naughton. <b>Query ExecutionTechniques for Caching Expensive Methods.</b> <I>Proc. ACM-SIGMOD InternationalConference on Management of Data,</I> Montreal, June, 1996. <!WA16><A HREF="http://www.cs.berkeley.edu/~jmh/miscpapers/sigmod96.ps">Postscript</A>and an <!WA17><A HREF="http://www.cs.berkeley.edu/~jmh/miscpapers/sigmod96.html">HTMLabstract</A> of the paper are available. </P><P>Joseph M. Hellerstein, Jeffrey F. Naughton and Avi Pfeffer. <b>GeneralizedSearch Trees for Database Systems.</b> <I>Proc. 21st International Conferenceon Very Large Data Bases</I>, Zurich, September, 1995. <!WA18><A HREF="http://gist.cs.berkeley.edu/gist.ps">Postscriptof the full tech report</A>, <!WA19><A HREF="http://gist.cs.berkeley.edu/VLDB95.ps">postscriptof the extended abstract appearing in VLDB '95</A>, and an <!WA20><A HREF="http://gist.cs.berkeley.edu/gistabs.html">HTMLabstract</A> are available. </P><P>Joseph M. Hellerstein. <b>Practical Predicate Placement.</b> <I>Proc.ACM-SIGMOD International Conference on Management of Data,</I> Minneapolis,May, 1994. <!WA21><A HREF="http://www.cs.berkeley.edu/~jmh/miscpapers/sigmod94.ps">Postscript</A>and an <!WA22><A HREF="http://www.cs.berkeley.edu/~jmh/miscpapers/sigmod94.html">HTMLabstract</A> of the paper are available. </P><P>Alexander Aiken, Joseph M. Hellerstein, and Jennifer Widom. <b>StaticAnalysis Techniques for Predicting the Behavior of Active Database Rules.</b><I>ACM Transactions on Database Systems (TODS)</I>, July 1995. <!WA23><A HREF="http://www.cs.berkeley.edu/~jmh/miscpapers/awh.ps">Postscriptof the full paper</A>, and an <!WA24><A HREF="http://www.cs.berkeley.edu/~jmh/miscpapers/awh.html">HTMLabstract</A> are available. </P><p>A <!WA25><a href="http://epoch.cs.berkeley.edu:8000/personal/jmh/papers.html">complete list of publications</a> is also available.<HR></P><H2>Courses</H2><P>This semester I'm teaching <!WA26><A HREF="http://www-inst.eecs.berkeley.edu/~cs186">CS186:Introduction to Database Systems</A>, an upper-level undergraduate course.<HR></P><H2>Seminars</H2><P>I have begun a <!WA27><A HREF="http://s2k-ftp.cs.berkeley.edu:8000/postgres/dblunch.html">databaselunch seminar</A> that meets weekly. <HR></P><H2>Pithy quotes:</H2><P>&quot;Laziness in doing stupid things can be a great virtue&quot; --James Hilton, <I>Lost Horizon</I></P><P>&quot;Sometimes we are confronted with more data than we can reallyuse, and it may be wisest to forget and to destroy most of it&quot; --Donald Knuth, <I>The Art of Computer Programming</I></P><P>&quot;Concepts are delicious snacks with which we try to alleviate ouramazement&quot; -- A. J. Heschel, <I>Man Is Not Alone</I></P><P><HR></P><H2>Points of interest:</H2><UL><LI><!WA28><A HREF="http://bunny.cs.uiuc.edu/README.html">ACM-SIGMOD home page</A></LI><LI><!WA29><A HREF="http://s2k-ftp.CS.Berkeley.EDU:8000">Sequoia 2000 Home Page</A></LI><LI><!WA30><A HREF="http://epoch.CS.Berkeley.EDU:8000/postgres/index.html">BerkeleyDBMS Home Page</A> </LI><LI><!WA31><A HREF="http://www.cs.wisc.edu/~kristint/dbmshome.html">WisconsinDBMS Home Page</A> </LI><LI><!WA32><A HREF="http://www.cs.wisc.edu/">University of Wisconsin ComputerSciences Dept.</A> </LI><LI><!WA33><A HREF="http://www.das.harvard.edu/cs.grafx.html">Harvard UniversityComputer Science</A> </LI><LI><!WA34><A HREF="http://www.nwu.edu/WNUR/jazz/">WNUR-FM Jazz Information Server</A></LI><LI><!WA35><A HREF="http://www.cs.berkeley.edu/~jmh/music/music.html">Hellersteinmusic page</A> </LI><LI><!WA36><A HREF="http://www.cs.berkeley.edu/~jmh/music/dolphy.html">Eric Dolphypage</A> </LI></UL><P><HR><FONT SIZE=-2>Last modified: $Date: 1996/11/15 03:59:37 $ by Joe Hellerstein jmh@cs.berkeley.edu</FONT></P></BODY></HTML>

http:^^epoch.cs.berkeley.edu:8000^personal^jmh^ - 源码说明

本页面展示了「This data set contains WWW-pages collected from computer science departments of various universities」中的 http:^^epoch.cs.berkeley.edu:8000^personal^jmh^ 源码文件，采用 EDU:8000^PERSONAL^JMH^ 编程语言编写，共 206 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫开发者社区收录了大量与数据集相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?