Applying parallel DBMS for very large graph mining
    
    
  
  
  
      
      
      
        
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, no. 2 (2012), pp. 127-132
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			Graph partitioning is an interesting topic in graph mining, that comes into use for some theoretical and practical problems (graph coloring, integrated curcuit desing, finite element modeling, etc.). The existing serial and parallel algorithms suppose that the graph being analyzed can fit into main memory along with all the intermediate data, so they cannot be applied for very large graphs. We introduce a new way of partitining – using the parallel
relational DBMS PargreSQL that is based on open-source PostgreSQL DBMS.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
data mining, graph partitioning, parallel DBMS.
                    
                  
                
                
                @article{VYURV_2012_2_a10,
     author = {K. S. Pan},
     title = {Applying parallel {DBMS} for very large graph mining},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a Vy\v{c}islitelʹna\^a matematika i informatika},
     pages = {127--132},
     publisher = {mathdoc},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURV_2012_2_a10/}
}
                      
                      
                    TY - JOUR AU - K. S. Pan TI - Applying parallel DBMS for very large graph mining JO - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika PY - 2012 SP - 127 EP - 132 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VYURV_2012_2_a10/ LA - ru ID - VYURV_2012_2_a10 ER -
%0 Journal Article %A K. S. Pan %T Applying parallel DBMS for very large graph mining %J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika %D 2012 %P 127-132 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/item/VYURV_2012_2_a10/ %G ru %F VYURV_2012_2_a10
K. S. Pan. Applying parallel DBMS for very large graph mining. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, no. 2 (2012), pp. 127-132. http://geodesic.mathdoc.fr/item/VYURV_2012_2_a10/
