A. Solanas, A. Martmez-Balleste, J. Domingo-Ferrer, J. M. Mateo-Sanz
{"title":"A 2/sup d/-tree-based blocking method for microaggregating very large data sets","authors":"A. Solanas, A. Martmez-Balleste, J. Domingo-Ferrer, J. M. Mateo-Sanz","doi":"10.1109/ARES.2006.1","DOIUrl":null,"url":null,"abstract":"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 2/sup d/-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.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Conference on Availability, Reliability and Security (ARES'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARES.2006.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
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 2/sup d/-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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
