Zacharatou, Eleni TziritaSidlauskas, DariusTauheed, FarhanHeinis, ThomasAilamaki, Anastasia2020-05-282020-05-282020-05-282019-01-0110.1145/3347146.3359077https://infoscience.epfl.ch/handle/20.500.14299/168982WOS:000532798200018Efficiently querying multiple spatial data sets is a growing challenge for scientists. Astronomers query data sets that contain different types of stars (e.g., dwarfs, giants, stragglers) while neuroscientists query different data sets that model different aspects of the brain in the same space (e.g., neurons, synapses, blood vessels). The results of each query determine the combination of data sets to be queried next. Not knowing a priori the queried data sets makes it hard to choose an efficient indexing strategy.In this paper, we show that indexing and querying the data sets separately incurs considerable overhead but so does using one index for all data sets. We therefore develop STITCH, a novel index structure for the scalable execution of spatial range queries on multiple data sets. Instead of indexing all data sets separately or indexing all of them together, the key insight we use in STITCH is to partition all data sets individually and to connect them to the same reference space. By doing so, STITCH only needs to query the reference space and follow the links to the data set partitions to retrieve the relevant data. With experiments we show that STITCH scales with the number of data sets and outperforms the state-of-the-art by a factor of up to 12.3.spatial range querymultiple spatial data setsspatial indexingspatial data partitioningspatial data managementalgorithmtreestext::conference output::conference proceedings::conference paper