default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuido Moerkotte
Person information
- affiliation: University of Mannheim, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[b5]Guido Moerkotte:
Building Query Compilers (Draft / Under Construction). 2023- [j38]Philipp Fent
, Guido Moerkotte, Thomas Neumann:
Asymptotically Better Query Optimization Using Indexed Algebra. Proc. VLDB Endow. 16(11): 3018-3030 (2023) - 2022
- [c99]Daniel Flachs, Magnus Müller, Guido Moerkotte:
The 3D Hash Join: Building On Non-Unique Join Attributes. CIDR 2022 - [c98]Michael Brendle, Nick Weber, Mahammad Valiyev, Norman May, Robert Schulze, Alexander Böhm, Guido Moerkotte, Michael Grossniklaus:
SAHARA: Memory Footprint Reduction of Cloud Databases with Automated Table Partitioning. EDBT 2022: 1:13-1:26 - [c97]Magnus Müller, Guido Moerkotte:
Translation Grids for Multi-way Join Size Estimation. EDBT 2022: 2:378-2:382 - 2021
- [c96]Michael Brendle, Nick Weber, Mahammad Valiyev, Norman May, Robert Schulze, Alexander Böhm, Guido Moerkotte, Michael Grossniklaus:
Precise, Compact, and Fast Data Access Counters for Automated Physical Database Design. BTW 2021: 79-100 - [c95]Magnus Müller, Daniel Flachs, Guido Moerkotte:
Memory-Efficient Key/Foreign-Key Join Size Estimation via Multiplicity and Intersection Size. ICDE 2021: 984-995 - [c94]Axel Hertzschuch, Guido Moerkotte, Wolfgang Lehner, Norman May, Florian Wolf, Lars Fricke:
Small Selectivities Matter: Lifting the Burden of Empty Samples. SIGMOD Conference 2021: 697-709 - 2020
- [c93]Guido Moerkotte, Axel Hertzschuch:
alpha to omega: the G(r)eek Alphabet of Sampling. CIDR 2020 - [c92]Diego Havenstein, Peter Lysakovski, Norman May, Guido Moerkotte, Gabriele Steidl:
Fast Entropy Maximization for Selectivity Estimation of Conjunctive Predicates on CPUs and GPUs. EDBT 2020: 546-554
2010 – 2019
- 2018
- [j37]Magnus Müller, Guido Moerkotte, Oliver Kolb:
Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses. Proc. VLDB Endow. 11(9): 1016-1028 (2018) - [j36]Andreas Meister, Guido Moerkotte, Gunter Saake:
Errata for "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products". Proc. VLDB Endow. 11(10): 1069-1070 (2018) - [j35]Marius Eich, Pit Fender, Guido Moerkotte:
Efficient generation of query plans containing group-by, join, and groupjoin. VLDB J. 27(5): 617-641 (2018) - [c91]Fisnik Kastrati, Guido Moerkotte:
Generating Optimal Plans for Boolean Expressions. ICDE 2018: 1013-1024 - 2017
- [c90]Fisnik Kastrati, Guido Moerkotte:
Optimization of Disjunctive Predicates for Main Memory Column Stores. SIGMOD Conference 2017: 731-744 - 2016
- [j34]Marius Eich, Pit Fender, Guido Moerkotte:
Faster Plan Generation through Consideration of Functional Dependencies and Keys. Proc. VLDB Endow. 9(10): 756-767 (2016) - [j33]Fisnik Kastrati, Guido Moerkotte:
Optimization of Conjunctive Predicates for Main Memory Column Stores. Proc. VLDB Endow. 9(12): 1125-1136 (2016) - 2015
- [j32]Guido Moerkotte, Martin J. Montag, Audrey Repetti, Gabriele Steidl:
Proximal operator of quotient functions with application to a feasibility problem in query optimization. J. Comput. Appl. Math. 285: 243-255 (2015) - [c89]Marius Eich, Guido Moerkotte:
Dynamic programming: The next step. ICDE 2015: 903-914 - 2014
- [c88]Guido Moerkotte, David DeHaan, Norman May, Anisoara Nica, Alexander Böhm:
Exploiting ordered dictionaries to efficiently construct histograms with q-error guarantees in SAP HANA. SIGMOD Conference 2014: 361-372 - 2013
- [j31]Pit Fender, Guido Moerkotte:
Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs. Proc. VLDB Endow. 6(14): 1822-1833 (2013) - [c87]Pit Fender, Guido Moerkotte:
Top down plan generation: From theory to practice. ICDE 2013: 1105-1116 - [c86]Guido Moerkotte, Pit Fender, Marius Eich:
On the correct and complete enumeration of the core search space. SIGMOD Conference 2013: 493-504 - 2012
- [j30]Pit Fender, Guido Moerkotte:
Reassessing Top-Down Join Enumeration. IEEE Trans. Knowl. Data Eng. 24(10): 1803-1818 (2012) - [c85]Pit Fender, Guido Moerkotte, Thomas Neumann, Viktor Leis:
Effective and Robust Pruning for Top-Down Join Enumeration Algorithms. ICDE 2012: 414-425 - 2011
- [j29]Guido Moerkotte, Thomas Neumann:
Accelerating Queries with Group-By and Join by Groupjoin. Proc. VLDB Endow. 4(11): 843-851 (2011) - [c84]Pit Fender, Guido Moerkotte:
A new, highly efficient, and easy to implement top-down join enumeration algorithm. ICDE 2011: 864-875 - [c83]Thomas Neumann, Guido Moerkotte:
Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins. ICDE 2011: 984-994 - 2010
- [j28]Simon Setzer, Gabriele Steidl, Tanja Teuber, Guido Moerkotte:
Approximation related to quotient functionals. J. Approx. Theory 162(3): 545-558 (2010) - [c82]Carl-Christian Kanne, Guido Moerkotte:
Histograms reloaded: the merits of bucket diversity. SIGMOD Conference 2010: 663-674
2000 – 2009
- 2009
- [j27]Thomas Neumann, Guido Moerkotte:
Generating optimal DAG-structured query evaluation plans. Comput. Sci. Res. Dev. 24(3): 103-117 (2009) - [j26]Guido Moerkotte, Thomas Neumann, Gabriele Steidl:
Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors. Proc. VLDB Endow. 2(1): 982-993 (2009) - [c81]Thomas Neumann, Guido Moerkotte:
A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator. BTW 2009: 7-26 - 2008
- [c80]Guido Moerkotte, Thomas Neumann:
Faster Join Enumeration for Complex Queries. ICDE 2008: 1430-1432 - [c79]Guido Moerkotte, Thomas Neumann:
Dynamic programming strikes back. SIGMOD Conference 2008: 539-552 - 2007
- [c78]Alexander Böhm, Carl-Christian Kanne, Guido Moerkotte:
Demaq: A Foundation for Declarative XML Message Processing. CIDR 2007: 33-43 - [c77]Sven Helmer, Robin Aly, Thomas Neumann, Guido Moerkotte:
Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme. DEXA 2007: 98-108 - [c76]Matthias Brantner, Norman May, Guido Moerkotte:
Unnesting Scalar SQL Queries in the Presence of Disjunction. ICDE 2007: 46-55 - [c75]Matthias Brantner, Carl-Christian Kanne, Guido Moerkotte:
Let a Single FLWOR Bloom. XSym 2007: 46-61 - [c74]Norman May, Guido Moerkotte:
Efficient XQuery Evaluation of Grouping Conditions with Duplicate Removals. XSym 2007: 62-76 - 2006
- [j25]Carl-Christian Kanne, Guido Moerkotte:
The importance of sibling clustering for efficient bulkload of XML document trees. IBM Syst. J. 45(2): 321-334 (2006) - [j24]Norman May, Sven Helmer, Guido Moerkotte:
Strategies for query unnesting in XML databases. ACM Trans. Database Syst. 31(3): 968-1013 (2006) - [c73]Alexander Böhm, Carl-Christian Kanne, Guido Moerkotte:
A Declarative Control Language for Dependable XML Message Queues. ARES 2006: 832-839 - [c72]Thomas Neumann, Sven Helmer, Guido Moerkotte:
On the Optimal Ordering of Maps, Selections, and Joins Under Factorization. BNCOD 2006: 115-126 - [c71]Alexander Böhm, Matthias Brantner, Carl-Christian Kanne, Norman May, Guido Moerkotte:
Natix Visual Interfaces. EDBT 2006: 1125-1129 - [c70]Matthias Brantner, Carl-Christian Kanne, Guido Moerkotte, Sven Helmer:
Algebraic Optimization of Nested XPath Expressions. ICDE 2006: 128 - [c69]Carl-Christian Kanne, Guido Moerkotte:
A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix. VLDB 2006: 91-102 - [c68]Guido Moerkotte, Thomas Neumann:
Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products. VLDB 2006: 930-941 - [c67]Carl-Christian Kanne, Guido Moerkotte:
Template Folding for XPath. XIME-P 2006 - [c66]Matthias Brantner, Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
Kappa-Join: Efficient Execution of Existential Quantification in XML Query Languages. XSym 2006: 1-15 - [c65]Norman May, Matthias Brantner, Alexander Böhm, Carl-Christian Kanne, Guido Moerkotte:
Index vs. Navigation in XPath Evaluation. XSym 2006: 16-30 - [i1]Alexander Böhm, Carl-Christian Kanne, Guido Moerkotte:
Demaq: A Foundation for Declarative XML Message Processing. CoRR abs/cs/0612114 (2006) - 2005
- [c64]Aleksei Pavlov, Sven Helmer, Guido Moerkotte:
A Model-Based Monitoring and Diagnosis System for a Space-Based Astrometry Mission. DEXA 2005: 920-929 - [c63]Thomas Neumann, Sven Helmer, Guido Moerkotte:
On the Optimal Ordering of Maps and Selections under Factorization. ICDE 2005: 490-501 - [c62]Matthias Brantner, Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
Full-fledged Algebraic XPath Processing in Natix. ICDE 2005: 705-716 - [c61]Carl-Christian Kanne, Matthias Brantner, Guido Moerkotte:
Cost-Sensitive Reordering of Navigational Primitives. SIGMOD Conference 2005: 742-753 - [c60]Vasco Amaral, Sven Helmer, Guido Moerkotte:
Formally Specifying the Syntax and Semantics of a Visual Query Language for the Domain of High Energy Physics Data Analysis. VL/HCC 2005: 251-258 - [c59]Norman May, Guido Moerkotte:
Main Memory Implementations for Binary Grouping. XSym 2005: 162-176 - 2004
- [j23]Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
Evaluating lock-based protocols for cooperation on XML documents. SIGMOD Rec. 33(1): 58-63 (2004) - [c58]Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
Timestamp-Based Protocols for Synchronizing Access on XML Documents. DEXA 2004: 591-600 - [c57]Vasco Amaral, Sven Helmer, Guido Moerkotte:
PHEASANT: A PHysicist's EAsy ANalysis Tool. FQAS 2004: 229-242 - [c56]Norman May, Sven Helmer, Guido Moerkotte:
Nested Queries and Quantifiers in an Ordered Context. ICDE 2004: 239-250 - [c55]Thomas Neumann, Guido Moerkotte:
An Efficient Framework for Order Optimization. ICDE 2004: 461-472 - [c54]Thomas Neumann, Guido Moerkotte:
A Combined Framework for Grouping and Order Optimization. VLDB 2004: 960-971 - [c53]Norman May, Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
XQuery Processing in Natix with an Emphasis on Join Ordering. XIME-P 2004: 49-54 - 2003
- [j22]Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
XML-Datenbanksysteme und ihre Anwendung. it Inf. Technol. 45(3): 137-142 (2003) - [j21]Sven Helmer, Guido Moerkotte:
A performance study of four index structures for set-valued attributes of low cardinality. VLDB J. 12(3): 244-261 (2003) - [c52]Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
Lock-based Protocols for Cooperation on XML Documents. DEXA Workshops 2003: 230-234 - [c51]Sven Helmer, Thomas Neumann, Guido Moerkotte:
A Robust Scheme for Multilevel Extendible Hashing. ISCIS 2003: 220-227 - [c50]Sven Helmer, Thomas Neumann, Guido Moerkotte:
Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness. VLDB 2003: 656-667 - [c49]Norman May, Sven Helmer, Guido Moerkotte:
Quantifiers in XQuery. WISE 2003: 313-316 - [c48]Norman May, Sven Helmer, Guido Moerkotte:
Three Cases for Query Decorrelation in XQuery. Xsym 2003: 70-84 - [p3]Sven Helmer, Guido Moerkotte:
Indexstrukturen für XML. Web & Datenbanken 2003: 217-250 - 2002
- [j20]Thorsten Fiebig, Sven Helmer, Carl-Christian Kanne, Guido Moerkotte, Julia Neumann, Robert Schiele, Till Westmann:
Anatomy of a native XML base management system. VLDB J. 11(4): 292-314 (2002) - [c47]Thorsten Fiebig, Sven Helmer, Carl-Christian Kanne, Guido Moerkotte, Julia Neumann, Robert Schiele, Till Westmann:
Natix: A Technology Overview. Web, Web-Services, and Database Systems 2002: 12-33 - [c46]Guido Moerkotte:
Incorporating XSL Processing into Database Engines. VLDB 2002: 107-118 - [c45]Sven Helmer, Carl-Christian Kanne, Guido Moerkotte:
Optimized Translation of XPath into Algebraic Expressions Parameterized by Programs Containing Navigational Primitives. WISE 2002: 215-224 - 2001
- [j19]Thorsten Fiebig, Carl-Christian Kanne, Guido Moerkotte:
Natix - ein natives XML-DBMS. Datenbank-Spektrum 1(1): 5-13 (2001) - [j18]Thorsten Fiebig, Guido Moerkotte:
Algebraic XML Construction and its Optimization in Natix. World Wide Web 4(3): 167-187 (2001) - [c44]Thorsten Fiebig, Guido Moerkotte:
Algebraic XML Construction in Natix. WISE (1) 2001: 212-221 - 2000
- [j17]Till Westmann, Donald Kossmann, Sven Helmer, Guido Moerkotte:
The Implementation and Performance of Compressed Databases. SIGMOD Rec. 29(3): 55-67 (2000) - [j16]Jens Claußen, Alfons Kemper, Guido Moerkotte, Klaus Peithner, Michael Steinbrunn:
Optimization and Evaluation of Disjunctive Queries. IEEE Trans. Knowl. Data Eng. 12(2): 238-260 (2000) - [c43]Carl-Christian Kanne, Guido Moerkotte:
Efficient Storage of XML Data. ICDE 2000: 198 - [c42]Thorsten Fiebig, Guido Moerkotte:
Evaluating Queries on Structure with eXtended Access Support Relations. WebDB (Informal Proceedings) 2000: 41-46 - [c41]Thorsten Fiebig, Guido Moerkotte:
Evaluating Queries on Structure with eXtended Access Support Relations. WebDB (Selected Papers) 2000: 125-136
1990 – 1999
- 1998
- [j15]Vassilis Christophides, Sophie Cluet, Guido Moerkotte, Jérôme Siméon:
Optimizing Generalized Path Expressions Using Full Text Indexes. Netw. Inf. Syst. J. 1(2-3): 177-194 (1998) - [c40]Wolfgang Scheufele, Guido Moerkotte:
Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections. EDBT 1998: 201-215 - [c39]Sven Helmer, Till Westmann, Guido Moerkotte:
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships. VLDB 1998: 98-109 - [c38]Guido Moerkotte:
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing. VLDB 1998: 476-487 - 1997
- [j14]Serge Abiteboul, Sophie Cluet, Vassilis Christophides, Tova Milo, Guido Moerkotte, Jérôme Siméon:
Querying Documents in Object Databases. Int. J. Digit. Libr. 1(1): 5-19 (1997) - [j13]Michael Steinbrunn, Guido Moerkotte, Alfons Kemper:
Heuristic and Randomized Optimization for the Join Ordering Problem. VLDB J. 6(3): 191-208 (1997) - [c37]Vassilis Christophides, Sophie Cluet, Guido Moerkotte, Jérôme Siméon:
Optimizing Generalized Path Expressions Using Full Text Indexes. BDA 1997 - [c36]Wolfgang Scheufele, Guido Moerkotte:
On the Complexity of Generating Optimal Plans with Cross Products. PODS 1997: 238-248 - [c35]Jens Claußen, Alfons Kemper, Guido Moerkotte, Klaus Peithner:
Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases. VLDB 1997: 286-295 - [c34]Sven Helmer, Guido Moerkotte:
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates. VLDB 1997: 386-395 - 1996
- [j12]Carsten Andreas Gerlhof, Alfons Kemper, Guido Moerkotte:
On the Cost of Monitoring and Reorganization of Object Bases for Clustering. SIGMOD Rec. 25(3): 22-27 (1996) - [c33]Georg Gottlob, Guido Moerkotte, V. S. Subrahmanian:
The PARK Semantics for Active Rules. EDBT 1996: 35-55 - [c32]Vassilis Christophides, Sophie Cluet, Guido Moerkotte:
Evaluating Queries with Generalized Path Expressions. SIGMOD Conference 1996: 413-422 - 1995
- [b4]Guido Moerkotte:
Konstruktion von Anfrageoptimierern für Objektbanken. Verlag Shaker, Aachen 1995, ISBN 3-8265-0869-6 - [c31]Sophie Cluet, Guido Moerkotte:
Efficient Evaluation of Aggregates on Bulk Types. DBPL 1995: 8 - [c30]Sophie Cluet, Guido Moerkotte:
On the Complexity of Generating Optimal Left-Deep Processing Trees with Cross Products. ICDT 1995: 54-67 - [c29]James J. Lu, Guido Moerkotte, Joachim Schü, V. S. Subrahmanian:
Efficient Maintenance of Materialized Mediated Views. SIGMOD Conference 1995: 340-351 - [c28]Michael Steinbrunn, Klaus Peithner, Guido Moerkotte, Alfons Kemper:
Bypassing Joins in Disjunctive Queries. VLDB 1995: 228-238 - [p2]Alfons Kemper, Guido Moerkotte:
Physical Object Management. Modern Database Systems 1995: 175-202 - 1994
- [b3]Alfons Kemper, Guido Moerkotte:
Object-Oriented Database Management: Applications in Engineering and Computer Science. Prentice-Hall 1994, ISBN 0-13-629239-9 [contents] - [j11]Alfons Kemper, Peter C. Lockemann, Guido Moerkotte, Hans-Dirk Walter:
Autonomous Objects: A Natural Model for Complex Applications. J. Intell. Inf. Syst. 3(2): 133-150 (1994) - [j10]Alfons Kemper, Christoph Kilger, Guido Moerkotte:
Function Materialization in Object Bases: Design, Realization, and Evaluation. IEEE Trans. Knowl. Data Eng. 6(4): 587-608 (1994) - [c27]Sophie Cluet, Guido Moerkotte:
Classification And Optimization of Nested Queries in Object Bases. BDA 1994 - [c26]Alfons Kemper, Guido Moerkotte, Klaus Peithner, Michael Steinbrunn:
Optimizing Disjunctive Queries with Expensive Predicates. SIGMOD Conference 1994: 336-347 - [c25]Christoph Kilger, Guido Moerkotte:
Indexing Multiple Sets. VLDB 1994: 180-191 - 1993
- [j9]Peter C. Lockemann, Guido Moerkotte, Andrea Neufeld, Klaus Radermacher, Norbert Runge:
Database Design with User-Definable Modelling Concepts. Data Knowl. Eng. 10: 229-257 (1993) - [j8]Alfons Kemper, Guido Moerkotte:
Basiskonzepte objektorientierter Datenbanksysteme. Inform. Spektrum 16(2): 69-80 (1993) - [j7]Andrea Neufeld, Guido Moerkotte, Peter C. Lockemann:
Generating Consistent Test Data for a Variable Set of General Consistency Constraints. VLDB J. 2(2): 173-213 (1993) - [c24]Guido Moerkotte, Holger Müller:
Exploiting Consistency Maintenance for Planning. DAISD 1993: 225-255 - [c23]Sophie Cluet, Guido Moerkotte:
Nested Queries in Object Bases. DBPL 1993: 226-242 - [c22]Alfons Kemper, Guido Moerkotte, Michael Steinbrunn:
Optimizing Join Expressions (Extended Abstract). FMLDO 1993: 59-68 - [c21]Carsten Andreas Gerlhof, Alfons Kemper, Christoph Kilger, Guido Moerkotte:
Partition-Based Clustering in Object Bases: From Theory to Practice. FODO 1993: 301-316 - [c20]Guido Moerkotte, Andreas Zachmann:
Towards More Flexible Schema Management in Object Bases. ICDE 1993: 174-181 - [c19]Alfons Kemper, Guido Moerkotte, Hans-Dirk Walter:
Autonomous Objects: A Natural Model for Complex Applications. NGITS 1993 - [c18]Alfons Kemper, Guido Moerkotte, Klaus Peithner:
A Blackboard Architecture for Query Optimization in Object Bases. VLDB 1993: 543-554 - 1992
- [j6]Alfons Kemper, Guido Moerkotte, Klaus Peithner:
Optimierung objektorientierter Anfragen mittels einer Blackboard-Architektur. Datenbank Rundbr. 10: 37-38 (1992) - [j5]