A Random Walk Approach to Sampling Hidden Databases
Summary: Random-walk over the interface query space to obtain a uniform sample of a hidden backend database accessed via form-like web interfaces. Fixed vs random attribute ordering and a probabilistic rejection technique improve sample quality; extensive experiments show accuracy and efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Arjun Dasgupta (University of Texas)
- 2. Gautam Das (University of Texas)
- 3. Heikki Mannila (Helsinki Institute for Information Technology; Helsinki University of Technology; University of Helsinki)
BibTeX Citation
@inproceedings{dasgupta_sigmod07,
title = {{A Random Walk Approach to Sampling Hidden Databases}},
author = {Dasgupta, Arjun and Das, Gautam and Mannila, Heikki},
series = {{SIGMOD} '07},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1247480.1247550},
url = {https://dl.acm.org/doi/10.1145/1247480.1247550},
year = {2007}
}
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 36 | Accurate Estimation Of The Number Of Tuples Satisfying A Condition | 1984 | SIGMOD | 0.00047863192 |
| 348 | Crawling the Hidden Web | 2001 | VLDB | 0.00020262145 |
| 372 | Approximate Query Processing: Taming the TeraBytes! A Tutorial | 2001 | VLDB | 0.00019720059 |
| 1,631 | Automatic Discovery of Language Models for Text Databases | 1999 | SIGMOD | 0.00010022634 |
| 1,826 | Effective Use of Block-Level Sampling in Statistics Estimation | 2004 | SIGMOD | 9.5575424e-05 |
| 3,871 | A Bi-Level Bernoulli Scheme for Database Sampling | 2004 | SIGMOD | 6.9543581e-05 |
| 4,610 | Probe, Count, and Classify: Categorizing Hidden-Web Databases | 2001 | SIGMOD | 6.5030302e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,785 | Privacy Preservation of Aggregates in Hidden Databases: Why and How? | 2009 | SIGMOD |
| 2 | 1,517 | Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection | 2002 | VLDB |
| 3 | 4,610 | Probe, Count, and Classify: Categorizing Hidden-Web Databases | 2001 | SIGMOD |
| 4 | 12,576 | Rank Discovery From Web Databases | 2013 | VLDB |
| 5 | 175 | Simple Random Sampling from Relational Databases | 1986 | VLDB |
| 6 | 14,053 | HDSampler: Revealing Data Behind Web Form Interfaces | 2009 | SIGMOD |
| 7 | 8,210 | Approximating Aggregate Queries about Web Pages via Random Walks | 2000 | VLDB |
| 8 | 8,833 | Unbiased Estimation of Size and Other Aggregates Over Hidden Web Databases | 2010 | SIGMOD |
| 9 | 9,856 | Optimal Algorithms for Crawling a Hidden Database in the Web | 2012 | VLDB |
| 10 | 12,675 | Randomized Generalization for Aggregate Suppression Over Hidden Web Databases | 2011 | VLDB |