Database Paper Browser

Back to papers

Approximating Aggregate Queries about Web Pages via Random Walks

Summary: Random-walk based approach to approximate web-page aggregates; a novel walk on a dynamically built regular undirected graph yields near-uniform samples. Estimates search-engine coverage, domain composition, and average page size with strong empirical accuracy under limited resources. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8678
Venue
VLDB
Year
2000
Pagerank
4.6688065e-05
Overall Rank
7,718 | 46.31%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,363 An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs 2022 VLDB 4.7523184e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers