Upsortable: Programming Top-K Queries Over Data Streams. Subercaze,  J., Gravier,  C., Gillani,  S., & Kammoun,  A. Proceedings of the VLDB Endowment, 2017.  ![pdf Upsortable: Programming Top-K Queries Over Data Streams [pdf]](https://bibbase.org/img/filetypes/pdf.svg) Paper  abstract   bibtex
Paper  abstract   bibtex   Top-k queries over data streams is a well studied problem. There exists numerous systems allowing to process contin- uous queries over sliding windows. At the opposite, non- append only streams call for ad-hoc solutions, e.g. tailor- made solutions implemented in a mainstream programming language. In the meantime, the Stream API and lambda expressions have been added in Java 8, thus gaining pow- erful operations for data stream processing. However, the Java Collections Framework does not provide data struc- tures to safely and conveniently support sorted collections of evolving data. In this paper, we demonstrate Upsortable, an annotation-based approach that allows to use existing sorted collections from the standard Java API for dynamic data management. Our approach relies on a combination of pre-compilation abstract syntax tree modifications and runtime analysis of bytecode. Upsortable offers the devel- oper a safe and time-efficient solution for developing top-k queries on data streams while keeping a full compatibility with standard Java.
@article{
 title = {Upsortable: Programming Top-K Queries Over Data Streams},
 type = {article},
 year = {2017},
 identifiers = {[object Object]},
 pages = {1873-1876},
 id = {347ab092-27b9-3782-9d83-327caaf3ddd6},
 created = {2018-01-04T18:05:59.772Z},
 file_attached = {true},
 profile_id = {0ecaa748-3fac-3117-bdf6-9c4c3c7996d4},
 group_id = {d5687afc-7996-37cd-8cc9-b955ea15e0aa},
 last_modified = {2018-01-10T17:12:33.383Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Subercaze2017a},
 private_publication = {false},
 abstract = {Top-k queries over data streams is a well studied problem. There exists numerous systems allowing to process contin- uous queries over sliding windows. At the opposite, non- append only streams call for ad-hoc solutions, e.g. tailor- made solutions implemented in a mainstream programming language. In the meantime, the Stream API and lambda expressions have been added in Java 8, thus gaining pow- erful operations for data stream processing. However, the Java Collections Framework does not provide data struc- tures to safely and conveniently support sorted collections of evolving data. In this paper, we demonstrate Upsortable, an annotation-based approach that allows to use existing sorted collections from the standard Java API for dynamic data management. Our approach relies on a combination of pre-compilation abstract syntax tree modifications and runtime analysis of bytecode. Upsortable offers the devel- oper a safe and time-efficient solution for developing top-k queries on data streams while keeping a full compatibility with standard Java.},
 bibtype = {article},
 author = {Subercaze, Julien and Gravier, Christophe and Gillani, Syed and Kammoun, Abderrahmen},
 journal = {Proceedings of the VLDB Endowment}
} 
Downloads: 0
{"_id":"ywf9H8xZk9ji6pfsv","bibbaseid":"subercaze-gravier-gillani-kammoun-upsortableprogrammingtopkqueriesoverdatastreams-2017","authorIDs":[],"author_short":["Subercaze,  J.","Gravier,  C.","Gillani,  S.","Kammoun,  A."],"bibdata":{"title":"Upsortable: Programming Top-K Queries Over Data Streams","type":"article","year":"2017","identifiers":"[object Object]","pages":"1873-1876","id":"347ab092-27b9-3782-9d83-327caaf3ddd6","created":"2018-01-04T18:05:59.772Z","file_attached":"true","profile_id":"0ecaa748-3fac-3117-bdf6-9c4c3c7996d4","group_id":"d5687afc-7996-37cd-8cc9-b955ea15e0aa","last_modified":"2018-01-10T17:12:33.383Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Subercaze2017a","private_publication":false,"abstract":"Top-k queries over data streams is a well studied problem. There exists numerous systems allowing to process contin- uous queries over sliding windows. At the opposite, non- append only streams call for ad-hoc solutions, e.g. tailor- made solutions implemented in a mainstream programming language. In the meantime, the Stream API and lambda expressions have been added in Java 8, thus gaining pow- erful operations for data stream processing. However, the Java Collections Framework does not provide data struc- tures to safely and conveniently support sorted collections of evolving data. In this paper, we demonstrate Upsortable, an annotation-based approach that allows to use existing sorted collections from the standard Java API for dynamic data management. Our approach relies on a combination of pre-compilation abstract syntax tree modifications and runtime analysis of bytecode. Upsortable offers the devel- oper a safe and time-efficient solution for developing top-k queries on data streams while keeping a full compatibility with standard Java.","bibtype":"article","author":"Subercaze, Julien and Gravier, Christophe and Gillani, Syed and Kammoun, Abderrahmen","journal":"Proceedings of the VLDB Endowment","bibtex":"@article{\n title = {Upsortable: Programming Top-K Queries Over Data Streams},\n type = {article},\n year = {2017},\n identifiers = {[object Object]},\n pages = {1873-1876},\n id = {347ab092-27b9-3782-9d83-327caaf3ddd6},\n created = {2018-01-04T18:05:59.772Z},\n file_attached = {true},\n profile_id = {0ecaa748-3fac-3117-bdf6-9c4c3c7996d4},\n group_id = {d5687afc-7996-37cd-8cc9-b955ea15e0aa},\n last_modified = {2018-01-10T17:12:33.383Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Subercaze2017a},\n private_publication = {false},\n abstract = {Top-k queries over data streams is a well studied problem. There exists numerous systems allowing to process contin- uous queries over sliding windows. At the opposite, non- append only streams call for ad-hoc solutions, e.g. tailor- made solutions implemented in a mainstream programming language. In the meantime, the Stream API and lambda expressions have been added in Java 8, thus gaining pow- erful operations for data stream processing. However, the Java Collections Framework does not provide data struc- tures to safely and conveniently support sorted collections of evolving data. In this paper, we demonstrate Upsortable, an annotation-based approach that allows to use existing sorted collections from the standard Java API for dynamic data management. Our approach relies on a combination of pre-compilation abstract syntax tree modifications and runtime analysis of bytecode. Upsortable offers the devel- oper a safe and time-efficient solution for developing top-k queries on data streams while keeping a full compatibility with standard Java.},\n bibtype = {article},\n author = {Subercaze, Julien and Gravier, Christophe and Gillani, Syed and Kammoun, Abderrahmen},\n journal = {Proceedings of the VLDB Endowment}\n}","author_short":["Subercaze,  J.","Gravier,  C.","Gillani,  S.","Kammoun,  A."],"urls":{"Paper":"https://bibbase.org/service/mendeley/7127e9bf-bb7e-31a5-a06e-59fccf53ff81/file/26e432c1-8bda-d091-420e-548e2b0c7072/p1873_subercaze.pdf.pdf"},"bibbaseid":"subercaze-gravier-gillani-kammoun-upsortableprogrammingtopkqueriesoverdatastreams-2017","role":"author","downloads":0},"bibtype":"article","creationDate":"2020-06-19T09:41:42.187Z","downloads":0,"keywords":[],"search_terms":["upsortable","programming","top","queries","over","data","streams","subercaze","gravier","gillani","kammoun"],"title":"Upsortable: Programming Top-K Queries Over Data Streams","year":2017}