Sciweavers

265 search results - page 37 / 53
» Separable Partitions
Sort
View
CIKM
1994
Springer
14 years 1 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 3 months ago
Spatio-Temporal Dynamic Spectrum Allocation with Interference Handling
— As for today, radio spectrum resource is rigidly partitioned for dedicated purposes. The exclusive license of fixed size spectrum blocks separated by guard bands easily solves...
László Kovacs, Attila Vidács,...
EURONGI
2006
Springer
14 years 23 days ago
The Challenges of Merging Two Similar Structured Overlays: A Tale of Two Networks
Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network ...
Anwitaman Datta, Karl Aberer
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
14 years 1 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
ICDE
2010
IEEE
379views Database» more  ICDE 2010»
14 years 8 months ago
Osprey: Implementing MapReduce-Style Fault Tolerance in a Shared-Nothing Distributed Database
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
Christopher Yang, Christine Yen, Ceryen Tan, Samue...