Ranking Large Temporal Data

Summary: Introduces aggregate top-k ranking over temporal data (interval-based, not instant). Proposes exact and approximate methods with guarantees; analyzes construction cost, index size, updates, and query costs, and demonstrates scalable, efficient performance on large real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10565
Venue: VLDB
Year: 2012
Pagerank: 5.5181056e-05
Overall Rank: 7,934 | 45.57%
DOI: 10.14778/2350229.2350263

Incoming Non-self Citations Over Time

Authors

1. Jeffrey Jestes (University of Utah)
2. Jeff M. Phillips (University of Utah)
3. Feifei Li (University of Utah)
4. Mingwang Tang (University of Utah)

BibTeX Citation

@article{jestes_vldb12,
        title = {{Ranking Large Temporal Data}},
        author = {Jestes, Jeffrey and Phillips, Jeff M. and Li, Feifei and Tang, Mingwang},
        journal = {PVLDB},
        series = {{VLDB} '12},
        volume = {5},
        number = {11},
        pages = {1412--1423},
        doi = {10.14778/2350229.2350263},
        url = {https://doi.org/10.14778/2350229.2350263},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,954	Durable Top-k Queries on Temporal Data	2018	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
1,100	Range Queries in OLAP Data Cubes	1997	SIGMOD	0.00012169143
1,139	Managing Intervals Efficiently in Object-Relational Databases	2000	VLDB	0.0001202217
1,722	Indexable PLA for Efficient Similarity Search	2007	VLDB	9.9227051e-05
4,765	Durable Top-k Search in Document Archives	2010	SIGMOD	6.5186944e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,706	Supporting Ad-hoc Ranking Aggregates	2006	SIGMOD
2	2,427	Processing a Large Number of Continuous Preference Top-k Queries	2012	SIGMOD
3	3,317	Ad-hoc Top-k Query Answering for Data Streams	2007	VLDB
4	3,500	Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions	2007	SIGMOD
5	3,007	Towards Robust Indexing for Ranked Queries	2006	VLDB
6	2,652	Comparing and Aggregating Rankings with Ties	2004	PODS
7	7,185	Anytime Measures for Top-k Algorithms	2007	VLDB
8	9,194	Efficient Approximation of Certain and Possible Answers for Ranking and Window Queries over Uncertain Data	2023	VLDB
9	7,299	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD
10	11,954	Durable Top-k Queries on Temporal Data	2018	VLDB