591 search results - page 56 / 119 » Implementing Joins Using Extensible Pattern Matching |
PAMI
2010
14 years 8 months ago
2010
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
79
Voted
EURONGI
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
JSC
2010
14 years 8 months ago
2010
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
103
click to vote
EDBT
2012
ACM
13 years 2 days ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
100
click to vote
ASPLOS
2008
ACM
14 years 11 months ago
2008
ACM
Today's system programmers go to great lengths to extend the languages in which they program. For instance, system-specific compilers find errors in Linux and other systems, ...