6 citations · 8 across the 3 of their papers we have counts for
5 papers
Querying collections of tree-structured records in the presence of within-record referential constraints
Foto N. Afrati, Matthew Damigos
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 t…
On the complexity of query containment and computing certain answers in the presence of ACs
Foto N. Afrati, Matthew Damigos
We often add arithmetic to extend the expressiveness of query languages and study the complexity of problems such as testing query containment and finding certain answers in the fr…
Handling Skew in Multiway Joins in Parallel Processing
Foto N. Afrati, Jeffrey D. Ullman, Angelos Vasilakopoulos
Handling skew is one of the major challenges in query processing. In distributed computational environments such as MapReduce, uneven distribution of the data to the servers is not…
Consistent Answers of Conjunctive Queries on Graphs
Foto N. Afrati, Phokion G. Kolaitis, Angelos Vasilakopoulos
During the past decade, there has been an extensive investigation of the computational complexity of the consistent answers of Boolean conjunctive queries under primary key constra…
Enumerating Subgraph Instances Using Map-Reduce
Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman
The theme of this paper is how to find all instances of a given "sample" graph in a larger "data graph," using a single round of map-reduce. For the simplest sample graph, the tria…