23 search results - page 3 / 5 » Sorting and Searching in Faulty Memories |
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
SIGMOD
2010
ACM
13 years 2 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
SPAA
2010
ACM
14 years 5 days ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...