91 search results - page 18 / 19 » Rethinking Database Algorithms for Phase Change Memory |
SIGMOD
2006
ACM
14 years 4 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...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
ICMCS
2007
IEEE
13 years 11 months ago
2007
IEEE
Today’s medical institutions produce enormous amounts of data on patients, including multimedia data, which is increasingly produced in digital form. These data in their clinica...
ALMOB
2007
13 years 4 months ago
2007
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...