153 search results - page 12 / 31 » Hash-Based Structural Join Algorithms |
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...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
LCN
2005
IEEE
14 years 29 days ago
2005
IEEE
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
SIGGRAPH
2000
ACM
13 years 11 months ago
2000
ACM
Named after the title, the PCCM transformation is a simple, explicit algorithm that creates large, smoothly joining bicubic Nurbs patches from a refined Catmull-Clark subdivision...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...