211 search results - page 7 / 43 » Efficient Join Processing for Complex Rasterized Objects |
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
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...
PVLDB
2008
13 years 7 months ago
2008
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
EDBTW
2006
Springer
13 years 11 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 ...