Header

UZH-Logo

Maintenance Infos

Rewriting queries for web searches that use local expressions


Grütter, Rolf; Helming, Iris; Speich, Simon; Bernstein, Abraham (2011). Rewriting queries for web searches that use local expressions. In: 5th International Symposium on Rules (RuleML 2011), Barcelona, Spain, 19 July 2011 - 21 July 2011, 345-359.

Abstract

Users often enter a local expression to constrain a web search to ageographical place. Current search engines’ capability to deal with expressionssuch as “close to” is, however, limited. This paper presents an approach thatuses topological background knowledge to rewrite queries containing localexpressions in a format better suited to standard search engines. To formalizelocal expressions, the Region Connection Calculus (RCC) is extended byadditional relations, which are related to existing ones by means of compositionrules. The approach is applied to web searches for communities in a part ofSwitzerland which are “close to” a reference place. Results show that queryrewriting significantly improves recall of the searches. When dealing withapprox. 30,000 role assertions, the time required to rewrite queries is in therange of a few seconds. Ways of dealing with a possible decrease ofperformance when operating on a larger knowledge base are discussed.

Abstract

Users often enter a local expression to constrain a web search to ageographical place. Current search engines’ capability to deal with expressionssuch as “close to” is, however, limited. This paper presents an approach thatuses topological background knowledge to rewrite queries containing localexpressions in a format better suited to standard search engines. To formalizelocal expressions, the Region Connection Calculus (RCC) is extended byadditional relations, which are related to existing ones by means of compositionrules. The approach is applied to web searches for communities in a part ofSwitzerland which are “close to” a reference place. Results show that queryrewriting significantly improves recall of the searches. When dealing withapprox. 30,000 role assertions, the time required to rewrite queries is in therange of a few seconds. Ways of dealing with a possible decrease ofperformance when operating on a larger knowledge base are discussed.

Statistics

Citations

2 citations in Web of Science®
3 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

279 downloads since deposited on 08 Aug 2012
13 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Paper), refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Informatics
Dewey Decimal Classification:000 Computer science, knowledge & systems
Language:English
Event End Date:21 July 2011
Deposited On:08 Aug 2012 13:26
Last Modified:11 Sep 2017 17:15
Publisher:Springer
Series Name:Lecture Notes in Computer Science
Number:6826
ISSN:0302-9743
ISBN:978-3-642-22545-1
Additional Information:The original publication is available at www.springerlink.com
Publisher DOI:https://doi.org/10.1007/978-3-642-22546-8_28
Other Identification Number:merlin-id:2489

Download

Download PDF  'Rewriting queries for web searches that use local expressions'.
Preview
Content: Accepted Version
Filetype: PDF
Size: 232kB
View at publisher