On 7/10/07, Cam Bazz <[EMAIL PROTECTED]> wrote:
Hello Natalia;
If I were to put records inside a BTreeFiler in a way:
filer.writeRecord(new Key(somekeyvalue),new Value(somevalue))
and then search this filer based on somekeyvalue, would I have to use a
ValueIndexer?
No, you do not need index
Thanks, I'll take a look.
Natalia
On 7/9/07, Nacho Gonzalez Mac Dowell <[EMAIL PROTECTED]> wrote:
Hi all, sorry to step in suddenly... but recently I've been using
Compass framework with excellent results. Compass has a framework called
XSEM (Xml Search Engine Mapping) which makes a really nice
it otherwords, I have to check if a graph contains a node n, if it does not
write a new node, and if it does retrieve the node. I need to be able to do
this very fast. I have tried object oriented dbms, although they worked
nicely for graph things, they were very poor at identity search.
Rememb
On 7/10/07, Joel Nelson <[EMAIL PROTECTED]> wrote:
> it otherwords, I have to check if a graph contains a node n, if it does not
> write a new node, and if it does retrieve the node. I need to be able to do
> this very fast. I have tried object oriented dbms, although they worked
> nicely for gra
True for Xindice's implementation of hashing, but if Xindice supported
Linear Hashing, even growing records would be ok.
http://en.wikipedia.org/wiki/Linear_hash
There were a lot of papers written about this, unfortunately I lost
the pdfs I had a while ago. However I think Berkeley DB (the famou
Hello Joel,
Thanks for the hints.
Yes, I am researching on how to design my own file format. Since adjacency
matrix does not scale well, and removals are problematic, I had decided to
use an adjacency list presentation of a graph.
I have tried the b-tree approach, and yes that was real slow.
I
this sounds interesting. would it be too diffucult to implement linear
hashing for xindices current hashfiler?
On 7/11/07, Joel Nelson <[EMAIL PROTECTED]> wrote:
True for Xindice's implementation of hashing, but if Xindice supported
Linear Hashing, even growing records would be ok.
http://en.w
