Thesis (Selection of subject)Thesis (Selection of subject)(version: 368)
Thesis details
   Login via CAS
Eliptic indexing of multidimensional databases
Thesis title in Czech: Eliptické indexování vícerozměrných dat
Thesis title in English: Eliptic indexing of multidimensional databases
Academic year of topic announcement: 2007/2008
Thesis type: diploma thesis
Thesis language: angličtina
Department: Department of Software Engineering (32-KSI)
Supervisor: prof. RNDr. Tomáš Skopal, Ph.D.
Author: hidden - assigned and confirmed by the Study Dept.
Date of registration: 09.10.2007
Date of assignment: 09.10.2007
Date and time of defence: 26.05.2008 00:00
Date of electronic submission:26.05.2008
Date of proceeded defence: 26.05.2008
Opponents: doc. RNDr. David Hoksza, Ph.D.
 
 
 
Guidelines
Navrhněte a implementujte datovou strukturu pro multidimenzionální indexování, založenou na hierarchii vícerozměrných elipsoidů. Nastudujte literaturu o indexování prostorových dat. Navrhněte algoritmy pro vkládání dotazování dat. Srovnejte s existujícími strukturami jako je např. R-strom. Proveďte rozsáhlé experimenty na syntetických i reálných datových sadách.
References
Hanan Samet, Foundations of Multidimensional and Metric Data Structures, MORGAN KAUFMANN PUBLISHERS, ISBN 0-12-369446-9, 2006
Yannis Manolopoulos, Apostolos N. Papadopoulos, Michael Gr Vassilakopoulos, Spatial Databases: Technologies, Techniques and Trends, IGI Global, ISBN-13: 978-1591403876, 2004
Christian Böhm, Stefan Berchtold, Daniel A. Keim, Searching in High-Dimensional Spaces?Index Structures for Improving the Performance of Multimedia Databases, ACM Computing Surveys, 33(3):322 - 373, 2001
Preliminary scope of work in English
In the area of database indexing, there have been developed many access methods for minimizing I/O costs when querying. In particular, multidimensional access methods aim to speedup retrieval of data represented as points in multidimensional vector spaces. The topic of this thesis is to develop a new multidimensional access structure, based on hierarchy of eliptic regions. This gemoetric representation could lead to more flexible and compact partitioning of the data space, thus it could index the data more afficiently than e.g. R-trees.
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html