![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Sven Helmer Matthias Brantner , Carl-Christian Kanne , Guido Moerkotte , Sven Helmer: Algebraic Optimization of Nested XPath Expressions. ICDE 2006 : 128 Aleksei Pavlov , Sven Helmer, Guido Moerkotte : A Model-Based Monitoring and Diagnosis System for a Space-Based Astrometry Mission. DEXA 2005 : 920-929 Thomas Neumann , Sven Helmer, Guido Moerkotte : On the Optimal Ordering of Maps and Selections under Factorization. ICDE 2005 : 490-501 Matthias Brantner , Sven Helmer, Carl-Christian Kanne , Guido Moerkotte : Full-fledged Algebraic XPath Processing in Natix. ICDE 2005 : 705-716 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 Sven Helmer, Carl-Christian Kanne , Guido Moerkotte : Timestamp-Based Protocols for Synchronizing Access on XML Documents. DEXA 2004 : 591-600 Vasco Amaral , Sven Helmer, Guido Moerkotte : PHEASANT: A PHysicist's EAsy ANalysis Tool. FQAS 2004 : 229-242 Norman May , Sven Helmer, Guido Moerkotte : Nested Queries and Quantifiers in an Ordered Context. ICDE 2004 : 239-250 Norman May , Sven Helmer, Carl-Christian Kanne , Guido Moerkotte : XQuery Processing in Natix with an Emphasis on Join Ordering. XIME-P 2004 : 49-54 Sven Helmer, Carl-Christian Kanne , Guido Moerkotte : Evaluating lock-based protocols for cooperation on XML documents. SIGMOD Record 33 (1): 58-63 (2004) Sven Helmer, Carl-Christian Kanne , Guido Moerkotte : Lock-based Protocols for Cooperation on XML Documents. DEXA Workshops 2003 : 230-234 Sven Helmer, Thomas Neumann , Guido Moerkotte : A Robust Scheme for Multilevel Extendible Hashing. ISCIS 2003 : 220-227 Sven Helmer, Thomas Neumann , Guido Moerkotte : Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness. VLDB 2003 : 656-667 Norman May , Sven Helmer, Guido Moerkotte : Quantifiers in XQuery. WISE 2003 : 313-316 Norman May , Sven Helmer, Guido Moerkotte : Three Cases for Query Decorrelation in XQuery. Xsym 2003 : 70-84 Sven Helmer, Guido Moerkotte : Indexstrukturen für XML. Web & Datenbanken 2003 : 217-250 Sven Helmer: Evaluating different approaches for indexing fuzzy sets. Fuzzy Sets and Systems 140 (1): 167-182 (2003) Sven Helmer: Book Review: "Recent issues on fuzzy databases" by G. Bordogna and G. Pasi (Eds.); Physica Verlag, Wurzburg, 2000, 236pp., ISBN: 3-7908-1319-2. Fuzzy Sets and Systems 140 (1): 229-230 (2003) 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) Sven Helmer, Carl-Christian Kanne , Guido Moerkotte : XML-Datenbanksysteme und ihre Anwendung. it - Information Technology 45 (3): 137-142 (2003) Sven Helmer, Carl-Christian Kanne , Guido Moerkotte : Optimized Translation of XPath into Algebraic Expressions Parameterized by Programs Containing Navigational Primitives. WISE 2002 : 215-224 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 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) Till Westmann , Donald Kossmann , Sven Helmer, Guido Moerkotte : The Implementation and Performance of Compressed Databases. SIGMOD Record 29 (3): 55-67 (2000) Sven Helmer, Till Westmann , Guido Moerkotte : Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships. VLDB 1998 : 98-109 Sven Helmer, Guido Moerkotte : Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates. VLDB 1997 : 386-395 1 [ 20 ] [ 22 ] 2 [ 23 ] [ 26 ] 3 [ 4 ] [ 5 ] 4 [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 16 ] [ 17 ] [ 18 ] [ 21 ] [ 23 ] [ 26 ] 5 [ 3 ] 6 [ 12 ] [ 13 ] [ 18 ] [ 19 ] 7 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] 8 [ 4 ] [ 5 ] 9 [ 14 ] [ 15 ] [ 24 ] 10 [ 25 ] 11 [ 4 ] [ 5 ] 12 [ 2 ] [ 3 ] [ 4 ] [ 5 ] ![]() ©2006 Association for Computing Machinery |