ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
The gardener's problem for web information monitoring
Full text PdfPdf (403 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 18th ACM conference on Information and knowledge management table of contents
Hong Kong, China
POSTER SESSION: Poster session 2: DB track table of contents
Pages: 1525-1528  
Year of Publication: 2009
ISBN:978-1-60558-512-3
Authors
Byron J. Gao  Texas State University - San Marcos, San Marcos, TX, and University of Wisconsin - Madison, Madison, WI, USA
Mingji Xia  University of Wisconsin - Madison, Madison, WI, USA
Walter Cai  Memorial High School, Madison, WI, USA
David C. Anastasiu  Texas State University - San Marcos, San Marcos, TX, USA
Sponsors
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): 10,   Downloads (12 Months): 28,   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/1645953.1646162
What is a DOI?

ABSTRACT

We introduce and theoretically study the Gardener's problem that well models many web information monitoring scenarios, where numerous dynamically changing web sources are monitored and local information needs to be periodically updated under communication and computation capacity constraints. Typical such examples include maintenance of inverted indexes for search engines and maintenance of extracted structures for unstructured data management systems. We formulate a corresponding multicriteria optimization problem and propose heuristic solutions.


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
E. Coffman, Z. Liu, and P. Weber. Optimal robot scheduling for web search engines. Journal of Scheduling, (1):15--29, 1998.
 
6
C. S. David R. Karger and J. Wein. Scheduling Algorithms. Algorithms and Theory of Computation Handbook, 1998.
 
7
A. Doan et al. Community information management. IEEE Data Engineering Bulletin, 29(1):64--72, 2006.
8
 
9
 
10
M. Pinedo. Scheduling - Theory, Algorithms, and Systems. Prentice Hall, 1995.
 
11

Collaborative Colleagues:
Byron J. Gao: colleagues
Mingji Xia: colleagues
Walter Cai: colleagues
David C. Anastasiu: colleagues