David Hawking

David Hawking

Auto-generated profile, based on publicly available information

David Hawking

Australian National University

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2001 in Information Retrieval Journal
Verified
Journal Article
Closed access
PDF file
DHDavid Hawking
David Hawking
NCNick Craswell
Nick Craswell
PBPeter Bailey
Peter Bailey
KGKathleen Griffihs
Kathleen Griffihs

1 September 2001
Verified
Conference Paper
Open access
PDF file
NCNick Craswell
Nick Craswell
DHDavid Hawking
David Hawking
SRStephen Robertson
Stephen Robertson

23 July 2007
Verified
Conference Paper
Open access
PDF file
ATAndrew Turpin
Andrew Turpin
YTYohannes Tsegay
Yohannes Tsegay
DHDavid Hawking
David Hawking
HWHugh E. Williams
Hugh E. Williams

1 November 2003 in Information Processing & Management
Verified
Journal Article
Closed access
PBPeter Bailey
Peter Bailey
NCNick Craswell
Nick Craswell
DHDavid Hawking
David Hawking

1 May 1999 in Computer Networks
Verified
Journal Article
Closed access
DHDavid Hawking
David Hawking
NCNick Craswell
Nick Craswell
PTPaul Thistlewaite
Paul Thistlewaite
DHDonna Harman
Donna Harman

1 January 1999 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
DHDavid Hawking
David Hawking
PTPaul Thistlewaite
Paul Thistlewaite
The problem of using a broker to select a subset of available information servers in order to achieve a good trade-off between document retrieval effectiveness and cost is addressed. Server selection methods which are capable of operating in the absence of global information, and where servers have no knowledge of brokers, are investigated. A novel method using Lightweight Probe queries (LWP method) is compared with several methods based on data from past query processing, while Random and Optimal server rankings serve as controls. Methods are evaluated, using TREC data and relevance judgments, by computing ratios, both empirical and ideal, of recall and early precision for the subset versus the complete set of available servers. Estimates are also made of the best-possible performance of each of the methods. LWP and Topic Similarity methods achieved best results, each being capable of retrieving about 60% of the relevant documents for only one-third of the cost of querying all servers. Subject to the applicable cost model, the LWP method is likely to be preferred because it is suited to dynamic environments. The good results obtained with a simple automatic LWP implementation were replicated using different data and a larger set of query topics.