Mining frequent trees is very useful in domains like bioinformatics, web mining, mining
semistructured data, and so on. We formulate the problem of mining (embedded) subtrees in …

We describe several compact routing schemes for general weighted undirected networks.
Our schemes are simple and easy to implement. The routing tables stored at the nodes of …

Graph reachability is fundamental to a wide range of applications, including XML indexing,
geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many …

ABSTRACT Х и и ж л ан йз в гж ж иг йаан мдаг и в гжб Й и гв ж згйж з к а а гв гждгж и виж в
из гж и Сви жЙ в иК Ь Ъ згйж з ж ди гв ж б лгж ДЪ Е бз и а и и в и ж и гв в м в г б и и з вн ги …

With the growing importance of XML in data exchange, much research has been done in
providing flexible query facilities to extract data from structured XML documents. In this …

We present algorithms to label the nodes of an XML tree which is subject to insertions and
deletions of nodes. The labeling is done such that (1) we label each node immediately when …

Efficient evaluation of XML queries requires the determination of whether a relationship
exists between two elements. A number of labeling schemes have been designed to label …

XML documents have recently become ubiquitous because of their varied applicability in a
number of applications. Classification is an important problem in the data mining domain …

This book is a graduate-level textbook on data structures. A data structure is a method1 to
realize a set of operations on some data. The classical example is to keep track of a set of …

The Internet and World Wide Web have revolutionized access to information. Users now
store information across multiple platforms from personal computers to smartphones and …