Abstract
A parallel file system design is presented. The implementation of B-tree indices on the system is described. It is shown that by the use of some special purpose hardware, the bound on the height of the B-tree index can be significantly reduced over what can be achieved by simply employing the divide and conquer approach to using the parallelism in the file system.
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.
