commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Pranas Baliuka" <pranas.bali...@danet.lt>
Subject RE: [Collections] [SUBMIT] Trie
Date Sat, 07 Dec 2002 09:34:17 GMT
Charles, You are 100% right. It depends on application.
For such applications as billing in telecomunications it is enough to use
object-based storage of elements (with some optimizations like converting
UNICODE String to the BDC string).
For text retrieving DBMS indexes primitive data structures as byte[]
preferable. Like extremely fast expression-matching functionality
(Application in biology or Evolutionary algorithms)

At lease some kind of Trie implementation in Collections would be of great
importance

/Pranas

-----Original Message-----
From: Charles Burdick [mailto:charles_burdick@yahoo.com]
Sent: 2002 m. gruod?io 6 d. 17:26
To: Jakarta Commons Developers List
Subject: Re: [Collections] [SUBMIT] Trie


As a frequent user of Commons-Collections, I can support the usefulness
of a Trie implementation in Collections.

Most algorithms textbooks use Trie as an advanced data structure for
fast string retrieval.  It is discussed in Knuth's Art of Computer
Programming.
http://www.amazon.com/exec/obidos/tg/detail/-/0201485419/ref=lib_rd_ss_TI73/
102-3297886-4987356?v=glance&s=books&vi=reader&img=86&coliid=I3GKWA6SDKHVJ5#
reader-link

I'm not convinced that Tries can be optimally stored as objects.
Perhaps we will want a Trie interface that supports primitive char
access as well as a TrieMap interface that is object-based and extends
Collection.

Thanks,
Chuck

--- Stephen Colebourne <scolebourne@btopenworld.com> wrote:
> Hi,
> I've taken a quick look at the code here, and that all looks fine.
>
> Unfortunately, I don't really know what I'm looking at! What I mean
> is that
> I've never heard of a 'Trie' before, and am thus wondering as to why
> I would
> use it, and is it general enough to be in [collections].
>
> In the past we have had discussions about Tree implementations (and I
> have
> coded some before). This may be related, as the Trie appears to be a
> recursive structure.
>
> Perhaps, some use cases as to why a Trie is useful, especially in a
> general/server environment would be useful. Thanks.
>
> Stephen
>
> ----- Original Message -----
> From: "Rich Dougherty" <rich@rd.gen.nz>
> To: <commons-dev@jakarta.apache.org>
> Sent: Monday, December 02, 2002 7:36 AM
> Subject: [Collections] [SUBMIT] Trie
>
>
> > Hi
> >
> > I've written an implementation for a trie which I'd like to
> > contribute. I've attached a simple implementation and a test
> > case. Here's the interface:
> >


__________________________________________________
Do you Yahoo!?
Yahoo! Mail Plus - Powerful. Affordable. Sign up now.
http://mailplus.yahoo.com

--
To unsubscribe, e-mail:
<mailto:commons-dev-unsubscribe@jakarta.apache.org>
For additional commands, e-mail:
<mailto:commons-dev-help@jakarta.apache.org>


--
To unsubscribe, e-mail:   <mailto:commons-dev-unsubscribe@jakarta.apache.org>
For additional commands, e-mail: <mailto:commons-dev-help@jakarta.apache.org>


Mime
View raw message