Όλο το DSpace

Πλοήγηση ανά Θέμα "Spatial data processing"

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

    • A comparison of distributed spatial data management systems for processing distance join queries 

      García-García F., Corral A., Iribarne L., Mavrommatis G., Vassilakopoulos M. (2017)
      Due to the ubiquitous use of spatial data applications and the large amounts of spatial data that these applications generate, the processing of large-scale distance joins in distributed systems is becoming increasingly ...

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

    • Efficient distance join query processing in distributed spatial data management systems 

      García-García F., Corral A., Iribarne L., Vassilakopoulos M., Manolopoulos Y. (2020)
      Due to the ubiquitous use of spatial data applications and the large amounts of such data these applications use, the processing of large-scale distance joins in distributed systems is becoming increasingly popular. Distance ...

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

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

    • MRSLICE: Efficient RkNN Query Processing in SpatialHadoop 

      García-García F., Corral A., Iribarne L., Vassilakopoulos M. (2019)
      Nowadays, with the continuously increasing volume of spatial data, it is difficult to execute spatial queries efficiently in spatial data-intensive applications, because of the limited computational capability and storage ...

    • RkNN query processing in distributed spatial infrastructures: A performance study 

      García-García F., Corral A., Iribarne L., Vassilakopoulos M. (2017)
      The Reverse k-Nearest Neighbor (RkNN) problem, i.e. finding all objects in a dataset that have a given query point among their corresponding k-nearest neighbors, has received increasing attention in the past years. RkNN ...