DEX: High-performance exploration on large graphs for information retrieval

Norbert Martínez-Bazan, Jordi Nin, Victor Muntés-Mulero, Mario A. Sánchez-Martínez, Sergio Gómez-Villamor, Josep L. Larriba-Pey

Producció científica: Capítol de llibreContribució a una conferènciaAvaluat per experts

59 Cites (Scopus)

Resum

Link and graph analysis tools are important devices to boost the richness of information retrieval systems. Internet and the existing social networking portals are just a couple of situations where the use of these tools would be beneficial and enriching for the users and the analysts. However, the need for integrating different data sources and, even more important, the need for high performance generic tools, is at odds with the continuously growing size and number of data repositories. In this paper we propose and evaluate DEX, a high performance graph database querying system that allows for the integration of multiple data sources. DEX makes graph querying possible in different flavors, including link analysis, social network analysis, pattern recognition and keyword search. The richness of DEX shows up in the experiments that we carried out on the Internet Movie Database (IMDb). Through a variety of these complex analytical queries, DEX shows to be a generic and efficient tool on large graph databases.

Idioma originalAnglès
Títol de la publicacióCIKM 2007 - Proceedings of the 16th ACM Conference on Information and Knowledge Management
Pàgines573-582
Nombre de pàgines10
DOIs
Estat de la publicacióPublicada - 2007
Publicat externament
Esdeveniment16th ACM Conference on Information and Knowledge Management, CIKM 2007 - Lisboa, Portugal
Durada: 6 de nov. 20079 de nov. 2007

Sèrie de publicacions

NomInternational Conference on Information and Knowledge Management, Proceedings

Conferència

Conferència16th ACM Conference on Information and Knowledge Management, CIKM 2007
País/TerritoriPortugal
CiutatLisboa
Període6/11/079/11/07

Fingerprint

Navegar pels temes de recerca de 'DEX: High-performance exploration on large graphs for information retrieval'. Junts formen un fingerprint únic.

Com citar-ho