• Distance range queries in spatialhadoop 

      García-García F., Corral A., Iribarne L., Vassilakopoulos M. (2016)
      Efficient processing of Distance Range Queries (DRQs) is of great importance in spatial databases due to the wide area of applications. This type of spatial query is characterized by a distance range over one or two datasets. ...
    • Enhancing spatialhadoop with closest pair queries 

      García-García F., Corral A., Iribarne L., Vassilakopoulos M., Manolopoulos Y. (2016)
      Given two datasets P and Q, the K Closest Pair Query (KCPQ) finds the K closest pairs of objects from P×Q. It is an operation widely adopted by many spatial and GIS applications. As a combination of the K Nearest Neighbor ...
    • Join-queries between two spatial datasets indexed by a single R*-tree 

      Vassilakopoulos, M.; Corral, A.; Karanikolas, N. N. (2011)
      A spatial join, a common query in Spatial Databases and Geographical Information Systems (GIS), consists in testing every possible pair of data elements belonging to two spatial datasets against a spatial predicate. This ...
    • SliceNBound: Solving closest pairs and distance join queries in apache spark 

      Mavrommatis G., Moutafis P., Vassilakopoulos M., García-García F., Corral A. (2017)
      The (K) Closest-Pair(s) Query, KCPQ, consists in finding the (K) closest pair(s) of objects between two spatial datasets. Recently, several systems that enhance Apache Spark with spatial-awareness have been presented, ...