qCube : efficient integration of range query operators over a high dimension data cube.

Detalhes bibliográficos
Autor(a) principal: Silva, Rodrigo Rocha
Data de Publicação: 2013
Outros Autores: Lima, Joubert de Castro, Hirata, Celso Massaki
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UFOP
Texto Completo: http://www.repositorio.ufop.br/handle/123456789/4362
Resumo: Many decision support tasks involve range query operators such as Similar, Not Equal, Between, Greater or Less than and Some. Traditional cube approaches only use Equal operator in their summarized queries. Recent cube approaches implement range query operators, but they suffer from dimensionality problem, where a linear dimension increase consumes exponential storage space and runtime. Frag-Cubing and its extension, using bitmap index, are the most promising sequential solutions for high dimension data cubes, but they implement only Equal and Sub-cube query operators. In this paper, we implement a new high dimension sequential range cube approach, named Range Query Cube or just qCube. The qCube implements Equal, Not Equal, Distinct, Sub-cube, Greater or Less than, Some, Between, Similar and Top-k Similar query operators over a high dimension data cube. Comparative tests with qCube and Frag-Cubing use relations with 20, 30 or 60 dimensions, 5k distinct values on each dimension and 10 million tuples. In general, qCube has similar behavior when compared with Frag-Cubing, but it is faster to answer point and inquire queries. Frag-Cubing could not answer inquire queries with more than two Sub-cube operators in a relation with 30 dimensions, 5k cardinality and 10M tuples. In addition, qCube efficiently answered inquire queries from such a relation using six Sub-cube or Distinct operators. In general, complex queries with 30 operators, combining point, range and inquire operators, took less than 10 seconds to be answered byqCube. A massive qCube with 60 dimensions, 5k cardinality on each dimension and 100M tuples answered queries with five range operators, ten point operators and one inquire operator in less than 2 minutes.
id UFOP_1e752284e74c8b1a9df042c824f417ba
oai_identifier_str oai:repositorio.ufop.br:123456789/4362
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling qCube : efficient integration of range query operators over a high dimension data cube.Data cubeHigh dimensionInquire queryRange queryMany decision support tasks involve range query operators such as Similar, Not Equal, Between, Greater or Less than and Some. Traditional cube approaches only use Equal operator in their summarized queries. Recent cube approaches implement range query operators, but they suffer from dimensionality problem, where a linear dimension increase consumes exponential storage space and runtime. Frag-Cubing and its extension, using bitmap index, are the most promising sequential solutions for high dimension data cubes, but they implement only Equal and Sub-cube query operators. In this paper, we implement a new high dimension sequential range cube approach, named Range Query Cube or just qCube. The qCube implements Equal, Not Equal, Distinct, Sub-cube, Greater or Less than, Some, Between, Similar and Top-k Similar query operators over a high dimension data cube. Comparative tests with qCube and Frag-Cubing use relations with 20, 30 or 60 dimensions, 5k distinct values on each dimension and 10 million tuples. In general, qCube has similar behavior when compared with Frag-Cubing, but it is faster to answer point and inquire queries. Frag-Cubing could not answer inquire queries with more than two Sub-cube operators in a relation with 30 dimensions, 5k cardinality and 10M tuples. In addition, qCube efficiently answered inquire queries from such a relation using six Sub-cube or Distinct operators. In general, complex queries with 30 operators, combining point, range and inquire operators, took less than 10 seconds to be answered byqCube. A massive qCube with 60 dimensions, 5k cardinality on each dimension and 100M tuples answered queries with five range operators, ten point operators and one inquire operator in less than 2 minutes.2015-01-26T11:13:50Z2015-01-26T11:13:50Z2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfSILVA, R. R.; LIMA, J. de C.; HIRATA, C. M. qCube: efficient integration of range query operators over a high dimension data cube. Journal of Information and Data Management - JIDM, v. 4, n. 3, p. 469-482, out. 2013. Disponível em: <https://seer.lcc.ufmg.br/index.php/jidm/article/view/266/217>. Acesso em: 22 jan. 2015.2178-7107http://www.repositorio.ufop.br/handle/123456789/4362Permission to copy without fee all or part of the material printed in JIDM is granted provided that the copies are not made or distributed for commercial advantage, and that notice is given that copying is by permission of the Sociedade Brasileira de Computação. Fonte: Informação contida no artigo.info:eu-repo/semantics/openAccessSilva, Rodrigo RochaLima, Joubert de CastroHirata, Celso Massakiengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOP2019-06-12T15:53:41Zoai:repositorio.ufop.br:123456789/4362Repositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-06-12T15:53:41Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false
dc.title.none.fl_str_mv qCube : efficient integration of range query operators over a high dimension data cube.
title qCube : efficient integration of range query operators over a high dimension data cube.
spellingShingle qCube : efficient integration of range query operators over a high dimension data cube.
Silva, Rodrigo Rocha
Data cube
High dimension
Inquire query
Range query
title_short qCube : efficient integration of range query operators over a high dimension data cube.
title_full qCube : efficient integration of range query operators over a high dimension data cube.
title_fullStr qCube : efficient integration of range query operators over a high dimension data cube.
title_full_unstemmed qCube : efficient integration of range query operators over a high dimension data cube.
title_sort qCube : efficient integration of range query operators over a high dimension data cube.
author Silva, Rodrigo Rocha
author_facet Silva, Rodrigo Rocha
Lima, Joubert de Castro
Hirata, Celso Massaki
author_role author
author2 Lima, Joubert de Castro
Hirata, Celso Massaki
author2_role author
author
dc.contributor.author.fl_str_mv Silva, Rodrigo Rocha
Lima, Joubert de Castro
Hirata, Celso Massaki
dc.subject.por.fl_str_mv Data cube
High dimension
Inquire query
Range query
topic Data cube
High dimension
Inquire query
Range query
description Many decision support tasks involve range query operators such as Similar, Not Equal, Between, Greater or Less than and Some. Traditional cube approaches only use Equal operator in their summarized queries. Recent cube approaches implement range query operators, but they suffer from dimensionality problem, where a linear dimension increase consumes exponential storage space and runtime. Frag-Cubing and its extension, using bitmap index, are the most promising sequential solutions for high dimension data cubes, but they implement only Equal and Sub-cube query operators. In this paper, we implement a new high dimension sequential range cube approach, named Range Query Cube or just qCube. The qCube implements Equal, Not Equal, Distinct, Sub-cube, Greater or Less than, Some, Between, Similar and Top-k Similar query operators over a high dimension data cube. Comparative tests with qCube and Frag-Cubing use relations with 20, 30 or 60 dimensions, 5k distinct values on each dimension and 10 million tuples. In general, qCube has similar behavior when compared with Frag-Cubing, but it is faster to answer point and inquire queries. Frag-Cubing could not answer inquire queries with more than two Sub-cube operators in a relation with 30 dimensions, 5k cardinality and 10M tuples. In addition, qCube efficiently answered inquire queries from such a relation using six Sub-cube or Distinct operators. In general, complex queries with 30 operators, combining point, range and inquire operators, took less than 10 seconds to be answered byqCube. A massive qCube with 60 dimensions, 5k cardinality on each dimension and 100M tuples answered queries with five range operators, ten point operators and one inquire operator in less than 2 minutes.
publishDate 2013
dc.date.none.fl_str_mv 2013
2015-01-26T11:13:50Z
2015-01-26T11:13:50Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv SILVA, R. R.; LIMA, J. de C.; HIRATA, C. M. qCube: efficient integration of range query operators over a high dimension data cube. Journal of Information and Data Management - JIDM, v. 4, n. 3, p. 469-482, out. 2013. Disponível em: <https://seer.lcc.ufmg.br/index.php/jidm/article/view/266/217>. Acesso em: 22 jan. 2015.
2178-7107
http://www.repositorio.ufop.br/handle/123456789/4362
identifier_str_mv SILVA, R. R.; LIMA, J. de C.; HIRATA, C. M. qCube: efficient integration of range query operators over a high dimension data cube. Journal of Information and Data Management - JIDM, v. 4, n. 3, p. 469-482, out. 2013. Disponível em: <https://seer.lcc.ufmg.br/index.php/jidm/article/view/266/217>. Acesso em: 22 jan. 2015.
2178-7107
url http://www.repositorio.ufop.br/handle/123456789/4362
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFOP
instname:Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
instname_str Universidade Federal de Ouro Preto (UFOP)
instacron_str UFOP
institution UFOP
reponame_str Repositório Institucional da UFOP
collection Repositório Institucional da UFOP
repository.name.fl_str_mv Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)
repository.mail.fl_str_mv repositorio@ufop.edu.br
_version_ 1813002863210659840