City University of Hong Kong
DSpace
 

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Science  >
CS - Master of Philosophy  >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2031/4406

Title: Approximate colored range and point enclosure queries
Other Titles: Zhuo se qu jian ji dian wei feng cha xun zhi jin si suan fa
著色區間及點圍封查詢之近似算法
Authors: Lai, Ying Kit (賴英傑)
Department: Dept. of Computer Science
Degree: Master of Philosophy
Issue Date: 2006
Publisher: City University of Hong Kong
Subjects: Database management
Querying (Computer science)
Notes: CityU Call Number: QA76.9.D3 L338 2006
Includes bibliographical references (leaves 44-48)
Thesis (M.Phil.)--City University of Hong Kong, 2006
vii, 49 leaves : ill. ; 30 cm.
Type: Thesis
Abstract: Range queries and point enclosure queries are popular in myriads of database applications. In this thesis, we study the range and point enclosure queries in the presence of categorical information (modelled as colors). We formulate two classes of problems, namely the colored range query problems and the colored point enclosure query problems to model multi-dimensional range and point enclosure queries in colored context. We argue that many of these problems are difficult to solve. Based on a new framework of combining sketching techniques and traditional data structures, we obtain two sets of results in solving the problems approximately and efficiently. For the colored range query problems, only colored range counting and colored range reporting were studied before. Although there are efficient l-dimensional structures for the two problems, no good solutions are found for higher dimensions (d ≥ 2). With our framework, we produce efficient approximate data structures that solve the higher dimensional colored range counting and two other colored range query problems. For the colored point enclosure problems, much less is known. Gupta et al. [15] proposed static structures for the colored point enclosure counting in 1 and 2-dimensional contexts and no solutions are found for higher dimensions. We present two dynamic solutions (based on the segment tree and interval tree) to solve the colored point enclosure problems approximately and the solutions can be extended to higher dimensions using standard technique [5].
Online Catalog Link: http://lib.cityu.edu.hk/record=b2147071
Appears in Collections:CS - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer