Abstract
Database management has become increasingly important in recent years. How to design an efficient database machine thus becomes an essential topic. This thesis presents a database machine for supporting the primitive operations of a relational algebra. First, the database machines that have been proposed so far are reviewed. Second, we propose a new database machine which adopts the hash-sort-merge strategy to implement these primitive operations. Finally, we compare the performance of our database machine with that of some other database machines. In our results, when the size of operand relations is large, our database machine is superior.