|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture
July 1985 (vol. 34 no. 7)
pp. 588-595
| ASCII Text | x | ||
| null Yang-Chang Hong, "Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture," IEEE Transactions on Computers, vol. 34, no. 7, pp. 588-595, July, 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1985.1676597, author = {null Yang-Chang Hong}, title = {Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture}, journal ={IEEE Transactions on Computers}, volume = {34}, number = {7}, issn = {0018-9340}, year = {1985}, pages = {588-595}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1985.1676597}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture IS - 7 SN - 0018-9340 SP588 EP595 EPD - 588-595 A1 - null Yang-Chang Hong, PY - 1985 KW - selectivity KW - Bit and pointer arrays KW - cross-referencing KW - explicit joins KW - hashed values KW - implicit joins KW - linked lists KW - partitioned RAM KW - relational algebraic primitives VL - 34 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
selectivity, Bit and pointer arrays, cross-referencing, explicit joins, hashed values, implicit joins, linked lists, partitioned RAM, relational algebraic primitives
Citation:
null Yang-Chang Hong, "Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture," IEEE Transactions on Computers, vol. 34, no. 7, pp. 588-595, July 1985, doi:10.1109/TC.1985.1676597
Usage of this product signifies your acceptance of the Terms of Use.