Category Archives: Performance Optimization

Fizz Buzz with XPath 2.0/3.0

Posted on March 5, 2012 by

A few days ago Jim Fuller asked on Twitter: @xquery fizz buzz with xquery http://bit.ly/wC6Ra5 can anyone come up with a faster version ? #xquery9:00 AM Feb 26, 2012 Here are my two answers in the categories: 1) Elegant; 2) Fast … Continue reading →

Posted in Performance Optimization, XPath, XPath 3.0, XSLT 2.0, XSLT 3.0 | 2 Comments

Optimized Repetitive Prepends, Part III: Understanding the Solution

Posted on December 24, 2008 by

  Technorati Tags: performance optimization, algorithms, algorithmic complexity, functional programming In Part II of this post a solution was given to the problem presented in Part I: "Can we implement an algorithm for repetitive prepends that will be run by … Continue reading →

Posted in Performance Optimization | Leave a comment

Performance Feat: Eliminate a dimension of complexity in XSLT Processor’s repetitive prepends. Part II: The Solution.

Posted on December 22, 2008 by

Technorati Tags: Performance optimization, algorithmic complexity, XPath sequence operationsTechnorati Profile Update: Minor code cleanup (using better names now). In my previous post I defined the problem of improving the quadratical performance of an XSLT processor P1 when performing repetitive prepends … Continue reading →

Posted in Performance Optimization | Leave a comment

Performance Feat: Eliminate a dimension of complexity in XSLT Processor’s repetitive prepends. Part I: The Problem.

Posted on December 22, 2008 by

Update: Minor code cleanup. Prepending a list xs with a list ys to obtain the concatenation (of ys ++ xs )  of the two is usually a cheap operation which, when done non-destructively, requires only to copy the list ys … Continue reading →

Posted in Performance Optimization | Leave a comment