Partition based Graph Compression
نویسندگان
چکیده
منابع مشابه
Grammar-Based Graph Compression
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. Specific queries such as reachability between two nodes or regular path queries can be evaluated in linear time (or quadratic times, respectively),...
متن کاملGraph Partition Based Muti-Way Spatial Joins
In this paper, we investigate the problem of efficiently computing a multi-way spatial join without spatial indexes. We propose a novel and effective filtering algorithm based on a two phase partitioning technique. To avoid missing hits due to an inherent difficulty in multi-way spatial joins, we propose to firstly partition a join graph into sub-graphs whenever necessary. In the second phase, ...
متن کاملDense & Sparse Graph Partition
In a graph G = (V, E), the density is the ratio between the number of edges |E| and the number of vertices |V |. This criterion may be used to find communities in a graph: groups of highly connected vertices. We propose an optimization problem based on this criterion, the idea is to find the vertex partition that maximizes the sum of the densities of each class. We prove that this problem is NP...
متن کاملGraph-Based Knowledge Discovery: Compression versus Frequency
There are two primary types of graph-based data miners: frequent subgraph and compression-based miners. With frequent subgraph miners, the most interesting substructure is the largest one (or ones) that meet the minimum support. Whereas, compression-based graph miners discover those subgraphs that maximize the amount of compression that a particular substructure provides a graph. The algorithms...
متن کاملGraph Pattern Based RDF Data Compression
The growing volume of RDF documents and their inter-linking raise a challenge on the storage and transferring of such documents. One solution to this problem is to reduce the size of RDF documents via compression. Existing approaches either apply well-known generic compression technologies but seldom exploit the graph structure of RDF documents. Or, they focus on minimized compact serialisation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2013
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2013.040902