Article
The Gardener's Problem for Web Information Monitoring
Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM ’09
(2009)
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.
Keywords
- np-hard,
- web information monitoring,
- multicriteria maintenance scheduling,
- gardener's problem,
- olap
Disciplines
Publication Date
2009
DOI
10.1145/1645953.1646162
Publisher Statement
SJSU users: use the following link to login and access the article via SJSU databases.
Citation Information
Byron J. Gao, Mingji Xia, Walter Cai and David C. Anastasiu. "The Gardener's Problem for Web Information Monitoring" Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM ’09 (2009) p. 1525 - 1528 Available at: http://works.bepress.com/david-anastasiu/11/