by Edward Nai Biu Tam. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 92-93). / Abstract --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Problems and Definitions --- p.1 / Chapter 1.1.1 --- Spatial Data --- p.1 / Chapter 1.1.2 --- Spatial Queries --- p.2 / Chapter 1.1.3 --- Spatial Access Method --- p.3 / Chapter 1.1.4 --- Motivations --- p.4 / Chapter 1.2 --- Architecture for Parallel SAM --- p.4 / Chapter 1.2.1 --- Parameters --- p.4 / Chapter 1.3 --- Objectives of the thesis --- p.7 / Chapter 1.4 --- Overview of the thesis --- p.7 / Chapter 2 --- Review of the Literature --- p.9 / Chapter 2.1 --- R-tree --- p.9 / Chapter 2.1.1 --- Structure --- p.9 / Chapter 2.1.2 --- Searching --- p.10 / Chapter 2.1.3 --- Searching Costs --- p.11 / Chapter 2.1.4 --- Insertion --- p.14 / Chapter 2.1.5 --- Deletion --- p.15 / Chapter 2.1.6 --- Splitting Algorithm --- p.16 / Chapter 2.2 --- Independent R-tree --- p.19 / Chapter 2.2.1 --- Data Distribution --- p.19 / Chapter 2.2.2 --- Space Partition --- p.19 / Chapter 2.3 --- Super Node --- p.19 / Chapter 2.4 --- Multiplexed R-tree --- p.20 / Chapter 2.4.1 --- Node Allocation Algorithm --- p.21 / Chapter 3 --- Comparison of Different Parallel R-tree Methods --- p.23 / Chapter 3.1 --- Throughput --- p.24 / Chapter 3.2 --- Service Time --- p.32 / Chapter 3.3 --- Summary --- p.37 / Chapter 3.3.1 --- Data Distribution --- p.37 / Chapter 3.3.2 --- Space Partition --- p.37 / Chapter 3.3.3 --- Multiplexed R-trees --- p.37 / Chapter 3.3.4 --- Super-nodes --- p.37 / Chapter 3.3.5 --- Conclusions --- p.38 / Chapter 4 --- Parallel Binary R-tree --- p.39 / Chapter 4.1 --- Architecture --- p.39 / Chapter 4.1.1 --- Extension of PBR-tree --- p.41 / Chapter 4.2 --- Searching Algorithm --- p.41 / Chapter 4.2.1 --- Asynchronous --- p.41 / Chapter 4.2.2 --- Synchronous --- p.45 / Chapter 4.3 --- Performance Evaluation --- p.45 / Chapter 4.3.1 --- Asynchronous --- p.49 / Chapter 4.3.2 --- Synchronous --- p.49 / Chapter 4.3.3 --- Comparison of the Cost models --- p.52 / Chapter 4.4 --- Application of PBR-tree --- p.54 / Chapter 4.4.1 --- Experimental Setup --- p.54 / Chapter 4.4.2 --- Experimental results --- p.55 / Chapter 4.5 --- Conclusions --- p.56 / Chapter 5 --- Multiplexed Parallel R-trees --- p.60 / Chapter 5.1 --- Architecture --- p.60 / Chapter 5.2 --- Searching --- p.61 / Chapter 5.3 --- Node Allocation Algorithm --- p.61 / Chapter 6 --- Comparisons and Experiment --- p.63 / Chapter 6.1 --- Assumptions and Experimental Setup --- p.63 / Chapter 6.2 --- Experimental Results --- p.65 / Chapter 6.2.1 --- Waiting time --- p.65 / Chapter 6.2.2 --- Service time --- p.65 / Chapter 6.3 --- Experimental results for large number of processors --- p.74 / Chapter 7 --- Conclusions --- p.83 / Chapter 7.1 --- Summary --- p.83 / Chapter 7.1.1 --- Studies on the previous works --- p.83 / Chapter 7.1.2 --- Parallel Binary R-tree --- p.84 / Chapter 7.1.3 --- Multiplexed Parallel R-trees --- p.84 / Chapter 7.2 --- Future Works --- p.84 / Chapter A --- Proximity Measure --- p.86 / Chapter B --- Summary of Variables and Symbols --- p.88 / Chapter C --- Proof of Equations --- p.90 / Bibliography --- p.92
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_321561 |
| Date | January 1996 |
| Contributors | Tam, Edward Nai Biu., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering. |
| Publisher | Chinese University of Hong Kong |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, x, 93 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.0023 seconds