Modern search engines answer keyword-based queries extremely efficiently. The
impressive speed is due to clever inverted index structures, caching, a domain-independent …

Labeled unranked trees are used as a model of XML documents, and logical languages for
them have been studied actively over the past several years. Such logics have different …

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 …

XDuce is a statically typed programming language for XML processing. Its basic data values
are XML documents, and its types (so-called regular expression types) directly correspond …

We study the satisfiability problem associated with XPath in the presence of DTDs. This is
the problem of determining, given a query p in an XPath fragment and a DTD D, whether or …

Research on information extraction from Web pages (wrapping) has seen much activity
recently (particularly systems implementations), but little work has been done on formally …

The advent of XML initiated a symbiosis between document research, databases and formal
languages (see, eg, the survey by Vianu [38]). This symbiosis resulted, for instance, in the …

We survey some recent developments in the broad area of automata and logic which are
motivated by the advent of XML. In particular, we consider unranked tree automata, tree …

We propose regular expression pattern matching as a core feature for programming
languages for manipulating XML (and similar tree-structured data formats). We extend …

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 …