Advanced query processing in databases.
Ding, Bolin. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. === Includes bibliographical references (leaves 53-56). === Abstracts in English and Chinese. === Abstract --- p.i === Acknowledgement --- p.ii === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Overview of Research...
| Other Authors: | |
|---|---|
| Format: | Others |
| Language: | English Chinese |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://library.cuhk.edu.hk/record=b5893385 http://repository.lib.cuhk.edu.hk/en/item/cuhk-326052 |
| Summary: | Ding, Bolin. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. === Includes bibliographical references (leaves 53-56). === Abstracts in English and Chinese. === Abstract --- p.i === Acknowledgement --- p.ii === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Overview of Research --- p.4 === Chapter 1.2 --- Summary of Results and Thesis Outline --- p.6 === Chapter 2 --- Problem Statement --- p.7 === Chapter 3 --- Literature Review --- p.10 === Chapter 3.1 --- Hardness Results --- p.10 === Chapter 3.2 --- Approximation Algorithms --- p.11 === Chapter 3.2.1 --- Spanning and Cleanup --- p.11 === Chapter 3.2.2 --- d-Star Tree or d-Level Tree --- p.11 === Chapter 3.2.3 --- Randomized Rounding --- p.12 === Chapter 3.3 --- Existing Systems --- p.13 === Chapter 3.3.1 --- RIU (Retrieve Information Unit) --- p.14 === Chapter 3.3.2 --- BANKS --- p.14 === Chapter 3.4 --- Summary --- p.16 === Chapter 4 --- Algorithm Based on Height-Bounded Trees --- p.17 === Chapter 4.1 --- Naive Dynamic Programming Algorithm --- p.19 === Chapter 4.2 --- Performance Ratio and Complexity --- p.23 === Chapter 5 --- Best-First Dynamic Programming Algorithm --- p.26 === Chapter 5.1 --- An Efficient Best-First Algorithm --- p.28 === Chapter 5.2 --- Time/Space Complexity --- p.35 === Chapter 5.3 --- Finding Top-k Group Steiner Trees --- p.36 === Chapter 5.4 --- Other Important Issues --- p.38 === Chapter 5.4.1 --- Comparison with an Unpublished Work --- p.39 === Chapter 5.4.2 --- General Cost Functions --- p.40 === Chapter 5.4.3 --- Keyword Queries with Logical Operators --- p.41 === Chapter 5.4.4 --- Handling Directed Graph --- p.42 === Chapter 5.4.5 --- Graph Size and Graph Maintenance --- p.42 === Chapter 5.4.6 --- Indexing and Pruning Strategy --- p.43 === Chapter 6 --- Experimental Studies --- p.45 === Chapter 6.1 --- Exp-1 Scalability --- p.46 === Chapter 6.2 --- Exp-2 Number of Keywords --- p.48 === Chapter 6.3 --- Exp-3 GST-k Testing --- p.49 === Chapter 6.4 --- Exp-4 MDB (A Directed Graph Dataset) --- p.50 === Chapter 7 --- Conclusions --- p.51 === Bibliography --- p.53 |
|---|