Name
Papers
Collaborators
GUIDO MOERKOTTE
120
82
Citations 
PageRank 
Referers 
2136
649.11
2899
Referees 
References 
1253
1489
Search Limit
1001000
Title
Citations
PageRank
Year
Translation Grids for Multi-way Join Size Estimation00.342022
SAHARA - Memory Footprint Reduction of Cloud Databases with Automated Table Partitioning.00.342022
The 3D Hash Join: Building On Non-Unique Join Attributes00.342022
Precise, Compact, and Fast Data Access Counters for Automated Physical Database Design.00.342021
Small Selectivities Matter: Lifting the Burden of Empty Samples00.342021
Memory-Efficient Key/Foreign-Key Join Size Estimation via Multiplicity and Intersection Size10.372021
Generating Optimal Plans for Boolean Expressions00.342018
Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses.00.342018
Errata for "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products"00.342018
Errata for "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products".00.342018
Optimization of Disjunctive Predicates for Main Memory Column Stores.10.362017
Faster Plan Generation through Consideration of Functional Dependencies and Keys.30.382016
Faster Plan Generation through Consideration of Functional Dependencies and Keys.00.342016
Optimization of Conjunctive Predicates for Main Memory Column Stores.20.372016
Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs.00.342013
Top down plan generation: From theory to practice40.432013
Counter strike: generic top-down join enumeration for hypergraphs80.522013
On the correct and complete enumeration of the core search space100.612013
Accelerating Queries with Group-By and Join by Groupjoin.00.342011
A new, highly efficient, and easy to implement top-down join enumeration algorithm100.802011
Preventing bad plans by bounding the impact of cardinality estimation errors331.392009
Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors.00.342009
A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator10.352009
Generating optimal DAG-structured query evaluation plans60.452009
Dynamic programming strikes back210.812008
Faster Join Enumeration for Complex Queries00.342008
Unnesting Scalar Sql Queries In The Presence Of Disjunction60.542007
Let a Single FLWOR Bloom20.392007
Efficient XQuery Evaluation of Grouping Conditions with Duplicate Removals10.352007
Indexing set-valued attributes with a multi-level extendible hashing scheme40.442007
A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in Natix150.922006
A Declarative Control Language for Dependable XML Message Queues10.352006
Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products231.572006
Algebraic Optimization of Nested XPath Expressions60.482006
Template Folding for XPath30.442006
Natix Visual Interfaces00.342006
Strategies for query unnesting in XML databases210.882006
On the optimal ordering of maps, selections, and joins under factorization10.352006
Index vs. navigation in XPath evaluation80.502006
Main memory implementations for binary grouping60.482005
Cost-sensitive reordering of navigational primitives90.572005
Formally Specifying the Syntax and Semantics of a Visual Query Language for the Domain of High Energy Physics Data Analysis10.382005
On the Optimal Ordering of Maps and Selections under Factorization60.472005
A model-based monitoring and diagnosis system for a space-based astrometry mission00.342005
An Efficient Framework for Order Optimization151.652004
A Combined Framework for Grouping and Order Optimization201.342004
XQuery Processing in Natix with an Emphasis on Join Ordering70.492004
Nested Queries and Quantifiers in an Ordered Context271.072004
PHEASANT: A PHysicist's EAsy ANalysis Tool20.612004
Evaluating lock-based protocols for cooperation on XML documents421.422004
  • 1
  • 2