re:
>
> * RPC method implementations
> * Functional tests
> * Client support
I'd like to stop by and work on client support for PHP, Python, or C++.
--
David Strauss
| da...@fourkitchens.com
| +1 512 577 5827 [mobile]
Four Kitchens
| http://fourkitchens.com
| +1 512 454 6659 [office]
| +1 512 870 8453 [direct]
ods that don't involve checking into Subversion, but they're more
complex.
--
David Strauss
| da...@fourkitchens.com
| +1 512 577 5827 [mobile]
Four Kitchens
| http://fourkitchens.com
| +1 512 454 6659 [office]
| +1 512 870 8453 [direct]
signature.asc
Description: OpenPGP digital signature
4/and-now-for-something-completely.html
>
> We're happy to answer questions on- or off-list.
Does this mean you're no longer with Rackspace?
--
David Strauss
| da...@fourkitchens.com
Four Kitchens
| http://fourkitchens.com
| +1 512 454 6659 [office]
| +1 512 870 8453 [direct
s than I would on regeneration, but my operation is
still correct.
Even with complex or cryptographic hashes, a bloom filter based on
using, say, the first X bits might be expandable or shrinkable without
regeneration.
--
David Strauss
| da...@fourkitchens.com
Four Kitchens
| http://fourkit
On 2010-04-05 02:23, S Ahmed wrote:
> For starters, I want to learn how keys are read and written from disk.
See "read" and "write":
http://wiki.apache.org/cassandra/ArchitectureOverview
--
David Strauss
| da...@fourkitchens.com
Four Kitchens
| http://fourkitchens.c
ther systems that do use B-tree
already. Why add it to Cassandra?
You may want to look at Project Voldemort, which can already distribute
data across servers similarly to Cassandra but (optionally) with
B-tree-based storage on each box. MongoDB also supports sharded data
with B-tree-based indexes. Fina