The largeness and the heterogeneity of most graph-modeleddatasets in several database application areas make the queryprocess a real challenge because of the lack of a completeknowledge of the vocabulary used, as well as of the informationabout the structural relationships between the data.To overcome these problems, flexible query answering capabilitiesare an essential need. In this paper we present a general model for supporting approximate queries on graphmodeled data. Approximation is both on the vocabularies and the structure. The model is general in that it is not bound to a specific graph data model, rather it gracefully accommodates labeled directed/undirected data graphs with labeled/unlabeled edges. The query answering principles underlying the model are not compelled to a specific data graph, instead they are founded on properties inferable from the data model the data graph conforms to. We complement the work with a ranking model to deal with data approximations and with an efficient top-k retrieval algorithm which smartly accesses ad-hoc data structures andgenerates the most promising answers in an order correlatedwith the ranking measures. Experimental results prove thegood effectiveness and efficiency of our proposal on differentreal world datasets.

Flexible Query Answering on Graph-modeled Data / Mandreoli, Federica; Martoglia, Riccardo; W., Penzo; Villani, Giorgio. - STAMPA. - (2009), pp. 216-227. ((Intervento presentato al convegno 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09 tenutosi a Saint-Petersburg, Russia nel March 23-26, 2009 [10.1145/1516360.1516386].

Flexible Query Answering on Graph-modeled Data

MANDREOLI, Federica;MARTOGLIA, Riccardo;VILLANI, Giorgio
2009

Abstract

The largeness and the heterogeneity of most graph-modeleddatasets in several database application areas make the queryprocess a real challenge because of the lack of a completeknowledge of the vocabulary used, as well as of the informationabout the structural relationships between the data.To overcome these problems, flexible query answering capabilitiesare an essential need. In this paper we present a general model for supporting approximate queries on graphmodeled data. Approximation is both on the vocabularies and the structure. The model is general in that it is not bound to a specific graph data model, rather it gracefully accommodates labeled directed/undirected data graphs with labeled/unlabeled edges. The query answering principles underlying the model are not compelled to a specific data graph, instead they are founded on properties inferable from the data model the data graph conforms to. We complement the work with a ranking model to deal with data approximations and with an efficient top-k retrieval algorithm which smartly accesses ad-hoc data structures andgenerates the most promising answers in an order correlatedwith the ranking measures. Experimental results prove thegood effectiveness and efficiency of our proposal on differentreal world datasets.
12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09
Saint-Petersburg, Russia
March 23-26, 2009
216
227
Mandreoli, Federica; Martoglia, Riccardo; W., Penzo; Villani, Giorgio
Flexible Query Answering on Graph-modeled Data / Mandreoli, Federica; Martoglia, Riccardo; W., Penzo; Villani, Giorgio. - STAMPA. - (2009), pp. 216-227. ((Intervento presentato al convegno 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09 tenutosi a Saint-Petersburg, Russia nel March 23-26, 2009 [10.1145/1516360.1516386].
File in questo prodotto:
File Dimensione Formato  
EDBT2009.pdf

non disponibili

Tipologia: Post-print dell'autore (bozza post referaggio)
Dimensione 616.49 kB
Formato Adobe PDF
616.49 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/611484
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 27
  • ???jsp.display-item.citation.isi??? ND
social impact