A compact representation of graph databases

Authors:
Sandra Álvarez;Nieves R. Brisaboa;Susana Ladra;Óscar Pedreira
Affiliations:
Univ. of A Coruña, A Coruña, Spain;Univ. of A Coruña, A Coruña, Spain;Univ. of A Coruña, A Coruña, Spain;Univ. of A Coruña, A Coruña, Spain
Venue:
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Year:
2010

Citing 10
Cited 2

Virtual Screening for Bioactive Molecules

Virtual Screening for Bioactive Molecules
The webgraph framework I: compression techniques

Proceedings of the 13th international conference on World Wide Web
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Measurement and analysis of online social networks

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Dex: high-performance exploration on large graphs for information retrieval

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Graph summarization with bounded error

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient aggregation for graph summarization

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
On compressing social networks

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
GConnect: a connectivity index for massive disk-resident graphs

Proceedings of the VLDB Endowment
Managing and Mining Graph Data

Managing and Mining Graph Data

Lightweighting the web of data through compact RDF/HDT

CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Compact representation of Web graphs with extended functionality

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph databases have emerged as an alternative data model with applications in many complex domains. Typically, the problems to be solved in such domains involve managing and mining huge graphs. The need for efficient processing in such applications has motivated the development of methods for graph compression and indexing. However, most methods aim at an efficient representation and processing of simple graphs (without attributes in nodes or edges, or multiple edges for a given pair of nodes). In this paper we present a model for compact representation of general graph databases. It represents an attractive alternative due to the compression rates it achieves and its efficient navigation operations.