ACM Home Page
Please provide us with feedback. Feedback
Pruning strategies for mixed-mode querying
Full text PdfPdf (175 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the 15th ACM international conference on Information and knowledge management table of contents
Arlington, Virginia, USA
SESSION: Indexing and pruning table of contents
Pages: 190 - 197  
Year of Publication: 2006
ISBN:1-59593-433-2
Authors
Vo Ngoc Anh  The University of Melbourne, Victoria, Australia
Alistair Moffat  The University of Melbourne, Victoria, Australia
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 70,   Citation Count: 5
Additional Information:

abstract   references   cited by   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/1183614.1183645
What is a DOI?

ABSTRACT

Web information retrieval systems face a range of unique challenges, not the least of which is the sheer scale of the data that must be handled. Also specific to web retrieval is that queries may be a mix of Boolean and ranked features, and documents may have static score components that must also be factored into the ranking process. In this paper we consider a range of query semantics used in web retrieval systems, and show that impact-sorted indexes provide support for dynamic pruning mechanisms and in doing so allow fast document-at-a-time resolution of typical mixed-mode queries, even on relatively large volumes of data. Our techniques also extend to more complex query semantics, including the use of phrase, proximity, and structural constraints.


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
V. N. Anh and A. Moffat. Structured index organizations for high-throughput text querying. In Proc. Symp. String Processing and Information Retrieval, pages 304--315, Glasgow, Scotland, October 2006b. LNCS 4209, Springer.
5
6
7
 
8
C. L. A. Clarke and F. Scholer. The TREC 2005 Terabyte Track. In The Fourteenth Text REtrieval Conference (TREC 2005) Notebook, Gaithersburg, MD, November 2005. National Institute of Standards and Technology. http://trec.nist.gov/act_part/t14_notebook/t14.notebook.html.
9
 
10
D. K. Harman and G. Candela. Retrieving records from a gigabyte of text on a minicomputer using statistical ranking. Journal of the American Society for Information Science, 41(8):581--589, August 1990.
11
12
 
13
N. Lester, A. Moffat, W. Webber, and J. Zobel. Space-limited ranked query evaluation using adaptive pruning. In A. H. H. Ngu, M. Kitsuregawa, E. J. Neuhold, J.-Y. Chung, and Q. Z. Sheng, editors, Proc. 6th International Conference on Web Information Systems Engineering, pages 470--477, New York, November 2005. LNCS 3806, Springer.
 
14
15
16
17
18
 
19
 
20
21


Collaborative Colleagues:
Vo Ngoc Anh: colleagues
Alistair Moffat: colleagues