147 search results - page 3 / 30 » Size Bounds and Query Plans for Relational Joins |
SSD
1999
Springer
13 years 11 months ago
1999
Springer
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
SSD
2001
Springer
13 years 12 months ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a qu...
GEOINFO
2003
13 years 8 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...