An Efficient Strategy for Ranged Top-K Query over Web Services

Recently, Top-k queries in distributed applications have attracted much interest in many different areas such as network and monitoring systems, information retrieval, sensor networks. Some efficient algorithms, such as TA, BPA, are regarded as centralized process in distributed applications. However, to some ad hoc ranged Top-K queries have less flexibility towards updating and low efficiency in ranged searching with much cost of network communication. So we propose an efficient strategy for ranged Top-k query over web services and our performance evaluation shows that such strategy has less network communication and queries timely updating ranged top k result efficiently.