Application Of Mixed Partitioning On Distributed Database Allocation

• Main Authors: Yu-Shen Shiu, 許聿慎
• Other Authors: 王貞淑
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/ux866j

碩士 === 國立臺北科技大學 === 資訊管理研究所 === 102 === In recent years, enterprises are facing a great challenge because of the data amount within the enterprise’s database is growing dramatically, the distributed database is an effective solution for storing increasing amounts of data. However, the data columns and records in the table are growing accordingly to shorten the time for particular columns and records to accelerate analyze is an important issue. Data allocation and data partitioning as the important keywords of the database domain. That reflected academic community is now actively developing data partitioning-oriented database design. In practice, Data Allocation Problem(DAP) is to arrange relevant information on the same database for shorten the response time of table merge operations that data query or modify, for illustration particular query pattern frequently used. The current study focuse on the data vertical and horizontal partitioning, In the design of distributed databases, whether it is the way to take a partitioning, the main design considerations is required in accordance with the needs of enterprises. This study aimed to decrease the query response time analysis effectively of the table columns and records partitioning, for this reason, we propose the two-step data partitioning mode -- VHP methods based on mixed data partitioning that Combination of vertical partitioning and horizontal partitioning. Through experiments to test its feasibility. Distributed insert methods reduce 31% of the time effectively. In the distributed query experiments, more than half of the query transactions to achieve the perfect configuration records, the average query time reduced by 12.1%.