Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Bottleneck

  • Parse and build postings entries one doc at a time

  • Now sort postings entries by term (then by doc within each term)

  • Doing this with random disk seeks would be too slow

    – must sort T=100M records

                                                                        ↑                     
If every comparison took 2 disk seeks, and N items could be sorted with N log2N comparisons, how long would this take?

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.