I was reading single pass in memory indexing and had few doubts.

Why is the time complexity of SPIMI O(T) where T are the token. We know that before writing blocks to Disk, we have to sort dictionary terms. So, why don't we consider log(T) factor of it?

Also, if there is some data in memory then while performing sorting can we sort it in log(n) time if all of the main memory is exhausted?

  • 2
    $\begingroup$ Slow down. What exactly are you talking about? Read the question again, and tell me how is anyone supposed to know what your question means? $\endgroup$ – gnasher729 Sep 22 '18 at 15:38
  • $\begingroup$ @gnasher729 I am talking about the index construction for information retrieval method. Everything else is clear afaik. $\endgroup$ – NIKHIL DILIP AGRAWAL Sep 23 '18 at 10:49

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.