Site-based dynamic pruning for query processing in search engines
- 20 July 2008
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 861-862
- https://doi.org/10.1145/1390334.1390543
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 sitesKeywords
This publication has 7 references indexed in Scilit:
- Incremental cluster-based retrieval using compressed cluster-skipping inverted filesACM Transactions on Information Systems, 2008
- Efficient document retrieval in main memoryPublished by Association for Computing Machinery (ACM) ,2007
- Simplified similarity scoring using term ranksPublished by Association for Computing Machinery (ACM) ,2005
- Efficiency and effectiveness of query processing in cluster-based retrievalInformation Systems, 2004
- Static index pruning for information retrieval systemsPublished by Association for Computing Machinery (ACM) ,2001
- Retrieving and organizing web pages by “information unit”Published by Association for Computing Machinery (ACM) ,2001
- Self-indexing inverted files for fast text retrievalACM Transactions on Information Systems, 1996