48 search results - page 2 / 10 » On Spatially Partitioned Temporal Join |
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
CASES
2007
ACM
13 years 11 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
DAC
1999
ACM
13 years 11 months ago
1999
ACM
: In this work we propose a technique for spatial and temporal partitioning of a logic circuit based on the nodes activity computed by using a simulation at an higher level of ion....