165 search results - page 15 / 33 » Parallel Processing of Spatial Joins Using R-trees |
176
Voted
HPDC
2010
IEEE
15 years 6 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...
227
Voted
DASFAA
2004
IEEE
15 years 10 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...
277
Voted
ICDE
2008
IEEE
16 years 7 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...
161
click to vote
PDP
2008
IEEE
16 years 22 days 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...
228
Voted
EDBT
2011
ACM
14 years 10 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...