183 search results - page 24 / 37 » Query Processing in Tertiary Memory Databases |
170
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
115
click to vote
BIBE
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU). Our method is implemented using compute uni...
ICDE
2012
IEEE
13 years 1 days ago
2012
IEEE
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...
162
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
CIKM
2006
Springer
14 years 11 months ago
2006
Springer
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...