165 search results - page 15 / 33 » Parallel Processing of Spatial Joins Using R-trees |
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we explore the problems of storing and reasoning about data collected from very large-scale wireless sensor networks (WSNs). Potential worldwide deployment of WSNs f...
DASFAA
2004
IEEE
14 years 5 days 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...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...
PDP
2008
IEEE
14 years 2 months ago
2008
IEEE
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
EDBT
2011
ACM
12 years 12 months ago
2011
ACM
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...