Foto N. Afrati

According to our database1, Foto N. Afrati
  • authored at least 124 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Awards

ACM Fellow

ACM Fellow 2014, "For contributions to the theory of database systems.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Report from the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'16).
SIGMOD Record, 2017

GYM: A Multiround Distributed Join Algorithm.
Proceedings of the 20th International Conference on Database Theory, 2017

2016
Assignment Problems of Different-Sized Inputs in MapReduce.
TKDD, 2016

Computing Marginals Using MapReduce: Keynote talk paper.
Proceedings of the 20th International Database Engineering & Applications Symposium, 2016

The ICDT 2016 Test of Time Award Announcement.
Proceedings of the 19th International Conference on Database Theory, 2016

2015
Parallel Skyline Queries.
Theory Comput. Syst., 2015

Handling Skew in Multiway Joins in Parallel Processing.
CoRR, 2015

SharesSkew: An Algorithm to Handle Skew for Joins in MapReduce.
CoRR, 2015

Consistent Answers of Conjunctive Queries on Graphs.
CoRR, 2015

Assignment Problems of Different-Sized Inputs in MapReduce.
CoRR, 2015

Assignment of Different-Sized Inputs in MapReduce.
CoRR, 2015

Meta-MapReduce: A Technique for Reducing Communication in MapReduce Computations.
CoRR, 2015

Computing Marginals Using MapReduce.
CoRR, 2015

Efficient lineage for SUM aggregate queries.
AI Commun., 2015

The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2015.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Lower Bounds on the Communication of XPath Queries in MapReduce.
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), 2015

Assignment of Different-Sized Inputs in MapReduce.
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), 2015

Bounds for Overlapping Interval Join on MapReduce.
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), 2015

Cross-Checking Data Sources in MapReduce.
Proceedings of the New Trends in Databases and Information Systems, 2015

2014
Storing and Querying Tree-Structured Records in Dremel.
PVLDB, 2014

On solving efficiently the view selection problem under bag and bag-set semantics.
Inf. Syst., 2014

GYM: A Multiround Join Algorithm In MapReduce.
CoRR, 2014

Assignment of Different-Sized Inputs in MapReduce.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

2013
Upper and Lower Bounds on the Cost of a Map-Reduce Computation.
PVLDB, 2013

Efficient Lineage for SUM Aggregate Queries.
CoRR, 2013

Matching bounds for the all-pairs MapReduce problem.
Proceedings of the 17th International Database Engineering & Applications Symposium, 2013

Enumerating subgraph instances using map-reduce.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2012
Enumerating Subgraph Instances Using Map-Reduce
CoRR, 2012

Upper and Lower Bounds on the Cost of a Map-Reduce Computation
CoRR, 2012

Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation
CoRR, 2012

Parallel skyline queries.
Proceedings of the 15th International Conference on Database Theory, 2012

Fuzzy Joins Using MapReduce.
Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012

Transitive closure and recursive Datalog implemented on clusters.
Proceedings of the 15th International Conference on Extending Database Technology, 2012

Designing good algorithms for MapReduce and beyond.
Proceedings of the ACM Symposium on Cloud Computing, SOCC '12, 2012

2011
Optimizing Multiway Joins in a Map-Reduce Environment.
IEEE Trans. Knowl. Data Eng., 2011

Determinacy and query rewriting for conjunctive queries and views.
Theor. Comput. Sci., 2011

Selecting and using views to compute aggregate queries.
J. Comput. Syst. Sci., 2011

On the complexity of tree pattern containment with arithmetic comparisons.
Inf. Process. Lett., 2011

Union rewritings for XPath fragments.
Proceedings of the 15th International Database Engineering and Applications Symposium (IDEAS 2011), September 21, 2011

Map-reduce extensions and recursive queries.
Proceedings of the EDBT 2011, 2011

2010
Computing certain answers in the presence of dependencies.
Inf. Syst., 2010

Query containment under bag and bag-set semantics.
Inf. Process. Lett., 2010

A New Framework for Join Product Skew
CoRR, 2010

Managing Lineage and Uncertainty under a Data Exchange Setting.
Proceedings of the Scalable Uncertainty Management - 4th International Conference, 2010

A New Framework for Join Product Skew.
Proceedings of the Resource Discovery - Third International Workshop, 2010

Query Containment for Databases with Uncertainty and Lineage.
Proceedings of the Fourth International VLDB workshop on Management of Uncertain Data (MUD 2010) in conjunction with VLDB 2010, 2010

Optimizing joins in a map-reduce environment.
Proceedings of the EDBT 2010, 2010

Cluster Computing, Recursion and Datalog.
Proceedings of the Datalog Reloaded - First International Workshop, 2010

2009
Repair checking in inconsistent databases: algorithms and complexity.
Proceedings of the Database Theory, 2009

On rewriting XPath queries using views.
Proceedings of the EDBT 2009, 2009

Approximate Rewriting of Queries Using Views.
Proceedings of the Advances in Databases and Information Systems, 2009

2008
Adaptive-sampling algorithms for answering aggregation queries on Web sites.
Data Knowl. Eng., 2008

Answering aggregate queries in data exchange.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Query Answering using Views in the Presence of Dependencies.
Proceedings of the International Workshop on New Trends in Information Integration, 2008

Data exchange: query answering for incomplete data sources.
Proceedings of the 3rd International ICST Conference on Scalable Information Systems, 2008

Data exchange in the presence of arithmetic comparisons.
Proceedings of the EDBT 2008, 2008

On Solving Efficiently the View Selection Problem under Bag-Semantics.
Proceedings of the Business Intelligence for the Real-Time Enterprise, 2008

2007
Using views to generate efficient evaluation plans for queries.
J. Comput. Syst. Sci., 2007

View selection for real conjunctive queries.
Acta Inf., 2007

Rewriting Conjunctive Queries Determined by Views.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
On Approximation Algorithms for Data Mining Applications.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

Foreword to special section on SIGMOD/PODS 2005.
ACM Trans. Database Syst., 2006

Rewriting queries using views in the presence of arithmetic comparisons.
Theor. Comput. Sci., 2006

Designing PTASs for MIN-SUM scheduling problems.
Discrete Applied Mathematics, 2006

Rewriting queries using views with negation.
AI Commun., 2006

Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons.
Proceedings of the Advances in Database Technology, 2006

2005
Datalog programs and their persistency numbers.
ACM Trans. Comput. Log., 2005

Report on PODS 2005.
SIGACT News, 2005

Scheduling trees with large communication delays on two identical processors.
J. Scheduling, 2005

Scheduling in Switching Networks with Set-Up Delays.
J. Comb. Optim., 2005

On relating CTL to Datalog
CoRR, 2005

Designing Views to Efficiently Answer Real SQL Queries.
Proceedings of the Abstraction, 2005

Selecting and Using Views to Compute Aggregate Queries (Extended Abstract).
Proceedings of the Database Theory, 2005

Mining Chains of Relations.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Designing and Using Views to Improve Performance of Aggregate Queries (Extended Abstract).
Proceedings of the Database Systems for Advanced Applications, 2005

Answering aggregation queries on hierarchical web sites using adaptive sampling.
Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31, 2005

2004
Approximating a collection of frequent sets.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

On Containment of Conjunctive Queries with Arithmetic Comparisons.
Proceedings of the Advances in Database Technology, 2004

2003
On temporal logic versus datalog.
Theor. Comput. Sci., 2003

Linearisability on datalog programs.
Theor. Comput. Sci., 2003

Definability and Compression.
Fundam. Inform., 2003

From CTL to Datalog.
Proceedings of the PCK50, 2003

2002
The expressiveness of DAC.
Theor. Comput. Sci., 2002

Answering Queries Using Views with Arithmetic Comparisons.
Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

2001
Generating Efficient Plans for Queries Using Views.
Proceedings of the 2001 ACM SIGMOD international conference on Management of data, 2001

Designing PTASs for MIN-SUM Scheduling Problems.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Change Management, a Critical Success Factor for e-Government.
Proceedings of the 12th International Workshop on Database and Expert Systems Applications (DEXA 2001), 2001

2000
Foreword: Selected Papers from ICDT 1997.
Theor. Comput. Sci., 2000

Definability and Compression.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Scheduling to Minimize the Average Completion Time of Dedicated Tasks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Scheduling Trees with Large Communication Delays on Two Identical Processors.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Scheduling on a Constant Number of Machines.
Proceedings of the Randomization, 1999

Answering Queries Using Materialized Views with Disjunctions.
Proceedings of the Database Theory, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
On Inheritance in Object Oriented Datalog.
Proceedings of the Third International Conference on Integrated Design and Process Technology, IDPT, 1998

1997
Bounded Arity Datalog (not-)Queries on Graphs.
J. Comput. Syst. Sci., 1997

The Expressiveness of Datalog Circuits (DAC).
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Datalog, units and information hiding.
Proceedings of the Actes des journées Langages et Modèles à Objets, 1997

On the Relationship Between Chain Queries and Linear Datalog Programs.
Proceedings of the Fifth International Workshop on Deductive Databases and Logic Programming, 1997

On the Expressiveness of Query Languages with Linear Constraints; Capturing Desirable Spatial Properties.
Proceedings of the Constraint Databases and Their Applications, 1997

1996
On Transformations into Linear Database Logic Programs.
Proceedings of the Perspectives of System Informatics, 1996

1995
On Datalog vs. Polynomial Time.
J. Comput. Syst. Sci., 1995

On the Expressiveness of First-Order Constraint Languages.
Proceedings of the Constraint Databases and Applications, 1995

1994
The Hamilton Circuit Problem on Grids.
ITA, 1994

Linear vs Polynomial Constraints in Database Query Languages.
Proceedings of the Principles and Practice of Constraint Programming, 1994

Bounded Arity Datalog (!=) Queries on Graphs.
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

1993
The Parallel Complexity of Simple Logic Programs.
J. ACM, 1993

Performance Considerations on a Random Graph Model for Parallel Processing.
ITA, 1993

1992
The Parallel Complexity of Single Rule Logic Programs.
Discrete Applied Mathematics, 1992

The parallel complexity of single rule logic programs.
Proceedings of the CNKBS'92, 1992

1991
On Datalog vs. Polynomial Time.
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

1990
A Hypertext Model Supporting Query Mechanisms.
Proceedings of the Hypertext: Concepts, 1990

1989
Corrigendum: The Complexity of Cubical Graphs
Inf. Comput., September, 1989

On the Convergence of Query Evaluation.
J. Comput. Syst. Sci., 1989

Expressiveness of Restricted Recursive Queries (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988
The Synthesis of Communication Protocols.
Algorithmica, 1988

Scheduling Dags to Minimize Time and Communication.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
The Parallel Complexity of Simple Chain Queries.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986
The Complexity of the Travelling Repairman Problem.
ITA, 1986

Convergence of Sideways Query Evaluation.
Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

The Synthesis of Communication Protocols.
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

1985
The Complexity of Cubical Graphs
Information and Control, 1985

1984
The Complexity of Cubical Graphs (Extended Abstract).
Proceedings of the Automata, 1984


  Loading...