A selectivity model for fragmented relations in information retrieval

Share/Save/Bookmark

Blok, Henk Ernst and Choenni, Sunil and Blanken, Henk M. and Apers, Peter M.G. (2001) A selectivity model for fragmented relations in information retrieval. [Report]

[img]
Preview
PDF
290Kb
Abstract:New application domains cause todays database sizes to grow rapidly, posing great demands on technology. Data fragmentation facilitates techniques (like distribution, parallelization, and main-memory computing) meeting these demands. Also, fragmentation might help improving effcient processing of query types such as top N. Database design and query optimization require a good notion of the costs resulting from a certain fragmentation. Our mathematically derived selectivity model facilitates this. Once its two parameters have been computed based on the fragmentation, after each (though usually infrequent) update, our model can forget the data distribution, resulting in fast and quite good selectivity estimation. We show experimental verification for Zipfian distributed IR databases.
Item Type:Report
Copyright:© 2001 CTIT
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/36661
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 202661