Interactive Path Query Specification on ...
Document type :
Autre communication scientifique (congrès sans actes - poster - séminaire...): Communication dans un congrès avec actes
Title :
Interactive Path Query Specification on Graph Databases
Author(s) :
Bonifati, Angela [Auteur]
Université Claude Bernard Lyon 1 [UCBL]
Linking Dynamic Data [LINKS]
Base de Données [BD]
Ciucanu, Radu [Auteur correspondant]
Linking Dynamic Data [LINKS]
University of Oxford
Lemay, Aurélien [Auteur]
Linking Dynamic Data [LINKS]
Université Claude Bernard Lyon 1 [UCBL]
Linking Dynamic Data [LINKS]
Base de Données [BD]
Ciucanu, Radu [Auteur correspondant]
Linking Dynamic Data [LINKS]
University of Oxford
Lemay, Aurélien [Auteur]
Linking Dynamic Data [LINKS]
Conference title :
31ème Conférence sur la Gestion de Données - Principes, Technologies et Applications - BDA 2015
City :
Île de Porquerolles
Country :
France
Start date of the conference :
2015-09-29
HAL domain(s) :
Informatique [cs]/Base de données [cs.DB]
English abstract : [en]
Graph databases are becoming pervasive in several application scenarios such as the Semantic Web, social and biological networks, and geographical databases, to name a few. However, specifying a graph query is a cumbersome ...
Show more >Graph databases are becoming pervasive in several application scenarios such as the Semantic Web, social and biological networks, and geographical databases, to name a few. However, specifying a graph query is a cumbersome task for non-expert users because graph databases (i) are usually of large size hence difficult to visualize and (ii) do not carry proper metadata as there is no clear distinction between the instances and the schemas. We present GPS, a system for interactive path query specification on graph databases, which assists the user to specify path queries defined by regular expressions. The user is interactively asked to visualize small fragments of the graph and to label nodes of interest as positive or negative, depending on whether or not she would like the nodes as part of the query result. After each interaction, the system prunes the uninformative nodes i.e., those that do not add any information about the user's goal query. Thus, the system also guides the user to specify her goal query with a minimal number of interactions.Show less >
Show more >Graph databases are becoming pervasive in several application scenarios such as the Semantic Web, social and biological networks, and geographical databases, to name a few. However, specifying a graph query is a cumbersome task for non-expert users because graph databases (i) are usually of large size hence difficult to visualize and (ii) do not carry proper metadata as there is no clear distinction between the instances and the schemas. We present GPS, a system for interactive path query specification on graph databases, which assists the user to specify path queries defined by regular expressions. The user is interactively asked to visualize small fragments of the graph and to label nodes of interest as positive or negative, depending on whether or not she would like the nodes as part of the query result. After each interaction, the system prunes the uninformative nodes i.e., those that do not add any information about the user's goal query. Thus, the system also guides the user to specify her goal query with a minimal number of interactions.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Nationale
Popular science :
Non
Collections :
Source :