Sven Helmer, Till Westmann, and Guido Moerkotte. Diag-join: An opportunistic join algorithm for 1:n relationships. In VLDB '98 [VLD98], pages 98-109. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exploiting Early Sorting and Early Partitioning for .. - Claussen, Kemper.. (2000) (4 citations) (Correct)
.... kinds of queries, database vendors have significantly extended their query processors and researchers have just recently developed a large variety of new query processing techniques; e.g. the use of bitmap indices [CI98] special joins that exploit bitmap join indices [GO95] new join methods [HWM98] or multi query optimization for decision support [ZDNS98] to name just a few. In addition, a whole new industry, data warehouses, has appeared with products that materialize (i.e. pre compute) query results and cache the results of queries. Furthermore, the TPC H and TPC R benchmarks ....
S. Helmer, T. Westmann, and G. Moerkotte. Diag-Join: An opportunistic join algorithm for 1:N relationships. In Proc. of the Conf. on Very Large Data Bases (VLDB), pages 98--109, New York, USA, August 1998.
Generalized Hash Teams for Join and Group-by - Kemper, Kossmann, Wiesner (1999) (1 citation) (Correct)
....copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and or special permission from the Endowment. Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999. cial joins that exploit bitmap join indices, new join methods [HWM98, CKK98] or multi query optimization for decision support to name just a few. In addition, a whole new industry, data warehouses, has appeared with products that materialize (i.e. pre compute) query results and cache the results of queries. Furthermore, the TPC D benchmark [TPC95] has been ....
S. Helmer, T. Westmann, and G. Moerkotte. DiagJoin: An opportunistic join algorithm for 1:N relationships. In Proc. of the Conf. on Very Large Data Bases (VLDB), pages 98--109, New York, USA, August 1998.
Variations in Grouping and Aggregation - Westmann, Moerkotte (1999) Self-citation (Westmann Moerkotte) (Correct)
No context found.
Sven Helmer, Till Westmann, and Guido Moerkotte. Diag-join: An opportunistic join algorithm for 1:n relationships. In VLDB '98 [VLD98], pages 98-109.
Early Grouping Gets The Skew - Helmer, Neumann, Moerkotte (2002) Self-citation (Helmer Moerkotte) (Correct)
No context found.
S. Helmer, T. Westmann, and G. Moerkotte. Diag-join: An opportunistic join algorithm for 1:n relationship. In Proc. of the 24th VLDB Conference, pages 98--109, New York, August 1998.
GRUBJOIN: An Adaptive Multi-Way Windowed Stream Join with.. - Gedik, Wu, Yu, Liu (2005) (Correct)
No context found.
S. Helmer, T. Westmann, and G. Moerkotte. Diag-Join: An opportunistic join algorithm for 1:N relationships. In VLDB, 1998.
Exploiting k-Constraints to Reduce Memory Overhead in Continuous .. - Mohamadou (2002) (Correct)
No context found.
S. Helmer, T. Westmann, and G. Moerkotte. Diagjoin: An opportunistic join algorithm for 1:n relationships. In Proc. of the 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC