Previous Posts
My previous posts on consistent hash are:
The above algorithm is beautiful while its time complexity is will introduce some CPU overhead in some extreme conditions compared to simple modulo hashing.
My previous posts on consistent hash are:
The above algorithm is beautiful while its time complexity is will introduce some CPU overhead in some extreme conditions compared to simple modulo hashing.
小慕慕才五个月,锅哥今年又在北京过年。独在异乡为异客,通过年夜饭来遥望家乡。
Jump consistent hash algorithm is a consistent hash algorithm that has been discussed in the previous blog Jump Consistent Hash Algorithm. After adding some new hosts in a distributed storage system, at some
Greenplum DB is an open-source massively parallel data platform for analytics, machine learning and AI.
Greenplum DB 6.0 is close to release and in GPDB6, Global Deadlock Detector (GDD) is introduced so that DMLS (insert, update, delete) on the same table can be executed concurrently. According to a performance test report by Alibaba:
Continue readingAlibaba in China has done some initial testing on OSS GP in
preperation for Greenplum 6. Here is the test result:TEST CASE: Each transaction 3 updates, 1 select, 1 insert
* Greenplum 5 , Transactions per Second: 15
* Greenplum 6, Transactions per Second: 2900
中国式摔跤是中国各民族摔跤运动综合起来,吸取各方面特点,统一服饰,制定规则,又为了区别国际式摔跤而命名。中国式摔跤讲究,两两相对,扑倒为胜,不砸不落,干净利落。中国式摔跤扎根于各民族的文化中,每个民族都有自己本族“痴迷”的摔跤活动。从全运会中取消至今已有接近30年,然而近年来的全国比赛和民间比赛如火如荼,甚至在国外的传播也一片欣荣之象,不得不承认这是一个奇迹,而缔造这个奇迹的根源在于:摔跤这项运动是人类竞技的本能。
My colleague asks me for a proof of the following algorithm:

is a binary square matrix whose elements are chosen from the set
. That is
. And
is an orthogonal matrix,
.
Theorem: prove that any sub matrix of
, with size
, if this sub matrix
contains only
(no
in it at all), then
.
3月末朋友组织报名了5月超级赛,为了备战,积极训练身体素质,控制体重,获得的本身要比超级赛本身多得多。身体素质竟然达到了30岁之前的巅峰。但是5月的比赛还是有几个项目没有通过。于是和朋友小白相约报名了8月的野兽赛。我和小白在手部磨损掉3-4块皮的情况下,依旧完成了比赛。
蒲黄榆的白露太极功夫馆是由我、小白、张师傅三人合租,精心打造的训练场地。身体素质是一切竞技的基础,不论是打篮球、摔跤等运动,都需要优秀的身体素质作为基础。优秀的身体素质,也会体现在健硕清朗的外型,良好的精神状态等等,大致包含下面几个方面:
所有视频来自网络,侵删。
One of my colleagues introduced me a new consistent hash algorithm: jump consistent hash. It is a concise algorithm, just in 5 line of code. The paper can be found here: A Fast, Minimal Memory, Consistent Hash Algorithm. The proofs in the paper are not that detailed, so in this blog, I will try to provide a more formal way to help you understand it and build it from scratch.