Upsortable: Programming Top-K Queries Over Data Streams
Summary: Upsortable enables safe, efficient Top-k queries over non-append-only streams by making standard Java sorted collections support evolving data. Its annotation-driven AST/bytecode transformation preserves full Java Collections compatibility without bespoke data structures. (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. Julien Subercaze (Jean Monnet University; University of Lyon)
- 2. Christophe Gravier (Jean Monnet University; University of Lyon)
- 3. Syed Gillani (Jean Monnet University; University of Lyon)
- 4. Abderrahmen Kammoun (Jean Monnet University; University of Lyon)
- 5. Frederique Laforest (Jean Monnet University; University of Lyon)
BibTeX Citation
@article{subercaze_vldb17,
title = {{Upsortable: Programming Top-K Queries Over Data Streams}},
author = {Subercaze, Julien and Gravier, Christophe and Gillani, Syed and Kammoun, Abderrahmen and Laforest, Frederique},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {12},
pages = {1873--1876},
doi = {10.14778/3137765.3137797},
url = {https://doi.org/10.14778/3137765.3137797},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 505 | TelegraphCQ: Continuous Dataflow Processing | 2003 | SIGMOD | 0.00017285498 |
| 612 | Twitter Heron: Stream Processing at Scale | 2015 | SIGMOD | 0.0001573018 |
| 1,389 | Realtime Data Processing at Facebook | 2016 | SIGMOD | 0.00010943767 |
| 1,513 | Continuous Monitoring of Top-k Queries over Sliding Windows | 2006 | SIGMOD | 0.00010530872 |
| 1,915 | S-Store: Streaming Meets Transaction Processing | 2015 | VLDB | 9.4884706e-05 |
| 8,536 | Changing Engines in Midstream: A Java Stream Computational Model for Big Data Processing | 2014 | VLDB | 5.4119882e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,500 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD |
| 2 | 12,163 | A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting | 2014 | PODS |
| 3 | 9,172 | External Merge Sort for Top-K Queries: Eager input filtering guided by histograms | 2020 | SIGMOD |
| 4 | 7,299 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 5 | 2,427 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD |
| 6 | 8,536 | Changing Engines in Midstream: A Java Stream Computational Model for Big Data Processing | 2014 | VLDB |
| 7 | 1,513 | Continuous Monitoring of Top-k Queries over Sliding Windows | 2006 | SIGMOD |
| 8 | 7,550 | Processing Top-k Join Queries | 2010 | VLDB |
| 9 | 3,599 | Sliding-Window Top-k Queries on Uncertain Streams | 2008 | VLDB |
| 10 | 3,317 | Ad-hoc Top-k Query Answering for Data Streams | 2007 | VLDB |