![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Robert Fenk Roland Pieringer , Klaus Elhardt , Frank Ramsak , Volker Markl , Robert Fenk, Rudolf Bayer : Transbase: a Leading-edge ROLAP Engine Supporting Multidimensional Indexing and Hierarchy Clustering. BTW 2003 : 648-667 Roland Pieringer , Klaus Elhardt , Frank Ramsak , Volker Markl , Robert Fenk, Robert Bayer , Nikos Karayannidis , Aris Tsois , Timos K. Sellis : Combining Hierarchy Encoding and Pre-Grouping: Intelligent Grouping in Star Join Processing. ICDE 2003 : 329-340 Robert Fenk, Volker Markl , Rudolf Bayer : Interval Processing with the UB-Tree. IDEAS 2002 : 12-22 Nikos Karayannidis , Aris Tsois , Timos K. Sellis , Roland Pieringer , Volker Markl , Frank Ramsak , Robert Fenk, Klaus Elhardt , Rudolf Bayer : Processing Star Queries on Hierarchically-Clustered Fact Tables. VLDB 2002 : 730-741 Volker Markl , Frank Ramsak , Roland Pieringer , Robert Fenk, Klaus Elhardt , Rudolf Bayer : The Transbase Hypercube RDBMS: Multidimensional Indexing of Relational Tables. ICDE Demo Sessions 2001 : 4-6 Frank Ramsak , Volker Markl , Robert Fenk, Rudolf Bayer , Thomas Ruf : Interactive ROLAP on Large Datasets: A Case Study with UB-Trees. IDEAS 2001 : 167-176 Robert Fenk: Management and Query Processing of One-Dimensional Intervals with the UB-Tree. EDBT PhD Workshop 2000 Robert Fenk, Akihiko Kawakami , Volker Markl , Rudolf Bayer , Shunji Osaki : Bulk Loading a Data Warehouse Built Upon a UB-Tree. IDEAS 2000 : 179-187 Frank Ramsak , Volker Markl , Robert Fenk, Martin Zirkel , Klaus Elhardt , Rudolf Bayer : Integrating the UB-Tree into a Database System Kernel. VLDB 2000 : 263-272 1 [ 8 ] 2 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 9 ] 3 [ 1 ] [ 5 ] [ 6 ] [ 8 ] [ 9 ] 4 [ 6 ] [ 8 ] 5 [ 2 ] 6 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] 7 [ 2 ] 8 [ 5 ] [ 6 ] [ 8 ] [ 9 ] 9 [ 1 ] [ 4 ] [ 5 ] [ 6 ] [ 8 ] [ 9 ] 10 [ 4 ] 11 [ 6 ] [ 8 ] 12 [ 6 ] [ 8 ] 13 [ 1 ] ![]() ©2004 Association for Computing Machinery |