Abstract: The invention provides systems and methods for implementation of a computer language type system by augmenting finite state automata algorithms to accommodate symbols having both subtype relationships and nested types. To make the classical automata algorithms work for type system with subtypes, finite state automata for a data type is augmented by additional transitions that include secondary symbols, wherein secondary symbols are subtypes of symbols of alphabet of finite state automata. A data type when compared to another data type must compare both names and the contents.

Abstract: Systems and methods in accordance with the present invention provide for an implementation of the XQuery standard, and such an implementation will be referred to herein as an XQuery (XML Query language) implementation. An XQuery implementation can be based on a token stream representation, which allows large XML documents to be processed without having to first read the entire document. An XQuery implementation can also utilize a streaming XQuery engine. A set of algorithms and a set of rewrite rules can be used for the implementation. Given a query, a set of rules can be applied to that query to transform the query into another query. Some of these rules allow the resulting query to be streamable. In other words, a query that would otherwise require an XML document to be read into memory can now be transformed into a query that can work on an XML stream. The type system of the XQuery language can be based on XML Schema, and the basic types of XML Schema can have derived types.

Abstract: Systems and methods in accordance with the present invention provide for an implementation of the XQuery standard, and such an implementation will be referred to herein as an XQuery (XML Query language) implementation. An XQuery implementation can be based on a token stream representation, which allows large XML documents to be processed without having to first read the entire document. An XQuery implementation can also utilize a streaming XQuery engine. A set of algorithms and a set of rewrite rules can be used for the implementation. Given a query, a set of rules can be applied to that query to transform the query into another query. Some of these rules allow the resulting query to be streamable. In other words, a query that would otherwise require an XML document to be read into memory can now be transformed into a query that can work on an XML stream. The type system of the XQuery language can be based on XML Schema, and the basic types of XML Schema can have derived types.