Sciweavers

20 search results - page 1 / 4
» Main Memory Implementations for Binary Grouping
Sort
View
XSYM
2005
Springer
79views Database» more  XSYM 2005»
13 years 10 months ago
Main Memory Implementations for Binary Grouping
Norman May, Guido Moerkotte
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 9 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
PDP
1995
IEEE
13 years 8 months ago
Iterated Runge-Kutta methods on distributed memory multiprocessors
We investigate the parallel implementation of the diagonal{implicitly iterated Runge{ Kutta (DIIRK) method, an iteration method based on a predictor{corrector scheme. This method ...
Thomas Rauber, Gudula Rünger
ICDE
2002
IEEE
126views Database» more  ICDE 2002»
14 years 6 months ago
Sequenced Subset Operators: Definition and Implementation
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
Joseph Dunn, Sean Davey, Anne Descour, Richard T. ...
ISMVL
1998
IEEE
113views Hardware» more  ISMVL 1998»
13 years 9 months ago
Look-up Tables (LUTs) for Multiple-Valued, Combinational Logic
The use of Look-Up Tables (LUTs) is extended from binary to multiple-valued logic (MVL) circuits. A multiplevalued LUT can be implemented using both current-mode and voltage-mode ...
Ali Sheikholeslami, R. Yoshimura, P. Glenn Gulak