by Chan Mei Shuen Polly. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 67-70). / Abstract --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Definitions --- p.3 / Chapter 1.2 --- Thesis Overview --- p.5 / Chapter 2 --- Background and Related Work --- p.6 / Chapter 2.1 --- Feature-Based Index Structures --- p.6 / Chapter 2.2 --- Distance Preserving Methods --- p.8 / Chapter 2.3 --- Distance-Based Index Structures --- p.9 / Chapter 2.3.1 --- The Vantage-Point Tree Method --- p.10 / Chapter 3 --- The Problem of Distance Preserving Methods in Querying --- p.12 / Chapter 3.1 --- Some Experimental Results --- p.13 / Chapter 3.2 --- Discussion --- p.15 / Chapter 4 --- Nearest Neighbor Search in VP-trees --- p.17 / Chapter 4.1 --- The sigma-factor Algorithm --- p.18 / Chapter 4.2 --- The Constant-α Algorithm --- p.22 / Chapter 4.3 --- The Single-Pass Algorithm --- p.24 / Chapter 4.4 --- Discussion --- p.25 / Chapter 4.5 --- Performance Evaluation --- p.26 / Chapter 4.5.1 --- Experimental Setup --- p.27 / Chapter 4.5.2 --- Results --- p.28 / Chapter 5 --- Update Operations on VP-trees --- p.41 / Chapter 5.1 --- Insert --- p.41 / Chapter 5.2 --- Delete --- p.48 / Chapter 5.3 --- Performance Evaluation --- p.51 / Chapter 6 --- Minimizing Distance Computations --- p.57 / Chapter 6.1 --- A Single Vantage Point per Level --- p.58 / Chapter 6.2 --- Reuse of Vantage Points --- p.59 / Chapter 6.3 --- Performance Evaluation --- p.60 / Chapter 7 --- Conclusions and Future Work --- p.63 / Chapter 7.1 --- Future Work --- p.65 / Bibliography --- p.67
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_322705 |
| Date | January 1997 |
| Contributors | Chan, Mei Shuen Polly., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, x, 70 leaves : ill. ; 30 cm. |
| Rights | Use 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.0041 seconds