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)
Incoming Non-self Citations Over Time
Authors
- 1. Jeffrey Jestes
- 2. Jeff M. Phillips
- 3. Feifei Li
- 4. Mingwang Tang
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,756 | Durable Top-k Queries on Temporal Data | 2018 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 986 | Managing Intervals Efficiently in Object-Relational Databases | 2000 | VLDB | 0.00014825631 |
| 1,363 | Range Queries in OLAP Data Cubes | 1997 | SIGMOD | 0.00012380611 |
| 2,045 | Indexable PLA for Efficient Similarity Search | 2007 | VLDB | 9.6950855e-05 |
| 4,851 | Durable Top-k Search in Document Archives | 2010 | SIGMOD | 5.8716965e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,967 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD | 7.7975455e-05 |
| 3,809 | Supporting Ad-hoc Ranking Aggregates | 2006 | SIGMOD | 6.7413981e-05 |
| 3,665 | Ad-hoc Top-k Query Answering for Data Streams | 2007 | VLDB | 6.8631567e-05 |
| 3,911 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD | 6.6343292e-05 |
| 3,447 | Towards Robust Indexing for Ranked Queries | 2006 | VLDB | 7.082382e-05 |
| 2,384 | Comparing and Aggregating Rankings with Ties | 2004 | PODS | 8.9177815e-05 |
| 7,133 | Anytime Measures for Top-k Algorithms | 2007 | VLDB | 4.8175888e-05 |
| 9,044 | Efficient Approximation of Certain and Possible Answers for Ranking and Window Queries over Uncertain Data | 2023 | VLDB | 4.3997447e-05 |
| 7,273 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD | 4.775366e-05 |
| 11,756 | Durable Top-k Queries on Temporal Data | 2018 | VLDB | 4.1905499e-05 |