Integrating the UB-Tree into a Database System Kernel

摘要: Multidimensional access methods have shown high potential for significant performance improvements in various application domains. However, only few approaches made their way into commercial products. In database management systems (DBMSs) the BTree is still prevalent indexing technique. Integrating new existing kernels general a very complex and costly task. Exceptions exist, as our experience of integrating UB-Tree TransBase, DBMS, shows. The promising multidimensional index, which has its superiority over traditional different scenarios, especially OLAP applications. this paper we discuss major issues integration. As will show, complexity cost task reduced significantly due to fact that UBTree relies on classical B-Tree. Even though DBMSs provide interfaces index extensions, favor kernel integration because tight coupling with query optimizer, allows optimal usage execution plans. Measurements real-world data warehouse show leads an additional improvement compared prototype implementation competing methods.