data structures - C : Store and index a HUGH amount of info! School Project -
I need to do a school project in C (I do not really know C ++ too)
I need a data structure to indicate every word of approximately 34k documents, there are so many words in it, and some rankings need to be done about the words, I already have this project I used to have a hash table of school and back (this year) and a binary tree of about 2 years ago, but I got a small grade reason because my project made all the words It took about 2 hours to make an indication. I need something a little faster ... any kind of possibilities?
Tkz Roberto
If you have the option, then I have a database engine ( MSSQ, MySQL, etc.) because it is exactly the type of dataset and operation that has been written for them. Not to change the best wheel again.
Otherwise, why use absolutely btree? What you have described (and I think we are probably not getting the full story ...) should be useful in the form of a key in the form of a key in the table and its rank / count should be useful?
Comments
Post a Comment