关键词: 多连接, 实体, 相似连接, 马尔可夫链蒙特卡洛（MCMC）

Abstract: To organize and query entities described by relational tuples is an effective way to manage poor-quality data. Taking into account that the attribute of an entity has more than one description, the similarity join based on entity must consider multiple values. Due to importance effect to the join efficiency of multi-join order, this paper proposes a multi-join order selection algorithm which based on Markov chain Monte Carol (MCMC) method to estimate the size of entity similarity join, and raises a cost model to optimize the order of multi-relation of entity on join problem. Moreover, experimental results show that the estimating algorithm has good performance especially when the size of relations is large.

Key words: multi-relation, entity, similarity join, Markov chain Monte Carol (MCMC)