Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Layaida, Nabil"'
Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business analytics. Graph data often come with schema information that describe
Externí odkaz:
http://arxiv.org/abs/2403.01863
Query optimizers built on the transformation-based Volcano/Cascades framework are used in many database systems. Transformations proposed earlier on the logical query dag (LQDAG) data structure, which is key in such a framework, focus only on recursi
Externí odkaz:
http://arxiv.org/abs/2312.02572
Big data programming frameworks have become increasingly important for the development of applications for which performance and scalability are critical. In those complex frameworks, optimizing code by hand is hard and time-consuming, making automat
Externí odkaz:
http://arxiv.org/abs/2306.07690
Graph data is omnipresent and has a wide variety of applications, such as in natural science, social networks, or the semantic web. However, while being rich in information, graphs are often noisy and incomplete. As a result, graph completion tasks,
Externí odkaz:
http://arxiv.org/abs/2303.15487
We present a system called Dist-$\mu$-RA for the distributed evaluation of recursive graph queries. Dist-$\mu$-RA builds on the recursive relational algebra and extends it with evaluation plans suited for the distributed setting. The goal is to offer
Externí odkaz:
http://arxiv.org/abs/2111.12487
Autor:
Layaida, Nabil
Les travaux de cette thèse ont pour cadre l'édition de documents électroniques multimédia en considérant en tout premier lieu leur dimension temporelle (enchaînement des objets dans le temps). L'objectif concerne à la fois l'intégration de ce
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00004952
http://tel.archives-ouvertes.fr/docs/00/04/62/62/PDF/tel-00004952.pdf
http://tel.archives-ouvertes.fr/docs/00/04/62/62/PDF/tel-00004952.pdf
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions where node car
Externí odkaz:
http://arxiv.org/abs/1008.5073
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node cardinali
Externí odkaz:
http://arxiv.org/abs/1005.5623
Autor:
Geneves, Pierre, Layaida, Nabil
This document describes how to use the XML static analyzer in practice. It provides informal documentation for using the XML reasoning solver implementation. The solver allows automated verification of properties that are expressed as logical formula
Externí odkaz:
http://arxiv.org/abs/0812.3550
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data. Nowadays, a challenge is to assess and accommodate
Externí odkaz:
http://arxiv.org/abs/0811.4324