Interactive multidimensional modeling of linked data for exploratory OLAP
Exploratory OLAP aims at coupling the precision and detail of corporate data with the information wealth of LOD. While some techniques to create, publish, and query RDF cubes are already available, little has been said about how to contextualize these cubes with situational data in an on-demand fash...
| Autores: | , , , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2018 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/119270 |
| Acesso em linha: | https://hdl.handle.net/2117/119270 https://dx.doi.org/10.1016/j.is.2018.06.004 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Data warehousing Multidimensional modeling Linked data Exploratory OLAP Gestor de dades Àrees temàtiques de la UPC::Informàtica::Sistemes d'informació |
| Resumo: | Exploratory OLAP aims at coupling the precision and detail of corporate data with the information wealth of LOD. While some techniques to create, publish, and query RDF cubes are already available, little has been said about how to contextualize these cubes with situational data in an on-demand fashion. In this paper we describe an approach, called iMOLD, that enables non-technical users to enrich an RDF cube with multidimensional knowledge by discovering aggregation hierarchies in LOD. This is done through a user-guided process that recognizes in the LOD the recurring modeling patterns that express roll-up relationships between RDF concepts, then translates these patterns into aggregation hierarchies to enrich the RDF cube. Two families of aggregation patterns are identified, based on associations and generalization respectively, and the algorithms for recognizing them are described. To evaluate iMOLD in terms of efficiency and effectiveness we compare it with a related approach in the literature, we propose a case study based on DBpedia, and we discuss the results of a test made with real users. |
|---|