Author

Dylan Hantula

Bound Volume Number

Volume VI

Document Type

Honors Capstone Project

Date of Submission

Spring 5-2016

Capstone Advisor

Deborah Nosky

Capstone Major

Information Management and Technology

Capstone College

Information Studies

Audio/Visual Component

no

Keywords

graph database, Relational databases

Capstone Prize Winner

no

Won Capstone Funding

no

Honors Categories

Professional

Subject Categories

Management Information Systems

Abstract

Relational databases have been the universal industry standard for almost as long as databases have existed. While relational databases are undoubtedly useful for storing tabular data that fits into a pre-defined schema of rows and columns, they are not very accommodating of interconnections within a data set. Forcing a highly connected data set into a relational database commonly results in severe performance issues in query return time. With the recent rise of social networks and other modern technological advancements, data is quickly becoming more connected and thus less suitable for relational databases. As a result, a new type of database, called a graph database, has emerged to store relationship-oriented data naturally and efficiently using nodes and edges. Deciding which database is more suitable for the task at hand is not always trivial, however. This paper sheds light on the differences between the two databases and delves into why one database might be more advantageous in certain situations.

Creative Commons License

Creative Commons Attribution 3.0 License
This work is licensed under a Creative Commons Attribution 3.0 License.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.