A sampling based approximate Top-k: algorithm was proposed that is adaptive for any data distribution. Ε≥0 and 0≤δ≤1 are respectively relative error bound and failure probability bound. The theoretical analysis demonstrates that for any ε≥0 and 0≤δ展开▼