arangodb

I am currently on design phase of a MMO browser game, game will include tilemaps for some real time locations (so tile data for each cell) and a general world map. Game engine I prefer uses MongoDB for persistent data world. I will also implement a shipping simulation (which I will explain more below) which is basically a Dijkstra module, I had decided to use a graph database hoping it will make things easier, found Neo4j as it is quite popular. I was happy with MongoDB + Neo4J setup but then noticed OrientDB , which apparently acts like both MongoDB and Neo4J (best of both worlds?), they even

I am evaluating ArangoDB and trying to create multiple graphs that might contain same node collections and same edge collections - even though each graph might contain different physical documents and edges. However when trying to create a graph that would use an edge collection that is already used in another graph I am getting " [1921] ... edge collection already used in edge def " error. Why can't graphs reuse existing relationships when it is possible for graphs to share same document collections and documents? To work around this issue I have to create a separate uniquely-named edge

Having a document of a following structure: { path: String, enabled: Long, disabled: null || Long, // other fields... } I would like to look the documents up by a combination of path's prefix and numerical relation between some number and document's timestamps: (pseudocode) SELECT e FROM entries WHERE e.path STARTS WITH "somePrefix" AND e.enabled <= timestamp AND ( e.disabled == null OR timestamp < e.disabled ) What index structure will I benefit from the most, if any? Should I have a non-sparse skiplist index on enabled field + a sparse one on disabled and a fulltext non-sparse one on the

I have a graph with three collections which items can be connected by edges. ItemA is a parent of itemB which in turn is a parent of itemC. Elements only can be connected by edges in direction "_from : child, _to : parent" Currently I can get only "linear" result with this AQL query: LET contains = (FOR v IN 1..? INBOUND 'collectionA/itemA' GRAPH 'myGraph' RETURN v) RETURN { "root": { "id": "ItemA", "contains": contains } } And result looks like this: "root": { "id": "itemA", "contains": [ { "id": "itemB" }, { "id": "itemC" } ] } But I need to get a "hierarchical" result of graph traversal

I have been looking for a database that can be embedded and also be file-based, like Sqlite. I wanted a NoSQL type of database with this kind of feature. The language is Python, and ArangoDB has binding for Python, and many other languages. I am finding conflicting facts about ArangoDB. In some cases I have seen articles say it is not an embedded DB, or can't be embedded, then see others that imply it is embedded. Also on the website it says that it stores its data in a special binary format, and then I see an article saying its mainly an In-Memory database. So its been very confusing. 1)So

I am trying to understand what the limits of Arangodb are and what the ideal setup is. From what I have understood arango stores all the collection data in the virtual memory and ideally you want this to fit in the RAM. If the collection grows and cannot fit in the RAM it will be swapped to disk. So my first question. If my db grows will I need to adjust the swap partition/file to accommodate the db? Since arango also syncs the data to disk does this mean that the data will always be located in the RAM and disk? So if I have a db that's 1.5GB and my RAM is 1GB I will need to at least have 0

I am trying to update the attribute on a json document in an embedded array using AQL. How do i update the "addressline" for "home" type address using AQL below? User: { name: "test", address: [ {"addressline": "1234 superway", type:"home"}, {"addressline": "5678 superway", type:"work"} ] } AQL Attempt so far for u in users for a in u.address FILTER a.type='home' UPDATE u WITH {<What goes here to update addressline?>} in users Thank you for the help. Regards, Anjan dothebart To do this we have to work with temporary variables. We will collect the sublist in there and alter it. We choose a