Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Algorithms are described and analyzed for the efficient evaluation of the primitive operators of a relational algebra on a database machine architecture. The architecture contains a RAM divided up into partitions, each partition having a separate server. Tuples from the first operand relation are stored in linked lists in the partitioned RAM via bit and pointer arrays based on hashed column values. Each tuple in the second operand relation is either deposited in the corresponding partition server queue based on the hashed value, or it is ignored. Cross-referencing involved in the operations is removed without performing a sorting operation, which significantly reduces the time complexity. A procedure is also presented for computing the optimal number of partition servers for different applications.
['Yang-Chang Hong']
I am writing a research paper on a idea Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture
[{"from": "human", "value": "I am writing a research paper on a idea Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Algorithms are described and analyzed for the efficient evaluation of the primitive operators of a relational algebra on a database machine architecture. The architecture contains a RAM divided up into partitions, each partition having a separate server. Tuples from the first operand relation are stored in linked lists in the partitioned RAM via bit and pointer arrays based on hashed column values. Each tuple in the second operand relation is either deposited in the corresponding partition server queue based on the hashed value, or it is ignored. Cross-referencing involved in the operations is removed without performing a sorting operation, which significantly reduces the time complexity. A procedure is also presented for computing the optimal number of partition servers for different applications."}]