{ "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),1200000} 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 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: { 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" } ] }