Home Products Developer Center Articles About Contact
Articles
A New Fast Approximate Multi-String Match and Search Method - Faster Grepping with ugrep
Improving the Double Exponential Quadrature Tanh-Sinh, Sinh-Sinh and Exp-Sinh Formulas
Schema Slicing Methods to Reduce Development Costs of WSDL-Based Web Services
Constructing Fast Lexical Analyzers with RE/flex
SJOT: Schemas for JSON Objects
How to Use Amazon Simple Storage Service (S3) in C++ with gSOAP
A Framework for Service-Oriented Computing with C and C++ Web Service Components published in ACM Transactions on Internet Technology, Vol.8, No.3, 2008
An Overview and Evaluation of Web Services Security Performance Optimizations published in the proceedings of the IEEE International Conference on Web Services 2008
High-Performance XML Parsing and Validation with Permutation Phrase Grammar Parsers published in the proceedings of the IEEE International Conference on Web Services 2008
A Table-Driven Streaming XML Parsing Methodology for High-Performance Web Services published in the proceedings of the IEEE International Conference on Web Services 2006
Exploring Remote Object Coherence in XML Web Services published in the proceedings of the IEEE International Conference on Web Services 2006
Constructing Finite State Automata for High-Performance XML Web Services published in the proceedings of the IEEE International Conference on Web Services 2004
Pushing the SOAP Envelope With Web Services for Scientific Computing published in the proceedings of the IEEE International Conference on Web Services 2003
The gSOAP Toolkit for Web Services and Peer-To-Peer Computing Networks published in the proceedings of IEEE Cluster Computing and the Grid 2002
Are Web Services Scale Free?
Constructing Finite State Automata for High-Performance XML Web Services ======================================================================== <p align="right"><i>by Robert A. van Engelen, published in the proceedings of the IEEE International Conference on Web Services 2004</i></p> This paper describes a validating XML parsing method based on deterministic finite state automata (DFA). XML parsing and validation is performed by a schema-specific XML parser that encodes the admissible parsing states as a DFA. This DFA is automatically constructed from the XML schemas of XML messages using a code generator. A two-level DFA architecture is used to increase efficiency and to reduce the generated code size. The lower-level DFA efficiently parses syntactically well-formed XML messages. The higher-level DFA validates the messages and produces application events associated with transitions in the DFA. Two example case studies are presented and performance results are given to demonstrate that the approach supports the implementation of high-performance Web services. ![Download](images/pdf.png) [Article](articles/icws2004.pdf) <p align="right"><i>Copyright (c) 2018, Robert van Engelen, Genivia Inc. All rights reserved.</i></p>