Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Foto N. Afrati"'
Publikováno v:
IDEAS
In this paper we investigate within-record referential constraints on tree-structured data. We consider an SQL-like query language such that the one used in Dremel and we call it tree-SQL. We show how to define and process a query in tree-SQL in the
Autor:
Matthew Damigos, Foto N. Afrati
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030864712
DEXA (1)
DEXA (1)
In this paper, we consider a tree-structured data model used in many commercial databases like Dremel, F1, JSON stores. We define identity and referential constraints within each tree-structured record. The query language is a variant of SQL and flat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4aea233c40306ee37f716d603f16939
https://doi.org/10.1007/978-3-030-86472-9_26
https://doi.org/10.1007/978-3-030-86472-9_26
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030780852
CSCML
CSCML
Computations, such as syndromic surveillance and e-commerce, are executed over the datasets collected from different geographical locations. Modern data processing systems, such as MapReduce/Hadoop or Spark, also, require to collect the data from dif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27cf87e0afa36d43d3eca5f2ab46398e
https://doi.org/10.1007/978-3-030-78086-9_34
https://doi.org/10.1007/978-3-030-78086-9_34
Publikováno v:
Journal of Computer and System Sciences. 94:98-117
We consider the problem of computing data-cube marginals by a single round of MapReduce, focusing on the relationship between the reducer size and the replication rate. Initially, we simplify the problem by making the extent of each dimension the sam
Publikováno v:
ACM SIGMOD Record. 46:43-48
This report summarizes the presentations and discussions of the fourth workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR '17). The BeyondMR workshop was held in conjunction with the 2017 SIGMOD/PODS conference in Chicago, Illinois
Autor:
Foto N. Afrati
Publikováno v:
IDEAS
We often add arithmetic to extend the expressiveness of query languages, tuple generating dependencies and data exchange mappings, and study the complexity of problems such as testing query containment and finding certain answers. When adding arithme
Publikováno v:
AI Communications. 28:655-663
AI systems typically make decisions and find patterns in data based on the computation of aggregate and specifically sum functions, expressed as queries, on data's attributes. This computation can become costly or even inefficient when these queries
Publikováno v:
Scientific Programming, Vol 2017 (2017)
As data sources accumulate information and data size escalates it becomes more and more difficult to maintain the correctness and validity of these datasets. Therefore, tools must emerge to facilitate this daunting task. Fact checking usually involve
Publikováno v:
Proceedings of the VLDB Endowment. 7:1131-1142
In Dremel, data is stored as nested relations. The schema for a relation is a tree, all of whose nodes are attributes, and whose leaf attributes hold values. We explore filter and aggregate queries that are given in the Dremel dialect of SQL. Complic
Publikováno v:
Information Systems. 42:153-176
In this paper, we investigate the problem of view selection for workloads of conjunctive queries under bag and bag-set semantics. In particular, for both semantics we aim to limit the search space of candidate viewsets. We also start delineating boun