From wiebren@cs.vu.nl Tue May 11 08:46:26 1993
Received: from CS.NYU.EDU by SHASHA.CS.NYU.EDU (5.61/1.34)
	id AA08879; Tue, 11 May 93 08:46:25 -0400
Received: from top.cs.vu.nl by cs.NYU.EDU (5.61/1.34)
	id AA15827; Tue, 11 May 93 08:46:23 -0400
Received: from clipper.cs.vu.nl by top.cs.vu.nl id aa05473;
          11 May 93 14:45 MET DST
Received: from wiebren.cs.vu.nl by clipper.cs.vu.nl id aa08423;
          11 May 93 14:45 MET DST
Date:     Tue, 11 May 93 14:45:30 MET DST
From: Wiebren de Jonge <wiebren@cs.vu.nl>
To: shasha@cs.NYU.EDU
Cc: wiebren@cs.vu.nl
Subject:  try to contact
Message-Id:  <9305111445.aa23616@wiebren.cs.vu.nl>
Status: RO

Dear Prof. Shasha,

In connection with your TODS-article on the performance of concurrent
B-tree algorithms, I am trying to contact you.
However, I do not have your e-mail address.
This is just a "wild" guess.
Please let me know whether you have received this message.

Sincerely,  Wiebren de Jonge
	    Dept. of Math. & Computer Science
	    Vrije Universiteit
	    Amsterdam, The Netherlands

	    e-mail: wiebren@cs.vu.nl

From AHO@us.oracle.com Wed Oct  6 20:43:03 1993
Received: from CS.NYU.EDU by SHASHA.CS.NYU.EDU (5.61/1.34)
	id AA13478; Wed, 6 Oct 93 20:43:02 -0400
Received: from GATEKEEPER.ORACLE.COM by cs.NYU.EDU (5.61/1.34)
	id AA21761; Wed, 6 Oct 93 20:42:54 -0400
Received:  from wrpyr4.us.oracle.com by gatekeeper.oracle.com (Oracle 1.12/37.7)
	id AA28551; Wed, 6 Oct 93 17:42:45 PDT
Received:  by wrpyr4.us.oracle.com (Oracle 1.12/37.7)
	id AA01912; Wed, 6 Oct 93 17:41:38 PDT
Message-Id: <9310070041.AA01912@wrpyr4.us.oracle.com>
Date: Wed, 6 Oct 93 17:41:38 PDT
From: "roger rabbit" <AHO@us.oracle.com>
To: shasha@cs.NYU.EDU
Subject: papers
Original-To: unix:shasha@cs.nyu.edu
Status: R





howdy.  i was wondering if i could get a copy of the papers,

Johnson and Shasha, Random B-trees with Inserts and Deletes, TR 453,
Johnson and Shasha, Utilization of B-trees with inserts, deletes and
  modifies, 1989.

thanks!
.a

alex ho
oracle corp
box 659414
500 oracle parkway
redwood shores, california 94065


-
alex ho    kernel group    4op1401     415.506.6343    aho@us.oracle.com


From wein@mem.poly.edu Wed Nov 10 11:27:43 1993
Received: from mem.poly.edu by shasha.cs.nyu.edu (5.61/1.34)
	id AA04071; Wed, 10 Nov 93 11:27:42 -0500
Received: by mem.poly.edu (5.65/1.34)
	id AA00592; Wed, 10 Nov 93 11:27:34 -0500
Date: Wed, 10 Nov 93 11:27:34 -0500
From: wein@mem.poly.edu (Joel Wein)
Message-Id: <9311101627.AA00592@mem.poly.edu>
To: shasha@shasha.cs.nyu.edu
In-Reply-To: Dennis Shasha's message of Tue, 9 Nov 93 21:56:48 -0500 <9311100256.AA03094@shasha.cs.nyu.edu>
Subject:  question about competitiveness of lru
Status: R




   Date: Tue, 9 Nov 93 21:56:48 -0500
   From: shasha@shasha.cs.nyu.edu (Dennis Shasha)

   Joel,
   That is interesting.
   The reason I ask this is that we have some improvements
   to LRU that appear to give better performance across many
   application domains.
   But the better performance is only 5-20%, well below 
   anything that competitiveness could measure.
   Thanks,
   Dennis

Sounds interesting.  If you ever write a paper I'd be happy to 
see a copy.

Regards,

Joel

From doshi@usl.com Wed Nov 10 17:47:45 1993
Received: from usl.usl.com by shasha.cs.nyu.edu (5.61/1.34)
	id AA05604; Wed, 10 Nov 93 17:47:43 -0500
Message-Id: <9311102247.AA05604@shasha.cs.nyu.edu>
Date: Wed, 10 Nov 93 17:43 EST
From: doshi@usl.com
To: shasha@shasha.cs.nyu.edu (Dennis Shasha)
Subject: Re: improvement to lru performance
Received: from usl by usl.com; Wed, 10 Nov 1993 17:43 EST
Content-Type: text
Content-Length: 398
Status: R

Dear Dennis,
	Thank you. I would be interested also in obtaining a copy
of the paper describing the LRU/k and your 2Q variant. Perhaps you
can point me to a publication, or if you have hard copies here I can
borrow briefly?
	Also, I think other members of the performance group and the
memory management team may be interested; so I have forwarded your
abstract to them.

Best regards,
-K. Doshi.


From JST2@CIDHIP1.EM.CDC.GOV Tue Jan 18 12:26:05 1994
Received: from CS.NYU.EDU by SHASHA.CS.NYU.EDU (5.61/1.34)
	id AA06897; Tue, 18 Jan 94 12:26:04 -0500
Received: from msmail.em.cdc.gov by cs.NYU.EDU (5.61/1.34)
	id AA13889; Tue, 18 Jan 94 12:25:58 -0500
Received: from router.em.cdc.gov by msmail.em.cdc.gov (5.0/SMI-SVR4)
	id AA08930; Tue, 18 Jan 94 12:30:14 EST
Received: by router.em.cdc.gov with Microsoft Mail
	id <2D3B9EAF@router.em.cdc.gov>; Tue, 18 Jan 94 12:32:47 EST
From: "Tolson, James" <JST2@CIDHIP1.EM.CDC.GOV>
To: "'Shasha, Dennis (B-tree)'" <shasha@cs.NYU.EDU>,
        "'Johnson, Ted (B-tree)'" <ted@cis.ufl.edu>
Subject: Reexamining B-trees
Date: Tue, 18 Jan 94 12:23:00 EST
Message-Id: <2D3B9EAF@router.em.cdc.gov>
Encoding: 8 TEXT
X-Mailer: Microsoft Mail V3.0
Content-Length: 372
Status: R



     I am interesting in obtaining more information on the free-at-empty 
algorithm  you alluded to in DDJ.  I could not determine how to implement 
the algorithm from your descriptions.  An example program  or a detailed 
description of the algorithm would be appreciated.  I was confused about 
what to do after freeing the node how does one balance the tree again.
 

From kbrown@almaden.ibm.com Sun May  1 20:51:10 1994
Received: from CS.NYU.EDU by SHASHA.CS.NYU.EDU (5.61/1.34)
	id AA13653; Sun, 1 May 94 20:50:45 -0400
Received: from ALMADEN.IBM.COM by cs.NYU.EDU (5.61/1.34)
	id AA20953; Sun, 1 May 94 20:49:52 -0400
Received: from ALMADEN by almaden.ibm.com (IBM VM SMTP V2R2) with BSMTP id 2918;
   Sun, 01 May 94 17:50:22 PDT
Received: by ALMADEN (XAGENTA 3.0) id 9010; Sun, 1 May 1994 17:50:22 -0700
Received: by kiwi.almaden.ibm.com (AIX 3.2/UCB 5.64/4.03)
          id AA23526; Sun, 1 May 1994 17:49:48 -0700
Date: Sun, 1 May 1994 17:49:48 -0700
From: <kbrown@almaden.ibm.com> (Kurt P. Brown)
Message-Id: <9405020049.AA23526@kiwi.almaden.ibm.com>
To: shasha@cs.NYU.EDU
Subject: 2Q paper
Status: R

Congratulations on your 2Q paper being accepted for VLDB.  I have a
version of this paper dated Nov 29, 1993 which I believe I pulled off
of the net somewhere, but I can't remember where I got it.  Anyway, it
is incomplete and I was wondering if you could mail me the postscript
for the current version.  Thanks much,

Kurt Brown

From boris@udsab.dia.unisa.it Fri Jun 24 07:53:12 1994
Received: from SPUNKY.CS.NYU.EDU by SHASHA.CS.NYU.EDU (5.61/1.34)
	id AA26202; Fri, 24 Jun 94 07:53:12 -0400
Received: from NYU.EDU by SPUNKY.CS.NYU.EDU (5.61/1.34)
	id AA29662; Fri, 24 Jun 94 06:56:11 -0400
Received: from udsab.dia.unisa.it by cmcl2.NYU.EDU (5.61/1.34)
	id AA09209; Fri, 24 Jun 94 06:56:07 -0400
Received: by udsab.dia.unisa.it id AA03779
  (5.65c+/IDA-1.4.4 for shasha@nyu.edu); Fri, 24 Jun 1994 12:55:56 +0200
Date: Fri, 24 Jun 1994 12:55:56 +0200
From: "Shidlovsky B.(ospite DIIMA)" <boris@udsab.dia.unisa.it>
Message-Id: <199406241055.AA03779@udsab.dia.unisa.it>
To: shasha@nyu.edu
Subject: About your article on Concurrent B-trees (TODS'93) + Johnson's e-mail
Status: R

Hello !

Reading your article "The Performance of Current B-tree Algorithm"
in ACM Trans. Database Systems (1993) I found that some tech reports 
are important to understand  better the analytical model proposed by you and 
Johnson. Unfortunately, I cannot find e-mail of Theodore Johnson via
any Whois service. That is why I would be thankful to you for sending me
his e-mail. Also, I 'd like to know if it is possible to get anyhow
some of tech reports or conference articles made by your and Johnson which
are preliminary versions of your approach. 


Thanks in advance ,           Boris Shidlovsky.

+---------------------------------------------------------------------+
| Dr.Boris Shidlovsky               e-mail : boris@udsab.dia.unisa.it |
| DIIMA, University of Salerno      Phone  : +39 +89 974262           |
| Via Ponte don Melillo,4           Fax    : +39 +89 974194           |
| 84084 Fisciano (SA), ITALY                                          |

From sa@cs.brown.edu Mon Jun 27 11:57:12 1994
Received: from CS.NYU.EDU by SHASHA.CS.NYU.EDU (5.61/1.34)
	id AA13460; Mon, 27 Jun 94 11:57:11 -0400
Received: from cs.brown.edu by cs.NYU.EDU (5.61/1.34)
	id AA22783; Mon, 27 Jun 94 11:57:11 -0400
Received: from isabeau (isabeau.cs.brown.edu [128.148.38.162]) by cs.brown.edu (8.6.8.1/Bullwinkle1.1) with ESMTP
	id LAA06124 for <shasha@cs.nyu.edu>; Mon, 27 Jun 1994 11:57:09 -0400
Received: (sa@localhost) by isabeau (8.6.8.1/BrownCS1.0) id LAA13256; Mon, 27 Jun 1994 11:57:08 -0400
Date: Mon, 27 Jun 1994 11:57:08 -0400
From: Swarup Acharya <sa@cs.brown.edu>
Message-Id: <199406271557.LAA13256@isabeau>
To: shasha@cs.NYU.EDU
Subject: Paper in VLDB94..
Status: R

Hi!

Mike Franklin mentioned to me about a paper of yours to appear in VLDB 94
about 2Q Buffer Management. I would be interested in taking a look at the
paper and was wondering if you could email me a postscript version of the
paper.. 

Thanks,

Swarup
--
sa@cs.brown.edu


From arun@apollo.hp.com Mon Mar  6 10:27:09 1995
Received: from cs.NYU.EDU by SHASHA.CS.NYU.EDU (4.1/1.34)
	id AA19619; Mon, 6 Mar 95 10:27:08 EST
Received: from amway.ch.apollo.hp.com by cs.NYU.EDU (4.1/1.34)
	id AA21434; Mon, 6 Mar 95 10:27:02 EST
Message-Id: <9503061527.AA21434@cs.NYU.EDU>
Received: from klavier.ch.apollo.hp.com by amway.ch.apollo.hp.com id <AA29261@amway.ch.apollo.hp.com> Mon, 6 Mar 1995 10:26:14 -0500    
Received: by unknown id <AA186453573@unknown>; Mon, 6 Mar 1995 10:26:13 -0500    
From: arun@apollo.hp.com
Date: Mon, 6 Mar 95 10:26:13 EST
Subject: concurrent algorithms on basic B-trees
To: shasha@cs.NYU.EDU
Status: R

Dear Professor Shasha:

I am interested in concurrent algorithms on basic B-tress (in which the data
are contained within internal nodes of the tree and the leaf nodes are nil).
All of the studies I have encountered in the literature deal with concurrent 
B+-trees (in which all data are contained in leaf nodes).  Are there any
published studies of concurrent algorithms on basic B-trees?  It doesn't look
like B-link algorithms can be adapted to basic B-trees.

                           Regards,
                           Arun Iyengar
                           Hewlett-Packard Company
-------

From arun@apollo.hp.com Mon Mar  6 13:34:58 1995
Received: from amway.ch.apollo.hp.com by SHASHA.CS.NYU.EDU (4.1/1.34)
	id AA23038; Mon, 6 Mar 95 13:34:57 EST
Message-Id: <9503061834.AA23038@SHASHA.CS.NYU.EDU>
Received: from klavier.ch.apollo.hp.com by amway.ch.apollo.hp.com id <AA02797@amway.ch.apollo.hp.com> Mon, 6 Mar 1995 13:34:09 -0500    
Received: by unknown id <AA003514849@unknown>; Mon, 6 Mar 1995 13:34:09 -0500    
From: arun@apollo.hp.com
Date: Mon, 6 Mar 95 13:34:08 EST
Subject: Re:  concurrent algorithms on basic B-trees
To: shasha@SHASHA.CS.NYU.EDU (Dennis Shasha)
In-Reply-To: shasha@SHASHA.CS.NYU.EDU (Dennis Shasha), Mon, 6 Mar 95 11:50:38 EST
Status: R

        You're right, in a way. Those algorithms all assume that
        the data is at the leaves.
        However, the basic ideas still apply. In particular,
        if you use the approach in my paper with Goodman, all the stuff
        with keyset and inrange still work fine.

Do you have a reference for this paper that you wrote with Goodman?

                                   --- Arun Iyengar
-------

From arun@apollo.hp.com Mon Mar  6 15:03:33 1995
Received: from amway.ch.apollo.hp.com by SHASHA.CS.NYU.EDU (4.1/1.34)
	id AA24166; Mon, 6 Mar 95 15:03:31 EST
Message-Id: <9503062003.AA24166@SHASHA.CS.NYU.EDU>
Received: from klavier.ch.apollo.hp.com by amway.ch.apollo.hp.com id <AA03882@amway.ch.apollo.hp.com> Mon, 6 Mar 1995 15:02:42 -0500    
Received: by unknown id <AA039020161@unknown>; Mon, 6 Mar 1995 15:02:41 -0500    
From: arun@apollo.hp.com
Date: Mon, 6 Mar 95 15:02:40 EST
Subject: Re:  concurrent algorithms on basic B-trees
To: shasha@SHASHA.CS.NYU.EDU (Dennis Shasha)
In-Reply-To: shasha@SHASHA.CS.NYU.EDU (Dennis Shasha), Mon, 6 Mar 95 14:46:00 EST
Status: R

Thanks a lot for your help.

                             --- Arun Iyengar
-------

From jhkim@archi.snu.ac.kr Wed Oct 11 22:20:26 1995
Received: from cs.NYU.EDU by SHASHA.CS.NYU.EDU (4.1/1.34)
	id AA26859; Wed, 11 Oct 95 22:20:20 EDT
Received: from ercc.snu.ac.kr by cs.NYU.EDU (4.1/1.34)
	id AA03967; Wed, 11 Oct 95 22:19:52 EDT
Received: from archi.snu.ac.kr by ercc.snu.ac.kr (5.0/SMI-SVR4)
	id AA03555; Thu, 12 Oct 1995 11:16:03 --900
Received: by archi.snu.ac.kr (4.1/ARCHI-4.1)
	id AA09382; Thu, 12 Oct 95 11:03:24-090
From: jhkim@archi.snu.ac.kr (Jong Hun Kim)
Message-Id: <9510122003.AA09382@archi.snu.ac.kr>
Subject: Can I get the information....?
To: ted@cis.ufl.edu
Date: Thu, 12 Oct 1995 11:03:23 -0900 (GMT-0900)
Cc: shasha@cs.NYU.EDU
X-Mailer: ELM [version 2.4 PL21-h3]
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Content-Length: 610       
Status: R

Hello ?
I'm grad student at Seoul National Unversity.
I got your technical report about "2Q:A Low Overhead High Performance Buffer
Management Replacement Algorithm".
But I don't know in which conference your paper was accepted.
So I'd like to know in which conference your paper was accepted.
I'll be very happy to know that....
The sooner, the better....
Thank you very much..


        ID:jhkim    E-Mail:jhkim@archi.snu.ac.kr
        pager:015-365-5129
        TEL:882-9361,880-7047
        Seoul National University
        Department Of Computer Engineering 
        Computer Architecture & Network Lab.


