J. Claussen, A. Kemper, D. Kossmann, C. Wiesner  Home/Search
Context Related
| dodgers.fmi.unipassau.de/pu...joins.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: dodgers.fmi.uni...indexall.phtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Decision support queries typically involve several joins, a grouping with aggregation, and/or sorting of the result tuples. We propose two new classes of query evaluation algorithms that can be used to speed up the execution of such queries. The algorithms are based on (1) early sorting and (2) early partitioning---or a combination of both. The idea is to push the sorting and/or the partitioning to the leaves, i. e., the base relations, of the query evaluation plans (QEPs) and thereby avoid... (Update)
Similar documents based on text: More All
0.5: Optimizing Queries with Universal Quantification.. - Claussen, Kemper, .. (1997) (Correct)
0.4: Building Dynamic Market Places Using Hyperqueries - Wiesner, Winklhofer, Kemper (2002) (Correct)
0.2: Exploiting Early Sorting and Early Partitioning for .. - Claussen, Kemper.. (2000) (Correct)
Related documents from co-citation: More All
4: Fundamental Techniques for Order Optimization (context) - Simmen, Shekita et al. - 1996
3: Including group-by in query optimization - Chaudhuri, Shim - 1994
3: Performing group by before join - Yan, Larson - 1994
BibTeX entry: (Update)
J. Claussen, A. Kemper, D. Kossmann, and C. Wiesner. Exploiting early sorting and early partitioning for decision support query processing. The VLDB Journal, 9(3): 190--213, December 2000. http://citeseer.ist.psu.edu/article/claussen00exploiting.html More
@article{ claussen00exploiting,
author = "J. Claussen and A. Kemper and D. Kossmann and C. Wiesner",
title = "Exploiting early sorting and early partitioning for decision support query processing",
journal = "VLDB Journal: Very Large Data Bases",
volume = "9",
number = "3",
month = "????",
pages = "190--213",
year = "2000",
url = "citeseer.ist.psu.edu/article/claussen00exploiting.html" }
Citations (may not include all citations):393 Data cube: A relational aggregation operator generalizing gr.. - Gray, Bosworth et al. - 1996
389 Access path selection in a relational database management sy.. (context) - Selinger, Astrahan et al. - 1979
330 Query evaluation techniques for large databases (context) - Graefe - 1993
106 The EXODUS optimizer generator - Graefe, DeWitt - 1987
68 Including group-by in query optimization - Chaudhuri, Shim - 1994
67 Grammar-like functional rules for representing query optimiz.. (context) - Lohman - 1988
61 Bitmap index design and evaluation - Chan, Ioannidis - 1998
57 Hashing methods and relational algebra operations (context) - Bratbergsengen - 1984
56 Multi-table joins through bitmapped join indices (context) - Graefe, O'Neil - 1995
46 Transaction Processing Performance Council (context) - Performance, TPC et al. - 1999
46 Eager aggregation and lazy aggregation - Yan, Larson - 1995
44 Performing group-by before join - Yan, Larson - 1994
43 Duplicate record elimination in large data files (context) - Bitton, DeWitt - 1983
32 Optimization of queries with user-defined predicates - Chaudhuri, Shim - 1996
28 enough already (context) - Carey, Kossmann - 1997
28 Fundamental techniques for order optimization (context) - Simmen, Shekita et al. - 1996
27 time trade-offs in hash coding with allowable errors (context) - Bloom - 1970
25 Seeking the truth about ad hoc join costs - Haas, Carey et al. - 1997
20 Query evaluation in CROQUE -- calculus and algebra coincide - Grust, Kroger et al. - 1997
19 Sort-Merge-Join: An idea whose time has (context) - Graefe - 1994
15 Simultaneous optimization and evaluation of multiple dimensi.. - Zhao, Deshpande et al. - 1998
12 Hash joins and hash teams in Microsoft SQL Server (context) - Graefe, Bunker et al. - 1998
10 Fast joins using join indices - Li, Ross - 1999
8 Iterative dynamic programming: A new class of query optimiza.. - Kossmann, Stocker - 2000
8 Evaluating functional joins along nested reference sets in o.. - Braumandl, Claussen et al. - 1998
7 Memory-contention responsive hash joins (context) - Davison, Graefe - 1994
6 Diag-Join: An opportunistic join algorithm for 1:N relations.. - Helmer, Westmann et al. - 1998
6 Functional jo (context) - Braumandl, Claussen et al. - 2000
5 Grouping and duplicate elimination: Benefits of early aggreg.. - Larson - 1997
4 TID hash joins (context) - Marek, Rahm - 1994
2 Generalized hash teams for join and group-by - Kemper, Kossmann et al. - 1999
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