Cell suppression in a special class of linked tables - unece

0 downloads 0 Views 188KB Size Report
Dec 17, 2007 - 5-digit NACE code × high level region. 2-digit NACE code × detailed region ... Notes. Hierarchies. Need way to define set of linked tables ...
Cell suppression in a special class of linked tables Peter-Paul de Wolf Statistics Netherlands December 17, 2007 Manchester, Great Brittain

Contents Introduction Hierarchies Trees Pure sub Covering Linking Problems Example Notes

Introduction Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems

Cell suppression Stand alone table

Example Notes

Hierarchically linked tables

Introduction Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems

Cell suppression Stand alone table

Example Notes

Hierarchically linked tables Subset of generally linked tables

Introduction Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems

Cell suppression Stand alone table

Example Notes

Hierarchically linked tables Subset of generally linked tables Hierarchically linked Different detail of same hierarchy

Introduction Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems

Cell suppression Stand alone table

Example Notes

Hierarchically linked tables Subset of generally linked tables Hierarchically linked Different detail of same hierarchy 5-digit NACE code × high level region 2-digit NACE code × detailed region

Introduction Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems

Cell suppression Stand alone table

Example Notes

Hierarchically linked tables Subset of generally linked tables Hierarchically linked Different detail of same hierarchy 5-digit NACE code × high level region 2-digit NACE code × detailed region 5-digit NACE code × detailed region

Introduction Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems

Cell suppression Stand alone table

Example Notes

Hierarchically linked tables Subset of generally linked tables Hierarchically linked Different detail of same hierarchy 5-digit NACE code × high level region 2-digit NACE code × detailed region 5-digit NACE code × detailed region

Hierarchies Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

Need way to define set of linked tables

Hierarchies as trees Contents Introduction Hierarchies Trees Pure sub Covering Linking

S

A

A1 A2

Problems Example Notes

B

B1 B2

B21 B22

C

C1 C2

C21 C22

Pure sub hierarchies Contents Introduction

G

Hierarchies Trees Pure sub

S

A

H1 S

A1

H2 S

A

H3 A1

S

A

Covering Linking

Problems Example

B

A2

B

B1

C

A2 C1

B1

C2

B2

Notes

B2

B21 B22

C

C1 C2

C1 C2

C21 C22

B

Pure sub hierarchies Contents Introduction

G

Hierarchies Trees Pure sub

S

A

H1 S

A1

H2 S

A

H3 A1

S

A

Covering Linking

Problems Example

B

A2

B

B1

C

A2 C1

B1

C2

B2

Notes

B2

B21 B22

C

C1

C1 C2

C2 C21 C22

H1  G

H2 6 G

H3 6 G

B

Covering hierarchies Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example

G covers the set of hierarchies (H1 , . . . , HK )

Notes

if G is the smallest hierarchy with Hi  G

∀i = 1, . . . , K

Defining linked tables Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example

User specifies N tables to be protected Tables can be hierarchical

Notes

Tables have M different spanning variables Define M-dimensional table with hierarchies covering user defined hierarchies Use modular approach, disregarding subtables not in user set of tables

Defining linked tables Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example

User specifies N tables to be protected Tables can be hierarchical

Notes

Tables have M different spanning variables Define M-dimensional table with hierarchies covering user defined hierarchies Use modular approach, disregarding subtables not in user set of tables

Defining linked tables Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

User specifies N tables to be protected Tables can be hierarchical All hierarchies of same variable should be coverable! Tables have M different spanning variables Define M-dimensional table with hierarchies covering user defined hierarchies Use modular approach, disregarding subtables not in user set of tables

Defining linked tables Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

User specifies N tables to be protected Tables can be hierarchical All hierarchies of same variable should be coverable! Tables have M different spanning variables Define M-dimensional table with hierarchies covering user defined hierarchies Use modular approach, disregarding subtables not in user set of tables

Defining linked tables Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

User specifies N tables to be protected Tables can be hierarchical All hierarchies of same variable should be coverable! Tables have M different spanning variables Define M-dimensional table with hierarchies covering user defined hierarchies Use modular approach, disregarding subtables not in user set of tables

Defining linked tables Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

User specifies N tables to be protected Tables can be hierarchical All hierarchies of same variable should be coverable! Tables have M different spanning variables Define M-dimensional table with hierarchies covering user defined hierarchies Use modular approach, disregarding subtables not in user set of tables

Problems Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

Implicitly defined structure is not protected explicitly

Problems Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

Implicitly defined structure is not protected explicitly Set of tables completely determines interior of higher dimensional table

Example of problem Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example

A1 A2 Total

B1 30 270 300

B2 150 110 260

B3 70 255 325

Total 250 635 885

A1 A2 Total

C1 140 85 225

C3 100 170 130 400

Total 300 260 325 885

Notes

B1 B2 B3 Total

C1 110 40 75 225

C2 90 50 120 260

C2 50 210 260

C3 60 340 400

Total 250 635 885

Example of problem Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

A1 A2 Total

B1 30 270 300

B2 B3 150 70 110 255 260 325 Safe!

B1 B2 B3 Total

Total 250 635 885

C1 110 40 75 225

C2 90 50 120 260 Safe!

A1 A2 Total

C1 C2 140 50 85 210 225 260 Safe!

C3 100 170 130 400

Total 300 260 325 885

C3 60 340 400

Total 250 635 885

Example of problem Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

A1 A2 Total

B1 30 270 300

B2 B3 150 70 110 255 260 325 Safe!

B1 B2 B3 Total

Total 250 635 885

C1 110 40 75 225

C2 90 50 120 260 Safe!

A1 A2 Total

C1 C2 140 50 85 210 225 260 Safe!

C3 100 170 130 400

Total 300 260 325 885

However: interior A × B × C is unique! Any unsafe cell in interior is implicitly disclosed!

C3 60 340 400

Total 250 635 885

Contents Introduction Hierarchies Trees Pure sub Covering Linking

Problems Example Notes

Similarly: suppression pattern can be broken

Contents Introduction Hierarchies Trees Pure sub Covering Linking

Similarly: suppression pattern can be broken

Problems Example Notes

Problem may also occur in current situation Used hierarchy not complete detail

Thank you.

Suggest Documents