Abstract: XML is now worldwide standards for data definition. It is universal language for information exchange and has been used by many organizations for developing enterprise applications. With the widespread adoption of SOAP and Web services, XML-based processing, and parsing of XML documents in particular, is becoming a performance-critical aspect of business computing. There are connections between Formal languages, Automata theory and XML. Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. XML has many important features, including platform and language independence, flexibility, expressiveness, and extensibility. Thus, the combination of these characteristics with the interoperability trait of Web services is an attractive way to design distributed applications. To improve web service performance, we have parsed XML documents using Deterministic Finite Automata (DFA). DFA is constructed to efficiently parse XML documents containing SOAP messages by encoding the XML parser’s states as a DFA. In this paper we discuss our simple example and performance results we obtained.
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot