Abstract
We propose a class of query, called a derange query, that maps a function over a set of records and lazily aggregates the results. Derange queries defer work until it is either convenient or necessary, and, as a result, can reduce total I/O costs of the system. Derange queries operate on a view of the data that is consistent with the point in time that they are issued, regardless of when the computation completes. They are most useful for performing calculations where the results are not needed until some future deadline. When necessary, derange queries can also execute immediately. Users can view partial results of in-progress queries at low cost.
Original language | English (US) |
---|---|
State | Published - 2016 |
Event | 8th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage 2016, co-located with USENIX ATC 2016 - Denver, United States Duration: Jun 20 2016 → Jun 21 2016 |
Conference
Conference | 8th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage 2016, co-located with USENIX ATC 2016 |
---|---|
Country/Territory | United States |
City | Denver |
Period | 6/20/16 → 6/21/16 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Information Systems
- Software