Optimizing chain queries in a distributed database system.
SIAM Journal on Computing
Optimization of distributed tree queries
Journal of Computer and System Sciences
How to estimate the sizes of domains
Information Processing Letters
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
On the design of a query processing strategy in a distributed database environment
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Evaluation of the size of a query expressed in relational algebra
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A Heuristic Approach to Distributed Query Processing
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Relational Algebra Operations and Sizes of Relations
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Note on the expected size of a join
ACM SIGMOD Record
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)
On parallel execution of multiple pipelined hash joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Parallel Execution of Hash Joins in Parallel Databases
IEEE Transactions on Parallel and Distributed Systems
Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins
IEEE Transactions on Computers
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Allocating Data and Operations to Nodes in Distributed Database Design
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
IEEE Transactions on Knowledge and Data Engineering
Optimization of Parallel Execution for Multi-Join Queries
IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Distributed Query Optimization
IEEE Transactions on Knowledge and Data Engineering
A Method for Design and Performance Modeling of Client/Server Systems
IEEE Transactions on Software Engineering
Combining Joint and Semi-Join Operations for Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Applying Hash Filters to Improving the Execution of Bushy Trees
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
On applying hash filters to improving the execution of multi-join queries
The VLDB Journal — The International Journal on Very Large Data Bases
Completeness of integrated information sources
Information Systems - Special issue: Data quality in cooperative information systems
Information Sciences: an International Journal
Quality-driven query answering for integrated information systems
Quality-driven query answering for integrated information systems
| Hi-index | 0.00 |
We propose a generating function approach to the problem of evaluating the sizes of derived relations in a relational database framework. We present a model of relations and show how to use it to deduce probabilistic estimations of derived relation sizes. These are found to asymptotically follow normal distributions under a variety of assumptions.