Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^2: Fastest XML Parser ?

by renodino (Curate)
on Feb 17, 2008 at 20:10 UTC ( #668445=note: print w/replies, xml ) Need Help??

in reply to Re: Fastest XML Parser ?
in thread Fastest XML Parser ?

Wow, very fast; thnx for the pointer.

BUT....the output is very densebloated. Every leaf node is a full hash, and it tries to preserve comments and attributes. Which is great if the output is going to be turned back into XML...but I just want the values/attributes keyed by their names, so I can create a reasonably compressed piece of JSON to send to the browser.

I'm taking a stab at patching it w/ a "compact" option to achieve that and see how it behaves.

Hacked it up to support both a compact mode, and a to_json() method;
XML::Simple + XML::LibXML + JSON::XS : ~0.6 sec
XML::Bare w/ hacks: 0.04 sec (yes, 40 millisecs)

I think I've found my favorite XML parser 8^))

Perl Contrarian & SQL fanboy

Replies are listed 'Best First'.
Re^3: Fastest XML Parser ?
by gfk (Novice) on Jul 09, 2008 at 14:50 UTC

    I'm interested in doing to same thing (convert XML to JSON quickly) and your solution looks very interesting.

    Would you mind posting it somewhere for the whole world to enjoy? :-)


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://668445]
[Corion]: A good daypart!
Corion feels slightly bad for initiating a discussion yesterday and then running away. I guess I should write that up as a meditation or SoPW
[Corion]: Not the "running away" part but the question+ discussion about IO-less HTTP modules
[Corion]: (or how/where to patch AnyEvent::HTTP or LWP::UserAgent to take control of both the callstack and the data transfer)

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (8)
As of 2016-12-08 08:59 GMT
Find Nodes?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:

    Results (137 votes). Check out past polls.