Ktreeforest: Efficient Indexes for Boolean Queries - PowerPoint PPT Presentation

The presentation will start after a short
(15 second) video ad from one of our sponsors.

Hot tip: Video ads won’t appear to registered users who are logged in. And it’s free to register and free to log in!
View by Category
About This Presentation

Ktreeforest: Efficient Indexes for Boolean Queries


BST-based inverted file using merge or scan technique. K-tree. Queries of ... BST-based inverted file 31.26. K-tree (parallel) 25.36. K-tree (sequential) 37.05 ... – PowerPoint PPT presentation

Number of Views:29
Avg rating:3.0/5.0
Slides: 12
Provided by: scie231
Learn more at: http://www2.cs.uh.edu


Write a Comment
User Comments (0)
Transcript and Presenter's Notes
About PowerShow.com