Close category search window
 

A 2d-tree-based blocking method for microaggregating very large data sets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Solanas, A. ; Dept. of Comput. Eng. & Maths, Univ. Rovira i Virgili, Catalonia, Spain ; Martmez-Balleste, A. ; Domingo-Ferrer, J. ; Mateo-Sanz, J.M.

Blocking is a well-known technique used to partition a set of records into several subsets of manageable size. The standard approach to blocking is to split the records according to the values of one or several attributes (called blocking attributes). This paper presents a new blocking method based on 2d-trees for intelligently partitioning very large data sets for micro aggregation. A number of experiments has been carried out in order to compare our method with the most typical univariate one.

Published in:
Availability, Reliability and Security, 2006. ARES 2006. The First International Conference on

Date of Conference: 20-22 April 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.