Regular Expression Performance
I have been using regular expressions for a while now, but I've never had to worry about performance until now.
I'm currently writing some classes that will scrape data from a message.
-The message is very large and has a tree-like structure similar to XML.
-I know the exact formatting and structure of the message. However, certain segments ("tags" if you're comparing it to XML) are optional and others can be repeated a certain number of times.
I wrote a regular expression that contains a group for each segment and subgroups for each branching segment. There's probably over 100 groups total. It will make sure that the correct data is scraped. However, performance issues have been brought to my attention.
Assuming that the regular expression will only be compiled once, will the massive number of groups and subgroups affect performance when using matcher.find()?
By sunilbenjamin in forum ASP.NET
Last Post: 09-29-2005, 03:09 AM
Last Post: 06-08-2005, 01:12 AM
By Claudiu in forum Database
Last Post: 02-05-2003, 08:50 AM
By eBiointel in forum .NET
Last Post: 10-24-2002, 05:11 AM
By Patrick Ireland in forum .NET
Last Post: 05-05-2001, 11:04 AM
Top DevX Stories
Easy Web Services with SQL Server 2005 HTTP Endpoints
JavaOne 2005: Java Platform Roadmap Focuses on Ease of Development, Sun Focuses on the "Free" in F.O.S.S.
Wed Yourself to UML with the Power of Associations
Microsoft to Add AJAX Capabilities to ASP.NET
IBM's Cloudscape Versus MySQL