UNIDAD ZACATENCO DEPARTAMENTO DE ... - Cinvestav

More documents

Recommendations

Info

ABSTRACT XXI partitioning in multimedia databases. Our contributions are the following: 1. We create a vertical partitioning method for relational databases, which is based on support, a measure used in association rule mining. The main advantage of our method is that it automatically obtains the value of the threshold of minimum support, and according to this threshold, it finds the optimal vertical partitioning scheme, while other related methods probe different thresholds to get different vertical partitioning schemes, and then they use a cost model to find the optimal. 2. We develop a vertical partitioning algorithm for multimedia databases, called MAVP (Multimedia Adaptable Vertical Partitioning), The main advantage of MAVP is that it takes into account the size of the attributes to obtain fragments that minimizes the amount of both irrelevant data accessed and data transported by the queries. 3. We present a cost model to evaluate vertical partitioning schemes in distributed multimedia databases. Some existing cost models only measure the number of disk accesses (I/O) to query processing, but they do not consider the transportation cost, which dominates query costs in distributed multimedia databases. The models which measure the transportation cost do not take into account the size of the attributes. Our cost model uses the size of the attributes to obtain both the cost of access- ing irrelevant attributes and the transportation cost of the queries in a distributed multimedia database. 4. We propose an active system for dynamic vertical partitioning of relational databases, called DYVEP (DYnamic VErtical Partitioning). Using active rules, DYVEP can monitor queries run against the database in order to accumulate the necessary information to develop the vertical partitioning, and automatically trigger the partitioning process if it is determined that the vertical partitioning scheme has become inadequate due to changes in access patterns or in the database scheme.
XXII ABSTRACT 5. We extend DYVEP to use it in multimedia databases (DYMOND). DYMOND has four active rule-based modules: 1) The Statistics Collector stores, filters and ana- lyzes information related to the database queries, like the access frequency of such queries and the multimedia objects accessed by them, 2) The Performance Evalua- tor calculates the cost of the current vertical partitioning scheme using the proposed cost model, and if the cost is greater than a threshold, then it triggers the vertical partitioning algorithm, 3) MAVP generates a vertical partitioning scheme, which minimizes the execution cost of the queries, and 4) the Partitioning Generator ma- terializes the partitioning scheme found by MAVP.
Page 1 and 2: CENTRO DE INVESTIGACIÓN Y DE ESTUD
Page 3 and 4: II ÍNDICE GENERAL 2.2.1. Estrategi
Page 5 and 6: IV ÍNDICE GENERAL 6.2.1. Recolecto
Page 7 and 8: Índice de figuras 2.1. Ambiente de
Page 9 and 10: VIII ÍNDICE DE FIGURAS 7.27. Proce
Page 11: X ÍNDICE DE TABLAS 4.7. Fragmentos
Page 14 and 15: GLOSARIO DE SIGLAS XIII CAT Cluster
Page 16 and 17: GLOSARIO DE SIGLAS XV TC Transporta
Page 18 and 19: Resumen Una de las actividades más
Page 20 and 21: RESUMEN XIX disparar automáticamen
Page 24 and 25: Capítulo 1 Introducción La consta
Page 26 and 27: como libros, periódicos, revistas,
Page 28 and 29: 1.2. Diseño de bases de datos dist
Page 34 and 35: 1.3. Motivación 11 el esquema se d
Page 36 and 37: 1.5. Organización de la tesis 13 U
Page 38 and 39: 2.1. Conceptos de bases de datos di
Page 72 and 73:
2.3. Procesamiento de consultas 49
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
2.4. Comentarios 57 Se explicaron l
Page 82 and 83:
3.1. Fragmentación estática en ba
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
3.3. Fragmentación dinámica en ba
Page 126 and 127:
Capítulo 4 MAVP: Fragmentación Ve
Page 128 and 129:
4.2. Motivación 105 q1:Encuentra t
Page 130 and 131:
4.3. Árbol de partición 107 Figur
Page 132 and 133:
4.4. Beneficio de fusión de MAVP 1
Page 134 and 135:
4.5. Modelo de costo 111 Algoritmo
Page 136 and 137:
4.5. Modelo de costo 113 Por ejempl
Page 138 and 139:
4.6. Experimentos y evaluación 115
Page 140 and 141:
4.6. Experimentos y evaluación 117
Page 142 and 143:
4.8. Conclusión 119 costo de otras
Page 144 and 145:
a esta operación de observación d
Page 146 and 147:
5.1. Reglas activas 123 medio de re
Page 148 and 149:
5.1. Reglas activas 125 de datos (p
Page 150 and 151:
5.2. Arquitectura de DYVEP 127 Fase
Page 152 and 153:
5.2. Arquitectura de DYVEP 129 THEN
Page 154 and 155:
5.3. Implementación de DYVEP 131 s
Page 156 and 157:
5.3. Implementación de DYVEP 133 i
Page 158 and 159:
5.3. Implementación de DYVEP 135 F
Page 160 and 161:
5.3. Implementación de DYVEP 137 F
Page 162 and 163:
5.3. Implementación de DYVEP 139 S
Page 164 and 165:
5.4. Discusión 141 Tabla 5.2: Comp
Page 166 and 167:
Capítulo 6 DYMOND: Un Sistema Acti
Page 168 and 169:
6.1. Motivación 145 Algoritmo 6.1
Page 170 and 171:
6.2. Arquitectura de DYMOND 147 DBA
Page 172 and 173:
6.2. Arquitectura de DYMOND 149 fra
Page 174 and 175:
6.2. Arquitectura de DYMOND 151 IF
Page 176 and 177:
6.2. Arquitectura de DYMOND 153 Reg
Page 178 and 179:
6.2. Arquitectura de DYMOND 155 Reg
Page 180 and 181:
6.2. Arquitectura de DYMOND 157 en
Page 182 and 183:
6.2. Arquitectura de DYMOND 159 act
Page 184 and 185:
6.2. Arquitectura de DYMOND 161 eve
Page 186 and 187:
6.4. Conclusión 163 Tabla 6.6: Com
Page 188 and 189:
7.1. Creación del EFV inicial 165
Page 190 and 191:
Page 192 and 193:
Page 194 and 195:
Page 196 and 197:
Page 198 and 199:
Page 200 and 201:
Page 202 and 203:
7.2. Proceso de la fragmentación v
Page 204 and 205:
Page 206 and 207:
Page 208 and 209:
Page 210 and 211:
Page 212 and 213:
Page 214 and 215:
Page 216 and 217:
Page 218 and 219:
7.3. Descripción del esquema DYMON
Page 220 and 221:
7.4. Descripción de las tablas y d
Page 222 and 223:
7.4. Descripción de las tablas y d
Page 224 and 225:
7.5. Conclusión 201 update_flag_pt
Page 226 and 227:
8.1. Fragmentación vertical estát
Page 228 and 229:
Page 230 and 231:
Page 232 and 233:
8.2. Fragmentación vertical dinám
Page 234 and 235:
Page 236 and 237:
Page 238 and 239:
Page 240 and 241:
Page 242 and 243:
Capítulo 9 Conclusiones En esta se
Page 244 and 245:
9.1. Conclusiones 221 Una vez se al
Page 246 and 247:
9.1. Conclusiones 223 asociación e
Page 248 and 249:
Publicaciones Durante el trabajo de
Page 250 and 251:
Bibliografía [1] Hector García Mo
Page 252 and 253:
BIBLIOGRAFÍA 229 [27] Valduriez, P
Page 254 and 255:
BIBLIOGRAFÍA 231 [56] Ezeife, C.I.
Page 256 and 257:
BIBLIOGRAFÍA 233 [81] ling Shyu, M
Page 258 and 259:
BIBLIOGRAFÍA 235 [104] Son, J.H.,
show all

UNIDAD ZACATENCO DEPARTAMENTO DE ... - Cinvestav

Create successful ePaper yourself

Delete template?

Save as template?