Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Gösta Grahne"'
Publikováno v:
Proceedings of the 14th International Workshop on the Theory and Practice of Provenance.
Autor:
Gösta Grahne, Ali Moallemi
Publikováno v:
Fundamenta Informaticae. 167:287-321
Incomplete Information research is quite mature when it comes to so called {\em existential nulls}, where an existential null is a value stored in the database, representing an unknown object. For some reason {\em universal nulls}, that is, values re
Autor:
Gösta Grahne, Adrian Onet
Publikováno v:
Fundamenta Informaticae. 157:221-270
A lot of research activity has recently taken place around the chase procedure, due to its usefulness in data integration, data exchange, query optimization, peer data exchange and data correspondence, to mention a few. As the chase has been investig
Autor:
Gösta Grahne, Ali Moallemi
Publikováno v:
IDEAS
Recently there has been an effort to solve the problems caused by the infamous NULL in relational databases, by systematically applying Kleene's three-valued logic to SQL. The third truth-value is unknown. In this paper we show that by using a fourth
Autor:
Gösta Grahne
Publikováno v:
Encyclopedia of Database Systems ISBN: 9781489979933
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fcf1403cb5b0541057ebd830d178bd2
https://doi.org/10.1007/978-1-4614-8265-9_1253
https://doi.org/10.1007/978-1-4614-8265-9_1253
Publikováno v:
BeyondMR@SIGMOD
We describe Map-Reduce implementations of two of the most prominent DFA minimization methods, namely Moore's and Hopcroft's algorithms. Our analysis shows that the one based on Hopcroft's algorithm is more efficient, both in terms of running time and
Autor:
Gösta Grahne
Publikováno v:
Encyclopedia of Database Systems ISBN: 9781489979933
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c540d7d0b492f199940a2e0f1825519
https://doi.org/10.1007/978-1-4899-7993-3_1265-2
https://doi.org/10.1007/978-1-4899-7993-3_1265-2
Autor:
Alex Thomo, Gösta Grahne
Publikováno v:
Information Processing Letters. 109:739-744
In this paper we study the problem of deciding boundedness of (recursive) regular path queries over views in data integration systems, that is, whether a query can be re-expressed without recursion. This problem becomes challenging when the views con