Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Need a better algorithmic design #20

Open
tomrittervg opened this issue Mar 26, 2012 · 1 comment
Open

Need a better algorithmic design #20

tomrittervg opened this issue Mar 26, 2012 · 1 comment

Comments

@tomrittervg
Copy link
Member

See http://swtch.com/~rsc/regexp/regexp4.html

@tomrittervg
Copy link
Member Author

Other ideas for performance improvement:

  • Change the commitwordmap_tbl to have one row per unique word, and the second column is a comma seperated list of commitids.
  • Change the commitwordmap_tbl to have commitid,uniquewordid, and a second table uniqueword_tbl containing the uniquewordid and word
  • Store nonexistance of words on a per-commit basis; no words between [a-adversary)
  • Store the nonexistance of words on a global basis, so if you search for something I know if it doesn't exist and don't have to consult database for anything.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant