Skyline query on multiple relations, known as skyline join query, finds skyline points from join results of multiple data sources. The issue of skyline join query has been extensively studied. However, most of the existing skyline join algorithms can only perform query on two relations, and ignores the common occasion which involves more than two relations. In this paper, we propose an efficient skyline join algorithm Skyjog, which is applicable for query on two or more relations. Skyjog can quickly identify most of skyline join results with simple calculation. Extensive experiments demonstrate that Skyjog outperforms the state-of-the-art skyline join algorithms on two and more than two relations.