Mostrar el registro sencillo del ítem

dc.contributor.authorMartínez Bazán, Norbert
dc.contributor.authorMuntés Mulero, Víctor
dc.contributor.authorGómez Villamor, Sergio
dc.contributor.authorDomínguez Sal, David
dc.contributor.authorÁguila Lorente, Miguel Ángel
dc.contributor.authorLarriba Pey, Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2013-05-16T13:52:00Z
dc.date.created2012
dc.date.issued2012
dc.identifier.citationMartinez-Bazan, N. [et al.]. Efficient graph management based on bitmap indices. A: International Database Engineering and Applications Symposium. "Proceedings of the 2012 International Database Engineering and Applications Symposium". Prague: Association for Computing Machinery (ACM), 2012, p. 110-119.
dc.identifier.isbn978-1-4503-1234-9
dc.identifier.urihttp://hdl.handle.net/2117/19309
dc.description.abstractThe 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.
dc.format.extent10 p.
dc.language.isoeng
dc.publisherAssociation for Computing Machinery (ACM)
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Sistemes d'informació::Bases de dades
dc.subjectÀrees temàtiques de la UPC::Informàtica::Sistemes d'informació::Emmagatzematge i recuperació de la informació
dc.subject.lcshDatabases
dc.subject.lcshSemantic Web
dc.subject.otherData representation
dc.subject.otherGraph databases
dc.subject.otherQuery performance
dc.titleEfficient graph management based on bitmap indices
dc.typeConference report
dc.subject.lemacBases de dades
dc.subject.lemacWeb semàntica
dc.contributor.groupUniversitat Politècnica de Catalunya. DAMA-UPC - Data Management Group
dc.identifier.doi10.1145/2351476.2351489
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://dl.acm.org/citation.cfm?id=2351489
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac11010782
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorMartinez-Bazan, N.; Muntés, V.; Gómez, S.; Dominguez, D.; Aguila, M.; Larriba, J.
local.citation.contributorInternational Database Engineering and Applications Symposium
local.citation.pubplacePrague
local.citation.publicationNameProceedings of the 2012 International Database Engineering and Applications Symposium
local.citation.startingPage110
local.citation.endingPage119


Ficheros en el ítem

Imagen en miniatura

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivs 3.0 Spain
Salvo que se indique lo contrario, los contenidos de esta obra estan sujetos a la licencia de Creative Commons : Reconocimiento-NoComercial-SinObraDerivada 3.0 España