It is common to find graphs with millions of nodes and billions of edges in, eg, social
networks. Queries on such graphs are often prohibitively expensive. These motivate us to …

Graph pattern matching is fundamental to social network analysis. Traditional techniques
are subgraph isomorphism and graph simulation. However, these notions often impose too …

We present SchemEX, an approach and tool for a stream-based indexing and schema
extraction of Linked Open Data (LOD) at web-scale. The schema index provided by …

We propose the use of a structure index for RDF. It can be used for querying RDF data for
which the schema is incomplete or not available. More importantly, we leverage it for a …

The efficient processing of XQuery still poses significant challenges. A particularly effective
technique to improve XQuery processing performance consists of using materialized views …

Graphs have become growingly important in representing shapes in computer vision. Given
a query graph, it is essential to retrieve similar database graphs efficiently from a large …

Visual search for mobile devices relies on transmitting wirelessly a compact representation
of the query image, generally in the form of feature descriptors, to a remote server …

多尺度分割算法是面向对象的图像分析方法中的一种较为成熟, 稳定的分割算法,
但存在部分分割不准确和分割效率低等问题. 为此, 提出一种融合数学形态学运算的多尺度建筑 …

XML (Extensible Mark-up Language) is a well established format which is often used for
modeling of semi-structured data. XPath and XQuery are de facto standards among XML …

In this paper we focus on the following constrained reachability problem over edge-labeled
graphs like RDF--" given source node x, destination node y, and a sequence of edge labels …