Return to search

From XML to relational database.

by Yan, Men-Hin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 114-119). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgments --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Storing XML in Database Systems --- p.2 / Chapter 1.2 --- Outline of the Thesis --- p.4 / Chapter 2 --- Related Work --- p.5 / Chapter 2.1 --- Overview of XML --- p.5 / Chapter 2.1.1 --- Extensible Markup Language (XML) --- p.5 / Chapter 2.1.2 --- Data Type Definition (DTD) --- p.6 / Chapter 2.1.3 --- "ID, IDREF and IDREFS" --- p.9 / Chapter 2.2 --- Using Special-Purpose Database to Store XML Data --- p.10 / Chapter 2.3 --- Using Relational Databases to Store XML Data --- p.11 / Chapter 2.3.1 --- Extracting Schemas with STORED --- p.11 / Chapter 2.3.2 --- Using Simple Schemes Based on Labeled Graph --- p.12 / Chapter 2.3.3 --- Generating Schemas from DTDs --- p.12 / Chapter 2.3.4 --- Commercial Approaches --- p.13 / Chapter 2.4 --- Discovering Functional Dependencies --- p.14 / Chapter 2.4.1 --- Functional Dependency --- p.14 / Chapter 2.4.2 --- Finding Functional Dependencies --- p.14 / Chapter 2.4.3 --- TANE and Partition Refinement --- p.15 / Chapter 2.5 --- Multivalued Dependencies --- p.17 / Chapter 2.5.1 --- Example of Multivalued Dependency --- p.18 / Chapter 3 --- Using RDBMS to Store XML Data --- p.20 / Chapter 3.1 --- Global Schema Extraction Algorithm --- p.22 / Chapter 3.1.1 --- Step 1: Simplify DTD --- p.22 / Chapter 3.1.2 --- Step 2: Construct Schema Prototype Trees --- p.24 / Chapter 3.1.3 --- Step 3: Generate Relational Schema Prototype --- p.29 / Chapter 3.1.4 --- Step 4: Discover Functional Dependencies and Candidate Keys --- p.31 / Chapter 3.1.5 --- Step 5: Normalize the Relational Schema Prototypes --- p.32 / Chapter 3.1.6 --- Discussion --- p.32 / Chapter 3.2 --- DTD-splitting Schema Extraction Algorithm --- p.34 / Chapter 3.2.1 --- Step 1: Simplify DTD --- p.35 / Chapter 3.2.2 --- Step 2: Construct Schema Prototype Trees --- p.36 / Chapter 3.2.3 --- Step 3: Generate Relational Schema Prototype --- p.45 / Chapter 3.2.4 --- Step 4: Discover Functional Dependencies and Candidate Keys --- p.46 / Chapter 3.2.5 --- Step 5: Normalize the Relational Schema Prototypes --- p.47 / Chapter 3.2.6 --- Discussion --- p.49 / Chapter 3.3 --- Experimental Results --- p.50 / Chapter 3.3.1 --- Real Life XML Data: SIGMOD Record XML --- p.50 / Chapter 3.3.2 --- Synthetic XML Data --- p.58 / Chapter 3.3.3 --- Discussion --- p.68 / Chapter 4 --- Finding Multivalued Dependencies --- p.75 / Chapter 4.1 --- Validation of Multivalued Dependencies --- p.77 / Chapter 4.2 --- Search Strategy and Pruning --- p.80 / Chapter 4.2.1 --- Search Strategy for Left-hand Sides Candidates --- p.81 / Chapter 4.2.2 --- Search Strategy for Right-hand Sides Candidates --- p.82 / Chapter 4.2.3 --- Other Pruning --- p.85 / Chapter 4.3 --- Computing with Partitions --- p.87 / Chapter 4.3.1 --- Computing Partitions --- p.88 / Chapter 4.4 --- Algorithm --- p.89 / Chapter 4.4.1 --- Generating Next Level Candidates --- p.92 / Chapter 4.4.2 --- Computing Partitions --- p.93 / Chapter 4.5 --- Experimental Results --- p.94 / Chapter 4.5.1 --- Results of the Algorithm --- p.95 / Chapter 4.5.2 --- Evaluation on the Results --- p.96 / Chapter 4.5.3 --- Scalability of the Algorithm --- p.98 / Chapter 4.5.4 --- Using Multivalued Dependencies in Schema Extraction Al- gorithms --- p.101 / Chapter 5 --- Conclusion --- p.108 / Chapter 5.1 --- Discussion --- p.108 / Chapter 5.2 --- Future Work --- p.110 / Chapter 5.2.1 --- Translate Semistructured Queries to SQL --- p.110 / Chapter 5.2.2 --- Improve the Multivalued Dependency Discovery Algorithm --- p.112 / Chapter 5.2.3 --- Incremental Update of Resulting Schema --- p.113 / Bibliography --- p.113 / Appendix --- p.120 / Chapter A --- Simple Proof for Minimality in Multivalued Dependencies --- p.120 / Chapter B --- Third and Fourth Normal Form Decompositions --- p.122 / Chapter B.1 --- 3NF Decomposition Algorithm --- p.123 / Chapter B.2 --- 4NF Decomposition Algorithm --- p.124

Identiferoai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_323513
Date January 2001
ContributorsYan, Men-Hin., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering.
Source SetsThe Chinese University of Hong Kong
LanguageEnglish, Chinese
Detected LanguageEnglish
TypeText, bibliography
Formatprint, xiv, 124 leaves : ill. ; 30 cm.
RightsUse of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Page generated in 0.0022 seconds