Database machine architecture for supporting incomplete information
Computer Systems Science and Engineering
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
A foundation of CODD's relational maybe-operations
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
MAYBE algebra operators in database machine architecture
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Systolic (VLSI) arrays for relational database operations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Assumptions in relational database theory
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Data-Base Computers
A parallel pipelined relational query processor: An architectural overview
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
The data management machine, a classification
CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
An associative backend machine for data base management
An associative backend machine for data base management
ACM SIGMOD Record
Theory of Relational Databases
Theory of Relational Databases
| Hi-index | 0.00 |
The proliferation of data combined with higher performance requirements have forced designers of database systems to look beyond software solutions. Hardware approaches, namely database machines, have been introduced to overcome this problem. Most of the database machine designs have been based on the relational database model. The performance of these machines has been closely identified with the performance of the join operation.The recent discussion of null values and maybe algebra allows the user to examine potentially interesting data relationships based on part on unknown (incomplete) data.The work presented here examines the performance of a join module at the presence of incomplete data in the database. Four classes of join operations namely: True join, maybe join, attribute maybe join and outer join have been considered in this study. In addition, we will show that the enhanced join module does not sacrifice the performance of the true join operation.