Heuristic geo query decomposition and orchestration in a SOA
iiWAS '10: Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services(2010)
摘要
SOA is often used today for architectures distributing geo-processing computation tasks. These tasks usually are both data and computationally expensive. A fundamental issue is finding an automated, efficient task distribution and coordination among different services. We propose a language-based approach to this issue. First, the distributed geo-processing problem is written up as a declarative query using the Open Geospatial Consortium (OGC) Web Coverage Processing Service (WCPS) language standard. Second, translate the query is translated into a graph on which a rule-based graph decomposition algorithms generates a task distribution among a subset of the service hosts available. A heuristic cost function, preliminarily based on the data output sizes of each query operator, is used to partition the query and determine the execution hosts of sub-queries. The result is reassembled into a recursively nested query which also performs coordination of its distributed evaluation.
更多查看译文
关键词
geo-processing computation task,data output size,rule-based graph decomposition algorithm,query operator,fundamental issue,recursively nested query,task distribution,geo-processing problem,declarative query,heuristic geo query decomposition,efficient task distribution,rule based,graph partitioning,cost function
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要