Abstract
In this paper we present some systolic algorithms for performing relational database operations, including Cartesian product, join, and sorting. They operate in a parallel and pipelined fashion. Their time complexity is linear in terms of the number of tuples involved. Because of the regularity of their structures, they are most suitable for VLSI implementation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
