• A cost-effective method for tranquility mapping using open environmental data 

      Pafi M., Chalkias C., Stathakis D. (2020)
      In this study, we propose a cost-effective method for tranquillity mapping using multi-criteria analysis and open geospatial data. We apply this method in an extended zone around a major Greek highway trespassing areas of ...
    • Efficient large-scale distance-based join queries in spatialhadoop 

      García-García F., Corral A., Iribarne L., Vassilakopoulos M., Manolopoulos Y. (2018)
      Efficient processing of Distance-Based Join Queries (DBJQs) in spatial databases is of paramount importance in many application domains. The most representative and known DBJQs are the K Closest Pairs Query (KCPQ) and the ...
    • Exploring regional and urban clusters and patterns in Europe using satellite observed lighting 

      Tselios V., Stathakis D. (2020)
      We explore regional and urban clusters and patterns in Europe by using satellite images of nighttime lights and by employing Exploratory Spatial Data Analysis. We map Defense Meteorological Satellite Program nighttime ...
    • New plane-sweep algorithms for distance-based join queries in spatial databases 

      Roumelis G., Corral A., Vassilakopoulos M., Manolopoulos Y. (2016)
      Efficient and effective processing of the distance-based join query (DJQ) is of great importance in spatial databases due to the wide area of applications that may address such queries (mapping, urban planning, transportation ...
    • WeR-trees 

      Bozanis, P.; Foteinos, P. (2007)
      R-tree has been proven to be one of the most practical and well-behaved data structures for accommodating dynamic massive sets of low dimensionality geometric objects and conducting a very diverse set of queries on such ...