Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Scalable Sweeping-Based Spatial Join Octavian Procopiuc
 

Summary: Scalable Sweeping-Based Spatial Join
Lars Arge

Octavian Procopiuc

Sridhar Ramaswamy

Torsten Suel

Jeffrey Scott Vitter

Abstract
In this paper, we consider the filter step of the
spatial join problem, for the case where neither
of the inputs are indexed. We present a new al-
gorithm, Scalable Sweeping-Based Spatial Join
(SSSJ), that achieves both efficiency on real-life
data and robustness against highly skewed and
worst-case data sets. The algorithm combines
a method with theoretically optimal bounds on

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences