RDF graph summarization for first-sight structure discovery
To help users get familiar with large RDF graphs, RDF summarization techniques can be
used. In this work, we study quotient summaries of RDF graphs, that is: graph summaries …
used. In this work, we study quotient summaries of RDF graphs, that is: graph summaries …
UCIS-X: an updatable compact indexing scheme for efficient extensible markup language document updating and query evaluation
WC Hsu, IE Liao - IEEE Access, 2020 - ieeexplore.ieee.org
One of the difficulties faced when using XML as the data storage structure is query
inefficiency. Therefore, various indexing methods have been proposed. When designing …
inefficiency. Therefore, various indexing methods have been proposed. When designing …
Exploring XML Index Structures and Evaluating C-Tree Index-based Algorithm
SJ Kapisha, GV Lakshmi - 2020 3rd International Conference …, 2020 - ieeexplore.ieee.org
There have been many XML specific indexing techniques available, but a comprehensive
list of comparisons of the existing techniques has not been performed yet. The two Key …
list of comparisons of the existing techniques has not been performed yet. The two Key …
[图书][B] Attributed Graph Analysis with Usability
Q Song - 2020 - search.proquest.com
Attributed graphs are now been widely used in expressing world wide web, social network,
knowledge base, biological structure, etc. Analyzing heterogeneous and large-scale graphs …
knowledge base, biological structure, etc. Analyzing heterogeneous and large-scale graphs …
[PDF][PDF] Efficient frameworks for keyword search on massive graphs
J Jiang - 2020 - scholars.hkbu.edu.hk
Due to the unstructuredness and the lack of schema information of knowledge graphs, social
networks and RDF graphs, keyword search has been proposed for querying such …
networks and RDF graphs, keyword search has been proposed for querying such …
[图书][B] Non-Standard Semantics for Graph Query Languages
S Mennicke - 2020 - iccl.inf.tu-dresden.de
We address the fundamentals of graph queries, which is best characterized by the notion of
graph pattern matching. In contrast to classical subgraph matching notions, like graph …
graph pattern matching. In contrast to classical subgraph matching notions, like graph …