FREE Registration is required
Overview:
This paper considers the problem of evaluating a large number of XPath expressions on an XML stream. The main contribution consists in showing that Deterministic Finite Automata (DFA) can be used effectively for this problem: in the experiments the author achieves a throughput of about 5.4MB/s, independent of the number of XPath expressions (up to 1,000,000 in the tests). The major problem the paper faces is that of the size of the DFA. Since the number of states grows exponentially with the number of XPath expressions, it was previously believed that DFAs cannot be used to process large sets of expressions.
(Is this item miscategorized? Does it need more tags? Let us know.)
| Format: | Size: | 450 KB | |
| Date: | Jan 2008 | ||
| Pages: | 23 |
People who downloaded this item also downloaded
White Papers, Webcasts, and Resources
- Web 2.0 and Sales Process Management OracleHow can Web 2.0 systems and applications support management of your sales processes? Get valuable insights from leading sales professionals.
- Sales 2.0: How Businesses are Using Online Collaboration to Spark Sales OracleExamine the rising use of LinkedIn, Facebook, Twitter, and other social media apps by sales and marketing teams to gain a competitive advantage.
- The Essential Guide: Real-Time High Availability for Exchange - Replicate Exchange Data for Improved Resiliency CA XOsoftSurvive major interruptions to your Exchange environment--and improve its resiliency and availability--with a real-time data replication solution.
Premier Vendor Content Whitepapers, webcasts & resources from our Power Center Sponsors
Featured Training Courses
- Implementing and Administering Windows 7 in the Enterprise
- CCNA Boot Camp v2.0
- VMware vSphere: Install, Configure, Manage [V4]
- Certified Ethical Hacker
- Management and Leadership Skills
- Browse all Training Courses
Popular Sanity Saver Videos
