Titlebook: Web Information Systems Engineering – WISE 2015; 16th International C Jianyong Wang,Wojciech Cellary,Yanchun Zhang Conference proceedings 2

Engaged

GraSS: An Efficient Method for RDF Subgraph Matching,or data and knowledge representation. Unlike queries on relational databases, most of queries applied on RDF data are known as ., expressed in the SPARQL language. Subgraph matching, a basic SPARQL operation, is known to be NP-complete. Coupled with the rapidly increasing volumes of RDF data, it mak

非实体

A Dynamically Extensible Open Cross-Document Link Service,, most existing document linking approaches show some shortcomings in terms of the offered link granularity and cannot easily be extended to support new document formats. More recently, we see new document formats such as the Office Open XML (OOXML) standard which facilitate the linking to parts of

效果

MAPLE

Assemble

旁观者

Ranked Reverse Boolean Spatial Keyword Nearest Neighbors Search,ely studied on the database research community. But the R.NN query cannot retrieve spatio-textual objects which are described by their spatial location and a set of keywords. Therefore, researchers proposed a RST.NN query to find these objects, taking both spatial and textual similarity into conside

Endometrium

OSCAR: OpenStreetMap Planet at Your Fingertips via OSm Cell ARrangements, on all relevant tags of the OSM data is possible. At the core of our OSCAR system lies the construction of a so-called . induced by all regions defined in the raw data. By having our index structure based on this cell arrangement, we can efficiently (with respect to query time and space) incorporat

paragon

GraSS: An Efficient Method for RDF Subgraph Matching,or data and knowledge representation. Unlike queries on relational databases, most of queries applied on RDF data are known as ., expressed in the SPARQL language. Subgraph matching, a basic SPARQL operation, is known to be NP-complete. Coupled with the rapidly increasing volumes of RDF data, it mak

Concrete

虚构的东西

FreeS: A Fast Algorithm to Discover Frequent Free Subtrees Using a Novel Canonical Form, is presented to discover all frequently occurring free subtrees in a database of labelled free trees. . is designed using an optimal canonical form, BOCF that can uniquely represent free trees even during the presence of isomorphism. To avoid enumeration of false positive candidates, it utilises th