![]() ![]() The ArangoDB approach is rather to squeeze the most onto one server (well ArangoDB supports multiple servers - but to support availability). In that case the query must be distributed over all servers (because the data you are looking for may live on any of the servers). This is for example the case if the data is distributed and the database system allows general queries. But we believe that the number of applications that truly need to store so much data that they must distribute it over a large number of servers and must therefore restrict the access pattern to key-value is very small. Note that we do believe that this approach is valid for some applications (e.g. ![]() ![]() Here the data model and the supported queries are so simple, that it is always possible to direct a query to the server (or the small number of servers) on which the requested value live. This is the route that key value stores such as Dynamo or RIAK have taken. For example it can be that the data model is very limited. We have made this decision, because distributing the data over several servers always comes at a price. The second issue is distributing the data over several servers to allow larger datasets.ĪrangoDB does not support distributing the data over several servers. And doing it inefficiently will negate the gain that we wanted to achieve through distribution. They have this restriction because distributing write requests and supporting full consistency is impossible to do efficiently. Note that most database systems follow a very similar path, i.e., they support distributing the requests either with restricted consistency guarantees or they allow writes only on one node and distribute the read requests. The first issue is distributing the request over several servers to balance the request load.ĪrangoDB will support this through synchronous replication of writes and distribution of the read requests. There are actually to separate scaling issues. What these projects need is replication for load distribution which is supported by ArangoDB. Today's computer will easily store all data on a single nodes. However, with the efficiency of modern SSD and computers, we believe that almost all projects no longer need sharding. Offering a support for fairly complex data models like graphs and documents gets into conflicts with how sharding works. monkegjinni is right, ArangoDB did not support sharding, but replication. It supersedes the shape concept / shaped JSON. Version 3.0 will bring VelocyPack, which is a binary JSON representation optimized for compactness, parseability and composeability. ArangoDB supports sharding since Version 2.0. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |