DBScholar

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
h99d8729e9cb9cf2d
Venue
VLDB
Year
1999
Pagerank
5.8864128e-05
Overall Rank
6,103 | 58.97%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{kumar_vldb99,
        title = {{Extracting large-scale knowledge bases from the web}},
        author = {Kumar, Ravi and Raghavan, Prabhakar and Rajagopalan, Sridhar and Tomkins, Andrew},
        journal = {PVLDB},
        series = {{VLDB} '99},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
131 Discovering Large Dense Subgraphs in Massive Graphs 2005 VLDB 0.00030242586
563 Graph Summarization with Bounded Error 2008 SIGMOD 0.00016327158
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
29 Fast Algorithms for Mining Association Rules 1994 VLDB 0.0005121339
2,301 Query Flocks: A Generalization of Association-Rule Mining 1998 SIGMOD 8.6716957e-05
Previous Page 1 / 1 Next

Semantically Similar Papers