Bizur: A Key-Value Consensus Algorithm for Scalable File-Systems

Re:Bizur: A Key-Value Consensus Algorithm for Scalable File-... by solidsnack9000 on Wednesday March 08, 2017 @09:37PM (#13826437)

Their application is file systems and no file systems offer that capability. In order to provide transactionality for multi-file operations, you have to have a file that represents "the transaction" and move it or create/delete it.

In most file systems, you can't even update a file atomically, actually -- what you can update atomically is a disk page, 4-16k. Database servers might then maintain a separate, small file that contains only a transaction token, which is atomically updated to contain the last transaction written to disk in full.

[ Parent | on HN ]

Re:Bizur: A Key-Value Consensus Algorithm for Scalable File-... by xanton on Thursday March 09, 2017 @10:23AM (#13829828)

I don't judge them, I was confused by the choice of systems to compare with and thought that I didn't understand article. I think that comparison with MongoDB or RethinkDB would be more appropriate in this case.

[ Parent | on HN ]

Re:Bizur: A Key-Value Consensus Algorithm for Scalable File-... by mhf8o9a on Thursday March 09, 2017 @04:08PM (#13833651)

Keep in mind that the Bizur is being used for services internal to the file system. So the use case is more like etcd or ZooKeeper's, for example in one role it is a cluster configuration database (with high availablity, fault tolerance, consistency, etc.)

[ Parent | on HN ]