Durable Top-k Queries on Temporal Data
Summary: Introduces durable top-k queries over temporal histories: objects ranked in the top k for a specified fraction of timestamps. Provides exact fixed-k algorithms and adaptive approximate methods for arbitrary k, exploiting workload/data properties while bounding index cost. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Junyang Gao (Duke University)
- 2. Pankaj K. Agarwal (Duke University)
- 3. Jun Yang (Duke University)
BibTeX Citation
@article{gao_vldb18,
title = {{Durable Top-k Queries on Temporal Data}},
author = {Gao, Junyang and Agarwal, Pankaj K. and Yang, Jun},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {13},
pages = {2223--2235},
doi = {10.14778/3275366.3275371},
url = {https://doi.org/10.14778/3275366.3275371},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,738 | Efficiently Answering Durability Prediction Queries | 2021 | SIGMOD | 5.6918011e-05 |
| 8,832 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS | 5.2680847e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010679641 |
| 1,106 | Range Queries in OLAP Data Cubes | 1997 | SIGMOD | 0.00011994008 |
| 4,869 | Durable Top-k Search in Document Archives | 2010 | SIGMOD | 6.3739434e-05 |
| 8,102 | Ranking Large Temporal Data | 2012 | VLDB | 5.3942942e-05 |
| 9,187 | Finding Diverse, High-Value Representatives on a Surface of Answers | 2017 | VLDB | 5.211358e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,893 | Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data | 2007 | VLDB |
| 2 | 2,485 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD |
| 3 | 3,068 | Towards Robust Indexing for Ranked Queries | 2006 | VLDB |
| 4 | 1,439 | Continuous Monitoring of Top-k Queries over Sliding Windows | 2006 | SIGMOD |
| 5 | 3,326 | Sliding-Window Top-k Queries on Uncertain Streams | 2008 | VLDB |
| 6 | 8,449 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 7 | 7,327 | Anytime Measures for Top-k Algorithms | 2007 | VLDB |
| 8 | 3,249 | On Querying Historical K-Cores | 2021 | VLDB |
| 9 | 8,102 | Ranking Large Temporal Data | 2012 | VLDB |
| 10 | 4,869 | Durable Top-k Search in Document Archives | 2010 | SIGMOD |