Database Paper Browser

Back to papers

Efficient Exploration of Interesting Aggregates in RDF Graphs

Summary: End-to-end framework to automatically identify top-k interesting aggregates on RDF graphs, discovering facts, dimensions, and measures within a lattice. RDF-friendly one-pass lattice evaluation with probabilistic early-stop pruning; up to 2.9x speedup and scalable performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6197
Venue
SIGMOD
Year
2021
Pagerank
4.383548e-05
Overall Rank
9,175 | 36.18%
DOI
10.1145/3448016.3457307

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
8,289 Knowledge Graph Exploration Systems: are we lost? 2022 CIDR 4.5435639e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 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