User:Hyeonjungko/GraphDatabases

Copied text has been bolded. Personal edits have been indicated with normal text and strikethroughs.

= Graph Database = '''In computing, a graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges and properties to represent and store data. A key concept of the system is the graph (or edge or relationship), which directly relates data items in the store a collection of nodes of data and edges representing the relationships between the nodes. The relationships allow data in the store to be linked together directly, and in many cases retrieved with one operation.''' Graph databases hold the relationships between data as a priority. Querying relationships within a graph database is fast because they are perpetually stored within the database itself. Relationships can be intuitively visualized using graph databases, making it useful for heavily inter-connected data.

' This contrasts with relational databases that, with the aid of relational database management systems, permit managing the data without imposing implementation aspects like physical record chains; for example, links between data are stored in the database itself at the logical level, and relational algebra operations (e.g. join'') can be used to manipulate and return related data in the relevant logical format. The execution of relational queries is possible with the aid of the database management systems at the physical level (e.g. using indexes), which permits boosting performance without modifying the logical structure of the database. '''

Graph databases are part of the NoSQL databases created to address the limitations of the existing relational databases. While the graph model explicitly lays out the dependencies between nodes of data, the relational model and other NoSQL database models link the data by implicit connections. '''Graph databases, by design, allow simple and fast retrieval[citation needed] of complex hierarchical structures that are difficult to model[according to whom?] in relational systems. Graph databases are similar to 1970s network model databases in that both represent general graphs, but network-model databases operate at a lower level of abstraction and lack easy traversal over a chain of edges. Most[according to whom?] graph databases based on non-relational storage engines also add the concept of tags or properties, which are essentially relationships having a pointer to another document. This allows data elements to be categorized for easy retrieval en masse.'''

'''Retrieving data from a graph database requires a query language other than SQL, which was designed for the manipulation of data in a relational system and therefore cannot “elegantly” handle traversing a graph. As of 2017  2018, no single graph query language has been universally adopted in the same way as SQL was for relational databases. and there are a wide variety of systems, most often tightly tied to one product. Some standardization efforts have occurred, leading to multi-vendor query languages like Gremlin, SPARQL, and Cypher. In addition to having query language interfaces, some graph databases are accessed through application programming interfaces (APIs).'''

Graph databases differ from graph compute engines. Graph databases are technologies that are translations of the relational OLTP databases. On the other hand, graph compute engines are utilized in OLAP for bulk analysis. Graph databases have attracted considerable attention in the 2000s, due to the successes of major technology corporations in using proprietary graph databases, and the introduction of open-source graph databases.

Execution of queries within a graph database is localized to a portion of the graph. It does not search through irrelevant data, making it advantageous for real-time big data analytical queries. Consequently, graph database performance is proportional to the size of the data needed to be traversed, staying relatively constant despite the growth of data stored.

Typical operations within a graph databases include finding the shortest path, graph traversal,

Graph
A graph within Graph databases is  are based on graph theory. It is a set of objects, either a node or an edge.


 * Nodes represent entities or instances such as people, businesses, accounts, or any other item to be tracked. They are roughly the equivalent of the record, relation, or row in a relational database, or the document in a document-store database.
 * Edges, also termed graphs or relationships, are the lines that connect nodes to other nodes; they represent the  representing the relationship between them. Meaningful patterns emerge when examining the connections and interconnections of nodes, properties, and edges. The edges can either be directed or undirected. In an undirected graph, an edge from a point to another have one meaning. In a directed graph, the edges connecting two different points have different meanings depending on their direction. Edges are the key concept in graph databases, representing an abstraction that is not directly implemented in other systems  a relational model or a document-store model.
 * Properties are germane information to nodes. For example, if Wikipedia were one of the nodes, it might be tied to properties such as website, reference material, or words that starts with the letter w, depending on which aspects of Wikipedia are germane to a given database.

Labeled-Property Graph
A labeled-property graph model is represented by a set of nodes, relationships, properties, and labels. Both nodes of data and their relationships are named and can store properties represented by key/value pairs. Nodes can be labelled to be grouped. The edges representing the relationships have two qualities: they always have a start node and an end node, and are directed ; making the graph a directed graph. Relationships can also have properties. This is useful in providing additional metadata and semantics to relationships of the nodes. Direct storage of relationships allows a constant-time traversal.

It is the most popular form of graph model as of 2018, and the model for the most popular graph database as of October 2018, Neo4j.

Resource Description Framework (RDF)
In a RDF graph model, the addition of information is each represented with a separate node. For example, imagine a scenario where a user has to add a name property for a person represented as a distinct node in the graph. In a labeled-property graph model, this would be done with an addition of a name property into the node of the person. However, in a RDF, the user has to add a separate node called 'hasName' connecting it to the original person node. Specifically, a RDF graph model is composed of nodes and arcs. A RDF graph notation or a statement is represented by: a node for the subject, a node for the object, and an arc for the predicate. A node may be left blank, a literal and/or be identified by a URIref. An arc may also be identified by a URIref. A literal for a node may be of two types: plain(untyped) and typed. A plain literal has a lexical form and optionally a language tag. A typed literal is made up of a string with a URIref that identifies a particular datatype. A blank node may be used to accurately illustrate the state of the data when the data does not have a URI.

It is used in The Open Graph protocol used in Facebook to "allow any web page to have the same functionality as any other object on Facebook." and the Semantic Web.

Properties of Graph Database
Graphs are flexible, meaning it allows the user to insert new data into the existing graph without loss of application functionality. There is no need for the designer of the database to plan out extensive details of the databases's future use-cases.

Underlying Storage
'''The underlying storage mechanism of graph databases can vary. Some depend on a relational engine and “store” the graph data in a table (although a table is a logical element, therefore this approach imposes another level of abstraction between the graph database, the graph database management system and the physical devices where the data is actually stored). Others use a key–value store or document-oriented database for storage, making them inherently NoSQL structures.''' One such NoSQL database that utilizes this method is ArangoDB. ArangoDB is a native multi-model database that supports graphs as one of its data models. It stores graphs by holding edges and nodes in separate collections of documents. A node would be represented as any other document store, but edges that link two different nodes hold special attributes inside its document; a _from and _to attributes.

Index-free Adjacency
Data lookup performance is dependent on the access speed from one particular node to another. Because index-free adjacency enforces the nodes to have direct physical RAM addresses and physically point to other adjacent nodes, it results in a fast retrieval. A native graph system with index-free adjacency does not have to move through any other type of data structures to find links between the nodes. Directly-related nodes in a graph are stored in the cache once one of the nodes are retrieved, making the data look-up even faster than the first time a user fetches a node. However, such advantage comes at a cost. index-free adjacency sacrifices the efficiency of queries that do not use graph traversals. Native graph databases use index-free adjacency to process CRUD operations on the stored data.

Graph Types
There are multiple types of graphs that can be categorized. Gartner suggests the five broad categories graphs could be sorted into: social, intent, consumption, interest, and mobile graphs. The social graph is about the connections between people. It is an intuitive, widely-implement graph type in the realm of graph databases. For example, Facebook and Twitter are some companies that utilizes the social graph. The well-known idea of Six degrees of separation can be mapped with the social graph. The intent graph deals with reasoning and motivation. The consumption graph or "payment graph" is heavily used in the retail industry. E-commerce giants such as Amazon, eBay and Walmart can track the consumption of individual customers with the consumption graph. The interest graph maps one's interests. It is often complimented with the social graph. It has potential to follow the previous revolution of web organization; by mapping the web by interest rather than indexing webpages. The mobile graph if built from mobile data. Mobile data in the future may include GPS, web, application, digital wallet data from Internet of Things(IoT) devices.

Usage
Because graph databases can intuitively represent many-to-many relationships between data, it is commonly applied to solve important problems in many fields. Graph databases assist the user in finding relationships between seemingly-unrelated pieces of data.

Bioinformatics
Graph databases are utilized in understanding complex relationships among heterogeneous biological data. It has been used to represent and query disease networks, effectively to improve the simulation of computational models of a biological system , and drug repositioning using gene-disease associations.

Transactional Data Applications
Graph databases are utilized in

In Comparison: Relational Databases
Since Edgar F. Codd's 1980 paper on the relational model, relational databases have been the de-facto industry standard for large-scale data storage systems. However, relational model's requirement of a strict schema and data normalization imposed limitations on how relationships can be queried. The increasing amount of data needing to be processed became an additional problem posed by the relational model.

Traditionally, databases have been designed with the relational model. In a relational model, data is normalized to support ACID transactions. The data normalization process removes any duplicate data within the database. The goal of data normalization is to preserve data consistency. The relational model enforces ACID transactions, separating data into many tables.

Relational models enforce heavy data normalization in order to guarantee consistency. One of the relational model's design motivation was to achieve a fast row-by-row access. Problems arise with when there is a need to form complex relationships between the stored data. Although relationships can be analyzed with the relational model, complex queries performing many join operations on many different attributes over several tables are required. In working with relational models, foreign key constraints and should also be considered when retrieving relationships, causing additional overhead.

'''Compared with relational databases, graph databases are often faster for associative data sets and map more directly to the structure of object-oriented applications. They can scale more naturally to large data sets as they do not typically need costly join operations (here costly means when executed on databases with non-optimal designs at the logical and physical levels). As they depend less on a rigid schema, they are marketed as more suitable to manage ad hoc and changing data with evolving schemas. Conversely, relational database management systems are typically faster at performing the same operation on large numbers of data elements, permitting the manipulation of the data in its natural structure.''' Despite the graph databases' advantages and recent popularity over the relational databases, it is recommended the graph model itself should not be the sole reason to replace an already placed and well-designed relational database. The benefit of utilizing a graph database becomes relevant once there is an evidence for performance improvement by orders of magnitude and lower latency.

'''The relational model gathers data together using information in the data. For example, one might look for all the "users" whose phone number contains the area code "311". This would be done by searching selected datastores, or tables, looking in the selected phone number fields for the string "311". This can be a time consuming process in large tables, so relational databases offer the concept of a database index, which allows data like this to be stored in a smaller subtable, containing only the selected data and a unique key (or primary key) of the record it is part of. If the phone numbers are indexed, the same search would occur in the smaller index table, gathering the keys of matching records, and then looking in the main data table for the records with those keys. Generally, the tables are physically stored so that lookups on these keys are fast. '''

'Relational databases do not inherently'' contain the idea of fixed relationships between records. Instead, related data is linked to each other by storing one record's unique key in another record's data. For example, a table containing email addresses for users might hold a data item called, which contains the primary key of the user record it is associated with. In order to link users and their email addresses, the system first looks up the selected user records primary keys, looks for those keys in the  column in the email table (or more likely, an index of them), extracts the email data, and then links the user and email records to make composite records containing all the selected data. This operation, termed a join, can be computationally costly. Depending on the complexity of the query, the number of joins, and the indexing of the various keys, the system may have to search through multiple tables and indexes, gather lots of information, and then sort it all to match it together. '''

'''In contrast, graph databases directly store the relationships between records. Instead of an email address being found by looking up its user's key in the  column, the user record has a pointer directly to the email address record. That is, having selected a user, the pointer can be followed directly to the email records, there is no need to search the email table to find the matching records. This can eliminate the costly join operations. For example, if one searches for all of the email addresses for users in area code "311", the engine would first perform a conventional search to find the users in "311", but then retrieve the email addresses by following the links found in those records. A relational database would first find all the users in "311", extract a list of the pk's, perform another search for any records in the email table with those pk's, and link the matching records together. For these types of common operations, a graph database (in theory at least) is significantly faster. '''

'''The true value of the graph approach becomes evident when one performs searches that are more than one level deep. For example, consider a search for users who have "subscribers" (a table linking users to other users) in the "311" area code. In this case a relational database has to first look for all the users with an area code in "311", then look in the subscribers table for any of those users, and then finally look in the users table to retrieve the matching users. In contrast, a graph database would look for all the users in "311", then follow the back-links through the subscriber relationship to find the subscriber users. This avoids several searches, lookups and the memory usage involved in holding all of the temporary data from multiple records needed to construct the output. Technically, this sort of lookup is completed in O(log(n)) + O(1) time, that is, roughly relative to the logarithm of the size of the data. In contrast, the relational version would be multiple O(log(n)) lookups, plus more time to join all the data. '''

To further illustrate, imagine a relational model with two different tables people and friend. The people table contains two columns: person_id and person_name. Similarly, the friend tables two columns as well: person_id and friend_id, where person_id is a foreign key from the people table. In this case, searching for all of Jack's friends would result in the following SQL query. Same query is translated into Cypher, a graph database query language used in Neo4j. The above examples are a simple illustration of a basic relationship query. They condense the idea of relational models' query complexity that increases with the total amount of data. In comparison, a graph database query is easily able to sort through the relationship graph to present the results.

'''The relative advantage of graph retrieval grows with the complexity of a query. For example, one might want to know "that movie about submarines with the actor who was in that movie with that other actor that played the lead in Gone With the Wind". This first requires the system to find the actors in Gone With the Wind, find all the movies they were in, find all the actors in all of those movies who were not the lead in Gone With the Wind, and then find all of the movies they were in, finally filtering that list to those with descriptions containing "submarine". In a relational database this will require several separate searches through the movies and actors tables, doing another search on submarine movies, finding all the actors in those movies, and then comparing the (large) collected results. In contrast, the graph database would simply walk from Gone With the Wind to Clark Gable, gather the links to the movies he has been in, gather the links out of those movies to other actors, and then follow the links out of those actors back to the list of movies. The resulting list of movies can then be searched for "submarine". All of this can be done via one search. '''

'''Properties add another layer of abstraction to this structure that also improves many common queries. Properties are essentially labels that can be applied to any record, or in some cases, edges also. For example, one might label Clark Gable as "actor", which would then allow the system to quickly find all the records that are actors, as opposed to director or camera operator. If labels on edges are allowed, one could also label the relationship between Gone With the Wind and Clark Gable as "lead", and by performing a search on people that are "lead" "actor" in the movie Gone With the Wind, the database would produce Vivien Leigh, Olivia de Havilland and Clark Gable. The equivalent SQL query would have to rely on added data in the table linking people and movies, adding more complexity to the query syntax. These sorts of labels may improve search performance under certain circumstances, but are generally more useful in providing added semantic data for end users. '''

'''Relational databases are very well suited to flat data layouts, where relationships between data is one or two levels deep. For example, an accounting database might need to look up all the line items for all the invoices for a given customer, a three-join query. Graph databases are aimed at datasets that contain many more links. They are especially well suited to social networking systems, where the "friends" relationship is essentially unbounded. These properties make graph databases naturally suited to types of searches that are increasingly common in online systems, and in big data environments. For this reason, graph databases are becoming very popular for large online systems like Facebook, Google, Twitter, and similar systems with deep links between records.'''

There are also results that indicate simple, condensed, and declarative queries of the graph databases do not necessarily provide good performance in comparison to the relational databases. While graph databases offer an intuitive representation of data, relational databases offer better results when set operations are needed. .

History
Graph databases are based on Graph Theory. Graph theory was first introduced by the mathematician Euler in the 18th century.

'''In the pre-history of graph databases, in the mid-1960s Navigational databases such as IBM's IMS supported tree-like structures in its hierarchical model, but the strict tree structure could be circumvented with virtual records. '''

'''Graph structures could be represented in network model databases from the late 1960s. CODASYL, which had defined COBOL in 1959, defined the Network Database Language in 1969.'''

'''Labeled graphs could be represented in graph databases from the mid-1980s, such as the Logical Data Model. '''

Several improvements to graph databases appeared in the early 1990s, accelerating in the late 1990s with endeavors to index web pages.

In the mid-late 2000s, commercial atomicity, consistency, isolation, durability (ACID) graph databases such as Neo4j and Oracle Spatial and Graph became available.

'''In the 2010s, commercial ACID graph databases that could be scaled horizontally became available. Further, SAP HANA brought in-memory and columnar technologies to graph databases. Also in the 2010s, multi-model databases that supported graph models (and other models such as relational database or document-oriented database) became available, such as OrientDB, ArangoDB, and MarkLogic (starting with its 7.0 version). During this time, graph databases of various types have become especially popular with social network analysis with the advent of social media companies.'''

Article Evaluation: Graph Database
The article contains decent information. However, the author(s) did not properly cite the sources for most of its work. There is no way for the readers to distinguish between the authors' opinions and facts from proper sources. There should also be more diagrams or images to help the reader understand the concepts of a graph database. The article is not categorized into subcategories to easily search through.

There are unnecessary comments that could be instead replaced with separate Wikipedia links. An example from the article is "that is, roughly relative to the logarithm of the size of the data." Many examples are written in good nature, but repetitive. The contrast between the relational databases and graph databases moves through the same differences with different examples.