No description available.

Jessie Ching. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1989. / Bibliography: leaves 98-101.

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

Cai, Junpu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 49-51). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Related Works --- p.6 / Chapter 3 --- Problem Definition --- p.10 / Chapter 4 --- Preliminary Study --- p.14 / Chapter 5 --- Algorithms --- p.17 / Chapter 5.1 --- Result Caching algorithm --- p.17 / Chapter 5.1.1 --- Caching Algorithm --- p.18 / Chapter 5.1.2 --- Implementation and Maintenance --- p.20 / Chapter 5.2 --- Query Processing algorithm --- p.20 / Chapter 5.2.1 --- Join Types --- p.21 / Chapter 5.2.2 --- Operators in the Operator Tree --- p.23 / Chapter 5.2.3 --- Comparison with previous work --- p.27 / Chapter 5.2.4 --- Operator Tree (OT) for one CN --- p.28 / Chapter 5.2.5 --- Generic Operator Network (ON) --- p.30 / Chapter 6 --- Empirical Study --- p.37 / Chapter 6.1 --- Result Caching --- p.38 / Chapter 6.2 --- Comparison of Bushy and Left Deep Plans --- p.41 / Chapter 6.3 --- Comparison of ON and previous methods --- p.44 / Chapter 7 --- Conclusion and Future Work --- p.47 / Bibliography --- p.49

In this thesis, for the schema-based approaches, we propose an efficient algorithm to general all relational algebra expressions in order to find all the connected trees in an RDB. We also study an efficient algorithm to evaluate all the expressions using semijoins in RDBMS . We show that our method can also be extended to answer continuous keyword queries in a relational data stream. We further propose novel algorithms that find sets of tuples that are reachable from a root tuple within a radius, and algorithms that find multi-center subgraphs within a radius. Our algorithms use SQL queries only in order to make fully use of RDBMS. We show that the current commercial RDBMSs are powerful enough to support such keyword queries in RDBs efficiently without any additional new indexing to be built and maintained. The main idea behind our approach is tuple reduction. For the graph-based approaches, we propose an efficient algorithm to find all/top- K multi-center subgraphs in polynomial delay. We also introduce a new kind of keyword query, namely, structural statistics by keywords, to summarize keyword search results into several dimensions. We conducted extensive performance studies using two large real datasets IMDB and DBLP to show the efficiency and effectiveness of all our approaches. / Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB that cannot be easily identified using SQL on RDBMSs. In brief, it finds how the tuples containing the given keywords are connected via sequences of connections (foreign key references) among tuples in an RDB. Such interconnected tuple structures can be found as connected trees up to a certain size, sets of tuples that are reachable from a root tuple within a radius, or even multi-center subgraphs within a radius. In the literature, there are two main approaches, namely schema-based approaches and graph-based approaches. The schema-based approaches are to generate a set of relational algebra expressions and evaluate every such expression using SQL on an RDBMS directly or in a middleware on top of an RDBMS indirectly. Due to a large number of relational algebra expressions needed to process, most of the existing works take a middleware approach without fully utilizing RDBMSs. The graph-based approaches are to materialize an RDB as a graph and find the interconnected tuple structures using graph-based algorithms in memory. / Qin, Lu. / Adviser: Jeffrey Xu Yu. / Source: Dissertation Abstracts International, Volume: 73-02, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 133-138). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Thesis (M. Phil.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains x, 54 p.; also contains graphics. Vita. Includes bibliographical references (p. 50-53).

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains x, 54 p.; also contains graphics. Vita. Includes bibliographical references (p. 50-53).

Revision of Thesis (Ph. D.)--Princeton University, 1978. / Includes bibliographical references (p. [97]-99) and index.

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: XML; views; updates; Rainbow. Includes bibliographical references (p. 94-96).