To access the full text documents, please follow this link: http://hdl.handle.net/2117/19309

Title:	Efficient graph management based on bitmap indices
Author:	Martínez Bazán, Norbert; Muntés Mulero, Víctor; Gómez Villamor, Sergio; Domínguez Sal, David; Águila Lorente, Miguel Ángel; Larriba Pey, Josep
Other authors:	Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors; Universitat Politècnica de Catalunya. DAMA-UPC - Data Management Group
Abstract:	The increasing amount of graph like data from social networks, science and the web has grown an interest in analyzing the relationships between different entities. New specialized solutions in the form of graph databases, which are generic and able to adapt to any schema as an alternative to RDBMS, have appeared to manage attributed multigraphs efficiently. In this paper, we describe the internals of DEX graph database, which is based on a representation of the graph and its attributes as maps and bitmap structures that can be loaded and unloaded efficiently from memory. We also present the internal operations used in DEX to manipulate these structures. We show that by using these structures, DEX scales to graphs with billions of vertices and edges with very limited memory requirements. Finally, we compare our graph-oriented approach to other approaches showing that our system is better suited for out-of-core typical graph-like operations.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Sistemes d'informació::Bases de dades -Àrees temàtiques de la UPC::Informàtica::Sistemes d'informació::Emmagatzematge i recuperació de la informació -Databases -Semantic Web -Data representation -Graph databases -Query performance -Bases de dades -Web semàntica
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Published version Conference Object
Published by:	Association for Computing Machinery (ACM)
Share:

Show full item record