Query processing is an important concern in the field of distributed databases. The main problem is: if a query can be decomposed into sub queries that require operations at geographically separated databases, determine the sequence and the sites for performing this set of operations such that the operating cost (communication cost and processing cost) for processing this query is minimized. The problem is complicated by the fact that query processing not only depends on the operations of the query, but also on the parameter values associated with the query. Distributed query processing is an important factor in the overall performance of a distributed database system. Query optimization is a difficult task in a distributed client/server environment as data location becomes a major factor. In order to optimize queries accurately, sufficient information must be available to determine which data access techniques are most effective (for example, table and column cardinality, organization information, and index availability). Optimization algorithms have an important impact on the performance of distributed query processing.
[1]
Fan Yuanyuan,et al.
Distributed database system query optimization algorithm research
,
2010,
2010 3rd International Conference on Computer Science and Information Technology.
[2]
Kyuseok Shim,et al.
Optimizing queries with materialized views
,
1995,
Proceedings of the Eleventh International Conference on Data Engineering.
[3]
Feifei Li,et al.
Scalable Multi-query Optimization for SPARQL
,
2012,
2012 IEEE 28th International Conference on Data Engineering.
[4]
Preeti Tewari.
Query Optimization Strategies in Distributed Databases
,
2013
.
[5]
Jeffrey F. Naughton,et al.
Materialized View Selection for Multidimensional Datasets
,
1998,
VLDB.