Preference Join on Heterogeneous Data

摘要：

　　There are different types of join operation dealing with different issues in database research.However,existing join operations cannot meet the increasing demands of the real world.In this paper,we define a new join operation,the preference join (p-join),which introduces the concepts of the personal preference and the satisfaction operator on various data types.We present a general join algorithm (Nested Loop) to deal with the p-join,and we also propose an advanced algorithm called MFV for p-join.To improve the MFV algorithm,two enhanced mapping methods are employed.A large number of experiments on both real-world and synthetic data sets are conducted.The experimental results demonstrate the effectiveness,efficiency and scalability of our methods,and show the advanced algorithms have advantages over the general algorithms.

作者: Changping Wang Chaokun Wang Hao Wang Jun Chen Xiaojun Ye

作者单位: School of Software,Tsinghua University,Beijing 100084,China

会议类型: 国际会议

会议名称: International Asia-Pacific Web Conference(第18届国际亚太互联网大会)

会议地点: 苏州

会议语种:英文

页码: 317-329

在线出版日期: 2016-09-23（万方平台首次上网日期，不代表论文的发表时间）