m

F Nous contacter

0

Documents  68Q19 | enregistrements trouvés : 6

O
     

-A +A

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Ecoles de recherche

After giving a motivation of graph databases and an overview of the main data models, we will dive into foundational aspects of graph database query languages, with a strong focus on regular path queries (RPQs) and conjunctive regular path queries (CRPQs). We will consider the different semantics that graph database systems use for such queries (every path, simple path, trail), and we will look into the computational complexities of query evaluation and query containment.
After having gone through these foundations, we plan to do some excursions into connections between tree-structured and graph-structured data, adding data value comparisons, and aspects of real-life queries.
After giving a motivation of graph databases and an overview of the main data models, we will dive into foundational aspects of graph database query languages, with a strong focus on regular path queries (RPQs) and conjunctive regular path queries (CRPQs). We will consider the different semantics that graph database systems use for such queries (every path, simple path, trail), and we will look into the computational complexities of query ...

68P15 ; 68Q19

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- viii; 519 p.
ISBN 978-0-8218-4943-9

Contemporary mathematics , 0558

Localisation : Collection 1er étage

théorie des modèles finis # probabilités combinatoires

03-02 ; 03-06 ; 05-02 ; 05-06 ; 68-02 ; 68-06 ; 03C65 ; 05Axx ; 05Cxx ; 68Q19 ; 00B25

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Ecoles de recherche

68Q19 ; 03B70 ; 68P15

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Ecoles de recherche

03B70 ; 68P15 ; 68Q19

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Ecoles de recherche

After giving a motivation of graph databases and an overview of the main data models, we will dive into foundational aspects of graph database query languages, with a strong focus on regular path queries (RPQs) and conjunctive regular path queries (CRPQs). We will consider the different semantics that graph database systems use for such queries (every path, simple path, trail), and we will look into the computational complexities of query evaluation and query containment.
After having gone through these foundations, we plan to do some excursions into connections between tree-structured and graph-structured data, adding data value comparisons, and aspects of real-life queries.
After giving a motivation of graph databases and an overview of the main data models, we will dive into foundational aspects of graph database query languages, with a strong focus on regular path queries (RPQs) and conjunctive regular path queries (CRPQs). We will consider the different semantics that graph database systems use for such queries (every path, simple path, trail), and we will look into the computational complexities of query ...

68P15 ; 68Q19

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research talks;Computer Science

Approximation methods and probabilistic algorithms are two important ways to obtain efficient algorithms giving approximate solutions to hard problems. We give some examples from optimization, counting and verification problems. Property testing is also a very efficient method to approximate verification problems.
complexity - difficult problem - approximation - probabilistic approximation schemes - optimization - counting
verification - property testing
Approximation methods and probabilistic algorithms are two important ways to obtain efficient algorithms giving approximate solutions to hard problems. We give some examples from optimization, counting and verification problems. Property testing is also a very efficient method to approximate verification problems.
complexity - difficult problem - approximation - probabilistic approximation schemes - optimization - counting
verification - ...

68Q15 ; 68Q17 ; 68Q19 ; 68W20 ; 68W25

... Lire [+]

Z