Mostrar o rexistro simple do ítem
Efficient Representation of Multidimensional Data over Hierarchical Domains
dc.contributor.author | Brisaboa, Nieves R. | |
dc.contributor.author | Cerdeira-Pena, Ana | |
dc.contributor.author | López López, Narciso | |
dc.contributor.author | Navarro, Gonzalo | |
dc.contributor.author | Penabad, Miguel R. | |
dc.contributor.author | Silva-Coira, Fernando | |
dc.date.accessioned | 2017-02-23T16:20:36Z | |
dc.date.available | 2017-02-23T16:20:36Z | |
dc.date.issued | 2016-09-21 | |
dc.identifier.citation | Brisaboa N.R., Cerdeira-Pena A., López-López N., Navarro G., Penabad M.R., Silva-Coira F. (2016) Efficient Representation of Multidimensional Data over Hierarchical Domains. In: Inenaga S., Sadakane K., Sakai T. (eds) String Processing and Information Retrieval. SPIRE 2016. Lecture Notes in Computer Science, vol 9954. Springer, Cham | es_ES |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | http://hdl.handle.net/2183/18175 | |
dc.description | The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-46049-9_19 | es_ES |
dc.description.abstract | [Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of each dimension. This is the typical case of OLAP databases. A basic approach is to represent each hierarchy as a one-dimensional line and recast the queries as multidimensional range queries. This approach can be implemented compactly by generalizing to more dimensions the k2k2 -treap, a compact representation of two-dimensional points that allows for efficient summarization queries along generic ranges. Instead, we propose a more flexible generalization, which instead of a generic quadtree-like partition of the space, follows the domain hierarchies across each dimension to organize the partitioning. The resulting structure is much more efficient than a generic multidimensional structure, since queries are resolved by aggregating much fewer nodes of the tree. | es_ES |
dc.description.sponsorship | Ministerio de Economía, Industria y Competitividad; TIN2013-46238-C4-3-R | es_ES |
dc.description.sponsorship | Ministerio de Economía, Industria y Competitividad; IDI-20141259 | es_ES |
dc.description.sponsorship | Ministerio de Economía, Industria y Competitividad; ITC-20151305 | es_ES |
dc.description.sponsorship | Ministerio de Economía y Competitividad; ITC-20151247 | es_ES |
dc.description.sponsorship | Xunta de Galicia; GRC2013/053 | es_ES |
dc.description.sponsorship | Chile.Fondo Nacional de Desarrollo Científico y Tecnológico; 1-140796 | es_ES |
dc.description.sponsorship | COST. IC1302 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Springer | es_ES |
dc.relation | info:eu-repo/grantAgreement/EC/H2020/690941 | es_ES |
dc.relation.uri | http://dx.doi.org/10.1007/978-3-319-46049-9_19 | es_ES |
dc.subject | Efficient representation | es_ES |
dc.subject | Multidimensional data | es_ES |
dc.subject | Hierarchical domains | es_ES |
dc.subject | OLAP databases | es_ES |
dc.title | Efficient Representation of Multidimensional Data over Hierarchical Domains | es_ES |
dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
UDC.journalTitle | Lecture Notes in Computer Science | es_ES |
UDC.volume | 9954 | es_ES |
UDC.startPage | 191 | es_ES |
UDC.endPage | 203 | es_ES |
dc.identifier.doi | 10.1007/978-3-319-46049-9_19 | |
UDC.conferenceTitle | 23rd International Symposium on String Processing and Information Retrieval (SPIRE) | es_ES |
Ficheiros no ítem
Este ítem aparece na(s) seguinte(s) colección(s)
-
GI-LBD - Congresos, conferencias, etc. [18]
-
OpenAIRE [264]