505 search results - page 5 / 101 » Efficient Temporal Join Processing Using Indices |
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
DEBS
2007
ACM
13 years 11 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...
IIS
2004
13 years 8 months ago
2004
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...
TKDE
2002
13 years 7 months ago
2002
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
ACIIDS
2009
IEEE
14 years 13 days ago
2009
IEEE
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...