Processor allocation strategies for multiprocessor database machines
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A loop network for simultaneous transmission of variable-length messages
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
DIRECT - a multiprocessor organization for supporting relational data base management systems
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
The architecture and system method of DDM1: A recursively structured Data Driven Machine
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
The Architecture of SM3: A Dynamically Partitionable Multicomputer System
IEEE Transactions on Computers
Database concurrency control using data flow graphs
ACM Transactions on Database Systems (TODS)
Petri-Net-Based Modeling and Evaluation of Pipelined Processing of Concurrent Database Queries
IEEE Transactions on Software Engineering
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
A parallel execution model for a database machine with high performances
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Processor allocation strategies for multiprocessor database machines
ACM Transactions on Database Systems (TODS)
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
A relational database machine based on functional programming concepts
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment
IEEE Transactions on Software Engineering
An Overview of The System Software of A Parallel Relational Database Machine GRACE
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Parallel Processing Strategy for Evaluating Recursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The Fifth Generation grail: A survey of related research
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Building a scalable spatial OLAP system
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
This paper presents a discussion of the application of data-flow machine concepts to the design and implementation of database machines which execute relational algebra queries. We analyze the performance of multiprocessor nested-loops and sort-merge join algorithms and show that the nested-loops algorithm is generally superior. Three levels of operand granularity for data-flow database machines are introduced and compared using the nested-loops join algorithm. We demonstrate, that relation-level granularity is too coarse and that tuple-level granularity is too fine. The third level of granularity, a page of a relation, is shown to be the best choice from both hardware and software viewpoints. Finally, a preliminary design for a data-flow database machine which utilizes page-level granularity and supports distributed control of instruction execution is presented.