Sciweavers

1992 search results - page 10 / 399
» Implementing sorting in database systems
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 7 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
CGO
2005
IEEE
14 years 1 months ago
Optimizing Sorting with Genetic Algorithms
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
Xiaoming Li, María Jesús Garzar&aacu...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 7 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
CSI
2004
353views more  CSI 2004»
13 years 7 months ago
Design and implementation of a mobile database for Java phones
Due to the popularity of electronic commerce and the maturity of wireless technology, mobile users can access the Internet anytime anywhere without having to physically hook up an...
Eric Jui-Lin Lu, Yung-Yuan Cheng
MEMOCODE
2008
IEEE
14 years 2 months ago
High-throughput Pipelined Mergesort
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a softwa...
Kermin Fleming, Myron King, Man Cheuk Ng, Asif Kha...