File size: 158,186 Bytes
7ec75e2 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 | {
"course": "Distributed_and_Object-Oriented_Databases",
"course_id": "CO3023",
"schema_version": "material.v1",
"slides": [
{
"page_index": 0,
"chapter_num": 0,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_001.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_001.png",
"page_index": 0,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:10+07:00"
},
"raw_text": "Distributed and Object-Oriented Databases (CO3023)"
},
{
"page_index": 1,
"chapter_num": 0,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_002.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_002.png",
"page_index": 1,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:12+07:00"
},
"raw_text": "Contact information Nguyén Dinh Thanh Email: dinhthanhhcmut.edu.vn 2"
},
{
"page_index": 2,
"chapter_num": 0,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_003.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_003.png",
"page_index": 2,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:15+07:00"
},
"raw_text": "Course Content Credits: 3 W1: Distributed Databases Concepts W2: Distributed Database Architectures W3,4: Distributed Database Design W5: Distributed Query Processing W6,7: Distributed Transaction Management W8,9,10: Distributed Concurrency Control & Recovery W11,12 Object Oriented Database Concept W13.14: OODBMS Architecture Approach W15: F Revision 3"
},
{
"page_index": 3,
"chapter_num": 0,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_004.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_004.png",
"page_index": 3,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:17+07:00"
},
"raw_text": "Assessment Quiz: 45-60 mins. (20%) Assignment (3o%): report + presentation Final exam: Single choice + Written test, 80 minutes (max) (50%) 4"
},
{
"page_index": 4,
"chapter_num": 0,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_005.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_005.png",
"page_index": 4,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:21+07:00"
},
"raw_text": "References Ozsu, M. Tamer, and Patrick Valduriez. Principles of distributed database systems Springer Science & Business Media, 2011. Silberschatz, Abraham, Henry F. Korth, and Shashank Sudarshan. Database system concepts. Vol. 4. New York: McGraw-Hill, 1997 Gerald V. Post.Database Management System. McGraw Hill International Edition, 2001. 5"
},
{
"page_index": 5,
"chapter_num": 0,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_006.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_0/slide_006.png",
"page_index": 5,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:23+07:00"
},
"raw_text": "& A 6"
},
{
"page_index": 6,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_001.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_001.png",
"page_index": 6,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:28+07:00"
},
"raw_text": "Introduction -What is a distributed DBMS - History - Distributed DBMS promises - Design issues - Distributed DBMS Architecture Ch.1/1"
},
{
"page_index": 7,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_002.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_002.png",
"page_index": 7,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:34+07:00"
},
"raw_text": "File program 1 File 1 data description 1 2 program data description 2 File 2 program 3 File 3 data description 3 Ch.1/2"
},
{
"page_index": 8,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_003.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_003.png",
"page_index": 8,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:40+07:00"
},
"raw_text": "Database Application program 1 (with data semantics) DBMS description Application manipulation program 2 database (with data control semantics) Application program 3 (with data semantics) Ch.1/3"
},
{
"page_index": 9,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_004.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_004.png",
"page_index": 9,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:45+07:00"
},
"raw_text": "Motivation Database Computer Technology Networks integration distribution Distributed Database Systems integration integration centralization Ch.1/4"
},
{
"page_index": 10,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_005.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_005.png",
"page_index": 10,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:50+07:00"
},
"raw_text": "Distributed Computing A number of autonomous processing elements s (not necessarily homogeneous) that are network and that cooperate in performing their assigned tasks. What is being distributed? - Processing logic - Function - Data - Control Ch.1/5"
},
{
"page_index": 11,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_006.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_006.png",
"page_index": 11,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:37:55+07:00"
},
"raw_text": "What is Distributed Database a System? A distributed database (DDB) is a collection of multiple, /ogically interrelated databases distributed over a computer network A distributed database management system (D- DBMS) is the software that manages the DDB 3 and Distributed database system (DDBS) = DDB + D- DBMS Ch.1/6"
},
{
"page_index": 12,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_007.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_007.png",
"page_index": 12,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:02+07:00"
},
"raw_text": "What is not a DDBS? A timesharing computer system A loosely tightly or t coupled multiprocessor s system A database system which resides at e nodes of a network of e of the one computers - this is centralized a database on a network node Ch.1/7"
},
{
"page_index": 13,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_008.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_008.png",
"page_index": 13,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:06+07:00"
},
"raw_text": "Centralized DBMS on a Network Site 1 Site 2 Site 5 Communication Network Site 3 Site 4 Ch.1/8"
},
{
"page_index": 14,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_009.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_009.png",
"page_index": 14,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:11+07:00"
},
"raw_text": "Distributed d DBMS Environment Site 1 Site 2 Site 5 Communication Network Site 4 Site 3 Ch.1/9"
},
{
"page_index": 15,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_010.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_010.png",
"page_index": 15,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:16+07:00"
},
"raw_text": "Data stored at a number of sites each site Iogically consists of a single processor. not a multiprocessor system a computer network - Parallel database systems Distributed database is a database, not a collection of files s data logically related as exhibited in the users' access patterns - Relational data model D-DBMS is a full-fledged DBMS - Not remote file system, not a TP system Ch.1/10"
},
{
"page_index": 16,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_011.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_011.png",
"page_index": 16,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:21+07:00"
},
"raw_text": "Data Delivery modes - Pull-only - Push-only - Hybrid Frequency - Periodic - Conditional - Ad-hoc or irregular Communication Methods - Unicast - One-to-many Note: not all combinations make sense Ch.1/11"
},
{
"page_index": 17,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_012.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_012.png",
"page_index": 17,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:26+07:00"
},
"raw_text": "Distributed DBMS Promises l .Transparent management of distributed, fragmented, and replicated data lmproved reliability/availability through distributed transactions .Improved performance .Easier and more economical system expansion Ch.x/12 Ch.1/12"
},
{
"page_index": 18,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_013.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_013.png",
"page_index": 18,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:32+07:00"
},
"raw_text": "Transparency Transparency is the separation of the higher level s from the lower level implementation issues. Fundamental issue is to provide data independence in the distributed l environment Network (distribution) transparency Replication transparency Fragmentation transparency horizontal fragmentation: selection vertical fragmentation: projection hybrid Ch.x/13 Ch.1/13"
},
{
"page_index": 19,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_014.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_014.png",
"page_index": 19,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:44+07:00"
},
"raw_text": "Example EMP ASG ENO ENAME TITLE ENO PNO RESP DUR E1 J. Doe Elect. Eng E1 P1 Manager 12 E2 M. Smith Syst. Anal. E2 P1 Analyst 24 E3 A.Lee Mech. Eng E2 P2 Analyst 6 E4 J. Miller Programmer E3 P3 Consultant 10 E5 B. Casey Syst. Anal. E3 P4 Engineer 48 E6 L. Chu Elect. Eng. E4 P2 Programmer 18 E7 R. Davis Mech. Eng E5 P2 Manager 24 E8 J. Jones Syst. Anal. E6 P4 Manager 48 E7 P3 Engineer 36 E8 P3 Manager 40 PROJ PAY TITLE SAL PNO PNAME BUDGET P1 Instrumentation 150000 Elect. Eng 40000 P2 Database Develop 135000 Syst. Anal. 34000 P3 CAD/CAM 250000 Mech. Eng 27000 P4 Maintenance 310000 Programmer 24000 Ch.1/14"
},
{
"page_index": 20,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_015.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_015.png",
"page_index": 20,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:52+07:00"
},
"raw_text": "SELECT ENAME, SAL Tokyo EROM EMP ,ASG,PAY WHERE DUR 12 Paris Bostor AND EMP.EN0 ASG .ENO Paris projects AND PAY.TITLE EMP.TITLE Paris employees Communication Paris assignments Boston employees Network Boston projects Boston employees Boston assignments Montrea New Montreal projects York Paris projects Boston projects New York projects New York employees with budget > 200000 New York projects Montreal employees New York assignments Montreal assignments Ch.1/15"
},
{
"page_index": 21,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_016.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_016.png",
"page_index": 21,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:38:56+07:00"
},
"raw_text": "Distributed d Database User View Distributed Database Ch.1/16"
},
{
"page_index": 22,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_017.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_017.png",
"page_index": 22,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:02+07:00"
},
"raw_text": "Reality Distributed DBMS User Query User DBMS Application Software DBMS software Communication DBMS Software Subsystem User DBMS User Application Software Query DBMS Software User Query Ch.1/17"
},
{
"page_index": 23,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_018.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_018.png",
"page_index": 23,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:07+07:00"
},
"raw_text": "Types of Transparency 1 Data independence Network transparency (or distribution transparency) - Location transparency - Naming transparency Replication transparency Ch.1/18"
},
{
"page_index": 24,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_019.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_019.png",
"page_index": 24,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:13+07:00"
},
"raw_text": "Reliability Through Transactions Replicated components and data should make distributed DBMS more reliable. Distributed transactions provide - Concurrency transparency - Failure atomicity Distributed transaction support requires implementation of - Distributed concurrency control protocols - Commit protocols Data replication - Great for read-intensive workloads, problematic for updates - Replication protocols Ch.1/19"
},
{
"page_index": 25,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_020.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_020.png",
"page_index": 25,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:17+07:00"
},
"raw_text": "Potentially Ii Performance Proximity a to its of data points of use fragmentation and replication Parallelism in execution Ch.1/20"
},
{
"page_index": 26,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_021.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_021.png",
"page_index": 26,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:23+07:00"
},
"raw_text": "Parallelism Have s much of the data as required by each application at the site where the application executes - Full replication about updates? How - Mutual consistency - Freshness of copies Ch.1/21"
},
{
"page_index": 27,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_022.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_022.png",
"page_index": 27,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:28+07:00"
},
"raw_text": "Issue is database scaling Emergence and technologies workstation l 1 - Demise of Grosh's Iaw - Client-server model of computing Data communication l cost vs telecommunication cost Ch.1/22"
},
{
"page_index": 28,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_023.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_023.png",
"page_index": 28,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:33+07:00"
},
"raw_text": "Distributed DBMS Issues Database Design Distributed to distribute the database - How - Replicated & non-replicated database distribution problem in directory - A related management Processing Query - Convert user transactions to data manipulation instructions Ch.1/23"
},
{
"page_index": 29,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_024.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_024.png",
"page_index": 29,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:38+07:00"
},
"raw_text": "Distributed DBMS Issues Concurrency Control - Consistency and isolation of transactions' effects - Deadlock management Reliability - How failures - Atomicity and durability Ch.1/24"
},
{
"page_index": 30,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_025.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_025.png",
"page_index": 30,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:43+07:00"
},
"raw_text": "Relationship Between Issues Directory Management 4 Query Distribution Reliability Processing Design A Concurrency Control Deadlock Management Ch.1/25"
},
{
"page_index": 31,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_026.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_026.png",
"page_index": 31,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:50+07:00"
},
"raw_text": "Related Issues Operating System Support - Operating system with p proper support for database operations - Dichotomy between general purpose processing requirements and database processing requirements Open Systems and - Distributed Multidatabase Systems - More probable scenario Ch.1/26"
},
{
"page_index": 32,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_027.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_027.png",
"page_index": 32,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:54+07:00"
},
"raw_text": "Architecture e of the system Defines s the structure - components identified - functions of each component defined - interrelationships and interactions Ch.1/27"
},
{
"page_index": 33,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_028.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_028.png",
"page_index": 33,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:39:58+07:00"
},
"raw_text": "ANSI/SPARC Architecture Users External External External External view view view Schema Conceptual Conceptual view Schema Internal Internal view Schema Ch.1/28"
},
{
"page_index": 34,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_029.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_029.png",
"page_index": 34,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:04+07:00"
},
"raw_text": "Generic DBMS Architecture Applications User Interfaces Interface View Management relational calculus Semantic Integrity Control Control Authorization Checking relational calculus Query Decomposition and Optimization Results Compilation Access Plan Management relational algebra Access Plan Execution Control Execution Algebra Operation Execution retrieval/update Buffer Management Data Access Access Methods retrieval/update Concurrency Control Consistency Logging Database Ch.1/29"
},
{
"page_index": 35,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_030.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_030.png",
"page_index": 35,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:09+07:00"
},
"raw_text": "DBMS Implementation Alternatives Distribution Peer-to-Peer DDBSs Multidatabase Systems Client/Server Systems Autonomy Heterogeneity Ch.1/30"
},
{
"page_index": 36,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_031.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_031.png",
"page_index": 36,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:15+07:00"
},
"raw_text": "Dimensions of the Problem 1 Distribution - Whether the components of the system are located on the same machine or not Heterogeneity - Various Ievels (hardware, communications, operating system - DBMS important one data model, query language,transaction management algorithms Autonomy - Not well understood and most troublesome - Various versions . Design autonomy: Ability of a component DBMs to decide on issues related to its own design. Communication autonomy: Ability of a component DBMS to decide whether and how to communicate with other DBMSs. Execution autonomy: Ability of a component DBMs to execute local operations in any manner it wants to. Ch.1/31"
},
{
"page_index": 37,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_032.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_032.png",
"page_index": 37,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:21+07:00"
},
"raw_text": "Client/Server Architecture User Application Interface Program Sssssm Client DBMS Communication Software A SQL Result queries relation 0 Communication Software p Semantic Data Controller e r Query Optimizer a Transaction Manager t - Recovery Manager n Runtime Support Processor g System Database Ch.1/32"
},
{
"page_index": 38,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_033.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_033.png",
"page_index": 38,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:26+07:00"
},
"raw_text": "Advantages Client-Server of Architectures More efficient division of labor Horizontal scaling and d vertical s i j of resources price/performance Better e on client machines Ability e familiar tools on client to use machines Client access s to remote data (via standards) Ch.1/33"
},
{
"page_index": 39,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_034.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_034.png",
"page_index": 39,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:31+07:00"
},
"raw_text": "Server Database Client Client network Application server network Database server Ch.1/34"
},
{
"page_index": 40,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_035.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_035.png",
"page_index": 40,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:35+07:00"
},
"raw_text": "Distributed Database Client Client network Application Application server server network Database Database Database server server server Ch.1/35"
},
{
"page_index": 41,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_036.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_036.png",
"page_index": 41,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:41+07:00"
},
"raw_text": "Datalogical Distributed DBMS Architecture ES. ES. ES GCS LCS1 LCS. LCS n LIS LIS2 LIS. Ch.1/36"
},
{
"page_index": 42,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_037.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_037.png",
"page_index": 42,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:48+07:00"
},
"raw_text": "Component Peer-to-Peer Architecture USER PROCESSOR DATA PROCESSOR System Global Local Local External Log Conceptual Conceptual nternal Schema GD/D Schema Schema Schema User reguests Database Rttttne Soddns USER System responses Ch.1/37"
},
{
"page_index": 43,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_038.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_038.png",
"page_index": 43,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:53+07:00"
},
"raw_text": "Datalogical Multi-DBMS Architecture GES GES2 GES n LES LES GCS LES LES 11 1n n1 nm LCS LCS2 LCS, LIS1 LIS LIS 2 Ch.1/38"
},
{
"page_index": 44,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_039.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_039.png",
"page_index": 44,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:40:59+07:00"
},
"raw_text": "MDBS & 1 Execution Global User Request Local Local MuIti-DBMS User User Layer Request Request Global Global Global Subrequest Subrequest Subrequest DBMS DBMS DBMS T Ch.1/39"
},
{
"page_index": 45,
"chapter_num": 1,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_040.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_1/slide_040.png",
"page_index": 45,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:04+07:00"
},
"raw_text": "Mediator/Wrapper Architecture USER User System requests responses Mediator Mediator Mediator Mediator Wrapper Wrapper Wrapper H DBMS DBMS DBMS DBMS Ch.1/40"
},
{
"page_index": 46,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_001.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_001.png",
"page_index": 46,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:06+07:00"
},
"raw_text": "Distributed and Parallel Database Design 1"
},
{
"page_index": 47,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_002.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_002.png",
"page_index": 47,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:08+07:00"
},
"raw_text": "Outline Distributed and Parallel Database Design Fragmentation Data distribution Combined approaches 2"
},
{
"page_index": 48,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_003.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_003.png",
"page_index": 48,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:11+07:00"
},
"raw_text": "Distribution Design GCS Distribution Auxiliary Design Information Set of LCSs Allocation LCS1 LCS2 LCSn Physical Physical Physical Design Design Design Physical Physical Physical Schema 1 Schema 2 Schema n 3"
},
{
"page_index": 49,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_004.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_004.png",
"page_index": 49,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:15+07:00"
},
"raw_text": "Fragmentation Can't we just distribute relations? What is a reasonable unit of distribution? relation views are subsets of relations locality extra communication fragments of relations (sub-relations) concurrent execution of a number of transactions that access different portions of a relation views that cannot be defined on a single fragment will reguire extra processing semantic data control (especially integrity enforcement) more difficult 4"
},
{
"page_index": 50,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_005.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_005.png",
"page_index": 50,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:24+07:00"
},
"raw_text": "Example Database EMP ASG ENO ENAME TITLE ENO PNO RESP DUR E1 J. Doe Elect. Eng. E1 P1 Manager 12 E2 M. Smith Syst. Anal. E2 P1 Analyst 24 E3 A. Lee Mech. Eng. E2 P2 Analyst 6 E4 J. Miller Programmer E3 P3 Consultant 10 E5 B. Casey Syst. Anal. E3 P4 Engineer 48 E6 L. Chu Elect. Eng. E4 P2 Programmer 18 E7 R. Davis Mech. Eng. E5 P2 Manager 24 E8 J. Jones Syst. Anal. E6 P4 Manager 48 E7 P3 Engineer 36 E8 P3 Manager 40 PROJ PAY PNO PNAME BUDGET LOC TITLE SAL P1 Instrumentation 150000 Montreal Elect. Eng 40000 P2 Database Develop 135000 New York Syst. Anal. 34000 P3 CAD/CAM 250000 New York Mech. Eng. 27000 P4 Maintenance 310000 Paris Programmer 24000 5"
},
{
"page_index": 51,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_006.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_006.png",
"page_index": 51,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:31+07:00"
},
"raw_text": "Fragmentation Alternatives - Horizontal PROJ PROJ, : projects with budgets PNO PNAME BUDGET LOC less than $200,000 P1 Instrumentation 150000 Montreal P2 Database Develop 135000 New York PROJ, : projects with budgets P3 CAD/CAM 250000 New York P4 Maintenance 310000 Paris greater than or equal to $200,000 PR0J1 PNO PNAME BUDGET LOC P1 Instrumentation 150000 Montreal P2 Database Develop. 135000 New York PR0J2 PNO PNAME BUDGET LOC P3 CAD/CAM 255000 New York P4 Maintenance 310000 Paris 6"
},
{
"page_index": 52,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_007.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_007.png",
"page_index": 52,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:36+07:00"
},
"raw_text": "Fragmentation Alternatives - Vertical PROJ,: information about PROJ PNO PNAME BUDGET LOC project budgets P1 Instrumentation 150000 Montreal P2 Database Develop 135000 New York PROJ,: information about P3 CAD/CAM 250000 New York project names and P4 Maintenance 310000 Paris locations PR0J1 PR0J2 PNO BUDGET PNO PNAME LOC P1 150000 P1 Instrumentation Montreal P2 135000 P2 Database Develop New York P3 250000 P3 CAD/CAM New York P4 310000 P4 Maintenance Paris 7"
},
{
"page_index": 53,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_008.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_008.png",
"page_index": 53,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:40+07:00"
},
"raw_text": "Correctness of Fragmentation Completeness Decomposition of relation R into fragments R, R,, ..., R, is complete if and only if each data item in R can also be found in some Rj Reconstruction If relation R is decomposed into fragments R, R,, ..., R.. then there should exist some relational operator v such that R Disjointness If relation R is decomposed into fragments R, R,, ..., R., and data item d, is in R, then d; should not be in any other fragment Rk(kj) 8"
},
{
"page_index": 54,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_009.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_009.png",
"page_index": 54,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:43+07:00"
},
"raw_text": "Allocation Alternatives Non-replicated partitioned : each fragment resides at only one site Replicated fully replicated : each fragment at each site partially replicated : each fragment at some of the sites Rule of thumb: If read-only queries/update queries >>1, replication is advantageous otherwise replication may cause problems 9"
},
{
"page_index": 55,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_010.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_010.png",
"page_index": 55,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:47+07:00"
},
"raw_text": "Comparison of Replication Alternatives Full replication Partial replication Partitioning QUERY Easy Same difficulty PROCESSING DIRECTORY Easy or Same difficulty MANAGEMENT nonexistent CONCURRENCY Moderate Difficult Easy CONTROL RELIABILITY Very high High Low Possible Possible REALITY Realistic application application 10"
},
{
"page_index": 56,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_011.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_011.png",
"page_index": 56,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:50+07:00"
},
"raw_text": "Fragmentation Horizontal Fragmentation (HF) Primary Horizontal Fragmentation (PHF) Derived Horizontal Fragmentation (DHF Vertical Fragmentation (VF) Hybrid Fragmentation (HF) 11"
},
{
"page_index": 57,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_012.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_012.png",
"page_index": 57,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:53+07:00"
},
"raw_text": "PHF - Information Requirements Database Information relationship PAY TITLE, SAL L1 EMP PROJ ENO, ENAME, TITLE PNO, PNAME, BUDGET, LOC L2 ASG ENO, PNO, RESP, DUR cardinality of each relation: card(R) 12"
},
{
"page_index": 58,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_013.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_013.png",
"page_index": 58,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:56+07:00"
},
"raw_text": "PHF - Information Requirements Application Information simple predicates : Given R[A., A2, ..., A,], a simple predicate p is Pj : Aj 6Value where e {=,<,,>,=,}, Value Di and D, is the domain of A.. For relation R we define Pr ={P, P, ...,Pm} Example : PNAME = \"Maintenance BUDGET < 200000 minterm predicates : Given R and Pr = {P1 P, ...,Pm} define M ={m,m,...,m,} as M={ m;1m;= where p* = p or p* = -(p)) 13"
},
{
"page_index": 59,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_014.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_014.png",
"page_index": 59,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:41:59+07:00"
},
"raw_text": "PHF - Information Requirements Example m,: PNAME=\"Maintenance\" BUDGET<200000 m,: NOT(PNAME=\"Maintenance\") BUDGET<200000 m: PNAME= \"Maintenance\" NOT(BUDGET200000 m,: NOT(PNAME=\"Maintenance' NOT(BUDGET<200000 14"
},
{
"page_index": 60,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_015.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_015.png",
"page_index": 60,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:03+07:00"
},
"raw_text": "PHF - Information Requirements Application Information minterm selectivities: se/(m) The number of tuples of the relation that would be accessed by a user query which is specified according to a given minterm predicate m. access frequencies: acc(qi) The frequency with which a user application qi accesses data. Access freguency for a minterm predicate can also be defined 15"
},
{
"page_index": 61,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_016.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_016.png",
"page_index": 61,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:05+07:00"
},
"raw_text": "Primary Horizontal Fragmentation Definition : Rj= Se(R),1<j<w where F; is a selection formula, which is (preferably) a minterm predicate Therefore A horizontal fragment R; of relation R consists of all the tuples of R which satisfy a minterm predicate m. Given a set of minterm predicates M, there are as many horizontal fragments of relation R as there are minterm predicates. Set of horizontal fragments also referred to as minterm fragments. 16"
},
{
"page_index": 62,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_017.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_017.png",
"page_index": 62,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:08+07:00"
},
"raw_text": "Primary Horizontal Fragmentation Example 2.6 The decomposition of relation PROJ into horizontal fragments 17"
},
{
"page_index": 63,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_018.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_018.png",
"page_index": 63,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:11+07:00"
},
"raw_text": "PHF - Algorithm Given: A relation R, the set of simple predicates Pr Output: obey the fragmentation rules. Preliminaries : Pr should be comp/ete Pr should be minimal 18"
},
{
"page_index": 64,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_019.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_019.png",
"page_index": 64,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:14+07:00"
},
"raw_text": "Completeness of Simple Predicates A set of simple predicates Pr is said to be complete if and only if the accesses to the tuples of the minterm fragments defined on Pr requires that two tuples of the same minterm fragment have the same probability of being accessed by any application. Example : Assume PROJ[PNO,PNAME,BUDGET,LOC] has tw0 applications defined on it. Find the budgets of projects at each location. (1)) Find projects with budgets less than $200000. (2)) 19"
},
{
"page_index": 65,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_020.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_020.png",
"page_index": 65,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:17+07:00"
},
"raw_text": "Completeness of Simple Predicates According to (1) Pr={LOC=\"Montreal\",LOC=\"New York\",LOC=\"Paris\"} which is not complete with respect to (2) Modify Pr ={LOC=\"Montreal\",LOC=\"New York\",LOC=\"Paris\" BUDGET<200000,BUDGET>200000} which is complete 20"
},
{
"page_index": 66,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_021.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_021.png",
"page_index": 66,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:21+07:00"
},
"raw_text": "Minimality of Simple Predicates If a predicate influences how fragmentation is performed (i.e., causes a fragment f to be further fragmented into, say, f and f) then there should be at least one application that accesses f, and f: differently. In other words, the simple predicate should be relevant in determining a fragmentation. If all the predicates of a set Pr are relevant, then Pr is minimal acc(m) acc(m) not card( fi) card(fj) 21"
},
{
"page_index": 67,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_022.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_022.png",
"page_index": 67,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:23+07:00"
},
"raw_text": "Minimality of Simple Predicates Example : Pr ={LOC=\"Montreal\",LOC=\"New York\" LOC=\"Paris\" BUDGET<200000,BUDGET>200000} is minimal (in addition to being complete). However, if we add PNAME = \"Instrumentation' then Pr is not minimal 22"
},
{
"page_index": 68,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_023.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_023.png",
"page_index": 68,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:26+07:00"
},
"raw_text": "COM MIN Algorithm Given: a relation R and a set of simple predicates Pr Output: a complete and minimal set of simple predicates Pr' for Pr Rule 1: a relation or fragment is partitioned into at least two parts which are accessed differently by at least one application. 23"
},
{
"page_index": 69,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_024.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_024.png",
"page_index": 69,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:30+07:00"
},
"raw_text": "COM MiN Algorithm 1 Initialization : find a p; in Pr such that p; partitions R according to Rule 1 set Pr'=pj ;Pr Pr-{p};F+{f} 2 Iteratively add predicates to Pr' until it is complete find a p: in Pr such that p; partitions some fk defined according to minterm predicate over Pr' according to Rule 1 set Pr'=Pr'+{p};Pr=Pr-{p};F=F+{f} If exist p, in Pr' which is nonrelevant then Pr'= Pr -{p} F = F-{f} 24"
},
{
"page_index": 70,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_025.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_025.png",
"page_index": 70,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:33+07:00"
},
"raw_text": "PHORlZONTAL Agorithm Makes use of COM MIN to perform fragmentation. Input: a relation R ? and a set of simple predicates Pr Output: a set of minterm predicates M according to which relation R is to be fragmented 0 Pr' = COM MIN (R,Pr) @ determine the set M of minterm predicates @ determine the set / of implications among P; Pr 4 eliminate the contradictory minterms from M 25"
},
{
"page_index": 71,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_026.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_026.png",
"page_index": 71,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:36+07:00"
},
"raw_text": "PHF - Example Two candidate relations : PAY and PROJ Fragmentation of relation PAY Application: Check the salary info and determine raise. Employee records kept at two sites application run at two sites Simple predicates P1 : SAL 30000 P,: SAL > 30000 Pr = {p,} which is complete and minimal Pr'=Pr Minterm predicates m1 : (SAL 30000) m2 : NOT(SAL 30000) = (SAL > 30000 26"
},
{
"page_index": 72,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_027.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_027.png",
"page_index": 72,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:39+07:00"
},
"raw_text": "PHF - Example PAY1 PAY2 TITLE SAL TITLE SAL Mech. Eng 27000 Elect. Eng 40000 Programmer 24000 Syst. Anal. 34000 c 2020,M.T. Ozsu & P.Valduriez 27"
},
{
"page_index": 73,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_028.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_028.png",
"page_index": 73,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:46+07:00"
},
"raw_text": "PHF - Example Fragmentation of relation PROJ 0 Applications: Find the name and budget of projects given their location. 0 Issued at three sites 0 SELECT PNAME, BUDGET 0 FROM PROJ Access project information according to budget WHERE LOC=value one site accesses 200000 other accesses >200000 0 Simple predicates 0 For application (1) P : LOC = \"Montreal' Pz: LOC = \"New York' P3 : LOC = \"Paris' 0 For application (2) P4 : BUDGET 200000 P5 : BUDGET > 200000 0 Pr ={P1,Pz;P3;P4,P5} 0 using COM_MIN Pr'={p1, p2,p4} 0 => minterm predicates M ={m1, m2, m3 , m4, m5, m6} after some minterm predicates eliminated 0 e.g p1 =>not p2 and not p3 ; not p5=> p4 0 loking at database instance some implications may hold: i8: LOC='Montreal' => not(BUDGET >20k) i9: LOC='Paris' => not(Budget <=20k), i10: not(LOC='Montreal')=> BUDGET <=20k,i11: not(LOC='Paris')=> BUDGET > 20k. 0 However, implicatiosn should be defined according to sematics of the database not according to curent values Result of primary hozontal fragmentation of PROJ is to form 6 fragments F ={PROJ1, PROJ2, PROJ3, PROJ4, PROJ5, PROJ6} of PROJ according to M. Since PROJ2 and PROJ5 are empty, they are not depicted 28"
},
{
"page_index": 74,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_029.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_029.png",
"page_index": 74,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:51+07:00"
},
"raw_text": "PHF - Example Fragmentation of relation PROJ continued Minterm fragments left after elimination m : (LOC = \"Montreal\") (BUDGET 200000) m, : (LOC = \"Montreal\") (BUDGET > 200000) m3 : (LOC =\"New York\") (BUDGET < 200000 m4 : (LOC = \"New York\") (BUDGET > 200000 m5 : (LOC = \"Paris\") (BUDGET 200000 m6 : (LOC = \"Paris\") (BUDGET > 200000 29"
},
{
"page_index": 75,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_030.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_030.png",
"page_index": 75,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:55+07:00"
},
"raw_text": "PHF - Example PR0J1 PNO PNAME BUDGET LOC P1 Instrumentation 150000 Montreal PR0J3 PNO PNAME BUDGET LOC P2 Database Develop 135000 New York PR0J4 PNO PNAME BUDGET LOC P3 CAD/CAM 255000 New York PR0J6 PNO PNAME BUDGET LOC P4 Maintenance 310000 Paris 30"
},
{
"page_index": 76,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_031.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_031.png",
"page_index": 76,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:42:58+07:00"
},
"raw_text": "PHF - Correctness Completeness Since Pr' is complete and minimal, the selection predicates are complete Reconstruction If relation R is fragmented into F = {R,,R,,. ..,R,} R = ?Rj FR R Disjointness Minterm predicates that form the basis of fragmentation should be mutually exclusive 31"
},
{
"page_index": 77,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_032.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_032.png",
"page_index": 77,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:02+07:00"
},
"raw_text": "Derived Horizontal Fragmentation Defined on a member relation of a link according to a selection operation specified on its owner. Each link is an equijoin. Equijoin can be implemented by means of semijoins PAY TITLE, SAL L1 EMP PROJ ENO, ENAME, TITLE PNO, PNAME, BUDGET, LOC L2 ASG ENO, PNO, RESP, DUR 32"
},
{
"page_index": 78,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_033.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_033.png",
"page_index": 78,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:05+07:00"
},
"raw_text": "DHF - Definition Given a link L where owner(L)=S and member(L)=R, the derived horizontal fragments of R are defined as Rj=R Xe Sj1<i<w where w is the maximum number of fragments that will be defined on R and Si= f (S) Fi where F; is the formula according to which the primary horizontal fragment S; is defined. 33"
},
{
"page_index": 79,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_034.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_034.png",
"page_index": 79,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:11+07:00"
},
"raw_text": "DHF - Example Given link L, where owner(L)=SKILL and member(L)=EMP EMP1 = EMP X SKILL where SKILL1= (SKILL) SAL30000 SKILLz= ASG1 ASG2 ENO PNO RESP DUR ENO PNO RESP DUR E3 P3 Consultant 10 E1 P1 Manager 12 E3 P4 Engineer 48 E2 P1 Analyst 24 E4 P2 Programmer 18 E2 P2 Analyst 6 E7 P3 Engineer 36 E5 P2 Manager 24 E6 P4 Manager 48 E8 P3 Manager 40 34"
},
{
"page_index": 80,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_035.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_035.png",
"page_index": 80,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:15+07:00"
},
"raw_text": "DHF - Correctness Completeness Referential integrity Let R be the member relation of a link whose owner is relation S which is fragmented as Fs = {S,, S,, ..., S,}. Furthermore, let A be the ioin attribute between R and S. Then, for each tuple t of R, there should be a tuple t' of S such that t[A] = t'[A] Reconstruction Same as primary horizontal fragmentation. Disjointness Simple join graphs between the owner and the member fragments. 35"
},
{
"page_index": 81,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_036.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_036.png",
"page_index": 81,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:17+07:00"
},
"raw_text": "Vertical Fragmentation Has been studied within the centralized context design methodology physical clustering More difficult than horizontal, because more alternatives exist. Two approaches : grouping attributes to fragments splitting relation to fraqments 36"
},
{
"page_index": 82,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_037.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_037.png",
"page_index": 82,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:21+07:00"
},
"raw_text": "Vertical Fragmentation Overlapping fragments grouping Non-overlapping fragments Splitting => focus discussing! We do not consider the replicated key attributes to be overlapping Advantage: Easier to enforce functional dependencies (for integrity checking etc.) 37"
},
{
"page_index": 83,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_038.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_038.png",
"page_index": 83,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:23+07:00"
},
"raw_text": "VF - Information Requirements Application Information Attribute affinities a measure that indicates how closely related the attributes are This is obtained from more primitive usage data Attribute usage values R[A,A,...,A,] 1 if attribute A, is referenced by query q use(qjAj) = 0 otherwise use(qu.) can be defined accordingly 38"
},
{
"page_index": 84,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_039.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_039.png",
"page_index": 84,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:28+07:00"
},
"raw_text": "VF - Definition of use(q,Aj) Consider the following 4 queries for relation PROJ q1: SELECT BUDGET 02: SELECT PNAME.BUDGET FROM PROJ FROM PROJ WHERE PNO=Value PNAME 94 93: SELECT SELECT SUM(BUDGET FROM PROJ FROM PROJ WHERE LOC=Value WHERE LOC=Value A1 = PNO.A2=PNAME.A3=BUDGET A4=LOO Attribute Usaqe Matrix: A1 A2 A3 91 1 0 1 0 92 0 1 1 0 93 0 1 0 1 04 0 0 1 39"
},
{
"page_index": 85,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_040.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_040.png",
"page_index": 85,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:32+07:00"
},
"raw_text": "The attribute affinity measure between two attributes A; and A applications aff (A,Aj)=Z (query access) all queries that access A, and A access access frequency of a query query access execution all sites aff(Ai,Aj)= kuse(qk,Ai)=1use(qk,Aj)=1 VSi 40"
},
{
"page_index": 86,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_041.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_041.png",
"page_index": 86,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:37+07:00"
},
"raw_text": "Assume each guery in the previous example accesses the attributes once during each execution. S. S2 Also assume the access frequencies 91 15 20 10 92 5 0 0 25 25 25 93 3 0 0 94 Then aff(Au A3) PNO PNAME BUDGET LOC = 15*1 + 20*1+10*1 = 45 PNO 0 45 0 and the attribute affinity matrix AA is PNAME 0 5 75 Let A,=PNO,A,=PNAME,A,=BUDGET BUDGET 45 5 3 LOC 0 75 3 A4=LOC) 41"
},
{
"page_index": 87,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_042.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_042.png",
"page_index": 87,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:41+07:00"
},
"raw_text": "VF - Clustering Algorithm Take the attribute affinity matrix AA and reorganize the attribute orders to form clusters where the attributes in each cluster demonstrate high affinity to one another. Bond Energy Algorithm (BEA) has been used for clustering of entities. BEA finds an ordering of entities (in our case attributes) such that the global affinity measure (AM) is maximized AM = affinity of A; and A; with their neighbors) 2 42"
},
{
"page_index": 88,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_043.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_043.png",
"page_index": 88,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:44+07:00"
},
"raw_text": "Bond Energy Algorithm Input: The AA matrix Output: The clustered affinity matrix CA which is a perturbation of AA CA. 2 l Iteration: Place the remaining n-i columns in the remaining i+1 positions in the CA matrix. For each column, choose the placement that makes the most contribution to the global affinity measure. ordering 43"
},
{
"page_index": 89,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_044.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_044.png",
"page_index": 89,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:46+07:00"
},
"raw_text": "Bond Energy Algorithm \"Best\" placement? Define contribution of a placement: cont(Aj, AkAi) = 2bond(Aj,A)+2bond(Ak A) -2bond(A;, A) where n bond(Ax,Ay) = aff(A,,Ax)aff(Az,Av z =1 44"
},
{
"page_index": 90,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_045.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_045.png",
"page_index": 90,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:51+07:00"
},
"raw_text": "BEA - Example Consider the following AA matrix and the corresponding CA matrix where PNO and PNAME have been placed. Pace BUDGET: PNO PNAME BUDGET LOC PNO PNAME PNO 0 45 0 PNO 45 0 PNAME 0 5 75 PNAME 0 80 BUDGET 45 5 3 BUDGET 45 5 LOC 0 75 3 LOC 0 75 Ordering (0-3-1) : COnt(Ao,BUDGET,PNO) = 2bond(Ao, BUDGET)+2bond(BUDGET,PNO) -2bond(A,,PNO) = 8820 Ordering (1-3-2) : C0nt(PNO,BUDGET,PNAME) = 10150 Ordering (2-3-4) : COnt (PNAME,BUDGET,LOC = 1780 45"
},
{
"page_index": 91,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_046.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_046.png",
"page_index": 91,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:56+07:00"
},
"raw_text": "BEA - Example Therefore, the CA matrix has the form PNO BUDGET PNAME PNO 45 45 0 PNAME 0 5 80 BUDGET 45 53 5 LOC 0 3 75 When Loc is placed, the nnal torm of the CA matrix (after row organization) is PNO BUDGET PNAME LOC PNO 45 45 0 0 BUDGET 45 53 5 3 PNAME 0 80 75 LOC 0 3 75 78 46"
},
{
"page_index": 92,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_047.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_047.png",
"page_index": 92,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:43:59+07:00"
},
"raw_text": "VF - Algorithm .... A,} into two (or more) sets {A., A,. ..., A} and {A...., A,} such that there are no (or minimal) applications that access both (or more than one) of the sets. A1 A2 A3 ... A; 'Ai+1 An A1 A2 A2 TA Ai Ai+1 BA A 47"
},
{
"page_index": 93,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_048.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_048.png",
"page_index": 93,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:03+07:00"
},
"raw_text": "VF - ALgorithm Define TQ set of applications that access only TA - BQ set of applications that access only BA - OQ set of applications that access both TA and BA - and CTQ = total number of accesses to attributes by applications that access only TA CBQ = total number of accesses to attributes by applications that access only BA COQ = total number of accesses to attributes by applications that access both TA and BA Then find the point along the diagonal that maximizes CTQ*CBQ-COQ2 48"
},
{
"page_index": 94,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_049.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_049.png",
"page_index": 94,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:06+07:00"
},
"raw_text": "VF - Algorithm Two problems : @ Cluster forming in the middle of the CA matrix Shift a row up and a column left and apply the algorithm to find the \"best\" partitioning point Do this for all possible shifts Cost O(m2) More than two clusters m-way partitioning try 1, 2, ..., m-1 split points along diagonal and try to find the best point for each of these Cost O(2m) 49"
},
{
"page_index": 95,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_050.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_050.png",
"page_index": 95,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:10+07:00"
},
"raw_text": "VF - Correctness A relation R, defined over attribute set A and key K generates the vertical partitioning F, = {R, R,, ..., R,}. Completeness The following should be true for A: A = Reconstruction Reconstruction can be achieved by R=XkR, SR; FR Disiointness TiD's are not considered to be overlapping since they are maintained by the system Duplicated keys are not considered to be overlapping 50"
},
{
"page_index": 96,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_051.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_051.png",
"page_index": 96,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:13+07:00"
},
"raw_text": "Hybrid Fragmentation R H H R1 R2 V V V V V R11 R11 R21 R22 R23 51"
},
{
"page_index": 97,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_052.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_052.png",
"page_index": 97,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:15+07:00"
},
"raw_text": "Reconstruction of HF U X X R11 R11 R21 R22 R23 52"
},
{
"page_index": 98,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_053.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_053.png",
"page_index": 98,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:17+07:00"
},
"raw_text": "Outline Distributed and Parallel Database Design Fragmentation Data distribution Combined approaches 53"
},
{
"page_index": 99,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_054.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_054.png",
"page_index": 99,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:21+07:00"
},
"raw_text": "Fragment Allocation Problem Statement Given F={F,F...,F.} fragments S ={S,, S,, ..., Sm} network sites Q = {9, q,..., q.}applications Find the \"optimal\" distribution of F to S. Optimality Minimal cost Communication + storage + processing (read & update) Cost in terms of time (usually) Pertormance Response time and/or throughput Constraints Per site constraints (storage & processing) 54"
},
{
"page_index": 100,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_055.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_055.png",
"page_index": 100,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:24+07:00"
},
"raw_text": "Information Requirements Database information selectivity of fragments size of a fragment Application information access types and numbers access localities Communication network information unit cost of storing data at a site unit cost of processing at a site Computer system information bandwidth latency communication overhead 55"
},
{
"page_index": 101,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_056.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_056.png",
"page_index": 101,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:27+07:00"
},
"raw_text": "Allocation File Allocation (FAP) vs Database Allocation (DAP): Fragments are not individual files relationships have to be maintained Access to databases is more complicated remote file access model not applicable relationship between allocation and query processing Cost of integrity enforcement should be considered Cost of concurrency control should be considered 56"
},
{
"page_index": 102,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_057.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_057.png",
"page_index": 102,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:30+07:00"
},
"raw_text": "Allocation Model General Form min(Total Cost) subject to response time constraint storage constraint processing constraint Decision Variable 1 if fragment F, is stored at site S 0 otherwise 57"
},
{
"page_index": 103,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_058.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_058.png",
"page_index": 103,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:34+07:00"
},
"raw_text": "Allocation Mode Total Cost query processing cost + all queries cost of storing a fragment at a site all sites all fragments Storage Cost (of fragment F; at Sk) (unit storage cost at Sk) * (size of Fj) * xjk Query Processing Cost (for one query) processing component + transmission component 58"
},
{
"page_index": 104,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_059.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_059.png",
"page_index": 104,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:36+07:00"
},
"raw_text": "Allocation Mode Query Processing Cost Processing component access cost + integrity enforcement cost + concurrency control cost Access cost (no. of update accesses+ no. of read accesses) * all sites all fragments x j * local processing cost at a site Integrity enforcement and concurrency control costs Can be similarly calculated 59"
},
{
"page_index": 105,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_060.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_060.png",
"page_index": 105,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:41+07:00"
},
"raw_text": "Allocation Mode Query Processing Cost Transmission component cost of processing updates + cost of processing retrievals Cost of updates update message cost + all sites all fragments acknowledgment cost all sites all fragments Retrieval Cost (cost of retrieval command + ir all sites all fragments cost of sending back the result) 60"
},
{
"page_index": 106,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_061.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_061.png",
"page_index": 106,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:44+07:00"
},
"raw_text": "Allocation Model Constraints Response Time execution time of query max. allowable response time for that query Storage Constraint (for a site) storage requirement of a fragment at that site storage capacity at that site all fragments Processing constraint (for a site) processing load of a query at that site all queries processing capacity of that site 61"
},
{
"page_index": 107,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_062.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_062.png",
"page_index": 107,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:46+07:00"
},
"raw_text": "Allocation Mode Solution Methods EAP is NP-complete DAP also NP-complete Heuristics based on single commodity warehouse location (for FAP) knapsack problem branch and bound techniques network flow 62"
},
{
"page_index": 108,
"chapter_num": 2,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_063.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_2/slide_063.png",
"page_index": 108,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:48+07:00"
},
"raw_text": "Allocation Mode Attempts to reduce the solution space assume all candidate partitionings known; select the \"best' partitioning ignore replication at first sliding window on fragments 63"
},
{
"page_index": 109,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_001.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_001.png",
"page_index": 109,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:52+07:00"
},
"raw_text": "Background - Relational database systems - Computer networks"
},
{
"page_index": 110,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_002.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_002.png",
"page_index": 110,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:44:56+07:00"
},
"raw_text": "Relational Model Relation D,} (not necessarily distinct) with values {Dom1, Dom,, ..., Dom,} is a finite, time varying set of n-tuples (d, d, .., d.> such that d, eDom1, d, e Doma, .., d, e Domn,. Notation: R(A1,Az, ..., An) or R(A1: D1, Az: D2, ..., An: Dn) Alternatively, given R as defined above, an instance of it at a given time is a set of n tuples: {<A1: dy, Az: dz, ...,An: d,> I d e Dom1, d, e Domz, .., dn e Domn} Tabular structure of data where R is the table heading Attributes are table columns Each tuple is a row"
},
{
"page_index": 111,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_003.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_003.png",
"page_index": 111,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:45:03+07:00"
},
"raw_text": "Relation Schemes and Instances Relational scheme - A relation scheme is the definition; i.e., a set of attributes - A relational database scheme is a set of relation schemes: Relation instance (simply relation) - An relation is an instance of a relation scheme subset of the Cartesian product of the domains of all attributes, i.e.,"
},
{
"page_index": 112,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_004.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_004.png",
"page_index": 112,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:45:08+07:00"
},
"raw_text": "Domains A domain is a type in the programming language sense Name: String Salary: Real Domain values is a set of acceptable values for a variable of a given type. Name: CdnNames ={...}, Salary: ProfSalary = {45,000 - 150,000} Simple/Composite domains Address = Street name+street number+city+province+ postal code Domain compatibility Binary operations (e.g., comparison to one another, addition, etc.) can be performed on them. Full support for domains is not provided in many current relational DBMSs"
},
{
"page_index": 113,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_005.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_005.png",
"page_index": 113,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:45:13+07:00"
},
"raw_text": "Relation Schemes EMP ENO ENAME TITLE SAL PNO RESP DUR PROJ PNO PNAME BUDGET EMP(ENO, ENAME, TITLE, SAL, PNO, RESP, DUR) PROJ (PNO, PNAME, BUDGET) Underlined attributes are relation keys (tuple identifiers)) Tabular form"
},
{
"page_index": 114,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_006.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_006.png",
"page_index": 114,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:45:25+07:00"
},
"raw_text": "Example Relation Instances EMP ENO ENAME TITLE SAL PNO RESP DUR E1 J. Doe Elect. Eng 40000 P1 Manager 12 E2 M.Smith Analyst 34000 P1 Analyst 24 E2 M.Smith Analyst 34000 P2 Analyst 6 E3 A. Lee Mech. Eng 27000 P3 Consultant 10 E3 A.Lee Mech. Eng. 27000 P4 Engineer 48 E4 J. Miller Programmer 24000 P2 Programmer 18 E5 B. Casey Syst. Anal. 34000 P2 Manager 24 E6 L. Chu Elect.Eng. 40000 P4 Manager 48 E7 R. Davis Mech. Eng 27000 P3 Engineer 36 E8 J. Jones Syst. Anal. 34000 P3 Manager 40 PROJ PNO PNAME BUDGET P1 Instrumentation 150000 P2 Database Develop 135000 P3 CAD/CAM 250000 P4 Maintenance 310000"
},
{
"page_index": 115,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_007.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_007.png",
"page_index": 115,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:45:35+07:00"
},
"raw_text": "Repetition Anomaly The NAME,TITLE, SAL attribute values are repeated for each project that the employee is involved in. - Waste of space 1 Complicates updates EMP ENO ENAME TITLE SAL PNO RESP DUR E1 J. Doe Elect. Eng 40000 P1 Manager 12 E2 M. Smith Analyst 34000 P1 Analyst 24 E2 M. Smith Analyst 34000 P2 Analyst 6 E3 A. Lee Mech. Eng 27000 P3 Consultant 10 E3 A. Lee Mech. Eng 27000 P4 Engineer 48 E4 J. Miller Programmer 24000 P2 Programmer 18 E5 B. Casey Syst. Anal. 34000 P2 Manager 24 E6 L. Chu Elect. Eng 40000 P4 Manager 48 E7 R. Davis Mech. Eng 27000 P3 Engineer 36 E8 J. Jones Syst. Anal. 34000 P3 Manager 40"
},
{
"page_index": 116,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_008.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_008.png",
"page_index": 116,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:45:44+07:00"
},
"raw_text": "Update Anomaly (say SAL of an project employee) is updated, multiple tuples have to be updated to reflect the change. EMP ENO ENAME TITLE SAL PNO RESP DUR E1 J. Doe Elect. Eng. 40000 P1 Manager 12 E2 M. Smith Analyst 34000 P1 Analyst 24 E2 M. Smith Analyst 34000 P2 Analyst 6 E3 A.Lee Mech. Eng 27000 P3 Consultant 10 E3 A. Lee Mech.Eng 27000 P4 Engineer 48 E4 J. Miller Programmer 24000 P2 Programmer 18 E5 B. Casey Syst. Anal. 34000 P2 Manager 24 E6 L. Chu Elect. Eng. 40000 P4 Manager 48 E7 R. Davis Mech. Eng 27000 P3 Engineer 36 E8 J. Jones Syst. Anal. 34000 P3 Manager 40"
},
{
"page_index": 117,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_009.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_009.png",
"page_index": 117,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:45:54+07:00"
},
"raw_text": "Insertion Anomaly It may not be p possible to store information about a new il an employee is project until - assigned to it. EMP ENO ENAME TITLE SAL PNO RESP DUR E1 J. Doe Elect. Eng 40000 P1 Manager 12 E2 M. Smith Analyst 34000 P1 Analyst 24 E2 M. Smith Analyst 34000 P2 Analyst 6 E3 A. Lee Mech. Eng 27000 P3 Consultant 10 E3 A. Lee Mech. Eng 27000 P4 Engineer 48 E4 J. Miller Programmer 24000 P2 Programmer 18 E5 B. Casey Syst. Anal. 34000 P2 Manager 24 E6 L. Chu Elect. Eng 40000 P4 Manager 48 E7 R. Davis Mech. Eng 27000 P3 Engineer 36 E8 J. Jones Syst. Anal. 34000 P3 Manager 40"
},
{
"page_index": 118,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_010.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_010.png",
"page_index": 118,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:04+07:00"
},
"raw_text": "Deletion Anomaly If an engineer, who is the only employee on a project, leaves the company, his personal information cannot be deleted, or the information about that project is lost. May have to delete many tuples. EMP ENO ENAME TITLE SAL PNO RESP DUR E1 J. Doe Elect. Eng 40000 P1 Manager 12 E2 M. Smith Analyst 34000 P1 Analyst 24 E2 M. Smith Analyst 34000 P2 Analyst 6 E3 A. Lee Mech. Eng 27000 P3 Consultant 10 E3 A. Lee Mech. Eng 27000 P4 Engineer 48 E4 J. Miller Programmer 24000 P2 Programmer 18 E5 B. Casey Syst. Anal. 34000 P2 Manager 24 E6 L. Chu Elect. Eng 40000 P4 Manager 48 E7 R. Davis Mech. Eng 27000 P3 Engineer 36 E8 J. Jones Syst. Anal. 34000 P3 Manager 40"
},
{
"page_index": 119,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_011.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_011.png",
"page_index": 119,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:10+07:00"
},
"raw_text": "What to do? Take each relation individually and \"improve 'it in terms of the desired characteristics Normal forms Atomic values (1NF) Can be defined according to keys and dependencies. Functional Dependencies ( 2NF, 3NF, BCNF Multivalued dependencies (4NF) Normalization Normalization is a process of concept separation which applies a top-down methodology for producing a schema by subsequent refinements and decompositions. Do not combine unrelated sets of facts in one table; each relation should contain an independent set of facts. Universal relation assumption 1NF to 3NF: 1NF to BCNF"
},
{
"page_index": 120,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_012.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_012.png",
"page_index": 120,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:16+07:00"
},
"raw_text": "Normalization lssues How do we decompose a schema into a desirable normal form? What criteria should the decomposed schemas follow in order to preserve the semantics of the original schema? Reconstructability: recover the original relation => no spurious joins Lossless decomposition: no information loss Dependency preservation: the constraints (i.e., dependencies) that hold on the original relation should be enforceable by means of the constraints (i.e., dependencies) defined on the decomposed relations. What happens to queries? Processing time may increase due to joins Denormalization"
},
{
"page_index": 121,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_013.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_013.png",
"page_index": 121,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:21+07:00"
},
"raw_text": "Functional Dependence A,} where X c U, Y c U. If, for all pairs of tuples t 1 relation scheme R, t[[X]= tz[X]=>t1[Y]= tz[Y], then the functional dependency X -> Y holds in R. Example - In relation EMP (ENO, PNO) -> (ENAME, TITLE, SAL, DUR, RESP)"
},
{
"page_index": 122,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_014.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_014.png",
"page_index": 122,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:27+07:00"
},
"raw_text": "Normal Forms Based on FDs 1NF eliminates the relations within relations or relations as attributes of tuples First Normal Form (1NF) eliminate the partial functional dependencies of non-prime attributes to key attributes Lossless & Second Normal Form n (2NF) Dependency eliminate the transitive functional dependencies of non-prime attributes to key attributes Third Normal Form (3NF) Lossless eliminate the partial and transitive functional dependencies of prime (key) attributes to key. Boyce-Codd Normal Form (BCNF)"
},
{
"page_index": 123,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_015.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_015.png",
"page_index": 123,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:38+07:00"
},
"raw_text": "Normalized Relations s - Example EMP ASG ENO ENAME TITLE ENO PNO RESP DUR E1 J. Doe Elect. Eng E1 P1 Manager 12 E2 M. Smith Syst. Anal. E2 P1 Analyst 24 E3 A.Lee Mech. Eng E2 P2 Analyst 6 E4 J. Miller Programmer E3 P3 Consultant 10 E5 B. Casey Syst. Anal. E3 P4 Engineer 48 E6 L. Chu Elect. Eng E4 P2 Programmer 18 E7 R.Davis Mech. Eng E5 P2 Manager 24 E8 J. Jones Syst. Anal. E6 P4 Manager 48 E7 P3 Engineer 36 E8 P3 Manager 40 PROJ PAY TITLE SAL PNO PNAME BUDGET P1 Instrumentation 150000 Elect. Eng 40000 P2 Database Develop. 135000 Syst. Anal. 34000 P3 CAD/CAM 250000 Mech. Eng 27000 P4 Maintenance 310000 Programmer 24000"
},
{
"page_index": 124,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_016.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_016.png",
"page_index": 124,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:43+07:00"
},
"raw_text": "Relational Algebra Specify how to obtain the result using a set of operators Form (Operands) -> (Result Relation (s) Relation"
},
{
"page_index": 125,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_017.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_017.png",
"page_index": 125,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:48+07:00"
},
"raw_text": "Relational Algebra Operators Fundamental Selection Projection - Union Set difference Cartesian product Additional Intersection 0-join Natural joir Semijoin Division Union compatibility Same degree Corresponding attributes defined over the same domain"
},
{
"page_index": 126,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_018.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_018.png",
"page_index": 126,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:52+07:00"
},
"raw_text": "Selection Produces a horizontal subset of the operand relation General form oF(R)={ttcR and F(t) is true} where - R is a relation, t is a tuple variable - F is a formula consisting of arithmetic comparison operators <,>,=,,<,"
},
{
"page_index": 127,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_019.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_019.png",
"page_index": 127,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:46:58+07:00"
},
"raw_text": "Selection E xample EMP ENO ENAME TITLE E1 J. Doe Elect. Eng (EMP) E2 OTITLE='Elect. Eng.' M. Smith Syst. Anal. E3 A. Lee Mech. Eng ENO ENAME TITLE E4 J. Miller Programmer E1 J. Doe Elect. Eng E5 B. Casey Syst. Anal. 1 E6 L. Chu Elect. Eng. E6 L. Chu Elect. Eng E7 R. Davis Mech. Eng E8 J. Jones Syst. Anal."
},
{
"page_index": 128,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_020.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_020.png",
"page_index": 128,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:04+07:00"
},
"raw_text": "P r rojection Produces a vertical slice of a relation General form (R)={t[A1,..,A,] tER} h where R is a relation, t is a tuple variable - 1 will be performed Note: projection can generate duplicate tuples. Commercial systems (and SQL) allow this and provide Projection with duplicate elimination Projection without duplicate elimination"
},
{
"page_index": 129,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_021.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_021.png",
"page_index": 129,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:10+07:00"
},
"raw_text": "P r rojection E :xample PROJ (PROJ) PNO PNAME BUDGET PNO BUDGET P1 Instrumentation 150000 P1 150000 P2 Database Develop. 135000 P2 135000 P3 CAD/CAM 250000 P3 250000 P4 Maintenance 310000 P4 310000"
},
{
"page_index": 130,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_022.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_022.png",
"page_index": 130,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:15+07:00"
},
"raw_text": "Union Similar to set union General form R U S={t R, S are relations, t is a tuple variable where - Result contains tuples that are in R or in S, but not both (duplicates removed) - R, S should be union-compatible"
},
{
"page_index": 131,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_023.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_023.png",
"page_index": 131,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:19+07:00"
},
"raw_text": "Set Difference General Form R-S={tt eR and t S} where R and S are relations, t is a tuple variable - Result contains all tuples that are in R, but not in S. - R - S X S - R - R, S union-compatible"
},
{
"page_index": 132,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_024.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_024.png",
"page_index": 132,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:25+07:00"
},
"raw_text": "Cartesian C Product ross Given relations - R of degree k1. cardinality n1 - S of degree k,, cardinality n2 Cartesian (cross) product: R x S ={t [A1,...,Ak ] t[A1,...,Ak 1 E R and 2 S} E The result of R . S is a relation of degree (k+ k,) and consists of all (n1* n,)-tuples where each tuple is a concatenation of one tuple of R with one tuple of S."
},
{
"page_index": 133,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_025.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_025.png",
"page_index": 133,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:40+07:00"
},
"raw_text": "Cartesian roduct E :xample EMP x PAY EMP ENO ENAME TITLE ENO ENAME EMP TITLE PAY.TITLE SALARY E1 J. Doe Elect. Eng E1 J. Doe Elect. Eng. Elect. Eng. 55000 E2 M. Smith Syst. Anal. E1 J. Doe Elect. Eng. Syst. Anal. 70000 E3 A. Lee Mech. Eng E1 J. Doe Elect. Eng. Mech. Eng 45000 E4 J. Miller Programmer E1 J. Doe Elect. Eng. Programmer 60000 E5 B. Casey Syst. Anal. E2 M. Smith Syst. Anal. Elect. Eng. 55000 E6 L. Chu Elect. Eng E2 M. Smith Syst. Anal. Syst. Anal. 70000 E7 R. Davis Mech. Eng E2 M. Smith Syst. Anal. Mech. Eng 45000 E8 J. Jones Syst. Anal E2 M. Smith Syst. Anal. Programmer 60000 E3 A. Lee Mech. Eng. Elect. Eng. 55000 1 E3 A. Lee Mech. Eng.Syst. Anal. 70000 PAY E3 A. Lee Mech. Eng.Mech. Eng 45000 TITLE SALARY E3 A. Lee Mech. Eng.Programmer 60000 Elect. Eng 55000 E8 J. Jones Syst. Anal. Elect. Eng. 55000 Syst. Anal. 70000 E8 J. Jones Syst. Anal. Syst. Anal. 70000 Mech. Eng 45000 E8 J. Jones Syst. Anal. Mech. Eng 45000 Programmer 60000 E8 J. Jones Syst. Anal. Programmer 60000"
},
{
"page_index": 134,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_026.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_026.png",
"page_index": 134,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:44+07:00"
},
"raw_text": "Intersection Typical set intersection ={tt E Rand t E S} R nS =R-(R-S) R, S union-compatible"
},
{
"page_index": 135,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_027.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_027.png",
"page_index": 135,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:47:49+07:00"
},
"raw_text": "0-Join General form R S={t[A B ,...,Ap F(R.Ai,S.Bj) n/ t[A R and t[B S A 1,...,B - E E n and F(R.A 4i, S.B;) is true} where - R, S are relations, t is a tuple variable - F (R.A, S.B;)is a formula defined as that of selection. A derivative of Cartesian product"
},
{
"page_index": 136,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_028.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_028.png",
"page_index": 136,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:02+07:00"
},
"raw_text": "Join E xample EMP X ASG EMP EMP.ENO=ASG.ENO ENO ENAME TITLE ENO ENAME TITLE PNO RESP DUR E1 J. Doe Elect. Eng E1 J.Doe Elect. Eng P1 Manager 12 E2 M. Smith Syst. Anal. E2 M. Smith Syst. Anal. P1 Analyst 12 E3 A. Lee Mech.Eng E2 M. Smith Syst. Anal. P2 Analyst 12 E4 J. Miller Programmer E3 A. Lee Mech. Eng. P3 Consultant 12 E5 B. Casey Syst. Anal. E3 A. Lee Mech. Eng P4 Engineer 12 E6 L. Chu Elect. Eng E4 J. Miller Programmer P2 Programmer 12 E7 R. Davis Mech. Eng E5 J. Miller Syst. Anal. P2 Manager 12 E8 J. Jones E6 L. Chu Elect. Eng. Syst. Anal. P4 Manager 12 E9 A. Hsu Programmer E7 R. Davis Mech. Eng P3 Engineer 12 E10 T. Wong Syst. Anal. E8 J. Jones Syst. Anal. P3 Manager 12 (a) (b)"
},
{
"page_index": 137,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_029.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_029.png",
"page_index": 137,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:07+07:00"
},
"raw_text": "Types s of Join Equi-join - The formula F only contains equality R X S R.A=S.B Natural join Equi-join of two relations R and S over an attribute (or attributes) common to both R and S and projecting out one copy of those attributes"
},
{
"page_index": 138,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_030.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_030.png",
"page_index": 138,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:16+07:00"
},
"raw_text": "Example Natural Join EMP ENO ENAME TITLE EMP X PAY E1 J. Doe Elect. Eng E2 M. Smith Syst. Anal. ENO ENAME TITLE SALARY E3 A. Lee Mech. Eng E4 J. Miller Programmer E1 J. Doe Elect. Eng 55000 E5 B. Casey Syst. Anal. E2 M. Smith Analyst 70000 E6 L. Chu Elect. Eng E3 A. Lee Mech. Eng 45000 E7 R. Davis Mech. Eng E8 J. Jones Syst. Anal. E4 J. Miller Programmer 60000 E5 B. Casey Syst. Anal. 70000 PAY E6 L. Chu Elect. Eng 55000 TITLE SALARY E7 R. Davis Mech. Eng 45000 E8 J. Jones Syst. Anal. 70000 Elect. Eng 55000 Syst. Anal. 70000 Mech. Eng 45000 Join is over the common attribute TITLE Programmer 60000"
},
{
"page_index": 139,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_031.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_031.png",
"page_index": 139,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:21+07:00"
},
"raw_text": "Types s of Join Outer-Join - Ensures that tuples from one or both relations that do not satisfy the join condition still appear in the final result with other relation' s attribute values set>to NULL - Left outer jin - Right outer join - Full outer join"
},
{
"page_index": 140,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_032.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_032.png",
"page_index": 140,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:32+07:00"
},
"raw_text": "Example Outer J Join Left outer join EMPTXA ASG ENO ENO ENAME TITLE PNO RESP DUR E1 J.Doe Elect. Eng. P1 Manager 12 E2 M. Smith Syst. Anal. P1 Analyst 12 E2 M. Smith Syst. Anal. P2 Analyst 12 E3 A. Lee Mech. Eng P3 Consultant 12 E3 A. Lee Mech. Eng P4 Engineer 12 E4 J. Miller Programmer P2 Programmer 12 E5 J.Miller Syst. Anal. P2 Manager 12 E6 L. Chu Elect. Eng. P4 Manager 12 E7 R. Davis Mech. Eng P3 Engineer 12 E8 J. Jones Syst. Anal. P3 Manager 12 E9 A.Hsu Programmer Null Null Null E10 T.Wong Syst. Anal. Null Null Null"
},
{
"page_index": 141,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_033.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_033.png",
"page_index": 141,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:37+07:00"
},
"raw_text": "Semijoin Derivation S =IIA(R s) R X =IIA(R) 1 AnB(S) = R X X X F F F 1 AnB(S) where - R, S are relations - A is a set of attributes"
},
{
"page_index": 142,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_034.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_034.png",
"page_index": 142,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:43+07:00"
},
"raw_text": "Semijoin Example EMP X PAY EMP.TITLE=PAY.TITLE ENO ENAME TITLE E1 J. Doe Elect. Eng E2 M. Smith Analyst E3 A. Lee Mech. Eng. E4 J.Miller Programmer E5 B.Casey Syst. Anal. E6 L. Chu Elect. Eng E7 R. Davis Mech. Eng E8 J. Jones Syst. Anal."
},
{
"page_index": 143,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_035.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_035.png",
"page_index": 143,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:49+07:00"
},
"raw_text": "Division (Quotient) Given relations -R of degree k1(R ={A1 } 1,...,A k. - S of degree k, (S = {B B1,...,Bk 2 {A1,..A Let A = K } [i.e.,R(A)] S(B)] and B cA. Then, T = R - S gives T of degree k-k, [i.e., T(Y) where Y = A-B] such that for a tuple t to appear in T, the values in t must appear in R in combination with every tuple in S. Derivation"
},
{
"page_index": 144,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_036.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_036.png",
"page_index": 144,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:48:57+07:00"
},
"raw_text": "Example Division PROJ ASG ENO PNO PNAME BUDGET PNO PNAME BUDGET E1 P1 Instrumentation 150000 P3 CAD/CAM 250000 E2 P1 Instrumentation 150000 P4 Maintenance 310000 E2 P2 Database Develop. 135000 E3 P3 CAD/CAM 250000 E3 P4 Maintenance 310000 E4 P2 Database Develop. 135000 (ASG' PROJ') E5 P2 Database Develop. 135000 E6 P4 Maintenance 310000 ENO E7 P3 CAD/CAM 250000 E3 E8 P3 CAD/CAM 250000"
},
{
"page_index": 145,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_037.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_037.png",
"page_index": 145,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:01+07:00"
},
"raw_text": "Relational Calculus Specify the properties that the result should hold Tuple relational calculus Domain relational calculus"
},
{
"page_index": 146,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_038.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_038.png",
"page_index": 146,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:06+07:00"
},
"raw_text": "Tuple Relational Calculus Query of the form {tF{t}} where 3 - t is a tuple variable - F is a well-formed formula Atomic formula - Tuple-variable membership expressions R.t or R(t) : tuple t belongs to relation R - Conditions s[A] 0 t[B]; s and t are tuple variables, A and B are components of s and t, respectively, e {<,>, =,+, , -}; e.g.,s[SAL] > t[SAL] s[A] c; s, A, and as defined above, c is a constant;"
},
{
"page_index": 147,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_039.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_039.png",
"page_index": 147,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:12+07:00"
},
"raw_text": "Relational Calculus Domain I where the fre EMP ENO ENAME TITLE E2 P. QBE is ar ASG ENO PNO RESP DUR E2 P3 PROJ PNO PNAME BUDGET P3 CAD/CAM"
},
{
"page_index": 148,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_040.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_040.png",
"page_index": 148,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:16+07:00"
},
"raw_text": "Computer Network Switches An / interconnected collection of autonomous Hosts computers that are capable of exchanging information Network among themselves."
},
{
"page_index": 149,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_041.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_041.png",
"page_index": 149,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:21+07:00"
},
"raw_text": "Internet Network of networks Intranet Client R Intranet R ISP Network R Intranet R Server R ISP Network"
},
{
"page_index": 150,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_042.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_042.png",
"page_index": 150,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:26+07:00"
},
"raw_text": "Types s of Networks According to scale (geographic distribution) - Wide are network (WAN) high as thousands of kms Long delays due to distance traveled Heterogeneity of transmission media Speeds of 150Mbps to 10Gbps (OC192 on the backbone) - Local area network (LAN) Limited in geographic scope (usually < 2km) Speeds 10-1000 Mbps"
},
{
"page_index": 151,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_043.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_043.png",
"page_index": 151,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:31+07:00"
},
"raw_text": "Types s of Networks (cont'd) Topology -Irregular No regularity in the interconnection - e.g., Internet - Bus Typical in LANs - Ethernet Using Carrier Sense Medium Access with Collision Detection (CSMA/CD) - Listen before and while you transmit - Star - Ring -Mesh"
},
{
"page_index": 152,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_044.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_044.png",
"page_index": 152,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:35+07:00"
},
"raw_text": "Bus network Host Host #1 #3 Bus Interface B U S Host Host #2 #4"
},
{
"page_index": 153,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_045.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_045.png",
"page_index": 153,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:42+07:00"
},
"raw_text": "Communication Schemes Point-to-point : (unicast) - One or more (direct or indirect) links between each pair of nodes - Communication always between two nodes - Receiver and sender are identified by their addresses included in the message header - Message may follow one of many links between the sender and receiver using switching or routing Broadcast (multi-point) - Messages are transmitted over a shared channel ivod bv all tbo"
},
{
"page_index": 154,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_046.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_046.png",
"page_index": 154,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:45+07:00"
},
"raw_text": "Communication Alternatives Twisted pair Coaxial Fiber optic cable Satellite Microwave Wireless"
},
{
"page_index": 155,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_047.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_047.png",
"page_index": 155,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:51+07:00"
},
"raw_text": "Data Communication Hosts are connected by links, each of which can carry one or more channels Link: physical entity; channel: logical entity Digital signal versus analog signal Capacity - bandwidth - The amount of information that can be trnsmitted over the channel in a given time unit - Packet switching Messages divided into fixed size packets, each of which are"
},
{
"page_index": 156,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_048.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_048.png",
"page_index": 156,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:55+07:00"
},
"raw_text": "Packet Format Block Error Header Text Check Source address Destination address Message number - Packet number - Acknowledgment Control information"
},
{
"page_index": 157,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_049.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_049.png",
"page_index": 157,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:49:59+07:00"
},
"raw_text": "Communication Protocols Software that ensures error-free, reliable and efficient communication between hosts Layered architecture - hence protocol stack protocol suite or r TCP/IP is the best-known one - Used in the Internet"
},
{
"page_index": 158,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_050.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_050.png",
"page_index": 158,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:04+07:00"
},
"raw_text": "Transmission using Message TCP/IP Message Message Application Layer Application Layer Transport Layer Transport Layer Internet Layer Internet Layer Local Local Network Network"
},
{
"page_index": 159,
"chapter_num": 3,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_051.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_3/slide_051.png",
"page_index": 159,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:08+07:00"
},
"raw_text": "TCP/IP P r rotocol Application HTML, HTTP, FTP Telnet NFS SNMP Transport TCP UDP IP Network Individual WiFi Ethernet Token Ring ATM FDDI Networks"
},
{
"page_index": 160,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_001.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_001.png",
"page_index": 160,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:13+07:00"
},
"raw_text": "Processing Query D-DBMS In Lecturer: Nguyen Dinh Thanh Email: dinhthanh@hcmut.edu.vn More info: https://nguyendinhthanh.net DAI HOC QUOC GIA THANH PHO HO CHi MINH TRU'O'NG DAI HOC BACH KHOA"
},
{
"page_index": 161,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_002.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_002.png",
"page_index": 161,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:18+07:00"
},
"raw_text": "Query Processing in a DDBMS high level user r query query processor Low-level data manipulation commands for D-DBMS 2"
},
{
"page_index": 162,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_003.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_003.png",
"page_index": 162,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:23+07:00"
},
"raw_text": "Processing Query Components Query language that is used SQL: \"intergalactic dataspeak' Query execution methodology The steps that one goes through in executing high-level (declarative) user queries Query optimization How do we determine the \"best\" execution plan? 3"
},
{
"page_index": 163,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_004.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_004.png",
"page_index": 163,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:31+07:00"
},
"raw_text": "Selecting Alternatives EMP (ENO. ENAME TITLE ASG (ENO: PNO, RESP. DUR) \"Find the of employees who names are managing a project\" SELECT ENAME FROM EMP, ASG WHERE EMP.ENO ASG.ENO AND RESP Strategy 1 1 (EMPxASG)) (0 ENAME RESP=\"Manager\"EMP.ENO=ASG.ENO Strategy 2 H EMP (0 (ASG)) X ENAME ENO RESP=\"Manager\" Strategy 2 avoids Cartesian product, so may be \"better\" 4"
},
{
"page_index": 164,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_005.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_005.png",
"page_index": 164,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:42+07:00"
},
"raw_text": "What is the Problem? 11 EMP (0 (ASG)) X ENAME ENO RESP=\"Manager\" Site 1 Site 2 Site 3 Site 4 Site 5 Result ASG= 3\"(ASG) EMP (EMP) EMP 0 (EMP) ENO<\"E3 2 ENO>\"E3\"l Execution Strategy 1 Execution Strategy 2 Site 5 Site 5 result =EMP'UEMP 2 result=(EMP,EMP X ASG,x ASG ENO RESP=\"Manager\" 2 EMP EMP 2 Site 3 Site 4 ASG ASG EMP EMP 2 2 EMP' =EMP ASG EMP'.=EMP ASG X X ENO 2 2 ENO 2 Site 1 Site 2 Site 3 Site 4 ASG ASG Site 1 Site 2 ASG1=0RESP=\"Manager\"F ASG ASG'2 = 0 RESP=\"Manager\" ASG 5 Which is better? Strategy 1 or Strategy 2"
},
{
"page_index": 165,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_006.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_006.png",
"page_index": 165,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:51+07:00"
},
"raw_text": "Cost of Alternatives Assume size(EMP) = 400,size(ASG) = 1000 tuple access cost = 1 unit; tuple transfer cost = 10 units 20 managers in ASG relation Data is uniformly distributed among sites Strategy 1 produce AsG': (10+10) * tuple access cost 20 transfer ASG' to the sites of EMP: (10+10) * tuple transfer cost 200 produce EMP': (10+10) * tuple access cost * 2 40 transfer EMp' to result site: (10+10) * tuple transfer cost 200 Total Cost 460 Strategy 2 transfer EMP to site 5: 400 * tuple transfer cost 4,000 transfer ASG to site 5: 1000 * tuple transfer cost 10,000 produce ASG': 1000 * tuple access cost 1,000 join EMP and ASG': 400 20 * tuple access cost 8,000 Total Cost 23,000 6"
},
{
"page_index": 166,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_007.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_007.png",
"page_index": 166,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:50:56+07:00"
},
"raw_text": "Query Optimization n Objectives Minimize a cost function I/O cost + CPU cost + communication cost These might have different weights in different distributed environments Wide area networks communication cost may dominate or vary much bandwidth speed high protocol overhead Local area networks communication cost not that dominant total cost function should be considered Can also maximize throughput 7"
},
{
"page_index": 167,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_008.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_008.png",
"page_index": 167,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:02+07:00"
},
"raw_text": "Complexity of Relational Operations Operation Complexity Select Project O(n) Assume (without duplicate elimination) relations of cardinality n Project (with duplicate elimination) O(n * 1og n) sequential scan Group Join Semi-join O(n * 1og n) Division Set Operators O(n2) Cartesian Product 8"
},
{
"page_index": 168,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_009.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_009.png",
"page_index": 168,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:08+07:00"
},
"raw_text": " Issues - Types Query Optimization Of Optimizers Exhaustive search Cost-based Optimal Combinatorial complexity in the number of relations Heuristics Not optimal Regroup common sub-expressions Perform selection, projection first Replace a join by a series of semijoins Reorder operations to reduce intermediate relation size Optimize individual operations 9"
},
{
"page_index": 169,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_010.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_010.png",
"page_index": 169,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:13+07:00"
},
"raw_text": "Query Optimization Issues - Granularity Optimization Single query at a time Cannot use common intermediate results Multiple queries at a time Efficient if many similar queries Decision space is much larger 10"
},
{
"page_index": 170,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_011.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_011.png",
"page_index": 170,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:20+07:00"
},
"raw_text": "Query Optimization Issues - Optimization Timing Static Compilation optimize prior to the execution Difficult to estimate the size of the intermediate results = error propagation Can amortize over many executions Dynamic Run time optimization Exact information on the intermediate relation sizes Have to reoptimize for multiple executions Distributed lNGRES Hybrid Compile using a static algorithm If the error in estimate sizes > threshold, reoptimize at run time Mermaid 11"
},
{
"page_index": 171,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_012.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_012.png",
"page_index": 171,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:25+07:00"
},
"raw_text": "Query Optimization Issues - Statistics Relation Cardinality Size of a tuple Fraction of tuples participating in a join with another relation Attribute Cardinality of domain Actual number of distinct values Common assumptions Independence between different attribute values Uniform distribution of attribute values within their domain 12"
},
{
"page_index": 172,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_013.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_013.png",
"page_index": 172,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:31+07:00"
},
"raw_text": "Query Optimization Issues - Decision Sites Centralized Single site determines the \"best\" schedule Simple Need knowledge about the entire distributed database Distributed Cooperation among sites to determine the schedule Need only local information Cost of cooperation Hybrid One site determines the global schedule Each site optimizes the local subqueries 13"
},
{
"page_index": 173,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_014.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_014.png",
"page_index": 173,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:37+07:00"
},
"raw_text": "Query Optimization i Issues - Network Topology Wide area networks (WAN) - point-to-point Characteristics Low bandwidth Low speed High protocol overhead Communication cost will dominate; ignore all other cost factors Global schedule to minimize communication cost Local schedules according to centralized query optimization Local area networks (LAN) Communication cost not that dominant Total cost function should be considered Broadcasting can be exploited (joins) Special algorithms exist for star networks 14"
},
{
"page_index": 174,
"chapter_num": 4,
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_015.png",
"metadata": {
"doc_type": "slide",
"course_id": "CO3023",
"source_file": "/workspace/data/converted/CO3023_Distributed_and_Object-Oriented_Databases/Chapter_4/slide_015.png",
"page_index": 174,
"language": "en",
"ocr_engine": "PaddleOCR 3.2",
"extractor_version": "1.0.0",
"timestamp": "2025-10-31T13:51:44+07:00"
},
"raw_text": "Distributed Query Processing Methodology Calculus Query on Distributed Relations Query GLOBAL Decomposition SCHEMA Algebraic Ouery on Distributed Relations CONTROL FRAGMEN Data SITE T Localization SCHEMA Fragment Query STATS ON Global FRAGMEN Optimization TS Optimized Fragment Query with Communication Operations Local LOCAL LOCAL Optimization SCHEMAS SITES Optimized Local Queries 15"
}
]
} |