2011Unpublished venueRequires access

Efficient Processing of XML Documents

Girish Tere, B. T. Jadhav

Open publisher page 1 citations

Abstract

is now worldwide standards for data definition. The standard of data transfer and exchange between organizations through Web services has become exceedingly popular, especially in electronic commerce. Web services are somewhat loosely defined, but may be characterized in general as using existing web technologies and standards to build the distributed computing environments. Data transferred through web services is in the form of XML. XML 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. 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 parsers states as a DFA. In this paper we discuss our simple application and performance results we obtained.

About this research paper

What this paper is about

is now worldwide standards for data definition. The standard of data transfer and exchange between organizations through Web services has become exceedingly popular, especially in electronic commerce. Web services are somewhat loosely defined, but may be characterized in general as using existing web technologies and standards to build the distributed computing environments. Data transferred through web services is in the form of XML. XML 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. 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 parsers states as a DFA. In this paper we discuss our simple application and performance results we obtained.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

is now worldwide standards for data definition. The standard of data transfer and exchange between organizations through Web services has become exceedingly popular, especially in electronic commerce. Web services are somewhat loosely defined, but may be characterized in general as using existing web technologies and standards to build the distributed computing environments. Data transferred through web services is in the form of XML. XML 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. 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 parsers states as a DFA. In this paper we discuss our simple application and performance results we obtained.

Key concepts: Efficient XML Interchange, Computer science, Streaming XML, XML validation, XML Signature, XML Encryption, XML Schema Editor, SOAP

Related papers

Back to paper searchBrowse research topicsOriginal source
Efficient Processing of XML Documents — Research Paper | ScholarLens