Skyline discovery from a hidden web database can enable a wide variety of innovative applications over one or multiple web databases in web information integration area. Due to the finite number of web accesses one can issue through per-IP-address or per-API-key, no more than k tuples of all matching tuples one top-k query can return, the restricted web interface types, etc., it is difficult to utilize traditional database Skyline computation methods for discovering Skyline of a hidden Web database. In the paper, we first analyze the key intersecting characters of skyline tuples by parallel coordinate system, and next define a search decomposition tree for searching skyline tuples of a hidden web database, and then prove that the tree is guaranteed to discover all skyline tuples. In the end, we put forward heuristic algorithms for getting skyline tuples of a hidden web database based on the mixture attributes. Theoretical analysis and real-world online and offline experiments demonstrate the effectiveness of our proposed methods and the superiority over baseline solutions.