Benchmarking the UB-tree (original) (raw)

2003, Department of Computers, Czech Technical University, Prague Department of Software Engineering, Charles University, Prague Department of Computer Science, VŠB-Technical University of Ostrava CSKI, OS Computer Science and Society

Abstract. In the area of multidimensional databases, the UB-tree represents a promising indexing structure. A key feature of any multidimensional indexing structure is its ability to effectively perform the range queries. In the case of UB-trees, we have proposed an advanced range query algorithm making possible to operate on indices of high dimensionality. In this paper we present experimental results of this range query algorithm. Keywords: UB-tree, range query, benchmarks, DRU algorithm

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact