Όλο το DSpace

Πλοήγηση ανά Θέμα "Plane sweep"

Αποτελέσματα 1-4 από 4

    • Efficient processing of all-k-nearest-neighbor queries in the MapReduce programming framework 

      Moutafis P., Mavrommatis G., Vassilakopoulos M., Sioutas S. (2019)
      Numerous modern applications, from social networking to astronomy, need efficient answering of queries on spatial data. One such query is the All k Nearest-Neighbor Query, or k Nearest-Neighbor Join, that takes as input ...

    • The K group nearest-neighbor query on non-indexed RAM-resident data 

      Roumelis G., Vassilakopoulos M., Corral A., Manolopoulos Y. (2016)
      Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query ...

    • 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 ...

    • Plane-sweep algorithms for the K Group Nearest-Neighbor Query 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A.; Manolopoulos, Y. (2015)
      One of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications ...