Query languages for graph databases

PT Wood - ACM Sigmod Record, 2012 - dl.acm.org
Query languages for graph databases started to be investigated some 25 years ago. With
much current data, such as linked data on the Web and social network data, being graph …

Sapper: Subgraph indexing and approximate matching in large graphs

S Zhang, J Yang, W Jin - Proceedings of the VLDB Endowment, 2010 - dl.acm.org
With the emergence of new applications, eg, computational biology, new software
engineering techniques, social networks, etc., more data is in the form of graphs. Locating …

Searching web data: An entity retrieval and high-performance indexing model

R Delbru, S Campinas, G Tummarello - Journal of Web Semantics, 2012 - Elsevier
More and more (semi) structured information is becoming available on the web in the form of
documents embedding metadata (eg, RDF, RDFa, Microformats and others). There are …

Answering approximate queries over XML data

J Liu, DL Yan - IEEE Transactions on Fuzzy Systems, 2015 - ieeexplore.ieee.org
With the increasing popularity of XML for data representations, there is a lot of interest in
searching XML data. Due to the structural heterogeneity and textual content's diversity of …

From data integration to big data integration

S Bergamaschi, D Beneventano, F Mandreoli… - A Comprehensive Guide …, 2018 - Springer
Abstract The Database Group (DBGroup, www. dbgroup. unimore. it) and Information
System Group (ISGroup, www. isgroup. unimore. it) research activities have been mainly …

On a fuzzy algebra for querying graph databases

O Pivert, V Thion, H Jaudoin… - 2014 IEEE 26th …, 2014 - ieeexplore.ieee.org
This paper proposes a notion of fuzzy graph database and describes a fuzzy query algebra
that makes it possible to handle such database, which may be fuzzy or not, in a flexible way …

Adding regular expressions to graph reachability and pattern queries

W Fan, J Li, S Ma, N Tang, Y Wu - Frontiers of Computer Science, 2012 - Springer
It is increasingly common to find graphs in which edges are of different types, indicating a
variety of relationships. For such graphs we propose a class of reachability queries and a …

SQBC: An efficient subgraph matching method over large and dense graphs

W Zheng, L Zou, X Lian, H Zhang, W Wang, D Zhao - Information Sciences, 2014 - Elsevier
Recent progress in biology and computer science have generated many complicated
networks, most of which can be modeled as large and dense graphs. Developing effective …

Approximation and relaxation of semantic web path queries

A Poulovassilis, P Selmer, PT Wood - Journal of Web Semantics, 2016 - Elsevier
Given the heterogeneity of complex graph data on the web, such as RDF linked data, it is
likely that a user wishing to query such data will lack full knowledge of the structure of the …

Expression and efficient processing of fuzzy queries in a graph database context

O Pivert, G Smits, V Thion - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
Graph databases have aroused a large interest in the last years thanks to their large scope
of potential applications (eg social networks, biomedical networks, data stemming from the …