Yeah, I am game. I will at least try.
Best,
-C.B.
On 7/11/07, Vadim Gritsenko <[EMAIL PROTECTED]> wrote:
Cam Bazz wrote:
> this sounds interesting. would it be too diffucult to implement linear
> hashing for xindices current hashfiler?
No reason to implement linear hashing within the current
Cam Bazz wrote:
this sounds interesting. would it be too diffucult to implement linear
hashing for xindices current hashfiler?
No reason to implement linear hashing within the current HashFiler, but it makes
sense to implement separate LinearHashFiler class, and if you start with
HashFiler's
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
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
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
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
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, 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
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?
A typical operation is for adding nodes to a graph is:
record r;
if(filer.
On 7/9/07, Cam Bazz <[EMAIL PROTECTED]> wrote:
I am working on a graph database project. I have tried several oodbms, and
finally decided to build my own.
Also, could it be possible to use xindice as a backend for Jena?
Possible, I guess it is (but with lots of pain). Sensible, I don't
think s
On 7/9/07, Cam Bazz <[EMAIL PROTECTED]> wrote:
Hello All,
That was really helpful. Thanks.
I also noticed FSFiler, and HashFiler. Are those for Indexing files?
Xindice allows several way for the data to be stored. Currently it has
BTreeFiler (based on tree-like structure), HashFiler (based on
Hello All,
That was really helpful. Thanks.
I also noticed FSFiler, and HashFiler. Are those for Indexing files?
I am working on a graph database project. I have tried several oodbms, and
finally decided to build my own.
Also, could it be possible to use xindice as a backend for Jena?
On 7/6/
Cam Bazz wrote:
Hello Vadim;
I have been looking and experimenting with BFiler. So far, I have been
able to insert into BTree,
but I have not been able to write to disk. (the initially created file
stays at same size).
Best Regards,
-C.B
//
Configuration config = new
Configuration(DOMParse
Hello Vadim;
I have been looking and experimenting with BFiler. So far, I have been able
to insert into BTree,
but I have not been able to write to disk. (the initially created file stays
at same size).
Best Regards,
-C.B
//
Configuration config = new Configuration(DOMParser.toDocument(
Xindice
Cam Bazz wrote:
Hello Developers,
I have been looking for a solid implementation of a Java BTree on disk
for the longest time. Could it be possible to use xindices btree on disk
seperately.
If so, where would be a good place to start. I have looked at the source
code, instantiated a new BTree
15 matches
Mail list logo
