Very Large Graph Partitioning by Means of Parallel DBMS
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 388-399
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Parallel Graph Partitioning on Multicore ArchitecturesLecture Notes in Computer Science, 2011
- Query processing in a DBMS for cluster systemsProgramming and Computer Software, 2010
- An Introduction to Graph Data2010
- HDB-Subdue: A Scalable Approach to Graph MiningLecture Notes in Computer Science, 2009
- DB-FSG: An SQL-Based Approach for Frequent Subgraph MiningLecture Notes in Computer Science, 2008
- DB-Subdue: Database Approach to Graph MiningLecture Notes in Computer Science, 2004
- A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix OrderingJournal of Parallel and Distributed Computing, 1998
- Parallel database systemsCommunications of the ACM, 1992
- Encapsulation of parallelism in the Volcano query processing systemACM SIGMOD Record, 1990
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970