Our experimental analysis of several popular XPath processors reveals a striking fact: Query
evaluation in each of the systems requires time exponential in the size of queries in the …

Motivated by formal models recently proposed in the context of XML, we study automata and
logics on strings over infinite alphabets. These are conservative extensions of classical …

We study the typechecking problem for XML transformers: given an XML transformation
program and a DTD for the input XML documents, check whether every result of the program …

The disclosed teachings provide methods and systems for efficient evaluation of XPath
queries. In particular, the disclosed evaluation methods require only polynomial time with …

The Web presents the database area with vast opportunities and commensurate challenges.
Databases and the Web are organically connected at many lev els. Web sites are …

Monadic query languages over trees currently receive considerable interest in the database
community, as the problem of selecting nodes from a tree is the most basic and widespread …

Contemporary XPath query engines evaluate queries in time exponential in the sizes of
input queries, a fact that has gone unnoticed for a long time. Recently, the first main-memory …

Semistructured data is used in data exchange applications, like B2B and EAI, and
represents data in a flexible format. Every data item has a unique tag (also called label), and …

When an XML document conforms to a given type (eg a DTD or an XML Schema type) it is
called a valid document. Checking if a given XML document is valid is called the validation …

US7644170B2 - Communications system providing extensible protocol translation features
and related methods - Google Patents US7644170B2 - Communications system providing …