DocumentCode :
3103496
Title :
An Efficient Strategy for Ranged Top-K Query over Web Services
Author :
Zhang, Yongjun ; Jiong, Zhang ; Zhu, Xugang ; Min, Wangjia ; Zhang, Zongguo
Author_Institution :
Sch. of Inf. Technol., Shandong Inst. of Commerce & Technol., Jinan, China
fYear :
2011
fDate :
16-18 Aug. 2011
Firstpage :
1
Lastpage :
4
Abstract :
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.
Keywords :
Web services; query formulation; Top-K query; Web services; distributed applications; network communication; search strategy; Algorithm design and analysis; Indexes; Maintenance engineering; Monitoring; Object recognition; Peer to peer computing; Web services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Internet Technology and Applications (iTAP), 2011 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-7253-6
Type :
conf
DOI :
10.1109/ITAP.2011.6006158
Filename :
6006158
Link To Document :
بازگشت