Foto N. Afrati

Loading Google Thumbnails...
2011
1 Optimizing Multiway Joins in a Map-Reduce Environment. Foto N. Afrati, Jeffrey D. Ullman. IEEE Trans. Knowl. Data Eng. (23): 1282-1298 (2011). Web SearchBibTeXDownload
2 Selecting and using views to compute aggregate queries. Foto N. Afrati, Rada Chirkova. J. Comput. Syst. Sci. (77): 1079-1107 (2011). Web SearchBibTeXDownload
3 Union rewritings for XPath fragments. Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis. IDEAS 2011, 43-51. Web SearchBibTeXDownload
4 On the complexity of tree pattern containment with arithmetic comparisons. Foto N. Afrati, Sara Cohen, Gabriel M. Kuper. Inf. Process. Lett. (111): 754-760 (2011). Web SearchBibTeXDownload
5 Map-reduce extensions and recursive queries. Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman. EDBT 2011, 1-8. Web SearchBibTeXDownload
6 Determinacy and query rewriting for conjunctive queries and views. Foto N. Afrati. Theor. Comput. Sci. (412): 1005-1021 (2011). Web SearchBibTeXDownload
2010
1 Optimizing joins in a map-reduce environment. Foto N. Afrati, Jeffrey D. Ullman. EDBT 2010, 99-110. Web SearchBibTeXDownload
2 A New Framework for Join Product Skew. Foto N. Afrati, Victor Kyritsis, Paraskevas V. Lekeas, Dora Souliou. CoRR (abs/1005.5732) (2010). Web SearchBibTeXDownload
3 Query Containment for Databases with Uncertainty and Lineage. Foto N. Afrati, Angelos Vasilakopoulos. MUD 2010, 67-81. Web SearchBibTeXDownload
4 Managing Lineage and Uncertainty under a Data Exchange Setting. Foto N. Afrati, Angelos Vasilakopoulos. SUM 2010, 28-41. Web SearchBibTeXDownload
5 Computing certain answers in the presence of dependencies. Foto N. Afrati, Nikos Kiourtis. Inf. Syst. (35): 149-169 (2010). Web SearchBibTeXDownload
6 Cluster Computing, Recursion and Datalog. Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman. Datalog 2010, 120-144. Web SearchBibTeXDownload
7 Query containment under bag and bag-set semantics. Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis. Inf. Process. Lett. (110): 360-369 (2010). Web SearchBibTeXDownload
2009
1 Repair checking in inconsistent databases: algorithms and complexity. Foto N. Afrati, Phokion G. Kolaitis. ICDT 2009, 31-41. Cited by 6Web SearchBibTeXDownload
2 Approximate Rewriting of Queries Using Views. Foto N. Afrati, Manik Chandrachud, Rada Chirkova, Prasenjit Mitra. ADBIS 2009, 164-178. Cited by 2Web SearchBibTeXDownload
3 On rewriting XPath queries using views. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv. EDBT 2009, 168-179. Web SearchBibTeXDownload
2008
1 Answering aggregate queries in data exchange. Foto N. Afrati, Phokion G. Kolaitis. PODS 2008, 129-138. Cited by 10Web SearchBibTeXDownload
2 Query Answering using Views in the Presence of Dependencies. Foto N. Afrati, Nikos Kiourtis. NTII 2008, 8-11. Cited by 1Web SearchBibTeXDownload
3 Adaptive-sampling algorithms for answering aggregation queries on Web sites. Foto N. Afrati, Paraskevas V. Lekeas, Chen Li. Data Knowl. Eng. (64): 462-490 (2008). Web SearchBibTeXDownload
4 Data exchange in the presence of arithmetic comparisons. Foto N. Afrati, Chen Li, Vassia Pavlaki. EDBT 2008, 487-498. Web SearchBibTeXDownload
5 On Solving Efficiently the View Selection Problem under Bag-semantics. Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis. BIRTE (Informal Proceedings) 2008. Web SearchBibTeXDownload
2007
1 Using views to generate efficient evaluation plans for queries. Foto N. Afrati, Chen Li, Jeffrey D. Ullman. J. Comput. Syst. Sci. (73): 703-724 (2007). Cited by 5Web SearchBibTeXDownload
2 View selection for real conjunctive queries. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki. Acta Inf. (44): 289-321 (2007). Cited by 3Web SearchBibTeXDownload
3 Rewriting Conjunctive Queries Determined by Views. Foto N. Afrati. MFCS 2007, 78-89. Cited by 2Web SearchBibTeXDownload
2006
1 Rewriting queries using views in the presence of arithmetic comparisons. Foto N. Afrati, Chen Li, Prasenjit Mitra. Theor. Comput. Sci. (368): 88-123 (2006). Cited by 13Web SearchBibTeXDownload
2 Rewriting queries using views with negation. Foto N. Afrati, Vassia Pavlaki. AI Commun. (19): 229-237 (2006). Cited by 7Web SearchBibTeXDownload
3 Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki. EDBT 2006, 942-960. Cited by 6Web SearchBibTeXDownload
4 Designing PTASs for MIN-SUM scheduling problems. Foto N. Afrati, Ioannis Milis. Discrete Applied Mathematics (154): 622-639 (2006). Cited by 4Web SearchBibTeXDownload
5 Foreword to special section on SIGMOD/PODS 2005. Foto N. Afrati, Jennifer Widom. ACM Trans. Database Syst. (31): 1417 (2006). Web SearchBibTeXDownload
2005
1 Selecting and Using Views to Compute Aggregate Queries (Extended Abstract). Foto N. Afrati, Rada Chirkova. ICDT 2005, 383-397. Cited by 38Web SearchBibTeXDownload
2 Scheduling in Switching Networks with Set-Up Delays. Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis. J. Comb. Optim. (9): 49-57 (2005). Cited by 14Web SearchBibTeXDownload
3 Designing and Using Views to Improve Performance of Aggregate Queries (Extended Abstract). Foto N. Afrati, Rada Chirkova, Shalu Gupta, Charles Loftis. DASFAA 2005, 548-554. Cited by 5Web SearchBibTeXDownload
4 Mining Chains of Relations. Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas. ICDM 2005, 553-556. Cited by 4Web SearchBibTeXDownload
5 Datalog programs and their persistency numbers. Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos. ACM Trans. Comput. Log. (6): 481-518 (2005). Cited by 4Web SearchBibTeXDownload
6 Scheduling trees with large communication delays on two identical processors. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis. J. Scheduling (8): 179-190 (2005). Cited by 1Web SearchBibTeXDownload
7 Answering aggregation queries on hierarchical web sites using adaptive sampling. Foto N. Afrati, Paraskevas V. Lekeas, Chen Li. CIKM 2005, 237-238. Cited by 1Web SearchBibTeXDownload
8 Designing Views to Efficiently Answer Real SQL Queries. Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki. SARA 2005, 332-346. Web SearchBibTeXDownload
9 On relating CTL to Datalog. Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, Eugénie Foustoucos, Irène Guessarian. CoRR (abs/cs/0510012) (2005). Web SearchBibTeXDownload
10 Report on PODS 2005. Foto N. Afrati. SIGACT News (36): 39-40 (2005). Web SearchBibTeXDownload
2004
1 Approximating a collection of frequent sets. Foto N. Afrati, Aristides Gionis, Heikki Mannila. KDD 2004, 12-19. Cited by 64Web SearchBibTeXDownload
2 On Containment of Conjunctive Queries with Arithmetic Comparisons. Foto N. Afrati, Chen Li, Prasenjit Mitra. EDBT 2004, 459-476. Cited by 21Web SearchBibTeXDownload
2003
1 Definability and Compression. Foto N. Afrati, Hans Leiß, Michel de Rougemont. Fundam. Inform. (56): 155-180 (2003). Cited by 5Web SearchBibTeXDownload
2 Linearisability on datalog programs. Foto N. Afrati, Manolis Gergatsoulis, Francesca Toni. Theor. Comput. Sci. (308): 199-226 (2003). Cited by 4Web SearchBibTeXDownload
3 On temporal logic versus datalog. Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati. Theor. Comput. Sci. (1): 103-133 (2003). Cited by 2Web SearchBibTeXDownload
4 From CTL to Datalog. Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, E. Foustoukos, Irène Guessarian. PCK50 2003, 72-85. Cited by 1Web SearchBibTeX
2002
1 Answering Queries Using Views with Arithmetic Comparisons. Foto N. Afrati, Chen Li, Prasenjit Mitra. PODS 2002, 209-220. Cited by 42Web SearchBibTeXDownload
2 The expressiveness of DAC. Foto N. Afrati, Irène Guessarian, Michel de Rougemont. Theor. Comput. Sci. (286): 3-32 (2002). Web SearchBibTeXDownload
2001
1 Generating Efficient Plans for Queries Using Views. Foto N. Afrati, Chen Li, Jeffrey D. Ullman. SIGMOD Conference 2001, 319-330. Cited by 62Web SearchBibTeXDownload
2 Change Management, a Critical Success Factor for e-Government. Agis Papantoniou, Ezz Hattab, Foto N. Afrati, Eleftherios Kayafas, Vassilis Loumos. DEXA Workshop 2001, 402-406. Cited by 10Web SearchBibTeX
3 Designing PTASs for MIN-SUM Scheduling Problems. Foto N. Afrati, Ioannis Milis. FCT 2001, 432-444. Web SearchBibTeXDownload
2000
1 Scheduling to Minimize the Average Completion Time of Dedicated Tasks. Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon. FSTTCS 2000, 454-464. Cited by 24Web SearchBibTeXDownload
2 Definability and Compression. Foto N. Afrati, Hans Leiß, Michel de Rougemont. LICS 2000, 63-73. Cited by 5Web SearchBibTeXDownload
3 Scheduling Trees with Large Communication Delays on Two Identical Processors. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis. Euro-Par 2000, 288-295. Cited by 2Web SearchBibTeXDownload
4 Foreword: Selected Papers from ICDT 1997. Foto N. Afrati, Phokion G. Kolaitis. Theor. Comput. Sci. (239): 187 (2000). Web SearchBibTeXDownload
1999
1 Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko. FOCS 1999, 32-44. Cited by 123Web SearchBibTeXDownload
2 Answering Queries Using Materialized Views with Disjunctions. Foto N. Afrati, Manolis Gergatsoulis, Theodoros G. Kavalieros. ICDT 1999, 435-452. Cited by 52Web SearchBibTeXDownload
3 Scheduling on a Constant Number of Machines. Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis. RANDOM-APPROX 1999, 281-287. Web SearchBibTeXDownload
1998
1 On Inheritance in Object Oriented Datalog. Foto N. Afrati, Isambo Karali, Theodoros Mitakos. IADT 1998, 280-289. Cited by 2Web SearchBibTeX
1997
1 On the Expressiveness of Query Languages with Linear Constraints; Capturing Desirable Spatial Properties. Foto N. Afrati, Theodore Andronikos, Theodore G. Kavalieros. CDB 1997, 105-115. Cited by 8Web SearchBibTeXDownload
2 On the Relationsship Between Chain Queries and Linear Datalog Programs. Foto N. Afrati, Francesca Toni. DDLP 1997. Cited by 1Web SearchBibTeX
3 Datalog, units and information hiding. Foto N. Afrati, Isambo Karali, Theodoros Mitakos. LMO 1997, 147-159. Web SearchBibTeX
4 Bounded Arity Datalog (not-)Queries on Graphs. Foto N. Afrati. J. Comput. Syst. Sci. (55): 210-228 (1997). Web SearchBibTeXDownload
5 The Expressiveness of Datalog Circuits (DAC). Foto N. Afrati, Irène Guessarian, Michel de Rougemont. MFCS 1997, 119-128. Web SearchBibTeXDownload
1996
1 On Transformations into Linear Database Logic Programs. Foto N. Afrati, Manolis Gergatsoulis, Maria Katzouraki. Ershov Memorial Conference 1996, 433-444. Web SearchBibTeXDownload
1995
1 On Datalog vs. Polynomial Time. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis. J. Comput. Syst. Sci. (51): 177-196 (1995). Cited by 64Web SearchBibTeXDownload
2 On the Expressiveness of First-Order Constraint Languages. Foto N. Afrati, Theodoros Andronikos, Theodoros G. Kavalieros. CDB 1995, 22-39. Cited by 18Web SearchBibTeXDownload
1994
1 Linear vs Polynomial Constraints in Database Query Languages. Foto N. Afrati, Stavros S. Cosmadakis, Stéphane Grumbach, Gabriel M. Kuper. PPCP 1994, 181-192. Cited by 78Web SearchBibTeXDownload
2 Bounded Arity Datalog (!=) Queries on Graphs. Foto N. Afrati. PODS 1994, 97-106. Cited by 8Web SearchBibTeX
3 The Hamilton Circuit Problem on Grids. Foto N. Afrati. ITA (28): 567-582 (1994). Cited by 2Web SearchBibTeX
1993
1 The Parallel Complexity of Simple Logic Programs. Foto N. Afrati, Christos H. Papadimitriou. J. ACM (40): 891-916 (1993). Cited by 13Web SearchBibTeXDownload
2 Performance Considerations on a Random Graph Model for Parallel Processing. Foto N. Afrati, Andreas Stafylopatis. ITA (27): 367-388 (1993). Cited by 1Web SearchBibTeX
1992
1 The parallel complexity of single rule logic programs. Foto N. Afrati. CNKBS 1992, 41-43. Web SearchBibTeX
2 The Parallel Complexity of Single Rule Logic Programs. Foto N. Afrati. Discrete Applied Mathematics (40): 107-126 (1992). Web SearchBibTeX
1991
1 On Datalog vs. Polynomial Time. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis. PODS 1991, 13-25. Cited by 64Web SearchBibTeX
1990
1 A Hypertext Model Supporting Query Mechanisms. Foto N. Afrati, Constantinos D. Koutras. ECHT 1990, 52-66. Cited by 40Web SearchBibTeX
1989
1 Expressiveness of Restricted Recursive Queries (Extended Abstract). Foto N. Afrati, Stavros S. Cosmadakis. STOC 1989, 113-126. Cited by 51Web SearchBibTeXDownload
2 On the Convergence of Query Evaluation. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman. J. Comput. Syst. Sci. (38): 341-359 (1989). Cited by 10Web SearchBibTeXDownload
3 Corrigendum: The Complexity of Cubical Graphs. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. Inf. Comput. (82): 350-353 (1989). Web SearchBibTeXDownload
1988
1 Scheduling Dags to Minimize Time and Communication. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. AWOC 1988, 134-138. Cited by 11Web SearchBibTeXDownload
2 The Synthesis of Communication Protocols. Foto N. Afrati, Christos H. Papadimitriou, Georgios I. Papadimitriou. Algorithmica (3): 451-472 (1988). Cited by 5Web SearchBibTeXDownload
1987
1 The Parallel Complexity of Simple Chain Queries. Foto N. Afrati, Christos H. Papadimitriou. PODS 1987, 210-213. Cited by 40Web SearchBibTeX
1986
1 Convergence of Sideways Query Evaluation. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman. PODS 1986, 24-30. Cited by 12Web SearchBibTeX
2 The Synthesis of Communication Protocols. Foto N. Afrati, Christos H. Papadimitriou, Georgios I. Papadimitriou. PODC 1986, 263-271. Cited by 5Web SearchBibTeX
3 The Complexity of the Travelling Repairman Problem. Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou. ITA (20): 79-87 (1986). Cited by 2Web SearchBibTeX
1985
1 The Complexity of Cubical Graphs. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. Information and Control (66): 53-60 (1985). Cited by 13Web SearchBibTeXDownload
1984
1 The Complexity of Cubical Graphs (Extended Abstract). Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. ICALP 1984, 51-57. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-22 - details
2. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-21 - details
3. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - PODs Program Committee - Retrieved 2009-11-21 - details
4. ^ KDD 2006 Conference - Organizers - Retrieved 2011-03-19 - details
5. ^ Untitled Document - Retrieved 2011-02-11 - details
6. ^ Untitled Document - Retrieved 2011-02-11 - details
7. ^ Untitled Document - Retrieved 2011-02-11 - details
8. ^ SIGMOD/PODS 2003 Conference - Retrieved 2011-03-19 - details
9. ^ Untitled Document - Retrieved 2011-02-11 - details
10. ^ SIGMOD/PODS 2003 Conference - Retrieved 2011-03-19 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research