{"action":"opened","issue":{"url":"https://api.github.com/repos/orientechnologies/orientdb/issues/3901","labels_url":"https://api.github.com/repos/orientechnologies/orientdb/issues/3901/labels{/name}","comments_url":"https://api.github.com/repos/orientechnologies/orientdb/issues/3901/comments","events_url":"https://api.github.com/repos/orientechnologies/orientdb/issues/3901/events","html_url":"https://github.com/orientechnologies/orientdb/issues/3901","id":67346820,"number":3901,"title":"Suggestion: use bloomfilter in traverse algorithm","user":{"login":"CasperWW","id":11570772,"avatar_url":"https://avatars.githubusercontent.com/u/11570772?v=3","gravatar_id":"","url":"https://api.github.com/users/CasperWW","html_url":"https://github.com/CasperWW","followers_url":"https://api.github.com/users/CasperWW/followers","following_url":"https://api.github.com/users/CasperWW/following{/other_user}","gists_url":"https://api.github.com/users/CasperWW/gists{/gist_id}","starred_url":"https://api.github.com/users/CasperWW/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/CasperWW/subscriptions","organizations_url":"https://api.github.com/users/CasperWW/orgs","repos_url":"https://api.github.com/users/CasperWW/repos","events_url":"https://api.github.com/users/CasperWW/events{/privacy}","received_events_url":"https://api.github.com/users/CasperWW/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-04-09T12:03:50Z","updated_at":"2015-04-09T12:03:50Z","closed_at":null,"body":"Currently the 'traverse' method speed is limited to \r\n- A. the lookup of the index engine (SB-Tree, Lucence, etc.) \r\n- B. the speed of communication with the Java client (network link).\r\n- C. The Java 'Set' data structure which has O(N). \r\nI want to suggest a bloomfilter which has O(1) complexity. Sole problem is that you must specify the size of the bloomfilter. "}}