{"action":"created","issue":{"url":"https://api.github.com/repos/BitFunnel/BitFunnel/issues/155","repository_url":"https://api.github.com/repos/BitFunnel/BitFunnel","labels_url":"https://api.github.com/repos/BitFunnel/BitFunnel/issues/155/labels{/name}","comments_url":"https://api.github.com/repos/BitFunnel/BitFunnel/issues/155/comments","events_url":"https://api.github.com/repos/BitFunnel/BitFunnel/issues/155/events","html_url":"https://github.com/BitFunnel/BitFunnel/issues/155","id":171799203,"number":155,"title":"TermTableBuilder strategy for small number of adhoc rows","user":{"login":"MikeHopcroft","id":15354983,"avatar_url":"https://avatars.githubusercontent.com/u/15354983?v=3","gravatar_id":"","url":"https://api.github.com/users/MikeHopcroft","html_url":"https://github.com/MikeHopcroft","followers_url":"https://api.github.com/users/MikeHopcroft/followers","following_url":"https://api.github.com/users/MikeHopcroft/following{/other_user}","gists_url":"https://api.github.com/users/MikeHopcroft/gists{/gist_id}","starred_url":"https://api.github.com/users/MikeHopcroft/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/MikeHopcroft/subscriptions","organizations_url":"https://api.github.com/users/MikeHopcroft/orgs","repos_url":"https://api.github.com/users/MikeHopcroft/repos","events_url":"https://api.github.com/users/MikeHopcroft/events{/privacy}","received_events_url":"https://api.github.com/users/MikeHopcroft/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2016-08-18T01:36:30Z","updated_at":"2016-08-18T01:56:30Z","closed_at":null,"body":"Right now the TermTableBuilder ensures that the TermTable never has less than 1000 rows at each rank. This is to ensure that small corpuses with no adhoc terms will produce workable TermTables (if adhocRowCount == 0, we get a divide by zero during the mod operation in TermTable::GetRowIdAdhoc()).\r\n\r\nThe current floor of 1000 rows wastes memory since all ranks have 1000 rows, even if they aren't used."},"comment":{"url":"https://api.github.com/repos/BitFunnel/BitFunnel/issues/comments/240602563","html_url":"https://github.com/BitFunnel/BitFunnel/issues/155#issuecomment-240602563","issue_url":"https://api.github.com/repos/BitFunnel/BitFunnel/issues/155","id":240602563,"user":{"login":"MikeHopcroft","id":15354983,"avatar_url":"https://avatars.githubusercontent.com/u/15354983?v=3","gravatar_id":"","url":"https://api.github.com/users/MikeHopcroft","html_url":"https://github.com/MikeHopcroft","followers_url":"https://api.github.com/users/MikeHopcroft/followers","following_url":"https://api.github.com/users/MikeHopcroft/following{/other_user}","gists_url":"https://api.github.com/users/MikeHopcroft/gists{/gist_id}","starred_url":"https://api.github.com/users/MikeHopcroft/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/MikeHopcroft/subscriptions","organizations_url":"https://api.github.com/users/MikeHopcroft/orgs","repos_url":"https://api.github.com/users/MikeHopcroft/repos","events_url":"https://api.github.com/users/MikeHopcroft/events{/privacy}","received_events_url":"https://api.github.com/users/MikeHopcroft/received_events","type":"User","site_admin":false},"created_at":"2016-08-18T01:56:29Z","updated_at":"2016-08-18T01:56:29Z","body":"Can we estimate the number of adhoc rows needed by extrapolating and then integrating the document frequency curve."}}
{"actor":{"display_login":"MikeHopcroft"}}