ACM Home Page
Please provide us with feedback. Feedback
Site-based dynamic pruning for query processing in search engines
Full text PdfPdf (206 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Singapore, Singapore
POSTER SESSION: Posters group 5: structured IR, ranking, classification and filtering table of contents
Pages 861-862  
Year of Publication: 2008
ISBN:978-1-60558-164-4
Authors
Ismail Sengor Altingovde  Bilkent University, Ankara, Turkey
Engin Demir  Bilkent University, Ankara, Turkey
Fazli Can  Bilkent University, Ankara, Turkey
Özgür Ulusoy  Bilkent University, Ankara, Turkey
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 91,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390334.1390543
What is a DOI?

ABSTRACT

Web search engines typically index and retrieve at the page level. In this study, we investigate a dynamic pruning strategy that allows the query processor to first determine the most promising websites and then proceed with the similarity computations for those pages only within these sites.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
4
5
6
 
7
Silvestri, F. Sorting out the document identifier assignment problem. In ECIR'07, 101--112, 2007.
8

Collaborative Colleagues:
Ismail Sengor Altingovde: colleagues
Engin Demir: colleagues
Fazli Can: colleagues
Özgür Ulusoy: colleagues