Database partitioning in a cluster of processors
ACM Transactions on Database Systems (TODS)
Use of graph-theoretic models for optimal relational database accesses to perform join
ACM Transactions on Database Systems (TODS)
Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware
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)
A relational model of data for large shared data banks
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
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Distributing a database for parallelism
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Systolic (VLSI) arrays for relational database operations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A new way to compute the product and join of relations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient processing of relational calculus expressions using range query theory
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
A relational database machine architecture
CAW '80 Proceedings of the fifth workshop on Computer architecture for non-numeric processing
Why sort-merge gives the best implementation of the natural join
ACM SIGMOD Record
Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
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)
Distributive join: a new algorithm for joining relations
ACM Transactions on Database Systems (TODS)
Dynamic Load Balancing in Very Large Shared-Nothing Hypercube Database Computers
IEEE Transactions on Computers
Incremental computation of nested relational query expressions
ACM Transactions on Database Systems (TODS)
Fast algorithms for universal quantification in large databases
ACM Transactions on Database Systems (TODS)
A heuristic algorithm for partition strategy in distributed query processing
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Considering data skew factor in multi-way join query optimization for parallel execution
The VLDB Journal — The International Journal on Very Large Data Bases - Parallelism in database systems
Optimal Secondary Storage Access Sequence for Performing Relational Join
IEEE Transactions on Knowledge and Data Engineering
Allocating Data and Operations to Nodes in Distributed Database Design
IEEE Transactions on Knowledge and Data Engineering
Dynamic Load Balancing in Multicomputer Database Systems Using Partition Tuning
IEEE Transactions on Knowledge and Data Engineering
Hash Joins and Hash Teams in Microsoft SQL Server
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The Value of Merge-Join and Hash-Join in SQL Server
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Particle swarm optimisation for data warehouse logical design
International Journal of Bio-Inspired Computation
Exploiting data access for dynamic fragmentation in data warehouse
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
A “divide and conquer” strategy to compute natural joins by sequential scans on unordered relations is described. This strategy is shown to always he better than merging SCBIIS when both relations must he sorted before joining, and generally better in practical cases when only the largest relation mutt be sorted.