Abstract
Data partition and the accordingly index technologies which could result in uniform data distribution and fast data finding are critical in high parallelism for shared nothing architecture to minimize the transaction processing time. An improved-hash based multi dimensional index mechanism is present in this paper to achieve high parallelism performance for distributed data-parallel computation in shared nothing architecture. After partitioning and storing data using improved-hash function based on partitioning column, the multi dimensional indexes based on multi columns and the corresponding data lookup procedure are constructed. Afterwards, the space complexity and time complexity are analyzed. DOI: http://dx.doi.org/10.11591/telkomnika.v11i4.2359
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 callMore From: TELKOMNIKA Indonesian Journal of Electrical Engineering
Disclaimer: 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.
