Author image not provided
 F. Afrati

 homepage

ACM Fellow badge
  Affiliation history
Bibliometrics: publication history
Average citations per article10.13
Citation Count902
Publication count89
Publication years1984-2017
Available for download34
Average downloads per article328.35
Downloads (cumulative)11,164
Downloads (12 Months)446
Downloads (6 Weeks)74
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


92 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 92
Result page: 1 2 3 4 5

Sort by:

1 published by ACM
February 2018 ACM SIGMOD Record: Volume 46 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 18,   Downloads (Overall): 18

Full text available: PDFPDF
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, USA on Friday May 19, 2017. The goal of the workshop was to bring ...

2
December 2017
Bibliometrics:
Citation Count: 0

The topic of using views to answer queries has been popular for a few decades now, as it cuts across domains such as query optimization, information integration, data warehousing, website design, and, recently, database-as-a-service and data placement in cloud systems. This book assembles foundational work on answering queries using views ...

3
December 2017
Bibliometrics:
Citation Count: 0

The topic of using views to answer queries has been popular for a few decades now, as it cuts across domains such as query optimization, information integration, data warehousing, website design, and, recently, database-as-a-service and data placement in cloud systems. This book assembles foundational work on answering queries using views ...

4 published by ACM
September 2017 ACM SIGMOD Record: Volume 46 Issue 2, June 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 38,   Downloads (Overall): 45

Full text available: PDFPDF
This report summarizes the presentations and discussions of the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'16). The BeyondMR workshop was held in conjunction with the 2016 SIGMOD conference in San Francisco, California, USA on July 1, 2016. The goal of the workshop was to bring together ...

5 published by ACM
December 2016 ACM Transactions on Knowledge Discovery from Data (TKDD): Volume 11 Issue 2, December 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 45,   Downloads (Overall): 144

Full text available: PDFPDF
A MapReduce algorithm can be described by a mapping schema , which assigns inputs to a set of reducers, such that for each required output there exists a reducer that receives all the inputs participating in the computation of this output. Reducers have a capacity that limits the sets of ...
Keywords: Distributed computing, MapReduce algorithms, and reducer capacity and communication cost trade-off, mapping schema, reducer capacity

6 published by ACM
July 2016 IDEAS '16: Proceedings of the 20th International Database Engineering & Applications Symposium
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 54

Full text available: PDFPDF
We consider the problem of computing the data-cube marginals of a fixed order k (i.e., all marginals that aggregate over k dimensions), using a single round of MapReduce. The focus is on the relationship between the reducer size (number of inputs allowed at a single reducer) and the replication rate ...

7
November 2015 Theory of Computing Systems: Volume 57 Issue 4, November 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In this paper, we design and analyze parallel algorithms for skyline queries. The skyline of a multidimensional set consists of the points for which no other point exists that is at least as good along every dimension. As a framework for parallel computation, we use both the MP model proposed ...
Keywords: Grid partitioning, Parallel computation, Skyline queries

8 published by ACM
May 2015 SYSTOR '15: Proceedings of the 8th ACM International Systems and Storage Conference
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 32,   Downloads (Overall): 72

Full text available: PDFPDF
An important parameter to be considered in MapReduce algorithms is the "reducer capacity," is introduced here for the first time. The reducer capacity is an upper bound on the sum of the sizes of the inputs that are assigned to the reducer. We consider, for the first time, the different ...

9 published by ACM
May 2015 PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 114

Full text available: PDFPDF
Keywords: Alberto o. Mendelzon test-of-time award

10
August 2014 Proceedings of the VLDB Endowment: Volume 7 Issue 12, August 2014
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Downloads (Overall): 49

Full text available: PDFPDF
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. Complications arise because of repeated attributes, i.e., ...

11
June 2014 Information Systems: Volume 42, June, 2014
Publisher: Elsevier Science Ltd.
Bibliometrics:
Citation Count: 0

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 boundaries between query workloads for which certain even more restricted search ...
Keywords: Bag semantics, Query rewriting, Bag-set semantics, View selection

12 published by ACM
October 2013 IDEAS '13: Proceedings of the 17th International Database Engineering & Applications Symposium
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 1,   Downloads (12 Months): 4,   Downloads (Overall): 116

Full text available: PDFPDF
The all-pairs problem is an input-output relationship where each output corresponds to a pair of inputs, and each pair of inputs has a corresponding output. It models similarity joins where no simplification of the search for similar pairs, e.g., locality-sensitive hashing, is possible, and each input must be compared with ...

13
April 2013 ICDE '13: Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 15

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 triangle, we improve upon the best known such algorithm. We then examine the general case, considering both ...

14
February 2013 Proceedings of the VLDB Endowment: Volume 6 Issue 4, February 2013
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 36
Downloads (6 Weeks): 8,   Downloads (12 Months): 28,   Downloads (Overall): 547

Full text available: PDFPDF
In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not "embarrassingly parallel," the finer we partition the work of the reducers so that more parallelism can be extracted, the greater will be the total communication between mappers and ...

15 published by ACM
October 2012 SoCC '12: Proceedings of the Third ACM Symposium on Cloud Computing
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Downloads (Overall): 652

Full text available: PDFPDF
As MapReduce/Hadoop grows in importance, we find more exotic applications being written this way. Not every program written for this platform performs as well as we might wish. There are several reasons why a MapReduce program can underperform expectations. One is the need to balance the communication cost of transporting ...
Keywords: distributed computing, communication parallelism tradeoff, map-reduce algorithms

16
April 2012 ICDE '12: Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 24

Fuzzy/similarity joins have been widely studied in the research community and extensively used in real-world applications. This paper proposes and evaluates several algorithms for finding all pairs of elements from an input set that meet a similarity threshold. The computation model is a single MapReduce job. Because we allow only ...

17 published by ACM
March 2012 EDBT '12: Proceedings of the 15th International Conference on Extending Database Technology
Publisher: ACM
Bibliometrics:
Citation Count: 14
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 317

Full text available: PDFPDF
Implementing recursive algorithms on computing clusters presents a number of new challenges. In particular, we consider the endgame problem: later rounds of a recursion often transfer only small amounts of data, causing high overhead for interprocessor communication. One way to deal with the endgame problem is to use an algorithm ...
Keywords: Datalog, map-reduce, recursion, polynomial fringe property, transitive closure

18 published by ACM
March 2012 ICDT '12: Proceedings of the 15th International Conference on Database Theory
Publisher: ACM
Bibliometrics:
Citation Count: 23
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 274

Full text available: PDFPDF
In this paper, we design and analyze parallel algorithms for skyline queries. The skyline of a multidimensional set consists of the points for which no other point exists that is at least as good along every dimension. As a framework for parallel computation, we use both the MP model proposed ...
Keywords: database theory, parallel computation, skyline queries

19
November 2011 Journal of Computer and System Sciences: Volume 77 Issue 6, November, 2011
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 1

We consider a workload of aggregate queries and investigate the problem of selecting materialized views that (1) provide equivalent rewritings for all the queries, and (2) are optimal, in that the cost of evaluating the query workload is minimized. We consider conjunctive views and rewritings, with or without aggregation; in ...
Keywords: Aggregate queries, View selection, Rewriting queries using views, Efficient query processing

20 published by ACM
September 2011 IDEAS '11: Proceedings of the 15th Symposium on International Database Engineering & Applications
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 5,   Downloads (Overall): 67

Full text available: PDFPDF
In this paper, we study the problem of finding an equivalent rewriting of an XPath query using multiple views, and we show that the union operator may be required in order to find such a rewriting. In particular, focusing on the fragment of XPath containing both descendant edges and wildcard ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us