Publicación:
EFFICIENT ALGORITHMS FOR REPAIRING INCONSISTENT DIMENSIONS IN DATA WAREHOUSES

Vista sencilla de ítem
dc.creatorRAUL EDUARDO ARREDONDO FLORES
dc.creatorMÓNICA ALEJANDRA CANIUPÁN MARILEO
dc.date2013
dc.date.accessioned2025-01-10T15:01:25Z
dc.date.available2025-01-10T15:01:25Z
dc.date.issued2013
dc.description.abstractDIMENSIONS IN DATA WAREHOUSES (DWS) ARE USUALLYMODELED AS A HIERARCHICAL SET OF CATEGORIES CALLED THE DIMENSIONSCHEMA. TO GUARANTEE SUMMARIZABILITY, THIS IS, THE CAPABILITY OFUSING PRE-COMPUTED ANSWERS AT LOWER LEVELS TO COMPUTE ANSWERSAT HIGHER LEVELS, A DIMENSION IS REQUIRED TO BE STRICT AND COVERING,MEANING THAT EVERY ELEMENT OF THE DIMENSION MUST BE CONNECTEDTO A UNIQUE ANCESTOR IN EACH OF ITS ANCESTOR CATEGORIES. IN PRACTICE,ROLLUP RELATIONS OF DIMENSIONS NEED TO BE RECLASSI?ED TO CORRECTERRORS OR TO ADAPT THE DATA TO CHANGES. AFTER THESE OPERATIONS THEDIMENSION MAY BECOME NON-STRICT. A MINIMAL R-REPAIR IS A NEWDIMENSION THAT IS STRICT AND COVERING, IS OBTAINED FROM THE ORIGINALDIMENSION THROUGH A MINIMUM NUMBER OF CHANGES, AND KEEPSTHE SET OF RECLASSI?CATIONS. IN THE GENERAL CASE ?NDING AN R-REPAIRFOR A DIMENSION IS NP-COMPLETE. WE PRESENT EF?CIENT POLYNOMIALTIME ALGORITHMS TO COMPUTE A SINGLE R-REPAIR FOR DIMENSIONS THATCONTAIN ONE CON?ICTING LEVEL AND BECOME INCONSISTENT AFTER ONERECLASSI?CATION OF ELEMENTS.
dc.formatapplication/pdf
dc.identifier.issn1522-4902
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/10049
dc.languagespa
dc.publisherPROCEEDINGS- INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY
dc.rightsPUBLICADA
dc.titleEFFICIENT ALGORITHMS FOR REPAIRING INCONSISTENT DIMENSIONS IN DATA WAREHOUSES
dc.typePROCEEDING PAPER
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE SISTEMAS DE INFORMACION
ubb.Otra ReparticionDEPARTAMENTO DE SISTEMAS DE INFORMACION
ubb.SedeCONCEPCIÓN
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Otros Documentos