Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Self-adaptive, on-line reclustering of complex object data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity
Proceedings of the International Symposium on Objects and Databases
A Clustering Technique for Object Oriented Databases
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
SQLCM: A Continuous Monitoring Framework for Relational Database Engines
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Integrating vertical and horizontal partitioning into automated physical database design
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Research issues in automatic database clustering
ACM SIGMOD Record
Automatic Database Clustering Using Data Mining
DEXA '06 Proceedings of the 17th International Conference on Database and Expert Systems Applications
Structural Error Verification in Active Rule-Based Systems using Petri Nets
MICAI '06 Proceedings of the Fifth Mexican International Conference on Artificial Intelligence
Termination analysis of active rules - a Petri net based approach
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
ECAPNVer: A Software Tool to Verify Active Rule Bases
ICTAI '10 Proceedings of the 2010 22nd IEEE International Conference on Tools with Artificial Intelligence - Volume 02
DYMOND: an active system for dynamic vertical partitioning of multimedia databases
Proceedings of the 16th International Database Engineering & Applications Sysmposium
| Hi-index | 0.00 |
Vertical partitioning is a well known technique to improve query response time in relational databases. This consists in dividing a table into a set of fragments of attributes according to the queries run against the table. In dynamic systems the queries tend to change with time, so it is needed a dynamic vertical partitioning technique which adapts the fragments according to the changes in query patterns in order to avoid long query response time. In this paper, we propose an active system for dynamic vertical partitioning of relational databases, called DYVEP (DYnamic VErtical Partitioning). DYVEP uses active rules to vertically fragment and refragment a database without intervention of a database administrator (DBA), maintaining an acceptable query response time even when the query patterns in the database suffer changes. Experiments with the TPC-H benchmark demonstrate efficient query response time.