Sciweavers

1992 search results - page 6 / 399
» Implementing sorting in database systems
Sort
View
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 7 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
VLDB
1995
ACM
116views Database» more  VLDB 1995»
13 years 11 months ago
W3QS: A Query System for the World-Wide Web
The World-Wide Web (WWW) is an ever growing, distributed, non-administered, global information resource. It resides on the worldwide computer network and allows access to heteroge...
David Konopnicki, Oded Shmueli
JSW
2007
106views more  JSW 2007»
13 years 7 months ago
A Multimodal Biometric System Implemented within an Active Database Management System
— Active databases have been used in many different fields to accomplish many different tasks. One of the main problems today that still have not been solved is authorization. In...
Kornelije Rabuzin, Miroslav Baca, Mirko Malekovic
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
CPHYSICS
2008
86views more  CPHYSICS 2008»
13 years 7 months ago
On ERI sorting for SIMD execution of large-scale Hartree-Fock SCF
Given the resurgent attractiveness of single-instruction-multiple-data (SIMD) processing, it is important for high-performance computing applications to be SIMD-capable. The Hartr...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...