Interval processing with the UB-Tree
Tóm tắt
Advanced data warehouses and Web databases have set the demand for processing large sets of time ranges, quality classes, fuzzy data, personalized data and extended objects. Since, all of these data types can be mapped to intervals, interval indexing can dramatically speed up or even be an enabling technology for these new applications. We introduce a method for managing intervals by indexing the dual space with the UB-Tree. We show that our method is an effective and efficient solution, benefitting from all good characteristics of the UB-Tree, i.e., concurrency control, worst case guarantees for insertion, deletion and update as well as efficient query processing. Our technique can easily be integrated into an RDBMS engine providing the UB-Tree as access method. We also show that our technique is superior and more flexible to previously suggested techniques.
Từ khóa
#Indexing #Databases #Space technology #Concurrency control #Multidimensional systems #Knowledge based systems #Data warehouses #Fuzzy sets #Fuzzy systems #Query processingTài liệu tham khảo
10.1145/280277.280279
10.1016/0169-023X(95)00034-P
hans-peter, 2001, Spatial data management for computer aided design, Proceedings of SIGMOD'01
kriegel, 2001, Interval Sequences: An Object-Relational Approach to Manage Spatial Data, Proc 7th Int'l Symp Advances in Spatial and Temporal Databases (SSTD 01), 10.1007/3-540-47724-1_25
hans-peter, 2000, Managing intervals efficiently in object-relational databases, Proc the 28th International Conference on Very Large Data Bases, 407
kspert, 1983, Storage Utilization in B*-Trees with a Generalized Overflow Technique, Acta Informatica, 19, 35
10.1145/115790.115807
markl, 1999, Processing Relational Queries using a Multidimensional Access Technique
10.1007/978-1-4419-8590-3_4
10.1109/ICDE.1999.754972
tansel, 1993, Temporal Databases: Theory, Design and implementation
böhm, 0, XZ-Ordering: A space-filling curve for objects with spatial extension, SSD'99, 1651, 75
2000, Transbase HyperCube TransAction Software
10.1007/BF01188717
bayer, 1997, The UB-Tree: Performance of Multidimensional Range Queries, Technical Report TUM-I9814
10.1007/BF00288683
10.1007/BF00289146
bozkaya, 1998, Index Structures For Temporal And Multimedia Databases
bayer, 1997, The universal B-Tree for multidimensional Indexing: General Concepts, World-Wide Computing and Its Applications '97 (WWCA '97), 10.1007/3-540-63343-X_48
10.1145/73721.73746
allen, 1985, A common-sense theory of time, Proceedings of the 9th International Joint Conference on Artificial Intelligence, 9, 528
10.1145/588011.588037
10.1145/93597.98743
2000, Oracle9i Data Cartridge Developer's Guide
ramsak, 2000, Integrating the UB-Tree into a Database System Kernel, Proceedings of the 2000 International Conference on Very Large Data Bases
ramaswamy, 1997, Efficient indexing for constraint and temporal databases, Proc of the 6th Int Conf on Database Theory (ICDT'97), 419, 10.1007/3-540-62222-5_61
10.1109/ICDE.1994.283041
ramsak, 2001, Interactive ROLAP on Large Databases: A Case Study with UB-Trees, Proceedings of the IDEAS 2001