This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
Query co-processing on graphics processors (GPUs) has become an effective means to improve the performance of main memory databases. However, this co-processing requires the data ...
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
Library-based record and replay tools aim to reproduce an application's execution by recording the results of selected functions in a log and during replay returning the resu...
Zhenyu Guo, Xi Wang, Jian Tang, Xuezheng Liu, Zhil...