Self-supervised web search for any-k complete tuples
Alexander Löser, Christoph Nagel, Stephan Pieper, Christoph Boden · 2011
A common task of Web users is querying structured information from Web pages. In this paper we propose a novel query processor for systematically discovering any-k relations from Web search results with conjunctive queries. The 'any-k' phrase denotes that retrieved tuples are not ranked by the system.