Maintenance of Placement Dependency in Distributed Multidatabase Systems
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Experimental evidence on partitioning in parallel data warehouses
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Efficiently Processing Query-Intensive Databases over a Non-Dedicated Local Network
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Large relations in node-partitioned data warehouses
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Distributed Query Plan Generation using Particle Swarm Optimization
International Journal of Swarm Intelligence Research
| Hi-index | 0.00 |
We present an algorithm to make use of placement dependency information to process distributed queries. Our algorithm first partitions the referenced relations of a given query into a number of non-exclusive subsets such that the fragmented relations within a subset have placement dependency and the join operation(s) associated with the relations in the subset can be locally processed without data transfer. Each subset is associated with a set of sites and can be used to generate an execution plan for the given query by keeping the fragmented relations in the subset fragmented at the sites where they are situated while replicating the other referenced relations at each of the processing sites. Among the alternatives, our algorithm picks the plan that gives the minimum response time. Our experimental results show that our algorithm improves response time significantly.