NoSQL Database for Software Project Data

Anna Bj¨rklund o

January 18, 2011 Master’s Thesis in Computing Science, 30 credits Supervisor at CS-UmU: Ola ˚gren A Examiner: Fredrik Georgsson

Ume˚ University a
Department of Computing Science SE-901 87 UME˚ A SWEDEN

Abstract The field of databases have exploded in the last couple of years. New architectures try to meet the need to store more and more data and new kinds of data. The old relational model is no longer the only way and the NoSQL movement is not a trend but a new way of making the database fit the data, not the other way around. This master thesis report aims to find an efficient and well designed solution for storing and retrieving huge amounts of software project data at Tieto. It starts by looking at different architectures and trying three to see if any of them can solve the problem. The three databases selected are the relational database PostgreSQL, the graph database Neo4j and the key value store Berkeley DB. These are all implemented as a Web service and time is measured to find out which, if any, can handle the data at Tieto. In the end it is clear that the best database for Tieto is Berkeley DB. Even if Neo4j is almost as fast, it is still new and not as mature as Berkeley DB.

ii

. . . . . . . . . . . . . . . . . . . . . . . . . . . .3.2 4. . . . . . . . . . . . . 15 Berkely DB . . . . . . . . . . . . 14 Strengths and weaknesses . . . . . . . . . . . . . . .2 2. . . . .2. . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 ACID v. 19 21 Neo4j . .two different ways of achieving partitioning . . . . . . . . . . . . . . . . . . . . The Questions . . . . . . . . . .1. . . . .1 4. . . . . . . . .2 4. . . . . . . . . . . . . .2 3. . . . . . . . . . .1 Paper outline . .1 2. . . . . . . . . . . . . . . . . . . . . . .1 3. . . . . . . . . . . . . . . .1. . . . . .3 A brief history . . . . . . . . . . . . . . . . . . . . . . . . . . . .2. . . . . . . . . . . . . . . . . . . . . . . . . 2. . 13 The questions .1 2. . . . . 18 Strengths and weaknesses . . . . . . . . .1 4. . . . . . . . . . . . . . .3. . . . . . . .3. BASE . . . . . . . .1 2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 The questions . . . . . . . 1 1 3 3 4 4 5 6 6 7 7 9 9 2 Modern Databases 2. . . . . . . . . . . . . . . . . . . . . . . . . .Contents 1 Introduction 1. . . . . .3 2. . . . . . . .2 5 Results iii PostgreSQL . . . . . . . . . . . . . . . 17 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3. . . . . . . . . . . .2 2. . . . . . . .3 The data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Column store . . . . .3. . . . . . . . Graph database . . . . 11 The databases .1 4. . . . . . . . . . . . . . . . . . .1 4. . . . .2 4. . . . . . . . . . . . . 3 The problem at Tieto 3. . . . . . . . . . . . . . . . . . . 16 The questions . . . . . . . . . . . . . . . . . . . . . . . .3 4. . . . . . . . . . . . . . . . . . Storing data today . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . The CAP Theorem . . . .2. . . . . . . . . . Document store . 16 Strengths and weaknesses . . . . . . . . . . . . . . . . . . . . . . . . . . .3. . 12 13 4 The solutions 4. . Key value store . . . .

. . . . . . . . . . . . . . . . . . . . . . .1 Server times . . . . . . . . .1 Future work . . .2 Client times . . . . . . . . . .iv CONTENTS 6 Conclusions 29 6. . . . . . . . . . . . . . . . . . . . . . . . . 35 A. . . . . . . . . . . . . . . . . . . . 38 . . . . . . . 29 7 Acknowledgements References 31 33 A Data from test runs 35 A. . . . . . . . . . . . . . . . . .

1 5. . . . . . . . . . . . . Total time for the server. . . . . . . . . . . . . . . . . . . Total time for the client for question 7 at different amounts of Client times for question 8-13 . . . . . . . . . data . . . . . . . . . . . . . . . . . . . . . . . . . . Client times for 10% of the data without PostgreSQL . . . .4 5. . . . . . . .3 3. . . . . . . . . . . 18 Total time for the client.5 5. . . . . . . . . . . . . . . 10 10 11 12 An example of how a shared property gets duplicated in Berkeley DB . . . . . .2 5. . . . . . . . . . . . . . . . . . . . . .6 An An An An overview of the data . 22 23 24 25 26 27 v . . . . . . . . . . . . . . . . . . . . . .3 5. . . . Client times for question 1-6 . . . . . . . . example of an inconsistent tree . .2 3. . . . . . .1 5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 4. . .1 3. . . . . . . . . . . . . . .List of Figures 3. . . . example of how a property is shared between different nodes example of a consistent tree . . . . . . . .

vi LIST OF FIGURES .

. . . . . . . Client times for all test runs at 0. . . . .3 A. . Time in milliseconds. . . . Client times for all test runs at 100%. . . . . .1% of the data.1 A. . . . . . . . .9 An example of data organized in a table . . . . . Time in milliseconds. .8 A. . . . . . . . Time in seconds. Time in seconds. . . . 6 . . . . . . . . . . . . .6 A. . .1 4.4 A. The server times for 100% of the data. . 35 36 36 37 37 38 38 39 39 vii .List of Tables 2. . . . . . . . . Client times for all test runs at 10%.5 A. . . . . .7 A. . Time in seconds. . . . Time in seconds. . . . . .2 A. 14 . . . The server times for the hash table. . Time in milliseconds. . . . . Client times for all test runs at 1%. . . . . . . . . . . . .1 A. The table retured by PostgreSQL for the inconsistent example The server times for 0. . The server times for 1% of the data. . . . The server times for 10% of the data. . . . . . . . . . . . . . . .1%. Time in milliseconds. . . Time in milliseconds. . . . . . . . . .

viii LIST OF TABLES .

the data they have and how this data fits different architectures. the main problem is deciding which architecture of data storing is best suited for the data. Chapter 3 takes a deeper look at the problem at Tieto. 1 . Chapter 4 describes the three different solutions implemented and where the strengths and weaknesses lie in each solution from a theorecial point of view. Chapter 5 presents the result of the implementation with extra attention to performance and the specific requirements from Tieto. reliability and so forth.1 Paper outline Chapter 2 begins with a brief history and then takes a deeper look at the different solutions for data storing that exist today.Chapter 1 Introduction Today there exist many different types of databases. Since the 70s and into the new millennium the relational model was the dominant and almost all databases followed the same basic architecture. When choosing a database today the problem is much more complex then deciding on a vendor for the relational database. At the beginning of the new millennium developers started to realize that their data did not fit the relational model and some of them started to develop other architectures for storing data in databases. not only the traditional relational SQL database but several other architectures designed to handle different types of data. When that decision is made it is time to choose a vendor that meets the companies requirements regarding price. Chapter 6 addresses what is left to do and how Tieto can move forward with this. First a theoretical approach is made and then all three are implemented and are tested to see which is fastest in a test with the real data. This paper will look at three different database solutions for software project data at Tieto Ume˚ and compare a them. 1.

Introduction .2 Chapter 1.

Today processors are thousands of times faster. The main market for RDBMS (Relational DBMS) in those days was business data processing. There were some products but most of them were only available within the company and for a specific solution. today there are a lot of different markets with completely different requirements. The two main disadvantages that RDBMS have are that they do not scale easily (in the next Section it will be obvious why) and they often fail at capturing the relation between the data. System R is the foundation for many of todays popular DBMSs (Database Management System)[9]. The continuing trends of cloud computing and growth of social networks will only fuel the need for large data stores even more. just that in some cases the relational model just isn’t enough.1 A brief history In the 70s databases was a growing field and there were some debate on how to organize the data. memory is thousands of times larger and the main bottleneck is the bandwidth between disk and main memory.Chapter 2 Modern Databases 2. Today the expression is often thought of as Not only SQL and is the movement of other database solutions than a relational database. In early 2009 it was reused by the organizers of an event to discuss open source distributed databases and was a reference to the naming convention of traditional relational databases. But if the data does not fit the relational model it is worthwhile to look at another types of database. 3 . Yet another difference is the user interface. At that time developers started to think outside the box and realized that they had data that did not fit the relational model. The phrase NoSQL was first used in 1998 as a name for a lightweight relational database that did not expose a SQL interface. IBM developed System R and it was the first system to implement a Standard Query Language (SQL). The idea is not that relational databases are bad and wrong. If the If the relational model fits the data then it is a good idea to use it. Several started to develop different ways to organize their data depending on their specific needs. The hardware design in the 70s and 80s were much different from today. such as MySQL and PostgreSQL. Only a few years ago these problems was not such a big problem but the amount of data that is in store today is infinitely much more than only ten years ago. in the beginning there was a text terminal and today there is a graphical interface. Despite the changes in requirements and hardware the relational model was the dominate one until the beginning of the new millennium.

If there are requirements on uptime or the data is massive there might be necessary to partition the data between several nodes and make a compromise on one of the other. Since this is the case for most web services it has a major impact on the decision to choose the right model for storing data.4 Chapter 2. The CAP theorem states that it is impossible for a Web service to guarantee all three of the following properties: Consistency – all clients have the same view of the same data at all times Availability – all clients can always read and write Partition-tolerance – the system works well despite physical network partitions All three are desirable for all Web services but at PODC 2000 Brewer [3] made the conjecture that it is impossible to have all three. some even demand it for some type of update. the database will be consistent at some time but not all the time. ACID (Atomicity Consistent Isolation Durability) and BASE (Basically. One node can never guarantee a given uptime and for some companies this is so important that they can tolerate a database that is inconsistent at times to guarantee availability. 2. it acts as an atomic operation . Soft state. In 2002 Gilbert and Lynch proved that Brewer was right for asynchronous network. The properties of a transaction are Consistency a transaction only commits if it preserves the consistency of the database Atomicity a transaction either commits or not. Modern Databases 2. ACID and BASE are not databases but more of organisation schemas that can give guidelines how a database can operate to be as good as it can be for the third criteria. Today transactions are something natural and most databases support it. which is a network where the nodes does not share a clock but have to rely on the messages that are sent between them. The CAP theorem states that any database solution can only fulfill two of the criteria and that it is up to the architecture to choose which two. Most relational databases can promise consistency and availability and this is good for smaller system. it only means that the database cannot guarantee that every node have the exact same picture of the data at all times.2 The CAP Theorem To be able to discuss the different database solutions that exist today it is important to have an understanding of the CAP theorem [3]. If this is the main goal. a Web service can at most choose two of the three. One important note is that inconsistency is not always inconsistency. but not all the time. They do guarantee that all nodes will have the same picture at some time.2.two different ways of achieving partitioning If a database needs to be physically partitioned then the CAP-theorem states that it needs to choose to give up either A (availability) or C (consistency). Jim Gray [4] proposed how a partitioned database could guarantee consistency by making sure updates were done in transactions that followed some given guidelines.1 ACID v. Eventually consistent) are two different ways of doing this. Available. BASE . In 1981. This is referred to as eventual consistency and as the term implies. the data fits the relational model and there are no requirements on uptime then the relational model is a good choice. But in 1981 when Jim Gray reinvented transactions it was something new and it is on that foundation most systems are built today.

Functional partitioning is dependent on the actual data stored and for some systems this technique will not work well. It allows some data to be inconsistent between different partitions at some period in time and uses persistent messaging to make the data consistent at a later point. When it is night at one part of the world another part has daytime and millions of potential customers choose between them and another online book store. Today there are several solutions that operate in different areas of the CAP theorem and the same database can exist in different areas depending on configurations. There are also several open source solutions with varying quality. In 1998 Jim Gray was awarded the Turing Award1 for seminal contributions to database and transaction processing research and technical leadership in system implementation [14]. it cannot roll back Isolation no other transaction can see the events in a non-committed transaction In the original paper there were no I. Another example of this is Amazon and their solution Dynamo [2]. is very scary to some computer scientist. Another problem with the rules is performance. for example when we pay with our credit card it takes a day or two before it can be seen on the bank statement.3 Storing data today Today there exist some famous non-relational database systems. If Amazon tolerated downtime on parts of the store at any given time the word would spread and they risk losing reputation and customers. The main point here is to allow some of the data to be inconsistent at some times but not all the time. 2. Grays rules guarantee that a database stays consistent even then partitioned. Googles Big Table.2. Because of this they tolerate that different nodes have different views of some the data at short periods of time. The term NoSQL does not denote a specific type of database but can be divided into several different types of 1 The Turing Award is recognized as the ”highest distinction in Computer science” and ”Nobel Prize of computing”. As a solution to these problems Dan Prittchett. it was added later in 1983 by Andreas Reuter and Theo Haerder [5] to form the acronym ACID (Atomicity Consistent Isolation Durability). hence the eventually consistent part of the acronym. even if it only is for a moment. instead there is money and time to be saved by choosing carefully and finding the model which fits the data the best. . Available. Amazons Dynamo and Cassandra (used by Facebook and Twitter) name a few. There are no reasons to choose an RDBMS and try to fit the data into it. the cost to keep the data consistent is not nonexistent. They risk losing millions in revenue if customers cannot access their web store at all times because they have customers from all around the world. The notion of having inconsistent data. This is something we all come in contact with at some point in our lives. It is worth mentioning that not all non-relational databases operate in the same space of the CAP-theorem and there is no clear way of saying that a specific type of NoSQL database is in any specific area. The important thing is to choose which data to allow inconsistency on and partition the system according to this. Storing data today 5 Durability once a transaction is committed. His solution has the acronym BASE (Basically. but the price for this must be availability according to the CAP theorem. Eventually consistent) and uses functional partitioning as a method of partitioning the data. Soft state.3. Ebay [7] suggested that trading some consistency for availability can lead to dramatic improvements in scalability.

G¨teborg . making it faster to read a particular column to memory and making calculations on all values in a column. but only on the surface. This row-oriented architecture gives fast writes and is called write optimized. in theory there . though Twitter use a slightly different configuration called Twissandra. Malin Olsson. 2. Ove Nykvist 1976-02-10. Nygatan 12. 735 12. Cassandra is one of the most famous of the wide column stores and is used by both Facebook and Twitter.1: An example of data organized in a table The data cannot be stored in two dimensions on disc since disc is sequentially accessed. Hammargr¨nd 2. 123 94. Name John Svensson Malin Olsson Ove Nykvist Birth date 1976-02-10 1986-09-23 1967-05-02 Address Nygatan 12 Storgatan 54 Hammargr¨nd 2 a Zipcode 123 94 345 19 735 12 City ¨ Orebro G¨teborg o Sundsvall Table 2. In a column store the data is stored in columns instead. Sundsvall a This is optimized for systems that does lots of writes but does not work well with systems that handle few writes with lots of data in each write and lots of querying in between the writes.1 Column store Most data today is organized in tables. 1986-09-23.6 Chapter 2. In that case a read-optimized system is better suited and a way to achieve this is a column-oriented organization [10]. Storgatan 54. 345 19. 1967-05-02. The traditional way a RBDMS organizes the data is in records and these are continuously placed in storage. G¨teborg o Ove Nykvist. This may seem very simple and it is. 735 12 ¨rebro. 2. 345 19. The key is used to access the stored value and the stored value can be anything.2 Key value store A key value store stores anything as a key/value pair. The main advantage with this type of storage is that it is schema less. John Svensson. John Svensson. 1976-02-10.3. this is a model that suits lots of data and is easy to understand for most humans. One disadvantage of this type of storage is that it makes joins very time consuming and some column stores does not support join operations on the data. thus making it faster for some types of operations. Storgatan 54. Sundsvall O o Then the columns of data are stored together and when querying it is not necessary to read unimportant columns to memory. 1967-05-02 Nygatan 12. the database engine handling the persistent data is often very advanced. ¨rebro O Malin Olsson. Another famous one is Googles Bigtable.3. Modern Databases non-relational databases that all have different characteristics and are suitable for different types of data and in different situations. Hammargr¨nd 2 a 123 94. 1986-09-23.

This is usually accomplice by XML. The main advantage is the speed and ease that data can be stored in a persistent way. Storing data today 7 are no constraints on the key or the value. In the last years there have been an exponential growth of data and the need to use something else than an RDBMS has also grown exponentially. The most famous of the key value stores is Amazons Dynamo with was already discussed earlier. Because of this there are demands on the data in the document.3 Document store A document store is a special kind of key value store. JSON or something else that the database can understand. MongoDB [1] and CouchDB [12]. it does not store the document (the value) as a mass of data.3. As with all these different ways of storing data it will only work if the data fits the model. This model will then work poorly and it would have been better to use another type of database instead. Some vendors include some way of indexing the nodes for easy access. This allows queries on the data and not just the keys as is the case for a key value store. This also allows for a much more flexible solution than an RDBMS since the database has no schema.3. The nodes have attributes or properties and the vertices have types or names. an integer or something like that. even if the attribute is something not even conceived at design time. An open source alternative to Dynamo is Voldemort [13] Another key value store is Berkeley DB which is one of the databases that is used in this paper. The value can be anything but is usually an object of the implementing language or a string. a string.4 Graph database In a graph database the data is stored as nodes and vertices between the nodes. it has to be structured in some way. 2.3. there have been several projects for as long as there have been computers. . The main disadvantage is that inhereted relations between data are lost and since anything can be stored it is up to the client to interpret the data returned by the store. Some famous document stores are Raven [8]. The data is extracted by traversing the nodes and vertices in different ways. 2.2. and it uses information in the document to index the document. The notion of storing data in something else besides an RDBMS is nothing new. In practice the key is usually some primitive of the programming language. This makes the document store very flexible. It is easy to support physical partitioning and most support the eventually consistent idea behind BASE. There will be problems if the data is tabular in nature with little or no relationship between nodes. More on that will follow later. There are no problems adding attributes to records after they have been inserted into the database. The main advantage with this type of storing is the possibility to traverse the nodes with known mathematical graph traversing algorithms. something that is hard to achieve with a traditional RDBMS.

8 Chapter 2. Modern Databases .

and D. The picture is an overview of how the data is organized. making the picture a little more complicated. in the implementations there exist a relationship both ways. There are four different levels of nodes. One of the questions Tieto wanted to have answered is if a more specific design of an RDBMS can help with scalability. 40 million relationships between nodes and 100 million values.1 is a picture to help understand the organization of the data and also give an idea of how many nodes there are in each level. There are no vertices between nodes of the same level and only vertices to a node of the adjacent level.Chapter 3 The problem at Tieto The database today has two major problems. Figure 3. Therefore this thesis will only give a general schematic picture of the data and not use the correct names or labels. Because of this it is a requirement among all solutions that nodes are entered in the right order. This is the nature of the data. the B and C nodes are very similar and have properties that they share. 9 . This became a big problem when the amount of data became much larger than anticipated at design time.1 The data The content and the nature of the content of the data is a company secret. The C nodes have information about which D nodes it relates to. This is a simplification of the real data. first a look at the data at Tieto. If a B node is entered into the database without all C nodes it relates to already being there. the B node cannot be stored. Figure 3. The information of the relationships lies entirely on the upper nodes. In total there are 4 million nodes. the B nodes have information on which C nodes they relate to and so forth. A.2 is a small section of the big graph and an illustration of how one of the properties of the data in the nodes makes them connected. C. B. in the real data there are some vertices from A to C. The easiest way of describing the data is by using a graph. Since the main goal of this thesis is to implement and test different databases and see if they can handle the amount of data these simplifications should not make the result differ too much from reality. These properties are removed from the data for this thesis to make the implementation a little bit easier. The choice is described later. 3. A C node has no information about which B nodes it connect to. the nodes also have some metadata attached to them and each node has a predecessor. At the same time they want to know if a different kind of database can do the job better. it is designed to handle any type of data and scalability was not an issue for the designers.

Figure 3. The problem at Tieto Figure 3.2: An example of how a property is shared between different nodes . the number of nodes and the number of properties shared between the nodes differ a lot depending on where in graph the calculations are made.10 Chapter 3. the number of vertices between the different levels.1: An overview of the data A node has on average one or zero connections to properties but the number vary a lot and others have up to ten. An algorithm that works nice in one part of the graph may be a catastrophe at another part. The nature of the graph. These implementations try to be as good as it gets for the majority of the graph but not optimal for any one part of it. This makes it harder to implement an optimal solution.

The Questions 11 3. How and why inconsistencies occur is to closely connect to the nature of the data to be revealed here. The first type is a simple get a set of nodes with a given property.3. Figure 3. It is only in the sub tree of one A that all C nodes with the same value in the attribute must be the same node. unique to A2 and all nodes A1 and A2 have in common in three different lists – Check if a tree under A is consistent and if it is inconsistent return how it is inconsistent A sub tree under an A is inconsistent if two C have the same value in a specific attribute but are not the same node.3 the sub tree of A is consistent but in 3.4. it only gives true or false if the sub tree is consistent or not. If the sub tree is consistent the question only return true. In two different sub trees there are some C nodes with the same value that are not the same C node but this is permitted. B2-C2. This type is called the simple questions without connections and there are nine in this solution.4 there are two C-nodes that have the same value of a=4 but they are not the same node. .3: An example of a consistent tree Note that the attribute in question is a very specific attribute and that it is only in a sub tree under a given A that this is interesting. These questions are – Return a sub tree of a given A – Return all B that connect to a given C – Check the difference between two A. They do occur at some points and the solution at Tieto today cannot tell in which nodes the problem is.3 and 3. In this case the question will return a=4 and a list of BC-pair. return all nodes unique to A1.2. B3-C4 and B4-C4. The other type is a set of more complicated questions where the connections between the nodes are explored.2 The Questions The questions asked to the database can be divided into two different types.b = Y.a = X AND table. The properties are one or two and all nodes returned must have the given property. In Figure 3. To illustrate this see Figure 3. In PostgreSQL a typical question is SELECT * FROM table WHERE table. For all cases of inconsistency the database returns the value of the attribute and all B-C pairs where the C-node has the value of the attribute.

12 Chapter 3. The last database was a choice of either a document store or a key value store. a free Open Source RDBMS that is known to have good performance. a key value store that had recently been rewritten for Java. Because of the nature of the data one of the databases is a graph oriented database and the choice was Neo4j. The problem at Tieto Figure 3. This was because they are very different in their architecture from the other two and it is interesting to see if they are as good as they should be on the simple requests and how bad they are on the more complicated questions. Berkeley DB is also well documented and has several examples.3 The databases One of the databases chosen was PostgreSQL. It previously only existed in C with a library that could run the C-version in Java but with the new version the cost for inter language translation was avoided. Several were considered but the choice fell on Berkeley DB. One major advantage was also that Tieto already had this installed for other testing purpose. a Swedish open source graph database. One major advantage was also that it is written in Java and well documented. .4: An example of an inconsistent tree 3.

none of them are physically partitioned. This was a requirement from Tieto as this would make it easier to integrate this into their existing systems. This makes it hard to have any other solution than the one chosen. The only protection that exists is against faulty data. This is not the structure of Tietos current solution.1 is also in its own table with a join table that tells which property belongs to which node. Then the table could be split into several smaller tables. This may seem a bit strange and if any of these databases are integrated into Tietos existing systems they need some work in this area. Another possibility would be if the graph could be divided into several smaller sub graphs. there are approximately 18 million rows in the table joining B and C nodes. The time for this thesis is limited and it was decided that it was better get as much functionality as possible instead of spending time on error handling for something that may be discarded. 4. this is a new design that tries to be as good as it can be for this version of the data. The three different data stores implements the same interface and are therefore interchangeable without making any changes to the Web service methods. One of the main problems with PostgreSQL can be found in this design.6 as a Web service. Pruning the data and discard some of the nodes is not an option. The property described in Section 3.1 PostgreSQL The PostgreSQL solution is implemented in version 8 and uses java. Both Neo4j and Berkeley can be partitioned if the need should arise. all data is still relevant in one way or another. The main table structure is straight forward. One way would be to let the table for B nodes contain this information but the number of connections differs widely between different B nodes. The main reason for this limitation is time. one table for each of the levels of nodes with a serial id field and three tables containing the relationship between the different layers of nodes. All three solutions operate in the same space of the CAP theorem. All questions regarding the relationship between the B and C nodes will be costly any way it is done. This is not possible for this data. Since this is intended as an internal system the data source is trusted and there are no protections against malicious data. not even when looking at only the B and C levels so this 13 .Chapter 4 The solutions The solution is implemented in Java 1.sql. The information about these connections must be in the database and the other solutions for achieving this would have other problems. When asking for a specific B it is necessary to query over this table because one important part of a B is with C it connects to.* library to communicate with the database.

1 is this C the same as the previous row 2. The query to PostgreSQL returns table 4. organized in a slightly different way. Question 10 and 11 does nothing special. For examples of this see Figure 3.1. If there is any more work done on this solution this questions is definitely worth looking at and implementing a better solution. It then uses javas set operators with a hash set on the two sets of strings to get the three different subsets.id B1 B2 B2 B3 B5 B3 B4 Table 4. This is the only solution that requires anything else than a java library since the PostgreSQL server runs independently from the java program. The return structure is not in row format but contains the same information. Question 12 gets the unique labelling string for the two different sub trees for the different A nodes. This is sorted primarily on the value of a and secondarily on C. They are not particularly interesting or special. The overhead of querying the database is something to consider and it is worth a little more logic in the program to not have to query the database more than once for each question. The java program then has the following algorithm to remove the rows that does not contain the inconsistent a-value.1: The table retured by PostgreSQL for the inconsistent example cannot be done without having more than one copy of some of the nodes. The queries are written to allow the query planner in PostgreSQL as much freedom as possible since it probably is better at the planning then the author of this paper.1 for the previous inconsistent example.1 keep C and D in a structure . The first nine questions are simple select with some joins for retrieving the data. In the test runs the PostgreSQL server was run on the same computer and thus eliminating the time it would take the data to be transferred in a network.4. 4.1.14 Chapter 4. The solutions a 3 3 4 4 4 2 2 B. This was really hard to implement and the final solution is one that uses PostgreSQL for the most part and some java for the final logic.3 and 3. 1 Fetch the values for the new row 2 is this a-value the same as the previous row 2. Given the results of the test runs this is probably not the optimal way of doing this even thought java is good at hashing strings. The last query determined if a sub tree of A was consistent or not. they only return the sub tree or the list of B nodes and does nothing unexpected.id C1 C1 C2 C4 C4 C3 C3 C. The logic of this solution strives to make as few queries to the database as possible without having to loop the resulting rows more than once. only simple selects. Note that before the first row is calculated the variables keeping track of the previous row are set to empty strings and therefore are a value but matches noting from the database.1 The questions In this Section the more interesting solutions will be described in some detail.

2 else (the previous a is consistent) 3. There is no indexing in the graph engine but this semi built in index service uses a Lucene as backend and is as close as it gets to being an integrated index. Because the indexing is separate from the database it is possible to . A node can have several properties and several vertices or relationships with other nodes. Relationships are set both ways so between two nodes there are two relationships with different types. This helps with the traversing of the tree.2. one going up and one going down. The value must be one of Javas primitive types. Almost all exception handling is simply printing an error message on stderr and moving on or returning false since there is no use spending time implementing fancy error handling for something that may be discarded shortly. Neo4j 15 2. There is a big hurdle to get over in order to do things nicely and efficiently. All attributes in a node are stored as properties and the relationships are set as the nodes get entered into the database. These relationships must be of a specific type. The data is retrieved from the database by traversing the graph. making sure that only nodes in the right direction gets traversed.1. Since the data is in a graph structure there was no need to think of any other structure for storing the data.1.2 else (the C is different meaning an inconsistent tree) 2.2 save all data in the return structure 3.2 Neo4j Neo4j is a graph database and as such it uses nodes and vertices to store data. setting up tables and similar things. the main way of finding the right nodes should be by traversing the graph with different algorithms. A relationship can also have several properties just like the nodes.2. All changes to the database are made in transaction and time and effort was spent on making sure the data in the database did not get corrupted. This is not intended as a key-value store and therefore indexing is not a priority. To index the nodes this solution uses the LucenIndexService that is closely integrated in the database but not a part of it.1 set the return structure as inconsistent 3.2 Strengths and weaknesses The implementation of PostgreSQL was the first one.4.2.2 keep C and B nodes in a structure 3 else (this is not the same a-value as the previous row) 3.1 discard all saved data 4 set this row as the previous row 4.2. exceptions and similar things is massive.1.1 is the previous a inconsistent 3. One problem with PostgreSQL and other SQL databases is that the programmer needs to be good at SQL to be able to handle writing the queries. The amount of code needed to handle calls to the database. a string or an array of primitives or strings. In the end this database proved to be the hardest and most time consuming to implement. since this was the database most familiar from previous experience. A property is a key that is a string and a value.1 set this a-value as inconsistent 2. 4.

Since this was a test there was a need to store data. The a-value is set as key and the C node is put in a list. the sub tree is inconsistent. One of the main differences is how the indexing is handled.2 Strengths and weaknesses It was fairly easy to start implementing Neo4j. A completely missing functionality is the ability to truncate the entire database. If there is any future work done on this solution one of the first steps should be integrating the new way of indexing. 4. It begins by making a depth first search with a maximum depth of two. More information on this can be found on Neo4js web page [11]. To get the right B nodes all B nodes are examined and the ones with correct A are stored in the return structure. When all nodes are traversed the program begins to go through the hash table and searching for a-values that have more than one value in the list. The index service may still return the node but it will not have the correct properties set and when sked for the value of the propery an exception will be thrown. The more complex questions use the graph structure of Neo4j to return the correct nodes. 4. the correct C node is found by asking the index service for the node and then asking the database for all its neighbours with the correct relationship. For all C nodes it saved the a-value and the C node in a hash table. The only time nodes are removed from the database in this solution is then all data is removed for testing purposes. This solution uses version 1. Then the correct node has been found the information is moved from the node to the Java object that gets returned.2.1 of Neo4j.2. For the most cases a sub tree will be consistent and this should be faster than BerkeleyDB for those cases since it really uses the nature of the graph and only when it is needed.16 Chapter 4. The database said that the property was not set but the problem was that the node was still indexed by the property and removed from the database. The consistency check really uses the graph properties of this database. This is very easy in both . Question 10 gets the correct A from the index service and then simply traverses the sub tree and returns the nodes. Neo4j makes this traversing very easy. As previously mentioned this is probably not the best way and a different algorithm should be considered if any more work is done on this database.1 The questions The first nine questions are handled by the index service. If such a list is found. The same is true for question 11. There are some examples on the web site and a really good API for all of the classes. The first time this happened it was a somewhat hard error to find. The implementation was finished in November of 2010 and has not been checked against the new version of the database. The new version 1. The only major problem was described above. All nodes that are put in the database get indexed on the different properties that are needed for this. it is possible to ask for every node that is at a maximum depth from this node and that can be accessed by the correct relationship type. It is vital that all indices are removed when a node is removed from the database. The solutions remove a node from the database and still have it indexed. perform the tests and then remove all data to make the database clean for the next test. A new object is created for every node that is returned. Question 12 uses Javas hash set in the same way as PostgreSQL to calculate the different sets from given sub trees. if an index was not removed it showed in a really strange behaviour and the root cause was hard to find.2 came out in December 2010. it is not the same object that got put in the database but it has the same information.

If an instance may have many but no other instance may have any of the same the relation type is ONE TO MANY and if an instance can have many that it shares with other the relation type is MANY TO MANY. BerkeleyDB is owned by Oracle since 2006. Berkely DB 17 PostgreSQL and BerkeleyDB but no easy solution was found for Neo4j. For more information on implementation details. When returning an object from the database . It uses annotation to set the class as persistent or as an entity class and the members of the class that are primary. } ONE TO ONE says that the value is unique for every instance in the database. 4. MANY TO ONE means that this instance only has one but share that with several other instances of this class. see the API [6].1 to 1.3. There exist programs that allows for a graphical presentation of the data in the database but none were tested by the author of this thesis. An example will clarify this.and secondary key. @SecondaryKey(relate=ONE_TO_MANY) String[] email. Neo4j requires really fast discs or huge amounts of memory to work well.2 shows that big changes are still being made. A primary key is of this type but it is unusual for secondary keys. Both PostgreSQL and BerkeleyDB are older and more mature products. Neo4j is still young and the changing of indexing from version 1. Since BerkeleyDB require all objects to be stored to be set as persistent the information have to be moved from the original object coming in to a Berkeley object that looks the same except for the Berkeley specific annotations.3 Berkely DB BerkeleyDB is a key-value store that is originally written in C++ but now has a completely rewritten version in Java.4. @Entity class ExampleClass { @PrimaryKey long id. Berkeley stores any java-class that is set to be persistent. @SecondaryKey(relate=ONE_TO_ONE) Int ssn. The Linux machine that was used in the developing of this thesis had some real problems with speed. Because the data is organized as a graph there are several graph algorithms that can be used to solve various problems. @SecondaryKey(relate=MANY_TO_ONE) String Name. The secondary keys have of four different ways of relating to other instances of the same class. @SecondaryKey(relate=MANY_TO_MANY) String[] family. A graph is easy to understand and most data with lots of relationships are described as a graph. The test runs was done on solid state drive and Neo4j needs better hardware for the program than the other two databases.

In Berkeley DB this would be much harder since there is no link from a C node to its B nodes and on to the A node to make sure only the correct B nodes gets returned. In Berkeley each node will get their own copy of this property and when returned the nodes will have different but identical copies of this property. If a get from the database is costly and there are lots of C nodes that belong to different B nodes in the same sub tree this approach will be expensive. The search is not hard. The inconsistency check was hard to do in Berkley DB. The difference here is in the speed of the initial search since it is done twice. getting the right node from database and finding all C nodes it connects to. Getting down the tree is fairly easy with Berkeley DB as with both the other databases.1 The questions As with the others the first nine questions were easy then the indexing part was understood. Information on with B nodes a C node belongs to is only stored in the B nodes and therefore it must be search in the B nodes.18 Chapter 4. The difference between two sub trees is handled in much the same way as with the other databases. Returning a sub tree needs the database to first get the right A node then looping all B nodes. When doing this some information about relationships between the nodes are lost. In the other two there is also information on how to get up the tree but this information does not exist in Berkeley DB.3. In Figure 3.1. This means that several nodes may get visited more than once and that is not optimal. see Figure 4. If a Berkeley DB object could be returned the search methods would consist of only one line of code. But if there are only a few of these nodes it will cost more to keep track of which have already been explored than to let them get explored once more. The solutions the reverse is done to make sure the correct type of object gets returned. In Neo4j there was a possibility to store only the C nodes and the a-value and then get the information if the sub tree is inconsistent.1: An example of how a shared property gets duplicated in Berkeley DB 4. Therefore this solution uses the naive approach and lets the same C node get explored several times. . It then needs to do the same for all C nodes to get all D nodes. Figure 4.2 there is a shared property between the nodes. the id of the C nodes is set to be a secondary index and the search is simple but possibly time consuming.

Berkely DB 19 The supervisor at Tieto.3. The hashtable has the structure Hashtable<String.4.3. The author of this paper has tried to find some graphical program to view the data in the database and handle it manually. Anders Martinsson. . Hashtable<String. No such program has been found but it would be good if it existed. then that a-value is in more than one C node and the tree is inconsistent. Those tests were only to test the functionality but even then it was a clear difference in the speed of the test program. The inner hashtable have the C node for key and then a list of B nodes for value. In Berkeley DB this is not possible so all information needed to be saved as the initial search proceeded. made a solution for his Hashtable and that solution seemed to be a good approach: it stores all the information needed as it makes a depth first search of the sub tree. List<String>>> to keep track of all nodes visited so far. In Neo4j only the a-value and its corresponding C node is saved but there it is possible to retrieve the information about the B nodes without having to search the whole tree again. If so. The outer hashtable have the a-value as key and a hashtable as the value.2 Strengths and weaknesses This was a little bit harder than Neo4j to get started on the implementation but after the initial hurdle was cleared there were few problems with getting the code to work. Then the initial search is done it is simply a matter of looking at the length of each of the inner hashtables to see if any of them are of greater length than one. Then first tested on the developing machine the first reaction was that it was really fast. 4.

The solutions .20 Chapter 4.

For that amount of data there can be no other explanation as to why the cost is so much higher. If the client times are divided by the number of test runs Berkeley DB completes query 12 in less than 5 seconds. The impact of this overhead should decrease as the amount of data increases. One other interesting thing that is obvious from these graphs is that the more complex questions that is the hardest seems to be question 12. Time was measured at both client and server. The test runs are made in four different percentages of the data. 1%. even though they both keep their data on the SSD. median and a trimmed mean will be presented. Neither Neo4j nor Berkeley DB can keep all the information in memory and need to read from disc.1(a) and 5.1(b) that PostgreSQL has a high overhead cost since it needs to call an external database. Note that the scale in the x-axis is logarithmic and not linear. Neo4j struggles with some of the questions when it comes to 100% of the data but Berkeley DB is still quite fast. returning a sub tree of A. The test program was developed at the same time as the databases and to test it Anders designed a Hash table to handle the data. All times are in tables in Appendix A. the difference between two sub-trees and question 10.Chapter 5 Results The test program was developed by Anders Martinsson. This is maybe the most important result of them all. The server times will not be presented in total here. Even if this is a question asked once a day 2 minutes is a very long time to wait for an answer. 10% and 100%. All test runs were done by him on his computer. Note that the listings of client times for 100% have the numbers for Neo4j and PostgreSQL are multiplied with 4 resp.1%. This seems to affect Neo4j more than Berkeley DB. only the mean. When 21 . It can be seen in Figure 5. Neo4j needs almost 25 second but PostgreSQL needs as much as 115 seconds or almost 2 minutes. my supervisor at Tieto. First a look at the client times for the different questions at the different percentage levels. The fact that the total time for running the entire test set was so high that it could not be completed for both Neo4j and PostgreSQL is very telling of which database is faster for the large amount of data. This is not a persistent database but for comparison reasons test runs were done with this as well for the three smaller data sets. 8 to give an accurate picture for comparison. The test was run 2048 times for each question except for Neo4j and PortgreSQL at 100% because they took so long it was not possible to let them run that many tests. The trimmed mean has 5% cut of at each end to get rid of any extreme values. In total there were almost 500 000 times to analyse at the end of all test runs. Neo4j had 512 tests and PostgreSQL had 256 tests per question. 0. the client measured the wall clock time for all test runs in milliseconds and the server each questions time in nanoseconds.

5 1 0 2 4 6 8 Question number 10 12 14 0 2 4 6 8 Question number 10 12 14 (c) 10 % of the data. (d) 100 % of the data. For question 9 it appears that the hash table is the slowest.2 the client times for Neo4j. Figure 5. especially for Neo4j.5 x 10 5 (b) 1 % of the data. A look at question 7 in Figure 5. it drops to 0. except for Neo4j which has a top at 100% when the rest of them actually go down in time. Berkeley DB and the Hash table are plotted for 10% of the data.5 1000 0 0 Time in seconds PostgreSQL Neo4J BerkeleyDB Hash table 2. Results 900 800 700 600 Time in seconds 500 400 300 200 Time in seconds PostgreSQL Neo4J BerkeleyDB Hash table 3000 PostgreSQL Neo4J BerkeleyDB Hash table 2500 2000 1500 1000 500 100 0 0 0 2 4 6 8 Question number 10 12 14 0 2 4 6 8 Question number 10 12 14 (a) 0. One of the main reasons for this is probably the speed of the solid state drive. comparing the times. One thing that becomes apparent from these Figures is that some of the simple questions are not so simple after all.1: Total time for the client. With a slower hard drive this would probably not be possible. That means that a much larger portion of the data is returned . but only just. 8000 7000 6000 Time in seconds 5000 4000 3000 2000 0.2 for 1% and is rounded to 1. If the original data contains 20 unique value of the attribute in question. One interesting fact is that Berkeley DB and Neo4j almost can keep up with the Hash table.5 and the results are very interesting. PostgreSQL Neo4J BerkeleyDB 2 1.1 % of the data. The graphs are almost the same. for 10% of the data the time is almost double which means that the time spend calculating the sets is almost nothing compared to the time of getting the sub trees.22 Chapter 5. The maximum seems to be when only 1% of the data is tested. For 100% the time is still only slightly more than double the time for getting one sub tree. On the server side the times plotted are the trimmed means because they are generally somewhere in between the mean and median. In Figure 5. PostgreSQL is the slowest for almost every question. There are some explanations for this but the most likely is that the data scales badly for this example.

23 800 700 600 Time in seconds 500 400 300 200 100 0 Neo4J BerkeleyDB Hash table 0 2 4 6 8 Question number 10 12 14 Figure 5.2: Client times for 10% of the data without PostgreSQL than for 10%. A closer look at the exact behaviour of the data and the databases for this question would be interresting but it probably does not influence the final result. .

Figure 5.5 0 0 0 2 4 6 8 Question number 10 12 14 (c) 10 % of the data.6 0.3 1. 3.15 0. .5 2 60 1. (d) 100 % of the data.4 PostgreSQL Neo4J BerkeleyDB Hash table 0.8 0. 4 PostgreSQL Neo4J BerkeleyDB Hash table 120 (b) 1 % of the data.25 Time in seconds Time in seconds 0 2 4 6 8 Question number 10 12 14 1 0.24 Chapter 5.5 PostgreSQL Neo4J BerkeleyDB 100 3 80 Time in seconds Time in seconds 0 2 4 6 8 Question number 10 12 14 2.05 0. Results 0.35 PostgreSQL Neo4J BerkeleyDB Hash table 1.4 0.1 0.5 40 1 20 0.2 0.2 0 0 0 2 4 6 8 Question number 10 12 14 (a) 0.2 0.3: Total time for the server.1 % of the data.

25 1200 PostgreSQL Neo4J BerkeleyDB Hash table 1200 PostgreSQL Neo4J BerkeleyDB Hash table 1000 1000 800 Time in seconds Time in seconds 1% Amount of data 10% 100% 800 600 600 400 400 200 200 0 0.1% Time in seconds PostgreSQL Neo4J BerkeleyDB Hash table 1200 (b) Question 2 1000 PostgreSQL Neo4J BerkeleyDB Hash table 800 600 400 200 1% Amount of data 10% 100% (c) Question 3 1800 1600 1400 1200 Time in seconds 1000 800 600 400 200 0 0.1% 1% Amount of data 10% 100% 0 0.1% 1% Amount of data 10% 100% (a) Question 1 200 180 160 140 Time in seconds 120 100 80 60 40 20 0 0.1% 0 0.4: Client times for question 1-6 .1% PostgreSQL Neo4J BerkeleyDB Hash table (d) Question 4 1% Amount of data 10% 100% 1% Amount of data 10% 100% (e) Question 5 (f) Question 6 Figure 5.1% Time in seconds PostgreSQL Neo4J BerkeleyDB Hash table 9000 8000 7000 6000 5000 4000 3000 2000 1000 0 0.

26 Chapter 5.5: Total time for the client for question 7 at different amounts of data . Results 3000 PostgreSQL Neo4J BerkeleyDB Hash table 2500 2000 Time in seconds 1500 1000 500 0 0.1% 1% Amount of data 10% 100% Figure 5.

1% 1% Amount of data 10% 100% (a) Question 8 12 x 10 4 (b) Question 9 60 10 PostgreSQL Neo4J BerkeleyDB Hash table 50 PostgreSQL Neo4J BerkeleyDB Hash table 8 Time in seconds Time in seconds 1% Amount of data 10% 100% 40 6 30 4 20 2 10 0 0.1% 0 0.27 1500 PostgreSQL Neo4J BerkeleyDB Hash table 9000 8000 7000 6000 Time in seconds 5000 4000 3000 2000 1000 PostgreSQL Neo4J BerkeleyDB Hash table 1000 Time in seconds 500 0 0.5 500 0 0.1% 0 0.5 x 10 5 (d) Question 11 3500 2 PostgreSQL Neo4J BerkeleyDB Hash table 3000 PostgreSQL Neo4J BerkeleyDB Hash table 2500 Time in seconds 1.1% 1% Amount of data 10% 100% (e) Question 12 (f) Question 13 Figure 5.1% 1% Amount of data 10% 100% 0 0.5 Time in seconds 1% Amount of data 10% 100% 2000 1 1500 1000 0.6: Client times for question 8-13 .1% 1% Amount of data 10% 100% (c) Question 10 2.

Results .28 Chapter 5.

The results were pretty clear. Even though there exist a solution today it is not optimal and at the rate the data is growing Tieto may find themselves in trouble a lot faster than they anticipate. 29 . The first version of Neo4j was released in February of 2010. The real data have some properties that are excluded from this first test to make the task a little easier. A third and completely different database was needed and Berkeley DB is a key value store that had all the qualities. This was a surprising result especially that it was faster even for the more graphical questions. Neo4j needs time to mature and become a more stable product before suits companies such as Tieto.Chapter 6 Conclusions In this paper a question was asked. All three were implemented as a Web service and their performance was measured. The relational database was based on the fact that is already existed in the company and that it is one of the fastest relational databases available. version 1. A good first step would be to identify these and start implementing them as well to see if the results still hold. There is also the problem with the maturity of the product. 6.1 Future work The results are promising and there is definitely worth a continued development of the Berkeley DB part of the solution. Even though it data fits the graphical model the best Neo4j just was not fast enough to be able to use its advantage. the database that is the best at handling the data is Berkeley DB. is there any database that can handle the amount of data that Tieto have and how good can it get? To answer this question it was necessary to take a look at what architectures that exist today and find some different databases that could do the job. Based on the nature of the data it became clear that one should be a graph database and Neo4j was chosen because it considered to be one of the best on the market.1 half a year later and in December of 2010 yet another version. even for the questions that are closely connected to the graphical aspect of the data.

30 Chapter 6. Conclusions .

I thank internal supervisor at the department of Computing Science at Ume˚ Universitet. Without him this master thesis would not have existed since the whole thing was his idea. 31 .Chapter 7 Acknowledgements I would like to start by thanking my supervisor at Tieto. a Ola ˚gren. A Last but not least I thank my husband for everything he has done to support me throwout the entire master thesis project. Anders Martinsson for all his support and help. I also thank everyone at Tietos office in Ume˚ for making my workday a a pleasant time.

32 Chapter 7. Acknowledgements .

Peter Vosshall. VLDB. [6] Oracle. Alex Rasin. December 6 2010. http://ravendb. Raven DB. [10] Mike Stonebraker. and Stan Zdonik. http://neo4j. C-Store: A Column-oriented DBMS. the graph database. The A CouchDB distributed Project. Adam Batkin. Nabil Hachem. [2] Giuseppe DeCandia. Edmond Lau. [14] Wikipedia.net/. Elizabeth O’Neil. December 6 2010. Daniel J. [8] Hibernating Rhinos. Principles of transaction-oriented database recovery. Swaminathan Sivasubramanian. http://www. SOSP. 2007. 2007.mongodb.com/doc/BerkeleyDb-4. Brewer’s Conjecture and the Feasibility of Consistent. [12] The Apache Software Foundation. 15(4). Deniz Hastorun. ACM SIGACT News.systomath. The End of an Architectural Era (It’s Time for a Complete Rewrite). Miguel Ferreira. August 18 2010. http://project-voldemort. http://couchdb. [3] Seth Gilbert and Nancy Lynch. Daniel J.org/. 6(3). 1981. http://www. [13] Project Voldemort. Pat O’Neil. Samuel Madden. Stavros Harizopoulos. Neo4J. pages 553–564. [4] Jim Gray.org/. October 5 2010. Dynamo: Amazon’s highly available key-value store. The Transaction Concept: Virtues and Limitations. Alex Pilchin. Computing Surveys. Mitch Cherniack. Abadi. and Pat Helland. 1983.wikipedia. Project Voldemort. 2008. August 18 2010. Madan Jampani. http://en.org/wiki/Turing Award. [7] Dan Pritchett.apache. 33. and Werner Vogels.References [1] 10Gen. Abadi. Partition-Tolerant Web Services. 41:205–220. database. Proceedings of Seventh International Conference on Very Large Databases. Sam Madden.7/html/java/. Mongodb. August 18 2010. 33 . [5] Theo Haerder and Andreas Reuter. Gunavardhan Kakulapati. In Proc.org/. [11] Neo Technology. Turing award. VLDB ’07. [9] Michael Stonebraker. Available.com/. 2005. Queue. Xuedong Chen. Amerson Lin. August 18 2010. BASE: An Acid Alternative. Avinash Lakshman. Nga Tran. 2002.

34 REFERENCES .

3003 0.648 8.14 12.09877 Neo4j trim 0. 35 .22 3.59 27.3681 0. Time in milliseconds.09334 mean 0.722 PostgreSQL trim median 13.74 27.9 12.288 59.0664 0.715 1.297 16.2815 0.6 25.29 3. The server times are rounded to 4 significant digits.679 8.36 297.1363 0.05806 0.53 29.06033 2.04666 0.4147 0.09506 median 0.6 27.7952 0.813 0.36 0.1% of the data.2452 0.52 59.49 68.7035 81.05725 0.575 0.47 3.2868 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Table A.8853 0.7108 82.346 0.38 0.89 28.37 53.7 297.4028 0.6 0.114 0.4 326.05615 0.37 12.09009 0.4973 0.408 59.1964 0.3437 0.13 32.3765 0.98 25.0648 3.29 15.06775 0.457 18.619 0.5257 0.43 53.295 2.36 9.9 27.8562 0.1: The server times for 0.563 0.04629 3.704 18.06893 0.74 32.1647 0.5486 0.5271 0.8656 0.16 24. A.3445 Berkeley DB trim median 0.Appendix A Data from test runs Here is the raw data from the test runs.17 5.97 32.41 298.4 326.7852 0.86 5.7051 0.709 8.83 29.134 8.1 Server times mean 13. The values for the Hash table did not fit in the table with the others and therefore it is in its own table.421 0.1 28.4977 0.1889 0.978 16.53 0.06052 3.909 18.713 mean 0.04722 3.2 326 27.1657 0.18 1.09073 0.285 5.403 9.1 53.1078 0.3281 0.3518 0.41 12.67 1.09068 0.5086 0.

1 161.3105 Neo4j trim 0.9 209.1131 0.2: The server times for 1% of the data.93 30.04 32.8452 3.03206 0.1761 5.71 1.3 1061 1092 26.88 36.004 21.4 0.9 163.9 0.03149 0.5008 1.54 median 0.1246 0.77 113.4 639.94 120.929 8.05541 0.2 1096 1098 566.76 1.08234 3.3 33.8 187.4 1044 26.4238 0.08166 0.42 114.118 21.239 5.9945 37.4153 0.833 0.1364 0.4219 0.429 3.5 85.5108 0.1218 0.1 631.87 159.69 3.429 mean 0.807 0.96 31.381 17.267 17.48 21.32 0.91 0.06115 0.8 0.33 1.3 631.08425 3.9 209.08 0.037 6. .072 3641 27.33 60.03178 0.1335 0.57 39.225 319.08651 9.21 1.0554 0.136 Table A.09598 9.11 160.368 Neo4j trim 0.1018 9.06573 3.7 3.668 15.7 567.9761 6.1559 120. Data from test runs Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 18.676 21.3028 median 0.05767 0.007 37.5 PostgreSQL trim median 61.1026 0.8292 3.3 0.692 Berkeley DB trimmean 0.22 1.7 1808 6.82 39.7109 0.53 0.05555 0.81 74.37 36.7133 107.018 4.01 25.499 0.335 3639 3637 27.06575 3.1 Berkeley DB trim median 0.14 1.89 105.17 32.3 209.5 1.02163 3.09 25.9 3.15 29.3 0.58 18.03 179.795 14.6 105.1 161. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 61.95 18.0664 3.238 median 0.97 8.21 0.1742 119.7107 105.388 0.066 1.09 65.62 61.37 61.13 25.75 61.76 381.94 105.4841 0.734 14.29 17.54 61. Time in milliseconds.245 0.49 27.2 5.015 21.9 0.1775 5.187 120 3.3 54.9066 74.8 375. Time in milliseconds.24 37.99 31.37 39.481 74.47 86.2 1807 1806 6.37 1.9983 0.3035 mean 0.064 199.09 31.51 382.91 27.072 200.1332 0.2 318.4 1.62 37.9 0.0218 3.27 46.119 0.36 Chapter A.206 8.59 1.075 17.7 159.099 0.434 PostgreSQL trim median 18.2 3.237 mean 0.811 0.02161 3.48 mean 0.8298 3.06133 0.338 60.6008 6.266 319.3: The server times for 10% of the data.59 46.4027 0.0829 0.4 201.23 46.8173 6.91 17.08158 0.418 0.3 3.23 32.4963 0.76 65.1265 0.4 1097 567.08418 0.1032 0.44 179.347 69.04 64.8 Table A.1757 5.745 21.016 4.8 106.2 49.8 17.024 4.9 5.9 113.

03121 0.0371 0.38 17.261 0.01608 0.2556 0.8 731.6003 0.01594 0.95 32.09 22.91 740.0408 0.37 353.95 14.006041 0.9 697.1 19.5044 0.05 4058 4058 52890 52660 18.001458 0.7 93.001521 0.03593 1.001138 0.366 0.8 558.71 8455 16 22320 1540 Neo4j trim median 17.4: The server times for 100% of the data.004403 0.8 2153 463.97 0.72 4059 52980 21.005312 0.5 1136 Berkeley DB trim median 1.6278 0.05061 0.004174 0.001157 0.12 8.001744 0.832 22540 22750 1505 1489 mean 1.4 693.001518 0.001185 0.001518 0.5 24.006902 1.001787 0.05151 0.009106 0.0172 median 0.05122 0.6575 11. Server times 37 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 501.001189 0.001897 0.008348 0.02466 1.332 0. Time in milliseconds.65 112400 374.05172 0.37 8.001573 0.4 4075 584.4 25.22 46.03216 0.001518 0.001518 0.87 90.005718 0.9 371.3 163.0187 0.00144 0.147 0.114 0.001138 0.7 462.0167 mean 0.1217 0.7 761.631 0.93 394.02125 0.001531 0.14 11.56 9.07 378 3.3 PostgreSQL trim median 492.89 562.03529 0.08085 1% trim 0.239 0.87 14.242 0.9 338.4637 0.02186 0.21 36.5418 0.006071 1.007546 1.794 63.7 17. .03555 0.5: The server times for the hash table.269 5.293 0.01792 0.001719 0.5411 0.03602 1.365 0.644 504.896 0.001897 0.134 0.6 495.6 495.669 5. Time in milliseconds.7 492.2 57.1872 0.7 410.008419 0.302 5.00142 0.6 747.004694 0.5 291 249.03111 0.008888 0.008618 0.02483 1.04063 0.03605 1.5432 0.5 77.009643 0.001467 0.8829 median 0.5 599.14 157.02497 1.301 3.5 495.001779 0.009677 0.001579 0.14 18.2 84.06412 mean 0.6 2144 2135 462.648 442.65 111900 112200 373.11 262.7 4096 4092 524.07295 median 0.88 153 22.8 55.5 357.008697 0.6182 11.00117 0. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 0.1867 0.56 0.01769 0.9 490.366 0.53 563.0406 0.5779 21.A.8 1134 1133 Table A.99 740.1% trim 0.05084 0.2 8473 8559 12.8914 10% trim 0.233 0.1213 0.001569 0.5589 21.55 0.1226 0.009106 0.008829 0.001563 0.62 11.007589 0.01621 0.5593 0.8 mean 55.01404 0.7 19.8 193 3.001518 0.8852 Table A.05229 0.008475 0.1925 0.1.6377 0.02147 0.2831 0.97 22.

687 23.29 181.7 3.357 0.94 7.8 197.341 5.776 0.75 26.296 0.54 198.266 4.57 0. This is the total time for 2048 test runs.8 4.2 Client times Here are the times recordeed by the server in seconds.837 39.004 1.9 133.221 1.645 1.743 45.217 1.502 1.15 876.28 0.007 0.006 Table A.192 242.74 2.455 1.674 4.72 2.6: Client times for all test runs at 0.31 1.875 9.7 262.6 905.377 31.83 Hash table 1.722 23.84 127.431 7.8 350. .891 Neo4j 1.195 Berkeley DB 2.2 215.7 791.91 63.6 10.16 11.958 3. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 PostgreSQL 29.402 3.22 8.86 1.6 263.6 268.983 0.147 37.889 5.58 698.383 1.745 0.35 139. Neo4j and PostgreSQLs times are multiplied with appropriate scalar to give a time for comparison.66 3.9 61.62 182.7: Client times for all test runs at 1%. PostgreSQL 39.52 Neo4j 2.984 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Table A.38 Chapter A. Time in seconds.962 0.038 67 19.872 31.1 3.33 73.956 63.485 Berkeley DB 1.7 641.52 83.8 457 1491 2754 57.7 285.7 175.22 0.3 3.02 152.1 4.92 139.561 6. Data from test runs A.42 74.4 75.9 97.239 0.065 0.59 Hash table 1.397 32.7 11.2 63.84 37.53 8.142 38.233 1.1%.59 182.5 7. Time in seconds.952 30.

4 2.8: Client times for all test runs at 10%. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 PostgreSQL 1032 1018 48.44 9654 2349 Table A.899 Berkeley DB 1.457 0.67 3758 52.865 1.478 436.5 254.3 1.885 69.2 114.5 9.7 Neo4j 116.38 2.9 126.6 2.619 18.1 0.006 41.14 328.8 78.37 494.14 7.9 3.36 7932 58.62 9.9 3.6 8604 1212 1423 201.6 120.51 154.9: Client times for all test runs at 100%.98 Neo4j 2. Time in seconds.56 198.262 31.1 838. Time in seconds.041 9.273 26.96 193 360.6 8322 111000 47.7 428.07 246.405 762.7 Hash table 1.38 50860 3186 Berkeley DB 4.3 4.193 0.2 481.437 Table A.794 496.127 2.628 1. .12 204. Client times 39 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 PostgreSQL 127.2.998 1.533 53.34 235200 789.8 574.68 1181 1710 4659 961.1 193.5 2494 1270 113 791 3940 13.891 400.1 844.874 661.1 19970 35.9 41.2 334.143 7.A.1 68.7 236.