Functional Querying in Graph Databases

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10374026" target="_blank" >RIV/00216208:11320/18:10374026 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s40595-017-0104-6" target="_blank" >http://dx.doi.org/10.1007/s40595-017-0104-6</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s40595-017-0104-6" target="_blank" >10.1007/s40595-017-0104-6</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Functional Querying in Graph Databases

Popis výsledku v původním jazyce

The paper is focused on a functional querying in graph databases. We consider labelled property graph model and mention also the graph model behind XML databases. An attention is devoted to functional modelling of graph databases both at a conceptual and data level. The notions of graph conceptual schema and graph database schema are considered. The notion of a typed attribute is used as a basic structure both on the conceptual and database level. As a formal approach to declarative graph database querying a version of typed lambda calculus is used. This approach allows to use a logic necessary for querying, arithmetic as well as aggregation function. Another advantage is the ability to deal with relations and graphs in one integrated environment.

Název v anglickém jazyce

Functional Querying in Graph Databases

Popis výsledku anglicky

The paper is focused on a functional querying in graph databases. We consider labelled property graph model and mention also the graph model behind XML databases. An attention is devoted to functional modelling of graph databases both at a conceptual and data level. The notions of graph conceptual schema and graph database schema are considered. The notion of a typed attribute is used as a basic structure both on the conceptual and database level. As a formal approach to declarative graph database querying a version of typed lambda calculus is used. This approach allows to use a logic necessary for querying, arithmetic as well as aggregation function. Another advantage is the ability to deal with relations and graphs in one integrated environment.

Druh

J_ost - Ostatní články v recenzovaných periodicích

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Vietnam Journal of Computer Science

ISSN

2196-8896

e-ISSN

—

Svazek periodika

5

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

11

Strana od-do

95-105

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—