Knowledge graphs (KGs) such as DBpedia, Freebase, YAGO, Wikidata, and NELL were
constructed to store large-scale, real-world facts as (subject, predicate, object) triples-that …

Existential blank nodes greatly complicate a number of fundamental operations on
Resource Description Framework (RDF) graphs. In particular, the problems of determining if …

Finding similar entities is a fundamental problem in graph data analysis. Similarity search
algorithms usually leverage the structural properties of the database to quantify the degree …

Graph analytics algorithms leverage quantifiable structural properties of the data to predict
interesting concepts and relationships. The same information, however, can be represented …

Standardized Electronic Healthcare Records (EHRs) data have a complex structure. They
are based on dual model approach where domain knowledge is saved as an archetype [1 …

Polyglot programming is a common practice in modern software development. This practice
is often considered useful to create software by allowing developers to use whichever …

One of the challenges in Web development is to achieve a good level of quality in terms of
code size and runtime performance for popular domain-specific languages such as XQuery …

Graph similarity search algorithms usually leverage the structural properties of a database.
Hence, these algorithms are effective only on some structural variations of the data and are …

People structure and represent their data in many different ways. One factor to consider in
choosing between different representations is how the structure will affect the effectiveness …

All real-world databases often have extremely complex schema s may be due to size or
design of database. Database schema with lots of entities and their relationships, each with …