552 search results - page 27 / 111 » On the Complexity of Join Predicates |
DEBS
2007
ACM
14 years 2 months ago
2007
ACM
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
SIGMOD
2005
ACM
14 years 10 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
EDBTW
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
VLDB
1992
ACM
14 years 2 months ago
1992
ACM
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel ...