Re: What should TrAX look like? (Was: Re: Article on

To: Wolfgang Hoschek <whoschek@l...>
Subject: Re: What should TrAX look like? (Was: Re: Article on JAXP 1.3 "Fast and Easy XML Processing")
From: Wolfgang Hoschek <whoschek@l...>
Date: Tue, 22 Feb 2005 13:45:50 -0800
Cc: Elliotte Harold <elharo@m...>, kjouk@y..., xml-dev@l...
In-reply-to: <e3e82eebdc6fa9346729066b1497431b@l...>
References: <E1D2Si4-0001QA-00@u...> <200502211623.51418.kjones@s...> <421A0ECF.3090802@m...> <200502220742.53890.kjouk@y...> <421B03D2.6020803@m...> <e3e82eebdc6fa9346729066b1497431b@l...>

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

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

Wolfgang.

References:
- RE: What should TrAX look like? (Was: Re: Article on JAXP 1.3 "Fast and Easy XML Processing")
  - From: "Michael Kay" <mike@s...>
- Re: What should TrAX look like? (Was: Re: Article on JAXP 1.3 "Fast and Easy XML Processing")
  - From: Kevin Jones <kjones@s...>
- Re: What should TrAX look like? (Was: Re: Articleon JAXP 1.3 "Fast and Easy XML Processing")
  - From: Elliotte Harold <elharo@m...>
- Re: What should TrAX look like? (Was: Re: Articleon JAXP 1.3 "Fast and Easy XML Processing")
  - From: Elliotte Harold <elharo@m...>
- Re: What should TrAX look like? (Was: Re: Article on JAXP 1.3 "Fast and Easy XML Processing")
  - From: Wolfgang Hoschek <whoschek@l...>