Re: triple (quad) storage sizing

On 2011-05-10, at 14:45, William Waites wrote:
> Typically there will be three different indexes for useful
> permutations of (s,p,o,g) -- (g,s,p,o), (p,s,o,g), (o,p,s,g) for
> example. Assuming three indexes, a safe estimate is 96 bytes (3x 32)
> per triple.

This doesn't follow, e.g. bitmap indexes, and the index structure that 5store uses are a lot more compact than that.

Don't discount the indexing of lexical values for nodes though, for some datasets that can be quite expensive, anything up to 3x the size of the quad index.

- Steve

Steve Harris, CTO, Garlik Limited
1-3 Halford Road, Richmond, TW10 6AW, UK
+44 20 8439 8203
Registered in England and Wales 535 7233 VAT # 849 0517 11
Registered office: Thames House, Portsmouth Road, Esher, Surrey, KT10 9AD

Received on Wednesday, 11 May 2011 10:00:15 UTC