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

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

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

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

vi LIST OF FIGURES .

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

viii LIST OF TABLES .

Chapter 1 Introduction Today there exist many different types of databases. Chapter 4 describes the three different solutions implemented and where the strengths and weaknesses lie in each solution from a theorecial point of view. 1.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 5 presents the result of the implementation with extra attention to performance and the specific requirements from Tieto. the main problem is deciding which architecture of data storing is best suited for the data. 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. not only the traditional relational SQL database but several other architectures designed to handle different types of data. When choosing a database today the problem is much more complex then deciding on a vendor for the relational database. the data they have and how this data fits different architectures. This paper will look at three different database solutions for software project data at Tieto Ume˚ and compare a them. Chapter 3 takes a deeper look at the problem at Tieto. reliability and so forth. 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. 1 . Since the 70s and into the new millennium the relational model was the dominant and almost all databases followed the same basic architecture. Chapter 6 addresses what is left to do and how Tieto can move forward with this. When that decision is made it is time to choose a vendor that meets the companies requirements regarding price.

2 Chapter 1. Introduction .

IBM developed System R and it was the first system to implement a Standard Query Language (SQL). Despite the changes in requirements and hardware the relational model was the dominate one until the beginning of the new millennium. Yet another difference is the user interface. memory is thousands of times larger and the main bottleneck is the bandwidth between disk and main memory. There were some products but most of them were only available within the company and for a specific solution. But if the data does not fit the relational model it is worthwhile to look at another types of database. The idea is not that relational databases are bad and wrong. such as MySQL and PostgreSQL. Today processors are thousands of times faster. today there are a lot of different markets with completely different requirements. Several started to develop different ways to organize their data depending on their specific needs. The main market for RDBMS (Relational DBMS) in those days was business data processing. 3 . 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. If the If the relational model fits the data then it is a good idea to use it. 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. The continuing trends of cloud computing and growth of social networks will only fuel the need for large data stores even more. 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.Chapter 2 Modern Databases 2. System R is the foundation for many of todays popular DBMSs (Database Management System)[9]. just that in some cases the relational model just isn’t enough. Today the expression is often thought of as Not only SQL and is the movement of other database solutions than a relational database. The phrase NoSQL was first used in 1998 as a name for a lightweight relational database that did not expose a SQL interface. in the beginning there was a text terminal and today there is a graphical 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 hardware design in the 70s and 80s were much different from today.1 A brief history In the 70s databases was a growing field and there were some debate on how to organize the data.

the data fits the relational model and there are no requirements on uptime then the relational model is a good choice. Today transactions are something natural and most databases support it.4 Chapter 2.2. 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. One important note is that inconsistency is not always inconsistency. 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.1 ACID v. but not all the time. In 2002 Gilbert and Lynch proved that Brewer was right for asynchronous network. 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. In 1981. it only means that the database cannot guarantee that every node have the exact same picture of the data at all times.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). it acts as an atomic operation . This is referred to as eventual consistency and as the term implies. 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. the database will be consistent at some time but not all the time. Eventually consistent) are two different ways of doing this. Jim Gray [4] proposed how a partitioned database could guarantee consistency by making sure updates were done in transactions that followed some given guidelines. Modern Databases 2. Available. a Web service can at most choose two of the three. But in 1981 when Jim Gray reinvented transactions it was something new and it is on that foundation most systems are built today. 2. which is a network where the nodes does not share a clock but have to rely on the messages that are sent between them. They do guarantee that all nodes will have the same picture at some time. Soft state. 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.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]. Most relational databases can promise consistency and availability and this is good for smaller system. 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. If this is the main goal. 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. BASE . some even demand it for some type of update.

Because of this they tolerate that different nodes have different views of some the data at short periods of time. The main point here is to allow some of the data to be inconsistent at some times but not all the 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”. Ebay [7] suggested that trading some consistency for availability can lead to dramatic improvements in scalability. His solution has the acronym BASE (Basically. 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. hence the eventually consistent part of the acronym. Available. Soft state. Amazons Dynamo and Cassandra (used by Facebook and Twitter) name a few. it was added later in 1983 by Andreas Reuter and Theo Haerder [5] to form the acronym ACID (Atomicity Consistent Isolation Durability). The important thing is to choose which data to allow inconsistency on and partition the system according to this. for example when we pay with our credit card it takes a day or two before it can be seen on the bank statement. Functional partitioning is dependent on the actual data stored and for some systems this technique will not work well. 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. There are also several open source solutions with varying quality. Another problem with the rules is performance. Googles Big Table. instead there is money and time to be saved by choosing carefully and finding the model which fits the data the best. This is something we all come in contact with at some point in our lives. but the price for this must be availability according to the CAP theorem.3 Storing data today Today there exist some famous non-relational database systems. Another example of this is Amazon and their solution Dynamo [2].3. 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. 2. 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. . Storing data today 5 Durability once a transaction is committed. 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]. is very scary to some computer scientist. Eventually consistent) and uses functional partitioning as a method of partitioning the data. the cost to keep the data consistent is not nonexistent. If Amazon tolerated downtime on parts of the store at any given time the word would spread and they risk losing reputation and customers. 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.2. Grays rules guarantee that a database stays consistent even then partitioned. There are no reasons to choose an RDBMS and try to fit the data into it. 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. even if it only is for a moment. As a solution to these problems Dan Prittchett. The notion of having inconsistent data.

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

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

8 Chapter 2. Modern Databases .

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

This makes it harder to implement an optimal solution. An algorithm that works nice in one part of the graph may be a catastrophe at another part. Figure 3.2: An example of how a property is shared between different nodes . The nature of the graph. 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. The problem at Tieto Figure 3.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. 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.

B3-C4 and B4-C4. In this case the question will return a=4 and a list of BC-pair.4 there are two C-nodes that have the same value of a=4 but they are not the same node. 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. . In PostgreSQL a typical question is SELECT * FROM table WHERE table. 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 and 3. If the sub tree is consistent the question only return true.2. To illustrate this see Figure 3. The first type is a simple get a set of nodes with a given property. How and why inconsistencies occur is to closely connect to the nature of the data to be revealed here. B2-C2.a = X AND table. return all nodes unique to A1.3.4.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. 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. 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. Figure 3. In Figure 3. The properties are one or two and all nodes returned must have the given property. 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.3 the sub tree of A is consistent but in 3.b = Y. This type is called the simple questions without connections and there are nine in this solution.2 The Questions The questions asked to the database can be divided into two different types. The Questions 11 3. The other type is a set of more complicated questions where the connections between the nodes are explored. it only gives true or false if the sub tree is consistent or not.

One major advantage was also that Tieto already had this installed for other testing purpose. The problem at Tieto Figure 3.4: An example of an inconsistent tree 3. The last database was a choice of either a document store or a key value store. One major advantage was also that it is written in Java and well documented. Because of the nature of the data one of the databases is a graph oriented database and the choice was Neo4j. a free Open Source RDBMS that is known to have good performance. . a key value store that had recently been rewritten for Java. 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. Several were considered but the choice fell on Berkeley DB. Berkeley DB is also well documented and has several examples. 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.3 The databases One of the databases chosen was PostgreSQL.12 Chapter 3. a Swedish open source graph database.

Then the table could be split into several smaller tables. Pruning the data and discard some of the nodes is not an option. The three different data stores implements the same interface and are therefore interchangeable without making any changes to the Web service methods. 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.sql. 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. The information about these connections must be in the database and the other solutions for achieving this would have other problems. This was a requirement from Tieto as this would make it easier to integrate this into their existing systems. 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 questions regarding the relationship between the B and C nodes will be costly any way it is done. 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 .* library to communicate with the database. all data is still relevant in one way or another.1 is also in its own table with a join table that tells which property belongs to which node. 4.Chapter 4 The solutions The solution is implemented in Java 1. The only protection that exists is against faulty data. there are approximately 18 million rows in the table joining B and C nodes.1 PostgreSQL The PostgreSQL solution is implemented in version 8 and uses java. The main reason for this limitation is time. Another possibility would be if the graph could be divided into several smaller sub graphs. Both Neo4j and Berkeley can be partitioned if the need should arise. The property described in Section 3. One of the main problems with PostgreSQL can be found in this design.6 as a Web service. none of them are physically partitioned. All three solutions operate in the same space of the CAP theorem. 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. 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. This makes it hard to have any other solution than the one chosen. The main table structure is straight forward. This is not possible for this data. This is not the structure of Tietos current solution. this is a new design that tries to be as good as it can be for this version of the data.

4. only simple selects. The last query determined if a sub tree of A was consistent or not. 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.14 Chapter 4. For examples of this see Figure 3.1. The solutions a 3 3 4 4 4 2 2 B. 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. 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. They are not particularly interesting or special.3 and 3. 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. 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. This is sorted primarily on the value of a and secondarily on C. Question 12 gets the unique labelling string for the two different sub trees for the different A nodes.4. The java program then has the following algorithm to remove the rows that does not contain the inconsistent a-value.1 is this C the same as the previous row 2. 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.id B1 B2 B2 B3 B5 B3 B4 Table 4. 1 Fetch the values for the new row 2 is this a-value the same as the previous row 2.1 for the previous inconsistent example. The return structure is not in row format but contains the same information. Question 10 and 11 does nothing special. This is the only solution that requires anything else than a java library since the PostgreSQL server runs independently from the java program. organized in a slightly different way.1 keep C and D in a structure .id C1 C1 C2 C4 C4 C3 C3 C. The query to PostgreSQL returns table 4. 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.1.1 The questions In this Section the more interesting solutions will be described in some detail. they only return the sub tree or the list of B nodes and does nothing unexpected. 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. The first nine questions are simple select with some joins for retrieving the data.1: The table retured by PostgreSQL for the inconsistent example cannot be done without having more than one copy of some of the nodes.

This helps with the traversing of the tree. 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. This is not intended as a key-value store and therefore indexing is not a priority. A node can have several properties and several vertices or relationships with other nodes. These relationships must be of a specific type. In the end this database proved to be the hardest and most time consuming to implement.2 keep C and B nodes in a structure 3 else (this is not the same a-value as the previous row) 3. The data is retrieved from the database by traversing the graph. 4. Relationships are set both ways so between two nodes there are two relationships with different types.2 else (the previous a is consistent) 3. Neo4j 15 2. the main way of finding the right nodes should be by traversing the graph with different algorithms. one going up and one going down.2.1. making sure that only nodes in the right direction gets traversed.1. 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.2. setting up tables and similar things. Because the indexing is separate from the database it is possible to . The amount of code needed to handle calls to the database.2 Neo4j Neo4j is a graph database and as such it uses nodes and vertices to store data.2.2 Strengths and weaknesses The implementation of PostgreSQL was the first one. A property is a key that is a string and a value.1 set this a-value as inconsistent 2. A relationship can also have several properties just like the nodes.2 save all data in the return structure 3.1 is the previous a inconsistent 3. 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. a string or an array of primitives or strings.2. All attributes in a node are stored as properties and the relationships are set as the nodes get entered into the database. The value must be one of Javas primitive types. since this was the database most familiar from previous experience. To index the nodes this solution uses the LucenIndexService that is closely integrated in the database but not a part of it. There is a big hurdle to get over in order to do things nicely and efficiently. 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. exceptions and similar things is massive.4. Since the data is in a graph structure there was no need to think of any other structure for storing the data.2 else (the C is different meaning an inconsistent tree) 2.1.1 set the return structure as inconsistent 3.1 discard all saved data 4 set this row as the previous row 4.

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

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

This means that several nodes may get visited more than once and that is not optimal. In Figure 3.18 Chapter 4. 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. Therefore this solution uses the naive approach and lets the same C node get explored several times.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. 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. . The search is not hard. The inconsistency check was hard to do in Berkley DB.1: An example of how a shared property gets duplicated in Berkeley DB 4. If a Berkeley DB object could be returned the search methods would consist of only one line of code. getting the right node from database and finding all C nodes it connects to. see Figure 4. Returning a sub tree needs the database to first get the right A node then looping all B nodes. It then needs to do the same for all C nodes to get all D nodes.1.3.2 there is a shared property between the nodes. The difference here is in the speed of the initial search since it is done twice. When doing this some information about relationships between the nodes are lost. Figure 4. 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. Getting down the tree is fairly easy with Berkeley DB as with both the other databases. 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. The solutions the reverse is done to make sure the correct type of object gets returned. the id of the C nodes is set to be a secondary index and the search is simple but possibly time consuming. The difference between two sub trees is handled in much the same way as with the other databases. In the other two there is also information on how to get up the tree but this information does not exist in Berkeley DB. 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.

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. Those tests were only to test the functionality but even then it was a clear difference in the speed of the test program.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. Berkely DB 19 The supervisor at Tieto. 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. 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. Hashtable<String. Anders Martinsson.3. . The author of this paper has tried to find some graphical program to view the data in the database and handle it manually.4.3. 4. The inner hashtable have the C node for key and then a list of B nodes for value. then that a-value is in more than one C node and the tree is inconsistent. Then first tested on the developing machine the first reaction was that it was really fast. The outer hashtable have the a-value as key and a hashtable as the value. If so. No such program has been found but it would be good if it existed. The hashtable has the structure Hashtable<String.

The solutions .20 Chapter 4.

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

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

2: Client times for 10% of the data without PostgreSQL than for 10%. .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. 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.

5 40 1 20 0. Results 0.05 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. Figure 5.2 0.2 0.8 0.1 0.3: Total time for the server. 3.24 Chapter 5.2 0 0 0 2 4 6 8 Question number 10 12 14 (a) 0.5 PostgreSQL Neo4J BerkeleyDB 100 3 80 Time in seconds Time in seconds 0 2 4 6 8 Question number 10 12 14 2. (d) 100 % of the data.4 PostgreSQL Neo4J BerkeleyDB Hash table 0.5 0 0 0 2 4 6 8 Question number 10 12 14 (c) 10 % of the data.5 2 60 1.4 0.15 0.35 PostgreSQL Neo4J BerkeleyDB Hash table 1.6 0.1 % of the data.3 1.

1% Time in seconds PostgreSQL Neo4J BerkeleyDB Hash table 9000 8000 7000 6000 5000 4000 3000 2000 1000 0 0.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.4: Client times for question 1-6 .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.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% 1% Amount of data 10% 100% 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.

26 Chapter 5. 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.5: Total time for the client for question 7 at different amounts of data .

1% 1% Amount of data 10% 100% 0 0.1% 1% Amount of data 10% 100% (e) Question 12 (f) Question 13 Figure 5.5 500 0 0.5 Time in seconds 1% Amount of data 10% 100% 2000 1 1500 1000 0.1% 1% Amount of data 10% 100% (c) Question 10 2.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.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.6: Client times for question 8-13 .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.

28 Chapter 5. Results .

Chapter 6 Conclusions In this paper a question was asked. The real data have some properties that are excluded from this first test to make the task a little easier. This was a surprising result especially that it was faster even for the more graphical questions. All three were implemented as a Web service and their performance was measured. 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. even for the questions that are closely connected to the graphical aspect of the data. The results were pretty clear. version 1. the database that is the best at handling the data is Berkeley DB. A good first step would be to identify these and start implementing them as well to see if the results still hold. 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. 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. Neo4j needs time to mature and become a more stable product before suits companies such as Tieto. 6. Even though it data fits the graphical model the best Neo4j just was not fast enough to be able to use its advantage. The first version of Neo4j was released in February of 2010.1 Future work The results are promising and there is definitely worth a continued development of the Berkeley DB part of the solution. 29 . 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. There is also the problem with the maturity of the product. A third and completely different database was needed and Berkeley DB is a key value store that had all the qualities.

30 Chapter 6. Conclusions .

Without him this master thesis would not have existed since the whole thing was his idea.Chapter 7 Acknowledgements I would like to start by thanking my supervisor at Tieto. I also thank everyone at Tietos office in Ume˚ for making my workday a a pleasant time. 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. 31 . I thank internal supervisor at the department of Computing Science at Ume˚ Universitet. a Ola ˚gren.

32 Chapter 7. Acknowledgements .

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

34 REFERENCES .

16 24.86 5.6 27.2 326 27.06033 2.5486 0.3518 0.14 12.709 8.36 297.06052 3.83 29.13 32.37 12.421 0.1647 0.1657 0.457 18.1% of the data.2868 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Table A.3281 0. Time in milliseconds.7852 0.49 68.813 0.2815 0.4028 0.59 27.09877 Neo4j trim 0.6 0.1 53.704 18.0664 0.17 5.06893 0.4147 0.05725 0.1 Server times mean 13.713 mean 0. The values for the Hash table did not fit in the table with the others and therefore it is in its own table.Appendix A Data from test runs Here is the raw data from the test runs.1889 0.5271 0.18 1.679 8.22 3.7051 0.8562 0.3445 Berkeley DB trim median 0.97 32.3003 0.37 53.41 298.7 297.89 28.4 326.36 0.05806 0.9 27.134 8.7952 0.4977 0.114 0.74 32.5257 0.98 25.74 27.29 15.04722 3.04666 0.7108 82.04629 3. A.909 18.05615 0.288 59.9 12.09073 0.285 5.2452 0.3681 0. The server times are rounded to 4 significant digits.1 28.53 29.67 1.648 8.4973 0.41 12.8656 0.715 1.0648 3.29 3.8853 0.52 59.4 326. 35 .346 0.09068 0.47 3.978 16.563 0.408 59.297 16.722 PostgreSQL trim median 13.403 9.09334 mean 0.3437 0.295 2.09009 0.09506 median 0.6 25.5086 0.36 9.1: The server times for 0.53 0.1078 0.1964 0.3765 0.43 53.06775 0.1363 0.7035 81.619 0.38 0.575 0.

7107 105.3 209.8 0.015 21.08651 9.2 49.15 29.3 0.075 17.02161 3.499 0.22 1.54 61.1364 0.338 60.5008 1.03149 0.206 8.1742 119.3 33. Time in milliseconds.018 4.418 0.9945 37.1218 0.9 0.3 3.8292 3.9066 74.8 106.11 160.58 18.27 46.54 median 0.09 31.17 32.2 1096 1098 566.1775 5.09 65. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 61.33 60.0829 0.02163 3.3035 mean 0.49 27.368 Neo4j trim 0.238 median 0.187 120 3.36 Chapter A.08234 3.9 3.7133 107. Data from test runs Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 18.6 105.064 199.072 200.1 161.037 6.2 1807 1806 6.57 39.14 1.37 36.81 74.072 3641 27.3028 median 0.745 21.434 PostgreSQL trim median 18.1 631.88 36.4841 0.37 1.06573 3.53 0.119 0.8173 6.37 61.76 1.1265 0.9 209.245 0.1026 0.48 21.03206 0.1757 5.21 1.1246 0.9 0.481 74.1761 5.4 1044 26.3 0.62 37.7 567.37 39.811 0.69 3.08166 0.48 mean 0.9 209.5 85.05555 0.82 39.1332 0.347 69.795 14.9983 0.97 8.2 3.01 25.9 163.1 161.8 187.09 25.8 17.91 0.24 37.3105 Neo4j trim 0.266 319.5 PostgreSQL trim median 61.8 Table A.04 32.807 0.429 mean 0.4 201.2: The server times for 1% of the data.4 1097 567.42 114.1559 120.04 64.5108 0.05541 0.05767 0.91 27.429 3.87 159.066 1.237 mean 0.335 3639 3637 27.676 21.692 Berkeley DB trimmean 0.4963 0.7109 0.62 61.47 86.8298 3.33 1.59 1.08425 3.929 8.32 0.71 1.9761 6.9 113.0554 0.44 179.1131 0.23 32.118 21.734 14.1018 9.91 17.136 Table A.9 0.2 5.08 0.7 159.833 0.59 46.007 37.08158 0.3: The server times for 10% of the data.8452 3.4027 0.7 3.1335 0.21 0.0664 3.23 46.4 1.9 5.3 631.1 Berkeley DB trim median 0.06115 0.06575 3.3 54.03178 0.94 120.95 18.94 105.099 0.267 17.77 113.8 375.7 1808 6.6008 6.03 179.5 1. Time in milliseconds.4238 0.381 17.76 381.1032 0.06133 0.3 1061 1092 26.4 0.239 5.51 382.004 21.2 318.09598 9.388 0.29 17.024 4. .4219 0.75 61.76 65.016 4.93 30.99 31.668 15.08418 0.4153 0.0218 3.13 25.96 31.225 319.89 105.4 639.

001467 0.95 14.004174 0.001518 0.009677 0.01594 0.38 17.001157 0.001563 0.7 410.4 25.00142 0.4: The server times for 100% of the data.22 46.53 563.6575 11.62 11.0371 0.5411 0.95 32.1213 0.2 57.97 0.8 55.5: The server times for the hash table.05 4058 4058 52890 52660 18.648 442.21 36.7 19.1872 0.5779 21.01621 0.5 24.5 599.3 PostgreSQL trim median 492.0187 0.03111 0.7 17.9 490.07 378 3.1217 0.007589 0.14 18.02186 0.05172 0.239 0.91 740.001744 0.03605 1.001897 0.008888 0.001531 0.1925 0.0167 mean 0.02466 1.5 1136 Berkeley DB trim median 1.001787 0.02497 1.65 111900 112200 373.55 0.05084 0.896 0.02483 1.87 14.14 11.0408 0.001779 0.65 112400 374.0406 0.147 0.301 3.6 747.11 262.008618 0.7 492.8 193 3.7 462.03216 0.6 495.5 291 249.6 2144 2135 462.001185 0.001897 0.6278 0.3 163.88 153 22.009106 0.1226 0.03555 0.001189 0.001573 0.7 93.008348 0.001518 0.644 504.09 22.93 394. Time in milliseconds.7 4096 4092 524.009106 0.05122 0.332 0.6 495.269 5.01792 0.134 0.1867 0.9 338.8 mean 55.001518 0.8 1134 1133 Table A.02125 0.8852 Table A.008475 0.5432 0.4 4075 584.71 8455 16 22320 1540 Neo4j trim median 17.001518 0.302 5.261 0.01769 0.005718 0.008419 0.293 0.56 9.06412 mean 0.001138 0.001719 0.8 558.114 0.0172 median 0.004403 0.89 562.2 84.04063 0.001518 0. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 0.007546 1.001521 0.366 0.8829 median 0.832 22540 22750 1505 1489 mean 1.87 90.1.006041 0.03593 1.6377 0.005312 0.669 5.001458 0.8 2153 463.01608 0.242 0.001138 0.03602 1.07295 median 0.006071 1.1% trim 0.5044 0.001579 0.97 22.5589 21.01404 0. Time in milliseconds.5 77.72 4059 52980 21.5593 0.794 63.001569 0.03529 0.233 0.9 371.14 157.6182 11.00144 0.37 8.A.08085 1% trim 0.56 0.8914 10% trim 0.008829 0.4 693.12 8.5 495.99 740.2 8473 8559 12.9 697.05151 0.009643 0.2831 0.6003 0. .631 0.5418 0.37 353.05229 0.5 357.7 761.8 731.365 0.2556 0.006902 1.008697 0.00117 0.366 0.05061 0.4637 0.004694 0. Server times 37 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 mean 501.02147 0.03121 0.1 19.

PostgreSQL 39.4 75.2 Client times Here are the times recordeed by the server in seconds.1 4.502 1.038 67 19.7 3.7 11.6 10.59 182.75 26.142 38.9 61.3 3.42 74.377 31.1 3.776 0.402 3.743 45.7 262.9 97.221 1.86 1. .233 1.35 139.59 Hash table 1.455 1.29 181.53 8.485 Berkeley DB 1.745 0.7 285.357 0.66 3.6: Client times for all test runs at 0.38 Chapter A.6 268.891 Neo4j 1.561 6.431 7.006 Table A.15 876.28 0.54 198.9 133.383 1.83 Hash table 1.239 0.7 175.72 2.52 Neo4j 2.2 63.984 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Table A.84 37. Data from test runs A.397 32. Neo4j and PostgreSQLs times are multiplied with appropriate scalar to give a time for comparison.065 0.192 242.52 83.195 Berkeley DB 2.952 30.31 1.22 0.16 11.837 39.22 8.8 457 1491 2754 57.8 4.7: Client times for all test runs at 1%.8 350.7 641.84 127.94 7.6 263.962 0.296 0. Time in seconds.58 698.645 1.674 4.341 5.5 7.6 905.1%.889 5. This is the total time for 2048 test runs.217 1.92 139.2 215.872 31. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 PostgreSQL 29.147 37.74 2.57 0.33 73.7 791. Time in seconds.958 3.8 197.91 63.983 0.722 23.02 152.007 0.875 9.62 182.266 4.956 63.687 23.004 1.

1 193. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 PostgreSQL 1032 1018 48.36 7932 58.2 334.127 2.5 9.7 Hash table 1.9 3.8 78.437 Table A.273 26.1 0.9 3.12 204.1 19970 35.885 69.891 400.874 661. Time in seconds.143 7.44 9654 2349 Table A.2 114.96 193 360.041 9.67 3758 52.37 494.14 328.14 7.8 574.4 2.7 Neo4j 116.62 9.A.794 496.2.3 4.38 50860 3186 Berkeley DB 4.1 838.998 1.5 254.68 1181 1710 4659 961.2 481.6 8604 1212 1423 201.38 2.1 844.262 31.9 41.9: Client times for all test runs at 100%.7 428.628 1.9 126.899 Berkeley DB 1.56 198. Client times 39 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 PostgreSQL 127.478 436.8: Client times for all test runs at 10%.405 762.533 53.457 0.7 236. .34 235200 789.865 1.619 18.6 8322 111000 47.07 246.98 Neo4j 2.006 41.1 68. Time in seconds.6 120.193 0.5 2494 1270 113 791 3940 13.3 1.51 154.6 2.