This work is intended to introduce a database design method to resolve the two-dimensional complexities inherent in the relational data model and its resulting performance challenges through abstract multidimensional constructs. A multidimensional constraint is derived and utilized to implement an indexed Multidimensional Key (MK) to abstract a logically partitioned subset by reading a single overriding index on a relation (table), without the need to traverse the domain (path) hierarchy. The Multidimensional Key can then be utilized for the purposes of improving the efficiencies and performance in both production and data warehouse environments, often mitigating the need for commonly used denormalization techniques. The results of this research demonstrate a performance increase that outweighs the cost of the MK index can be obtained in circumstances where the query execution is frequent. (Abstract shortened by UMI.) [The dissertation citations contained here are published with the permission of ProQuest LLC. Further reproduction is prohibited without permission. Copies of dissertations may be obtained by Telephone (800) 1-800-521-0600. Web page: http://www.proquest.com/en-US/products/dissertations/individuals.shtml.]