A Multiple Top-k Join Algorithm Based on the Star Schema

Top-k join query returns k join results that users are most interested in.Top-k join has become one of the main research issues recently,and it's dominant in many emerging applications,e.g.,web databases,information retrieval and data mining.Top-k join query also exists in data warehouse based on the star schema in practical application.For example,sometimes just the top-k join results that the decision maker is most interested in are desirable.However,the current existing algorithms aren't suitable for the data warehouse based on the star schema.In order to efficiently support top-k join query on star schema,we propose two kinds of indices and a multiple top-k join algorithm that is suitable for star schema based on these indices.By using a tighter upper bound than current existing algorithms and a pruning strategy,the algorithm is more efficient than the current existing algorithms.Furthermore,the experiment also shows that the algorithm is more efficient than the current existing algorithm.