xml-dev - Re: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Article on

Re: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Article on

To: Wolfgang Hoschek <whoschek@lbl.gov>
Subject: Re: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Article on JAXP 1.3 "Fast and Easy XML Processing")
From: Wolfgang Hoschek <whoschek@lbl.gov>
Date: Tue, 22 Feb 2005 13:45:50 -0800
Cc: Elliotte Harold <elharo@metalab.unc.edu>, kjouk@yahoo.co.uk, xml-dev@lists.xml.org
In-reply-to: <e3e82eebdc6fa9346729066b1497431b@lbl.gov>
References: <E1D2Si4-0001QA-00@ukmail1.eechost.net> <200502211623.51418.kjones@sarvega.com> <421A0ECF.3090802@metalab.unc.edu> <200502220742.53890.kjouk@yahoo.co.uk> <421B03D2.6020803@metalab.unc.edu> <e3e82eebdc6fa9346729066b1497431b@lbl.gov>

> joins with O(N * min(N,M)).

Actually hash joins have expected time O(max(N,M) + min(N,M)).

Wolfgang.

References:
- RE: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Article on JAXP 1.3 "Fast and Easy XML Processing")
  - From: "Michael Kay" <mike@saxonica.com>
- Re: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Article on JAXP 1.3 "Fast and Easy XML Processing")
  - From: Kevin Jones <kjones@sarvega.com>
- Re: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Articleon JAXP 1.3 "Fast and Easy XML Processing")
  - From: Elliotte Harold <elharo@metalab.unc.edu>
- Re: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Articleon JAXP 1.3 "Fast and Easy XML Processing")
  - From: Elliotte Harold <elharo@metalab.unc.edu>
- Re: [xml-dev] What should TrAX look like? (Was: Re: [xml-dev] Article on JAXP 1.3 "Fast and Easy XML Processing")
  - From: Wolfgang Hoschek <whoschek@lbl.gov>