Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Computer Communication Networks: Approaches, Objectives, and Performance Considerations
ACM Computing Surveys (CSUR)
Encryption and Secure Computer Networks
ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks
Communications of the ACM
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
Data base management system environments present and future
SIGSMALL/PC Proceedings of the Second symposium on Small systems
| Hi-index | 0.00 |
Optimizing the time and or cost of processing a query within a distributed network involves consideration of a large number of factors that reside with a complex problem environment. The complexity of this environment has led most research in the field to simplify the problem by assuming many factors to be constant or by ignoring them. After an evaluation of the entire problem environment, a method termed topologies is proposed for simplifying the problem without necessarily ignoring factors. Topologies are environments which describe the problem space either statically or dynamically. These can be used in combination to determine a reasonable problem space to the level of dynamic change that is required. Once a query topology (i.e., a subnetwork which can respond to the query) is formed from the topologies describing the system, the problem space is constrained to accommodate the user request, and an extant optimization procedure can be applied to effect a solution.