In this study, the online-secretary search problem is studied basing on the-competitive rate criterion (where,is the preference). Firstly, a threshold-type online strategyis designed basing on a nonlinear programmingwith variables. The steps of solving for the thresholds are given and it is further proved that. The strategyis proved to be optimal in the sense of the-competitive rate and its-competitive rate is.In the special case analyses whenand, it is found that whenthe competitive rate is just the competitive ratio, which is consistent with the results of Lorenz et al.; whenthe competitive rate is just the competitive difference, where the explicit expression ofcan be obtained. It is further proved that the thresholdwhich is based on competitive difference is larger than the thresholdwhich is based on the competitive ratio, implying that the online strategy based on the competitive ratio is more conservative. In the special case analyses when, the online-secretary search problem degenerates into the the classical online time series search problem proposed by El-Yaniv et al. and optimal online strategies based on competitive ratio and competitive difference are both presented, respectively.Finally, numerical simulation experiments reveal that: (1) the larger the preferencethe smaller the threshold, i.e., the larger the preferencethe more conservative the strategy is, and vice versa the more aggressive it is; (2) When the expectation of a candidate's rating sequence is small, an online strategy with a large preference should be selected; when the expectation of the rating sequence is moderate, an online strategy with a moderate preference should be selected; when the expectation of the rating sequence is large, an online strategy with a small preference should be selected.