Zobrazeno 1 - 10
of 44
pro vyhledávání: '"PETERFREUND, LIAT"'
SQL/PGQ and GQL are very recent international standards for querying property graphs: SQL/PGQ specifies how to query relational representations of property graphs in SQL, while GQL is a standalone language for graph databases. The rapid industrial de
Externí odkaz:
http://arxiv.org/abs/2409.01102
We study a relational perspective of graph database querying. Such a perspective underlies various graph database systems but very few theoretical investigations have been conducted on it. This perspective offers a powerful and unified framework to s
Externí odkaz:
http://arxiv.org/abs/2407.06766
Autor:
Francis, Nadime, Gheerbrant, Amélie, Guagliardo, Paolo, Libkin, Leonid, Marsault, Victor, Martens, Wim, Murlak, Filip, Peterfreund, Liat, Rogova, Alexandra, Vrgoč, Domagoj
The development of practical query languages for graph databases runs well ahead of the underlying theory. The ISO committee in charge of database query languages is currently developing a new standard called Graph Query Language (GQL) as well as an
Externí odkaz:
http://arxiv.org/abs/2210.16580
Queries with aggregation and arithmetic operations, as well as incomplete data, are common in real-world database, but we lack a good understanding of how they should interact. On the one hand, systems based on SQL provide ad-hoc rules for numerical
Externí odkaz:
http://arxiv.org/abs/2210.15395
Autor:
Paz, Ami, Peterfreund, Liat
Publikováno v:
In Theoretical Computer Science 12 November 2024 1016
Data provenance consists in bookkeeping meta information during query evaluation, in order to enrich query results with their trust level, likelihood, evaluation cost, and more. The framework of semiring provenance abstracts from the specific kind of
Externí odkaz:
http://arxiv.org/abs/2202.10766
Autor:
Libkin, Leonid, Peterfreund, Liat
The design of SQL is based on a three-valued logic (3VL), rather than the familiar Boolean logic. 3VL adds a truth value unknown to true and false to handle nulls. Viewed as indispensable for SQL expressiveness, it is at the same time much criticized
Externí odkaz:
http://arxiv.org/abs/2012.13198
Autor:
Peterfreund, Liat
We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting structured data from text. While previously studied formalisms for doc
Externí odkaz:
http://arxiv.org/abs/2003.06880
Autor:
Peterfreund, Liat
Publikováno v:
In Discrete Applied Mathematics 31 December 2023 341:372-392
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast to it, its
Externí odkaz:
http://arxiv.org/abs/1912.06110