Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re^6: In search of an efficient query abstractor

by tilly (Archbishop)
on Dec 08, 2008 at 08:21 UTC ( [id://728876]=note: print w/replies, xml ) Need Help??


in reply to Re^5: In search of an efficient query abstractor
in thread In search of an efficient query abstractor

I would recommend strongly against Parse::RecDescent for this. That was written before the /g modifier existed in Perl and so every time it matches a token it makes a copy of everything that comes after the token. On even a fairly small data set this can take a prohibitive amount of time and memory.

Changing that would entail rewriting the whole module. TheDamian had plans to do this, but I don't know if it ever happened. He did tell me that said rewrite was going to have to be incompatible with the original in some ways.

  • Comment on Re^6: In search of an efficient query abstractor

Replies are listed 'Best First'.
Re^7: In search of an efficient query abstractor
by mpeg4codec (Pilgrim) on Dec 08, 2008 at 21:04 UTC
    Why isn't this important fact in the perldoc?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://728876]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2024-04-24 01:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found