ACM Transactions on Database Systems (TODS)
Adaptive File Allocation in Star Computer Network
IEEE Transactions on Software Engineering - Special issue on COMPSAC 1982 and 1983
An Optimal Algorithm for Processing Distributed Star Queries
IEEE Transactions on Software Engineering
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Distributing a database for parallelism
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Overview of an Ada compatible distributed database manager
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
A methodology for interpreting tree queries into optimal semi-join expressions
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Transforming cyclic schemas into trees
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimizing Star Queries in a Distributed Database System
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Heuristic Approach to Distributed Query Processing
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
File Allocation in Distributed Databases with Interaction between Files
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
The optimization of query processing on distributed database systems
The optimization of query processing on distributed database systems
An introduction to database systems (The Systems programming series)
An introduction to database systems (The Systems programming series)
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
IEEE Transactions on Computers
Query Processing in Distributed Database System
IEEE Transactions on Software Engineering
Optimization Algorithms for Distributed Queries
IEEE Transactions on Software Engineering
A case study for distributed query processing
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Partition Strategy for Distributed Query Processing in Fast Local Networks
IEEE Transactions on Software Engineering
Optimizing equijoin queries in distributed databases where relations are hash partitioned
ACM Transactions on Database Systems (TODS)
Join processing in relational databases
ACM Computing Surveys (CSUR)
Progress in Database Search Strategies
IEEE Software
Adaptive Join Algorithms in Dynamic Distributed Databases
Distributed and Parallel Databases
Correcting execution of distributed queries
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Deciding to Correct Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Semantic Query Optimization for Tree and Chain Queries
IEEE Transactions on Knowledge and Data Engineering
Performance Issues in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
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
Large relations in node-partitioned data warehouses
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 14.98 |
We propose a scheme to make use of semantic information to process distributed queries locally without data transfer with respect to the join clauses of the query. Since not all queries can be processed without data transfer, we give an algorithm to recognize the "locally processable queries." For nonlocally processable queries, a simple "fragment and replicate" algorithm is used. The algorithm chooses a relation to remain fragmented at the sites where they are situated while replicating the other relations at those sites. Our algorithm determines the chosen relation and the chosen copy of every fragment of the chosen relation such that the minimum response time is obtained. The algorithm runs in linear time. If the fragments of the relation are allowed to be processed in other sites, then the problem is NP hard. Two heuristics are given for that situation. They are compared to the optimal situation. Experimental results show that the strategies produced by the heuristics have small errors relative to the optimal strategy.