Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Paraschos Koutris"'
Autor:
Paraschos Koutris, Shaleen Deep
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:1713-1739
Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be generally solved in time O ( n 3 ), where n is the number of vertices in t
Publikováno v:
Datenbank-Spektrum. 22:249-256
Autor:
Paraschos Koutris, Bas Ketsman
Publikováno v:
Foundations and Trends® in Databases. 12:1-68
Recent years have seen a resurgence of interest from both the industry and research community in Datalog. Datalog is a declarative query language that extends relational algebra with recursion. It has been used to express a wide spectrum of modern da
Autor:
Youmin Chen, Xiangyao Yu, Paraschos Koutris, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Jiwu Shu
Publikováno v:
Proceedings of the 2022 International Conference on Management of Data.
Autor:
Paraschos Koutris, Jef Wijsen
Publikováno v:
Theory of Computing Systems. 65:122-178
We study the complexity of consistent query answering on databases that may violate primary key constraints. A repair of such a database is any consistent database that can be obtained by deleting a minimal set of tuples. For every Boolean query q, C
Publikováno v:
Theory of Computing Systems. 64:965-998
Modern data management systems extensively use parallelism to speed up query processing over massive volumes of data. This trend has inspired a rich line of research on how to formally reason about the parallel complexity of join computation. In this
Publikováno v:
PODS
We study the data complexity of consistent query answering (CQA) on databases that may violate the primary key constraints. A repair is a maximal consistent subset of the database. For a Boolean query q, the problem CERTAINTY(q) takes a database as i
Publikováno v:
Proceedings of the VLDB Endowment. 12:695-708
Recursive query processing has experienced a recent resurgence, as a result of its use in many modern application domains, including data integration, graph analytics, security, program analysis, networking and decision making. Due to the large volum
Publikováno v:
aiDM@SIGMOD
Determining the degree of parallelism (DOP) for query execution is of great importance to both performance and resource provisioning. However, recent work that applies machine learning (ML) to query optimization and query performance prediction in re
Autor:
Jef Wijsen, Paraschos Koutris
Publikováno v:
PODS
We study consistent query answering with respect to key dependencies. Given a (possibly inconsistent) database instance and a set of key dependencies, a repair is an inclusion-maximal subinstance that satisfies all key dependencies. Consistent query