Publicación: MINING FOR FUNCTIONAL DEPENDENCIES USING SHARED RADIX TREES IN MANY-CORE MULTI-THREADED SYSTEMS
Fecha
2017
Autores
Título de la revista
ISSN de la revista
Título del volumen
Editor
EMERGENT COMPUTATION
Resumen
WE CONSIDER THE PROBLEM OF MINING FOR FUNCTIONAL DEPENDENCIES IN RELATIONAL DATABASES. INTERMEDIATE DATA STRUCTURES, ALTHOUGH SIMPLE, EXPLODE IN SIZE AND A SOLUTION IS PROPOSED USING RADIX TREES TO REDUCE MEMORY UTILIZATION. PARALLELISM IS FURTHER APPLIED IN A MULTI-CORE COMPUTER TO FURTHER SPEEDUP THE PROCESS. BECAUSE BIT-PERMUTATIONS ARE THE BASIS OF THE CONSTRUCTION OF A BINARY INTERMEDIATE MATRIX, RADIX TREES REDUCE THE MEMORY USAGE 10 TIMES. MULTI-THREADING THE CONSTRUCTION AND PROCESSING OF THE INTERMEDIATE DATA LEADS TO A CONCURRENT COMPUTING AVERAGE-OVER-TIME OF 63 % ON AN EQUIVALENT SPEEDUP OF 6.3 ON A SYSTEM WITH 12 CORES, 256 GB OF MEMORY AND 1 TB SSD.
