Optimal schemes for robust web extraction

Aditya Parameswaran, Nilesh Dalvi, Hector GarciaMolina, Rajeev Rastogi

Research output: Contribution to journalArticlepeer-review


In this paper, we consider the problem of constructing wrappers for web information extraction that are robust to changes in websites. We consider two models to study robustness formally: the adversarial model, where we look at the worst-case robustness of wrappers, and probabilistic model, where we look at the expected robustness of wrappers, as web-pages evolve. Under both models, we present efficient algorithms for constructing the provably most robust wrapper. By evaluating on real websites, we demonstrate that in practice, our algorithms are highly effective in coping up with changes in websites, and reduce the wrapper breakage by up to 500% over existing techniques.

Original languageEnglish (US)
Pages (from-to)980-991
Number of pages12
JournalProceedings of the VLDB Endowment
Issue number11
StatePublished - Aug 2011

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)


Dive into the research topics of 'Optimal schemes for robust web extraction'. Together they form a unique fingerprint.

Cite this