Dirk wrote: > Hi Gene, > > thanks for the reply! > The majority of operations performed on this matrix will be searching > for documents that contain a specific term. > > Regards, > Dirk
A natural implementation would be a table of <docname, term> pairs. Index the table on term so you can look up docnames quickly. In practice you can use an RDB to implement the table and indices. If you are rolling your own, you can use a hash table of terms whose values are lists of docnames. These amount to sparse matrix techniques as an earlier poster suggested, only more direct. Good luck! Gene --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
