Database Paper Browser

Back to papers

Optimal Algorithms for Crawling a Hidden Database in the Web

Summary: Algorithms to extract all tuples from a hidden web database via a query-only interface, even when results are partial. Provably efficient in the worst case and asymptotically optimal, with extensive experiments on real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10351
Venue
VLDB
Year
2012
Pagerank
5.3165429e-05
Overall Rank
9,541 | 33.69%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
8,256 Discovering the Skyline of Web Databases 2016 VLDB 5.5215308e-05
8,554 Progressive Deep Web Crawling Through Keyword Queries For Data Enrichment 2019 SIGMOD 5.4726897e-05
9,440 Aggregate Estimation Over Dynamic Hidden Web Databases 2014 VLDB 5.3325274e-05
11,891 Query Reranking As A Service 2016 VLDB 5.1725247e-05
12,096 Rank Discovery From Web Databases 2013 VLDB 5.1725247e-05
13,424 HDBTracker: Monitoring the Aggregates On Dynamic Hidden Web Databases 2014 VLDB -
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers