2004 · 52 citations · 9 references
ComputingComputer ScienceComputer SystemsNatural Language ProcessingSystems ArchitectureWeb TechnologiesAutomata TheoryFinite AutomataFinite-state MachinesParsingCode Size OptimizationDeterministic Finite AutomataFinite Automata TheoryXml Data ModelsXml EncodingXml ParsingXml Schema ValidationXml Validation
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 twolevel 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.
9
Latency Performance of SOAP Implementations
D. Davis, Manish Parashar · 2003 · 211 citations
Automata theory for XML researchers
Frank Neven · ACM SIGMOD Record · 2002 · 178 citations · Full text