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ón científica: Capítulo del libroContribución a congreso/conferenciarevisión exhaustiva

61 Citas (Scopus)

Resumen

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 originalInglés
Título de la publicación alojadaCIKM 2007 - Proceedings of the 16th ACM Conference on Information and Knowledge Management
Páginas573-582
Número de páginas10
DOI
EstadoPublicada - 2007
Publicado de forma externa
Evento16th ACM Conference on Information and Knowledge Management, CIKM 2007 - Lisboa, Portugal
Duración: 6 nov 20079 nov 2007

Serie de la publicación

NombreInternational Conference on Information and Knowledge Management, Proceedings

Conferencia

Conferencia16th ACM Conference on Information and Knowledge Management, CIKM 2007
País/TerritorioPortugal
CiudadLisboa
Período6/11/079/11/07

Huella

Profundice en los temas de investigación de 'DEX: High-performance exploration on large graphs for information retrieval'. En conjunto forman una huella única.

Citar esto