Database Partitioning: A Review Paper
Mayur Sawant1, Kishor Kinage2, Pooja Pilankar3, Nikhil Chaudhari4
1Mayur Mahadev Sawant, Department of Information Technology, MIT College of Engineering, Pune (Maharashtra), India.
2Dr. Kishor Kinage, Professor, Department of Information Technology, MIT College of Engineering, Pune (Maharashtra), India.
3Pooja Shashikant Pilankar, Department of Computer, Ramrao Adik Institute of Technology, Mumbai (Maharashtra), India.
4Nikhil Anil Chaudhari, Department of Information Technology, MIT College of Engineering, Pune (Maharashtra), India.
Manuscript received on 12 October 2013 | Revised Manuscript received on 20 October 2013 | Manuscript Published on 30 October 2013 | PP: 82-85 | Volume-3 Issue-5, October 2013 | Retrieval Number: E1259103513/13©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Data management is much tedious task in growing data environment. Partitioning is the best possible solution which is partially accepted. Partitioning provides availability, maintenance and improvised query performance to the database users. This paper focuses the three key methods of partitioning and helps to reduce the delay in response time. Paper also investigates the composite partition strategies which includes the date, range and hash partitions. The paper shows the encouraging result with partitioning methods and basic composite partition strategies.
Keywords: Database Partitioning, Dbms Redefinition, Range Partitioning, Hash Partitioning, List Partitioning.
Scope of the Article: Data Warehousing