Semistructured and structured data manipulation.

by Kuo Yin-Hung.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.Includes bibliographical references (leaves 91-97).Abstracts in English and Chinese.Abstract --- p.iiAcknowledgments --- p.ivChapter 1 --- Introduction --- p.1Chapter 1.1 --- Web Document Classification --- p.3Chapter 1.2 --- Web Document Integration --- p.5Chapter 1.3 --- Dictionary and Incremental Update --- p.5Chapter 1.4 --- IR-Tree --- p.6Chapter 1.5 --- Thesis Overview --- p.7Chapter 2 --- Related Works --- p.9Chapter 2.1 --- Semi-structured Data and OEM --- p.9Chapter 2.1.1 --- Semi-structured Data --- p.9Chapter 2.1.2 --- Object Exchange Model --- p.10Chapter 2.2 --- Related Work on Web Document Partitioning --- p.11Chapter 2.2.1 --- Retrieval of Authoritatives --- p.12Chapter 2.2.2 --- Document Categorization Methodology --- p.13Chapter 2.3 --- Semi-structured Data Indexing --- p.14Chapter 2.3.1 --- Lore --- p.14Chapter 2.3.2 --- Tsimmis --- p.15Chapter 2.3.3 --- Other Algorithms --- p.15Chapter 2.4 --- Related Work on SAMs --- p.15Chapter 2.4.1 --- R-Tree and R*-Tree --- p.16Chapter 2.4.2 --- SS-Tree and SR-Tree --- p.16Chapter 2.4.3 --- TV-Tree and X-Tree --- p.18Chapter 2.5 --- Clustering Algorithms --- p.18Chapter 2.5.1 --- DBSCAN and Incremental-DBSCAN --- p.20Chapter 3 --- Web Document Classification --- p.21Chapter 3.1 --- Basic Definitions --- p.21Chapter 3.2 --- Similarity Computation --- p.26Chapter 3.2.1 --- Structural Transformation --- p.27Chapter 3.2.2 --- Node Similarity --- p.29Chapter 3.2.3 --- Edge Label Similarity --- p.30Chapter 3.2.4 --- Structural Similarity --- p.31Chapter 3.2.5 --- Overall Similarity --- p.32Chapter 3.2.6 --- Representative Selection --- p.33Chapter 3.3 --- Incremental Update --- p.34Chapter 3.3.1 --- Documents related to a subset --- p.35Chapter 3.3.2 --- Documents unrelated to any subset --- p.35Chapter 3.3.3 --- Documents linking up two or more subsets --- p.35Chapter 3.4 --- Experimental Results --- p.36Chapter 3.4.1 --- Compare with K-NN --- p.36Chapter 3.4.2 --- Representative vs Feature Vector --- p.38Chapter 4 --- Web Document Integration --- p.40Chapter 4.1 --- Structure Borrowing --- p.40Chapter 4.2 --- Integration of Seeds --- p.42Chapter 4.3 --- Incremental Update --- p.48Chapter 4.3.1 --- New OEM record is a normal record --- p.49Chapter 4.3.2 --- New record is a potential seed --- p.50Chapter 5 --- Dictionary --- p.51Chapter 5.1 --- Structure of a Dictionary Entry --- p.52Chapter 5.2 --- Dictionary: Relation Identifier --- p.54Chapter 5.3 --- Dictionary: Complement of Representative --- p.55Chapter 5.4 --- Incremental Update --- p.56Chapter 5.5 --- Experimental Result --- p.57Chapter 5.5.1 --- Search based on keyword --- p.57Chapter 5.5.2 --- Search by submitting ambiguous words --- p.58Chapter 5.5.3 --- Retrieval of related words --- p.59Chapter 6 --- Structured Data Manipulation: IR-Tree --- p.61Chapter 6.1 --- Range Search vs Nearest Neighbor Search --- p.61Chapter 6.2 --- Why R*-Tree and Incremental-DBSCAN? --- p.63Chapter 6.3 --- IR-Tree: The Integration of Clustering and Indexing --- p.64Chapter 6.3.1 --- Index Structure --- p.64Chapter 6.3.2 --- Insertion of IR-Tree --- p.66Chapter 6.3.3 --- Deletion on IR-tree --- p.68Chapter 6.3.4 --- Nearest Neighbor Search --- p.69Chapter 6.3.5 --- Discussion on IR-Tree --- p.73Chapter 6.4 --- Experimental Results --- p.73Chapter 6.4.1 --- General knn-search performance --- p.74Chapter 6.4.2 --- Performance on Varying Dimensionality and Distribution --- p.76Chapter 7 --- IM-Tree: An Review --- p.80Chapter 7.1 --- Indexing Techniques on Metric Space --- p.80Chapter 7.1.1 --- Definition --- p.81Chapter 7.1.2 --- Metric Space Indexing Algorithms --- p.81Chapter 7.2 --- Clustering Algorithms on Metric Space --- p.83Chapter 7.3 --- The Integration of Clustering and Metric-Space Indexing Algorithm --- p.84Chapter 7.4 --- Proposed Algorithm --- p.85Chapter 7.4.1 --- Index Structure --- p.85Chapter 7.4.2 --- Nearest Neighbor Search --- p.86Chapter 7.5 --- Future Works --- p.86Chapter 8 --- Conclusion and Future Works --- p.87Chapter 8.1 --- Semi-structured Data Manipulation --- p.88Chapter 8.2 --- Structured Data Manipulation --- p.8