{"action":"closed","issue":{"url":"https://api.github.com/repos/orientechnologies/orientdb/issues/4352","labels_url":"https://api.github.com/repos/orientechnologies/orientdb/issues/4352/labels{/name}","comments_url":"https://api.github.com/repos/orientechnologies/orientdb/issues/4352/comments","events_url":"https://api.github.com/repos/orientechnologies/orientdb/issues/4352/events","html_url":"https://github.com/orientechnologies/orientdb/issues/4352","id":87482746,"number":4352,"title":"Recommended approach for handling a vertex with many (millions) of edges","user":{"login":"nmcintyre2014","id":8569560,"avatar_url":"https://avatars.githubusercontent.com/u/8569560?v=3","gravatar_id":"","url":"https://api.github.com/users/nmcintyre2014","html_url":"https://github.com/nmcintyre2014","followers_url":"https://api.github.com/users/nmcintyre2014/followers","following_url":"https://api.github.com/users/nmcintyre2014/following{/other_user}","gists_url":"https://api.github.com/users/nmcintyre2014/gists{/gist_id}","starred_url":"https://api.github.com/users/nmcintyre2014/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/nmcintyre2014/subscriptions","organizations_url":"https://api.github.com/users/nmcintyre2014/orgs","repos_url":"https://api.github.com/users/nmcintyre2014/repos","events_url":"https://api.github.com/users/nmcintyre2014/events{/privacy}","received_events_url":"https://api.github.com/users/nmcintyre2014/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/orientechnologies/orientdb/labels/performance","name":"performance","color":"eb6420"},{"url":"https://api.github.com/repos/orientechnologies/orientdb/labels/waiting%20reply","name":"waiting reply","color":"eb6420"}],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":4,"created_at":"2015-06-11T20:18:55Z","updated_at":"2015-10-07T11:43:23Z","closed_at":"2015-10-07T11:43:23Z","body":"We have a case where we have many (potentially millions) of edges attached to a single graph vertex.  An example use case is that we want to be able to tag records.  To do that, we create a vertex representing the tag and link it to all records we want to tag.  The idea is that we could then traverse from the tag to get the entities with that tag.  The underlying problem is that once there are many edges associated with a vertex, operations on the vertex are very slow (even just simply trying to read a single property from the tag vertex).  Is there a recommended way to model this type of relationship in the graph db? "}}