RDF datasets with billions of triples are no longer unusual and continue to grow constantly
(eg LOD cloud) driven by the inherent flexibility of RDF that allows to represent very diverse …

In many applications, it is convenient to substitute a large data graph with a smaller
homomorphic graph. This paper investigates approaches for summarising massive data …

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 …

XML data broadcast is an efficient way to disseminate semistructured information in wireless
mobile environments. In this paper, we propose a novel two-tier index structure to facilitate …

ABSTRACT RDF is the common data model to publish structured data on the Web. RDF
data sets are given as subject-predicateobject triples and typically are represented as …

Some indexing and query evaluation methods have been proposed for accelerating query
processing in XML documents. The structural summary approach reduces the portion of the …

XML is short for eXtensible Markup Language, whose purpose is to aid information systems
in sharing structured data, especially via the Internet, to encode documents, and to serialize …

摘要针对连续不确定XML 数据的概率阈值查询, 提出CPTI (
ContinuousProbabilisticThresholdIndex) 索引技术, 包括CPTI 结构索引和CPTI 值索引. CPTI …

Graphs provide effective data structures modeling complex relations and schemaless data
such as images, XML documents, circuits, compounds, and proteins. Given a query graph …

Graph pattern matching is fundamental to social network analysis. Its effectiveness for
identifying social communities and social positions, making recommendations and so on …