Sciweavers

304 search results - page 20 / 61
» Parallel and Distributed Compressed Indexes
Sort
View
VLDB
2004
ACM
118views Database» more  VLDB 2004»
14 years 1 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
PDIS
1993
IEEE
14 years 18 days ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
HPCA
2004
IEEE
14 years 8 months ago
Stream Register Files with Indexed Access
Many current programmable architectures designed to exploit data parallelism require computation to be structured to operate on sequentially accessed vectors or streams of data. A...
Nuwan Jayasena, Mattan Erez, Jung Ho Ahn, William ...
SIBGRAPI
2005
IEEE
14 years 2 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...
ICPP
2003
IEEE
14 years 1 months ago
Enabling Partial Cache Line Prefetching Through Data Compression
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
Youtao Zhang, Rajiv Gupta