The gardener's problem for web information monitoring

Authors:
Byron J. Gao;Mingji Xia;Walter Cai;David C. Anastasiu
Affiliations:
Texas State University - San Marcos, San Marcos, TX, and University of Wisconsin - Madison, Madison, WI, USA;University of Wisconsin - Madison, Madison, WI, USA;Memorial High School, Madison, WI, USA;Texas State University - San Marcos, San Marcos, TX, USA
Venue:
Proceedings of the 18th ACM conference on Information and knowledge management
Year:
2009

Citing 7
Cited 0

Synchronizing a database to improve freshness

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
An adaptive model for optimizing performance of an incremental web crawler

Proceedings of the 10th international conference on World Wide Web
Keeping Up with the Changing Web

Computer
Minimizing Service and Operation Costs of Periodic Scheduling

Mathematics of Operations Research
Multicriteria Optimization

Multicriteria Optimization
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
Windows scheduling as a restricted version of bin packing

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

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.