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.

B-trees handle *’s at the end of a query term

  • How can we handle *’s in the middle of query term?

    • co*tion

  • We could look up co* AND *tion in a B-tree and intersect the two term sets

    • Expensive

  • The solution: transform wild-card queries so that the *’s occur at the end

  • This gives rise to the Permuterm Index.

Speaker notes:

Content Tools


There are currently no sources for this slide.