Person: Guido Moerkotte

DBLP: Moerkotte:Guido

Contributed to:

2014

2013

2013

2011

2010

2009

2008

2006

2005

2004

2003

2002

1998

1997

1997

1996

1995

1995

1994

1994

1993

1992

1991

1990

1990

Wrote 28 papers:

SIGMOD-2014-MoerkotteDMNB #order

Exploiting ordered dictionaries to efficiently construct histograms with q-error guarantees in SAP HANA (GM, DD, NM, AN, AB), pp. 361–372.

SIGMOD-2013-MoerkotteFE #on the

On the correct and complete enumeration of the core search space (GM, PF, ME), pp. 493–504.

VLDB-2013-FenderM #top-down

Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs (PF, GM), pp. 1822–1833.

VLDB-2011-MoerkotteN #query

Accelerating Queries with Group-By and Join by Groupjoin (GM, TN), pp. 843–851.

SIGMOD-2010-KanneM

Histograms reloaded: the merits of bucket diversity (CCK, GM), pp. 663–674.

VLDB-2009-MoerkotteNS #bound #estimation #fault

Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors (GM, TN, GS), pp. 982–993.

SIGMOD-2008-MoerkotteN #programming

Dynamic programming strikes back (GM, TN), pp. 539–552.

VLDB-2006-KanneM #algorithm #approximate #clustering #linear

A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix (CCK, GM), pp. 91–102.

VLDB-2006-MoerkotteN #algorithm #analysis #generative #programming

Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products (GM, TN), pp. 930–941.

SIGMOD-2005-BrantnerKM #order

Cost-Sensitive Reordering of Navigational Primitives (CCK, MB, GM), pp. 742–753.

VLDB-2004-NeumannM #framework #optimisation #order

A Combined Framework for Grouping and Order Optimization (TN, GM), pp. 960–971.

VLDB-2003-HelmerNM #clustering

Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness (SH, TN, GM), pp. 656–667.

VLDB-2002-Moerkotte #database

Incorporating XSL Processing into Database Engines (GM), pp. 107–118.

VLDB-1998-HelmerWM #algorithm #named

Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships (SH, TW, GM), pp. 98–109.

VLDB-1998-Moerkotte

Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing (GM), pp. 476–487.

PODS-1997-ScheufeleM #complexity #generative #on the

On the Complexity of Generating Optimal Plans with Cross Products (WS, GM), pp. 238–248.

VLDB-1997-ClaussenKMP #database #object-oriented #optimisation #quantifier #query

Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases (JC, AK, GM, KP), pp. 286–295.

VLDB-1997-HelmerM #algorithm #comparison #evaluation #in memory #memory management #set

Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates (SH, GM), pp. 386–395.

SIGMOD-1996-ChristophidesCM #query

Evaluating Queries with Generalized Path Expressions (VC, SC, GM), pp. 413–422.

SIGMOD-1995-LuMSS #maintenance #performance

Efficient Maintenance of Materialized Mediated Views (JJL, GM, JS, VSS), pp. 340–351.

VLDB-1995-SteinbrunnPMK #query

Bypassing Joins in Disjunctive Queries (MS, KP, GM, AK), pp. 228–238.

SIGMOD-1994-KemperMPS #optimisation #query

Optimizing Disjunctive Queries with Expensive Predicates (AK, GM, KP, MS), pp. 336–347.

VLDB-1994-KilgerM #multi #set

Indexing Multiple Sets (CK, GM), pp. 180–191.

VLDB-1993-KemperMP #architecture #optimisation #query

A Blackboard Architecture for Query Optimization in Object Bases (AK, GM, KP), pp. 543–554.

VLDB-1992-KemperMS #optimisation

Optimizing Boolean Expressions in Object-Bases (AK, GM, MS), pp. 79–90.

SIGMOD-1991-KemperKM

Function Materialization in Object Bases (AK, CK, GM), pp. 258–267.

SIGMOD-1990-KemperM #data access

Access Support in Object Bases (AK, GM), pp. 364–374.

VLDB-1990-KemperM #data access #query #using

Advanced Query Processing in Object Bases Using Access Support Relations (AK, GM), pp. 290–301.