Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes
it an np-complete problem. Moreover, it requires bijective functions, which are often too …

Graph pattern matching is commonly used in a variety of emerging applications such as
social network analysis. These applications highlight the need for studying the following two …

In this paper we address the problem of modeling and implementing temporal data in XML.
We propose a data model for tracking historical information in an XML document and for …

The HOPI index, a connection index for XML documents based on the concept of a 2-hop
cover, provides space-and time-efficient reachability tests along the ancestor, descendant …

对XML 数据建立有效的索引, 是左右XML 数据处理性能的重要因素. 深入地讨论了目前XML
索引技术的研究现状, 将XML 索引技术分为两大类: 节点记录类索引(本身还可以分为3 …

With the proliferation of XML data and applications on the Internet, efficient XML query
processing techniques are in great demand. Answering queries using XML indexes is a …

XML query processing based on labeling schemes has been thoroughly studied in the past
several years. Recently efficient processing of updates in dynamic XML data has gained …

In this paper, we present, to our knowledge, the first known I/O efficient solutions for
computing the k-bisimulation partition of a massive directed graph, and performing …

The notion of bisimulation has been used in various fields including Modal Logic, Set theory,
Formal Verification, and XML indexing. In this paper we present the first algorithm for …

XML and semi-structured data is usually modeled using graph structures. Structural
summaries, which have been proposed to speedup XML query processing have graph …