Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Markus L. Noga is active.

Publication


Featured researches published by Markus L. Noga.


document engineering | 2002

Lazy XML processing

Markus L. Noga; Steffen Schott; Welf Löwe

This paper formalizes the domain of tree-based XML processing and classifies several implementation approaches. The lazy approach, an original contribution, is presented in depth. Proceeding from experimental measurements, we derive a selection strategy for implementation approaches to maximize performance.


Annals of Software Engineering | 2002

Foundations of Fast Communication via XML

Welf Löwe; Markus L. Noga; Thilo S. Gaul

Communication with XML often involves pre-agreed document types. In this paper, we propose an offline parser generation approach to enhance online processing performance for documents conforming to a given DTD. Our examination of DTDs and the languages they define demonstrates the existence of ambiguities. We present an algorithm that maps DTDs to deterministic context-free grammars defining the same languages. We prove the grammars to be LL(1) and LALR(1), making them suitable for standard parser generators. Our experiments show the superior performance of generated optimized parsers. Our results generalize from DTDs to XML schema specifications with certain restrictions, most notably the absence of namespaces, which exceed the scope of context-free grammars.


document engineering | 2003

Lazy XSL transformations

Steffen Schott; Markus L. Noga

We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tree are computed only upon initial access. As these computations have limited fan-in, sparse output coverage propagates backwards through the pipeline.In comparative measurements with traditional eager implementations, our approach is on par for complete coverage and excels as coverage becomes sparser. In contrast to eager evaluation, lazy evaluation also admits infinite intermediate results, thus extending the design space for transformation sequences.To demonstrate that lazy evaluation preserves the semantics of XSLT, we reduce XSLT to the lambda calculus via a functional language. While this is possible for all languages, most imperative languages cannot profit from the confluence of lambda as only one reduction applies at a time.


Electronic Notes in Theoretical Computer Science | 2002

Metaprogramming Applied to Web Component Deployment

Welf Löwe; Markus L. Noga

Metaprogramming is a generic approach described in many articles. Surprisingly, examples of successful applications are scarce. This paper gives such an example. With a metaprogram of less than 2500 lines, we deploy components on the web by adding specific XML-based communication facilities. This underlines the expressiveness of the metaprogramming approach.


generative programming and component engineering | 2002

Optimizing Content Management System Pipelines Separation and Merging of Concerns

Markus L. Noga; Florian Krüper

Content management systems support the dissemination and maintenance of documents. In software engineering terms, they separate the concerns of content, application logic and visual styling. Current systems largely maintain this separation of concerns after document deployment. Their runtime processing pipeline is a composition of generators, or document transformations. We exploit commutativity to enable new static evaluations of the composite during document deployment. Unlike traditional caching, we arrive at closed-form composites even for styled, database-driven documents. This eliminates the runtime penalties of a separation of concerns while preserving their software engineering benefits.


Lecture Notes in Computer Science | 2002

Scenario-Based Connector Optimization An XML Approach

Welf Löwe; Markus L. Noga

Software components can be connected by XML processing pipelines, which may perform adaptations. In our model, individual pipeline stages serialize source data structures to XML, perform one or multiple XSL transformations, transport the message to its destination and finally deserialize it to target data structures. Implementation of this model is open to optimizations. The present paper discusses two such optimizations: symbolic execution and lazy evaluation.


conference of the industrial electronics society | 2001

Specification in a large industry consortium-the MOST approach

Thilo S. Gaul; Welf Löwe; Markus L. Noga

The MOST Cooperation (media-oriented systems transport) is an industry group of automotive and supplier companies that specifies interfaces of multimedia components. Many members are competitors: they collaborate on standards while preserving their competitive advantages. Moreover, development processes differ for each member, but the MOST standard must be concise and consistent. We develop an XML based architecture to support individual workflows and the specification process as a whole.


Informatik Spektrum | 2000

Manchmal ist der wichtigste Baustein kein Baustein

Markus L. Noga

Italian LEGO Users Group am 26. März ihre vierte Vollversammlung abhielt.


Archive | 2002

A Lightweight XML-based Middleware Architecture

Alberto J. M. Martin; Markus L. Noga


Dr. Dobb's journal | 1999

DESIGNING THE LEGOS MULTITASKING OPERATING SYSTEM

Markus L. Noga

Collaboration


Dive into the Markus L. Noga's collaboration.

Top Co-Authors

Avatar

Welf Löwe

Karlsruhe Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Welf Löwe

Karlsruhe Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Steffen Schott

Karlsruhe Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Thilo S. Gaul

Karlsruhe Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Alberto J. M. Martin

Karlsruhe Institute of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge