NDLI: Parallel mining of dependencies

Content Provider	IEEE Xplore Digital Library
Author	Garnaud, E. Hanusse, N. Maabout, S. Novelli, N.
Copyright Year	2014
Description	Author affiliation: LaBRI, Univ. of Bordeaux, Bordeaux, France (Garnaud, E.; Hanusse, N.; Maabout, S.) \|\| LIF, Aix-Marseille Univ., Marseille, France (Novelli, N.)
Abstract	The problem of extracting functional dependencies (FDs) from databases has a long story dating back to the 90's. Still, efficient solutions taking into account both material evolution, namely the advent of multicore machines, and the amount of data that are to be mined, are still needed. In this paper we propose a parallel algorithm which, upon small modifications, extracts (i) the minimal keys, (ii) the minimal exact FDs, (iii) the minimal approximate FDs and (iv) the Conditional functional dependencies (CFDs) holding in a table. Under some natural conditions, we prove a theoretical speed up of our solution with respect to a baseline algorithm which follows a depth first search strategy. Since mining most of these dependencies require a procedure for computing the number of distinct values (NDV) which is a space consuming operation, we show how sketching techniques for estimating the exact value of NDV can be used for reducing both memory consumption as well as communications overhead when considering distributed data while guaranteeing a certain quality of the result. Our solution is implemented and some experimental results are reported here showing the efficiency and scalability of our proposal. Most notably, the theoretical speed ups are confirmed by the experiments.
Starting Page	491
Ending Page	498
File Size	881503
Page Count	8
File Format	PDF
ISBN	9781479953127
e-ISBN	9781479953134
DOI	10.1109/HPCSim.2014.6903725
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-07-21
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Program processors Computational fluid dynamics Memory management Approximation algorithms Approximation methods Parallel algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Distributed-Memory Parallel Algorithms for Matching and Coloring

Enabling hydrodynamics solver for efficient parallel simulations

Parallelization of data mining algorithms for multicore processors

Engineering parallel algorithms

Tight Approximation for Scheduling Parallel Jobs on Identical Clusters

A Communication-Optimal N-Body Algorithm for Direct Interactions

Discrete Min-Energy Scheduling on Restricted Parallel Processors

Performance analysis of the graph-partitioning algorithms used in OpenFOAM

The Synergetic Effect of Compiler, Architecture, and Manual Optimizations on the Performance of CFD on Multiprocessors

Parallel mining of dependencies

Similar Documents

Distributed-Memory Parallel Algorithms for Matching and Coloring

Enabling hydrodynamics solver for efficient parallel simulations

Parallelization of data mining algorithms for multicore processors

Engineering parallel algorithms

Tight Approximation for Scheduling Parallel Jobs on Identical Clusters

A Communication-Optimal N-Body Algorithm for Direct Interactions

Discrete Min-Energy Scheduling on Restricted Parallel Processors

Performance analysis of the graph-partitioning algorithms used in OpenFOAM

The Synergetic Effect of Compiler, Architecture, and Manual Optimizations on the Performance of CFD on Multiprocessors

Parallel mining of dependencies