[algogeeks] Re: Effictive storage of large document-term-matrix?

Mon, 22 May 2006 08:01:16 -0700

Try b-trees. they are  quite useful representations of large  databases

On 5/22/06, Dirk <[EMAIL PROTECTED] > wrote:

Hi Varun,

thanks for your reply!
Sparse matrix memory implementation sounds like a fit to me.

Will give Google a try and find out more about it!

Thanks,
Dirk

X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.11.88.14 with SMTP id l14mr39040cwb;
        Mon, 22 May 2006 02:40:52 -0700 (PDT)
X-Google-Token: tK44_wwAAADeA93ULMPXZ1cFpW0b1oev
Received: from 52.159.64.103 by j73g2000cwa.googlegroups.com with HTTP;
        Mon, 22 May 2006 09:40:52 +0000 (UTC)
From: "Dirk" <[EMAIL PROTECTED]>
To: "Algorithm Geeks" <[email protected]>
Subject: Re: Effictive storage of large document-term-matrix?
Date: Mon, 22 May 2006 02:40:52 -0700
Message-ID: <[EMAIL PROTECTED] >
In-Reply-To: <[EMAIL PROTECTED]>
References: < [EMAIL PROTECTED]>
   <[EMAIL PROTECTED]>
   < [EMAIL PROTECTED]>
User-Agent: G2/0.2
X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8.0.3) Gecko/20060426 Firefox/1.5.0.3,gzip(gfe),gzip(gfe)
Mime-Version: 1.0
Content-Type: text/plain

Hi Varun,

thanks for your reply!
Sparse matrix memory implementation sounds like a fit to me.

Will give Google a try and find out more about it!

Thanks,
Dirk



Reply via email to