Abstract

The paper concentrates on data models that differ from the traditional relational one by Codd (1970). In particular, we are interested in processing graph databases (graph datasets) without any pre-configured structure, in which graph nodes may represent different objects and graph edges – relations between them. In this approach, the linguistic summarization methods for graph datasets are introduced, and differences for these methods with respect to traditional relational approach are shown, commented and improved in comparison to the preceding proposition (Strobin, Niewiadomski, 2016). The novelty of the paper is mostly the new form for summaries: Multi-Subject linguistic summaries of graph databases, previously introduced for relational databases (Superson, 2018).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call