[HTML][HTML] 2DPR-Tree: two-dimensional priority R-Tree algorithm for spatial partitioning in SpatialHadoop
Among spatial information applications, SpatialHadoop is one of the most important systems
for researchers. Broad analyses prove that SpatialHadoop outperforms the traditional …
for researchers. Broad analyses prove that SpatialHadoop outperforms the traditional …
(A) kNN query processing on the cloud: a survey
A k-nearest neighbor (k NN) query determines the k nearest points, using distance metrics,
from a given location. An all k-nearest neighbor (A k NN) query constitutes a variation of ak …
from a given location. An all k-nearest neighbor (A k NN) query constitutes a variation of ak …
[HTML][HTML] An Enhanced Partitioning Approach in SpatialHadoop for Handling Big Spatial Data
SpatialHadoop could handle spatial data operations in a low partitioning execution time
compared to the traditional Hadoop. However, developing an efficient and an accurate …
compared to the traditional Hadoop. However, developing an efficient and an accurate …
DHLP 1&2: Giraph based distributed label propagation algorithms on heterogeneous drug-related networks
Background and objective Heterogeneous complex networks are large graphs consisting of
different types of nodes and edges. The knowledge extraction from these networks is …
different types of nodes and edges. The knowledge extraction from these networks is …
A benchmark test of spatial big data processing tools and a mapreduce application
Spatial data processing often poses challenges due to the unique characteristics of spatial
data and this becomes more complex in spatial big data processing. Some tools have been …
data and this becomes more complex in spatial big data processing. Some tools have been …
[PDF][PDF] Nikolaos Nodarakis1, Angeliki Rapti1, Spyros Sioutas2, Athanasios K.
A k-nearest neighbor (kNN) query determines the k nearest points, using distance metrics,
from a given location. An all k-nearest neighbor (AkNN) query constitutes a variation of a …
from a given location. An all k-nearest neighbor (AkNN) query constitutes a variation of a …
[PDF][PDF] Two distributed semi-supervised algorithms for mining of complex networks using Giraph
EF Maleki, N Ghadiri, ML Shahreza, Z Maleki - 2018 - scholar.archive.org
Background and Objective: Heterogeneous complex networks are large graphs consisting of
different types of nodes and edges. The process of mining and knowledge extraction from …
different types of nodes and edges. The process of mining and knowledge extraction from …
Scalable Label Propagation Algorithms for Heterogeneous Networks
EF Maleki, N Ghadiri, ML Shahreza, Z Maleki - bioRxiv, 2018 - biorxiv.org
Heterogeneous networks are large graphs consisting of different types of nodes and edges.
They are an important category of complex networks, but the process of knowledge …
They are an important category of complex networks, but the process of knowledge …
An Efficient Partitioning Technique in SpatialHadoop
SpatialHadoop is a Hadoop framework supporting spatial information handling in light of
MapReduce programming worldview. A huge number of studies leads to that SpatialHadoop …
MapReduce programming worldview. A huge number of studies leads to that SpatialHadoop …