Understanding local structure in ranked datasets

Summary: Defines “local structure” in ranked datasets—agreement of ranker subsets over item subsets—enabling localized consensus/conflict analysis yet hard to model and compute. Advocates combining declarative, incremental DB primitives with ML/data‑mining and outlines a roadmap for a scalable framework. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 203
Venue: CIDR
Year: 2013
Pagerank: 4.8637193e-05
Overall Rank: 7,009 | 51.25%
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
4,803	A System for Management and Analysis of Preference Data	2014	VLDB	5.9107061e-05
5,700	Rank aggregation with ties: Experiments and Analysis	2015	VLDB	5.365274e-05

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

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
7,276	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD	4.7798595e-05
4,095	Ranking Continuous Probabilistic Datasets	2010	VLDB	6.4556768e-05
1,992	Probabilistic Ranking of Database Query Results	2004	VLDB	9.8462684e-05
1,616	Relational link-based ranking	2004	VLDB	0.00011128652
2,385	Comparing and Aggregating Rankings with Ties	2004	PODS	8.9247846e-05
10,538	Ranking Indicator Discovery from Very Large Knowledge Graphs	2025	VLDB	4.1945683e-05
5,555	On Obtaining Stable Rankings	2019	VLDB	5.4386174e-05
1,609	A Unified Approach to Ranking in Probabilistic Databases	2009	VLDB	0.00011150935
5,700	Rank aggregation with ties: Experiments and Analysis	2015	VLDB	5.365274e-05
12,088	Rank Discovery From Web Databases	2013	VLDB	4.1945683e-05