1,828 research outputs found
An introduction to Graph Data Management
A graph database is a database where the data structures for the schema
and/or instances are modeled as a (labeled)(directed) graph or generalizations
of it, and where querying is expressed by graph-oriented operations and type
constructors. In this article we present the basic notions of graph databases,
give an historical overview of its main development, and study the main current
systems that implement them
Academic team formation as evolving hypergraphs
This paper quantitatively explores the social and socio-semantic patterns of
constitution of academic collaboration teams. To this end, we broadly underline
two critical features of social networks of knowledge-based collaboration:
first, they essentially consist of group-level interactions which call for
team-centered approaches. Formally, this induces the use of hypergraphs and
n-adic interactions, rather than traditional dyadic frameworks of interaction
such as graphs, binding only pairs of agents. Second, we advocate the joint
consideration of structural and semantic features, as collaborations are
allegedly constrained by both of them. Considering these provisions, we propose
a framework which principally enables us to empirically test a series of
hypotheses related to academic team formation patterns. In particular, we
exhibit and characterize the influence of an implicit group structure driving
recurrent team formation processes. On the whole, innovative production does
not appear to be correlated with more original teams, while a polarization
appears between groups composed of experts only or non-experts only, altogether
corresponding to collectives with a high rate of repeated interactions
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines “correctness by construction” and design creativity by the use of pre-proven behaviour preserving transformations as design steps. The formal aspects of this methodology are hidden in the transformations. A constraint is the availability of a design representation with a compositional formal semantics. Graph representations are useful design representations because of their visualisation of design information. In this paper graph rewriting theory, as developed in the last twenty years in mathematics, is shown to be a useful basis for a formal framework for transformational design. The semantic aspects of graphs which are no part of graph rewriting theory are included by the use of attributed graphs. The used attribute algebra, table algebra, is a relation algebra derived from database theory. The combination of graph rewriting, table algebra and transformational design is new
Recommended from our members
Embracing <i>n</i>-ary Relations in Network Science
Most network scientists restrict their attention to relations between pairs of things, even though most complex systems have structures and dynamics determined by n-ary relation where n is greater than two. Various examples are given to illustrate this. The basic mathematical structures allowing more than two vertices have existed for more than half a century, including hypergraphs and simplicial complexes. To these can be added hypernetworks which, like multiplex networks, allow many relations to be defined on the vertices. Furthermore, hypersimplices provide an essential formalism for representing multilevel part-whole and taxonomic structures for integrating the dynamics of systems between levels. Graphs, hypergraphs, networks, simplicial complex, multiplex network and hypernetworks form a coherent whole from which, for any particular application, the scientist can select the most suitable
- …