Database Paper Browser

Back to papers

Extracting large-scale knowledge bases from the web

Summary: Enumerates web subgraphs as signatures of phenomena to build large-scale knowledge bases. Proposes enumeration algorithms and a data-driven web-graph evolution model; introduces Campfire, a KB of 100k+ web communities with empirical efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8608
Venue
VLDB
Year
1999
Pagerank
6.0052781e-05
Overall Rank
4,676 | 67.48%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
57 Discovering Large Dense Subgraphs in Massive Graphs 2005 VLDB 0.00065491112
388 Graph Summarization with Bounded Error 2008 SIGMOD 0.00024662272
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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 Fast Algorithms for Mining Association Rules 1994 VLDB 0.00076161096
2,072 Query Flocks: A Generalization of Association-Rule Mining 1998 SIGMOD 9.6150986e-05
Previous Page 1 / 1 Next

Semantically Similar Papers