638 search results - page 70 / 128 » Efficient algorithms for evaluating xpath over streams |
IWSOC
2003
IEEE
14 years 2 months ago
2003
IEEE
: - A filter cache is proposed at a higher level than the L1 (main) cache in the memory hierarchy and is much smaller. The typical size of filter cache is of the order of 512 Bytes...
CIKM
2006
Springer
13 years 10 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Publication
Efficient bandwidth allocation and low delays remain important goals, expecially in high-speed networks. Existing end-to-end congestion control schemes (such as TCP+AQM/RED) have s...