SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Types and persistence in database programming languages
ACM Computing Surveys (CSUR)
Semantic database modeling: survey, applications, and research issues
ACM Computing Surveys (CSUR)
Extensible query processing in starburst
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Function materialization in object bases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
On the propagation of errors in the size of join results
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Extensible/rule based query rewrite optimization in Starburst
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Decomposition—an approach for optimizing queries including ADT functions
Information Processing Letters
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Optimizing disjunctive queries with expensive predicates
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Join queries with external text sources: execution and optimization techniques
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Query execution techniques for caching expensive methods
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Iris Architecture and Implementation
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Starburst Mid-Flight: As the Dust Clears
IEEE Transactions on Knowledge and Data Engineering
A Parallel Execution Method for Minimizing Distributed Query Response Time
IEEE Transactions on Parallel and Distributed Systems
Evaluation and Optimization of Query Programs in an Object-Oriented and Symbolic Information System
IEEE Transactions on Knowledge and Data Engineering
Inclusion of New Types in Relational Data Base Systems
Proceedings of the Second International Conference on Data Engineering
Database Integration in a Distributed Heterogeneous Database System
Proceedings of the Second International Conference on Data Engineering
Object and File Management in the EXODUS Extensible Database System
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Query Optimization in the Presence of Foreign Functions
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Query Optimization by Predicate Move-Around
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Optimization of Queries with User-defined Predicates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Control of an Extensible Query Optimizer: A Planning-Based Approach
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
| Hi-index | 0.00 |
Foreign functions have been considered in the advanced database systems to support complex applications. In this paper, we consider optimizing queries with foreign functions in a distributed environment. In traditional distributed query processing, selection operations are locally processed before joins as much as possible so that the size of relations being transmitted and joined can be reduced. However, if selection predicates involve foreign functions, the cost of evaluating selections cannot be ignored. As a result, the execution order of selections and joins becomes significant, and the trade-off for reducing the costs of data transmission, join processing, and selection predicate evaluation needs to be carefully considered in query optimization. In this paper, a response time model is developed for estimating the cost of distributed query processing involving foreign functions. We explore the property of the problem and find an optimal algorithm with polynomial complexity for a special case of it. However, finding the optimal execution plan for the general case is NP-hard. We propose an efficient heuristic algorithm for solving the problem and the simulation result shows its good quality. The research result can also be applied to the advanced database systems and the multidatabase systems where the conversion function defined for the need of schema integration can be considered a type of foreign functions.