BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Chile
1 × China
1 × Germany
1 × Greece
1 × Ireland
1 × Korea
1 × Switzerland
4 × Canada
8 × USA
Collaborated with:
A.Kemper T.Neumann C.Kanne S.Helmer K.Peithner P.Fender M.Steinbrunn C.Kilger W.Scheufele M.Eich G.Steidl M.Brantner T.Westmann V.Christophides S.Cluet J.Claußen J.J.Lu J.Schü V.S.Subrahmanian D.DeHaan N.May A.Nica A.Böhm
Talks about:
join (9) optim (8) object (7) queri (7) algorithm (5) base (5) materi (3) histogram (2) disjunct (2) support (2)

Person: Guido Moerkotte

DBLP DBLP: Moerkotte:Guido

Contributed to:

SIGMOD 20142014
SIGMOD 20132013
VLDB 20132013
VLDB 20112011
SIGMOD 20102010
VLDB 20092009
SIGMOD 20082008
VLDB 20062006
SIGMOD 20052005
VLDB 20042004
VLDB 20032003
VLDB 20022002
VLDB 19981998
PODS 19971997
VLDB 19971997
SIGMOD 19961996
SIGMOD 19951995
VLDB 19951995
SIGMOD 19941994
VLDB 19941994
VLDB 19931993
VLDB 19921992
SIGMOD 19911991
SIGMOD 19901990
VLDB 19901990

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.
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.
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.
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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.