Sciweavers

492 search results - page 20 / 99
» Fast data stream algorithms using associative memories
Sort
View
ASPDAC
2008
ACM
135views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Block cache for embedded systems
On chip memories provide fast and energy efficient storage for code and data in comparison to caches or external memories. We present techniques and algorithms that allow for an au...
Dominic Hillenbrand, Jörg Henkel
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 8 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 9 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
ISCAS
1994
IEEE
138views Hardware» more  ISCAS 1994»
13 years 11 months ago
High-Throughput Data Compressor Designs Using Content Addressable Memory
This paper presents a novel VLSI architecture for high-speed data compressor designs which implement the well-known LZ77 algorithm. The architecture mainly consists of three units...
Ren-Yang Yang, Chen-Yi Lee
DASFAA
2007
IEEE
202views Database» more  DASFAA 2007»
14 years 2 months ago
Optimizing Moving Queries over Moving Object Data Streams
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, w...
Dan Lin, Bin Cui, Dongqing Yang