Academic Appointments


2017-18 Courses


All Publications


  • Experiments as Research Validation: Have We Gone Too Far? COMMUNICATIONS OF THE ACM Ullman, J. D. 2015; 58 (9): 37-39

    View details for DOI 10.1145/2699405

    View details for Web of Science ID 000360214000015

  • Brief Announcement: Assignment of Different-Sized Inputs in MapReduce 28th International Symposium on Distributed Computing Afrati, F., Dolev, S., Korach, E., Sharma, S., Ullman, J. D. SPRINGER-VERLAG BERLIN. 2014: 536–537
  • Fuzzy Joins Using MapReduce 28th IEEE International Conference on Data Engineering (ICDE) Afrati, F. N., Das Sarma, A., Menestrina, D., Parameswaran, A., Ullman, J. D. IEEE. 2012: 498–509
  • Optimizing Multiway Joins in a Map-Reduce Environment IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING Afrati, F. N., Ullman, J. D. 2011; 23 (9): 1282-1298
  • Cluster Computing, Recursion and Datalog 1st International Workshop on Datalog Reloaded (Datalog) Afrati, F. N., Borkar, V., Carey, M., Polyzotis, N., Ullman, J. D. SPRINGER. 2011: 120–144
  • Using views to generate efficient evaluation plans for queries JOURNAL OF COMPUTER AND SYSTEM SCIENCES Afrati, F. N., Li, C., Ullman, J. D. 2007; 73 (5): 703-724
  • The Lowell database - Research self assessment COMMUNICATIONS OF THE ACM Abiteboul, S., Agrawal, R., Bernstein, P., Carey, M., Ceri, S., Croft, B., DeWitt, D., Franklin, M., Molina, H. G., Gawlick, D., Gray, J., Haas, L., Halevy, A., Hellerstein, J., Ioannidis, Y., Kersten, M., Pazzani, M., Lesk, M., Maier, D., Naughton, J., Schek, H., Sellis, T., Silberschatz, A., Snodgrass, R., Ullman, J., Weikum, G., Widom, J., Zdonik, S. 2005; 48 (5): 111-118
  • Querying websites using compact skeletons 20th Symposium on Principles of Database Systems Rajaraman, A., Ullman, J. D. ACADEMIC PRESS INC ELSEVIER SCIENCE. 2003: 809–51
  • A survey of new directions in database systems 8th International Conference on Database Systems for Advanced Applications Ullman, J. D. IEEE COMPUTER SOC. 2003: 3–3
  • Generating efficient plans for queries using views ACM SIGMOD International Conference on Management of Data Afrati, F. N., Li, C., ULLMAN, J. D. ASSOC COMPUTING MACHINERY. 2001: 319–30
  • Minimizing view sets without losing query-answering power 8th International Conference on Database Theory (ICDT 2001) Li, C., Bawa, M., ULLMAN, J. D. SPRINGER-VERLAG BERLIN. 2001: 99–113
  • Finding interesting associations without support pruning 16th International Conference on Data Engineering (ICDE 2000) Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., ULLMAN, J. D., Yang, C. IEEE COMPUTER SOC. 2001: 64–78
  • Scalable techniques for mining causal structures DATA MINING AND KNOWLEDGE DISCOVERY Silverstein, C., Brin, S., Motwani, R., Ullman, J. 2000; 4 (2-3): 163-192
  • Information integration using logical views 6th International Conference on Database Theory (ICDT 97) ULLMAN, J. D. ELSEVIER SCIENCE BV. 2000: 189–210
  • Answering queries using limited external query processors 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems Levy, A. Y., Rajaraman, A., Ullman, J. D. ACADEMIC PRESS INC ELSEVIER SCIENCE. 1999: 69–82
  • Computing capabilities of mediators 1999 ACM SIGMOD International Conference on Management of Data Yerneni, R., Li, C., Garcia-Molina, H., Ullman, J. ASSOC COMPUTING MACHINERY. 1999: 443–454
  • Optimizing large join queries in mediation systems 7th International Conference on Database Theory (ICDT 99) Yerneni, R., Li, C., Ullman, J., Garcia-Molina, H. SPRINGER-VERLAG BERLIN. 1999: 348–364
  • Information integration using logical views 6th International Conference on Database Theory ULLMAN, J. D. SPRINGER-VERLAG BERLIN. 1997: 19–40
  • Representative objects: Concise representations of semistructured, hierarchical data 13th International Conference on Data Engineering Nestorov, S., Ullman, J., Wiener, J., Chawathe, S. IEEE COMPUTER SOC. 1997: 79–90
  • Index selection for OLAP 13th International Conference on Data Engineering Gupta, H., Harinarayan, V., Rajaraman, A., ULLMAN, J. D. IEEE COMPUTER SOC. 1997: 208–219
  • Medmaker: A mediation system based on declarative specifications 12th IEEE International Conference on Data Engineering Papakonstantinou, Y., GARCIAMOLINA, H., Ullman, J. I E E E, COMPUTER SOC PRESS. 1996: 132–141
  • The database approach to knowledge representation 13th National Conference on Artificial Intelligence (AAAI 96) / 8th Conference on Innovative Applications of Artificial Intelligence (IAAI 96) ULLMAN, J. D. ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE. 1996: 1346–1348
  • ARGUMENT REDUCTION BY FACTORING THEORETICAL COMPUTER SCIENCE Naughton, J. F., Ramakrishnan, R., Sagiv, Y., ULLMAN, J. D. 1995; 146 (1-2): 269-310
  • A SURVEY OF DEDUCTIVE DATABASE-SYSTEMS JOURNAL OF LOGIC PROGRAMMING Ramakrishnan, R., ULLMAN, J. D. 1995; 23 (2): 125-149
  • THE ROLE OF THEORY TODAY ACM COMPUTING SURVEYS ULLMAN, J. D. 1995; 27 (1): 43-44
  • A VERSION NUMBERING SCHEME WITH A USEFUL LEXICOGRAPHICAL ORDER 11th International Conference on Data Engineering Keller, A. M., ULLMAN, J. D. I E E E, COMPUTER SOC PRESS. 1995: 240–248
  • LOGICAL QUERY OPTIMIZATION BY PROOF-TREE TRANSFORMATION JOURNAL OF COMPUTER AND SYSTEM SCIENCES Ramakrishnan, R., Sagiv, Y., ULLMAN, J. D., Vardi, M. Y. 1993; 47 (1): 222-248
  • NEW FRONTIERS IN DATABASE SYSTEM RESEARCH LECTURE NOTES IN COMPUTER SCIENCE ULLMAN, J. D. 1992; 653: 87-101
  • HIGH-PROBABILITY PARALLEL TRANSITIVE-CLOSURE ALGORITHMS SIAM JOURNAL ON COMPUTING ULLMAN, J. D., Yannakakis, M. 1991; 20 (1): 100-125
  • A COMPARISON BETWEEN DEDUCTIVE AND OBJECT-ORIENTED DATABASE-SYSTEMS 2ND INTERNATIONAL CONF ON DEDUCTIVE AND OBJECT-ORIENTED DATABASES ( DOOD 91 ) ULLMAN, J. D. SPRINGER VERLAG. 1991: 263–277
  • HIGH-PROBABILITY PARALLEL TRANSITIVE CLOSURE ALGORITHMS 2ND ANNUAL SYMP OF THE ASSOC FOR COMPUTING MACHINERY : PARALLEL ALGORITHMS AND ARCHITECTURES ( SPAA 90 ) / AEGEAN WORKSHOP ON COMPUTING ULLMAN, J. D., Yannakakis, M. ASSOC COMPUTING MACHINERY. 1990: 200–209
  • THE INPUT OUTPUT COMPLEXITY OF TRANSITIVE CLOSURE 1990 INTERNATIONAL CONF ON MANAGEMENT DATA ULLMAN, J. D., Yannakakis, M. ASSOC COMPUTING MACHINERY. 1990: 44–53
  • AN OPTIMAL SYNCHRONIZER FOR THE HYPERCUBE SIAM JOURNAL ON COMPUTING Peleg, D., ULLMAN, J. D. 1989; 18 (4): 740-747
  • ON THE CONVERGENCE OF QUERY EVALUATION JOURNAL OF COMPUTER AND SYSTEM SCIENCES Afrati, F., Papadimitriou, C. H., Papageorgiou, G., Roussou, A., Sagiv, Y., ULLMAN, J. D. 1989; 38 (2): 341-359
  • EFFICIENT EVALUATION OF RIGHT-LINEAR, LEFT-LINEAR, AND MULTILINEAR RULES INTERNATIONAL CONF ON THE MANAGEMENT OF DATA Naughton, J. F., Ramakrishnan, R., Sagiv, Y., ULLMAN, J. D. ASSOC COMPUTING MACHINERY. 1989: 235–242
  • ARGUMENT REDUCTION BY FACTORING 15TH INTERNATIONAL CONF ON VERY LARGE DATA BASES Naughton, J. F., Ramakrishnan, R., Sagiv, Y., ULLMAN, J. D. MORGAN KAUFMANN PUB INC. 1989: 173–182
  • EFFICIENT TESTS FOR TOP-DOWN TERMINATION OF LOGICAL RULES JOURNAL OF THE ACM ULLMAN, J. D., VANGELDER, A. 1988; 35 (2): 345-373
  • PARALLEL COMPLEXITY OF LOGICAL QUERY PROGRAMS ALGORITHMICA ULLMAN, J. D., VANGELDER, A. 1988; 3 (1): 5-42
  • A COMMUNICATION-TIME TRADEOFF SIAM JOURNAL ON COMPUTING Papadimitriou, C. H., ULLMAN, J. D. 1987; 16 (4): 639-646
  • ALGORITHMS FOR THE COMPILATION OF REGULAR EXPRESSIONS INTO PLAS ALGORITHMICA Karlin, A. R., TRICKEY, H. W., ULLMAN, J. D. 1987; 2 (3): 283-314
  • DESIGN OVERVIEW OF THE NAIL - SYSTEM LECTURE NOTES IN COMPUTER SCIENCE Morris, K., ULLMAN, J. D., VANGELDER, A. 1986; 225: 554-568
  • IMPLEMENTATION OF LOGICAL QUERY LANGUAGES FOR DATABASES ACM TRANSACTIONS ON DATABASE SYSTEMS ULLMAN, J. D. 1985; 10 (3): 289-321
  • CONNECTIONS IN ACYCLIC HYPERGRAPHS THEORETICAL COMPUTER SCIENCE Maier, D., ULLMAN, J. D. 1984; 32 (1-2): 185-199
  • FLUX, SORTING, AND SUPERCOMPUTER ORGANIZATION FOR AL APPLICATIONS JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING ULLMAN, J. D. 1984; 1 (2): 133-151
  • SYSTEM/U - A DATABASE SYSTEM BASED ON THE UNIVERSAL RELATION ASSUMPTION ACM TRANSACTIONS ON DATABASE SYSTEMS Korth, H. F., Kuper, G. M., Feigenbaum, J., VANGELDER, A., ULLMAN, J. D. 1984; 9 (3): 331-347
  • ON THE FOUNDATIONS OF THE UNIVERSAL RELATION MODEL ACM TRANSACTIONS ON DATABASE SYSTEMS Maier, D., ULLMAN, J. D., Vardi, M. Y. 1984; 9 (2): 283-308
  • TOOLS FOR TEMPLATE DEPENDENCIES SIAM JOURNAL ON COMPUTING Fagin, R., Maier, D., ULLMAN, J. D., Yannakakis, M. 1983; 12 (1): 36-59
  • MAXIMAL OBJECTS AND THE SEMANTICS OF UNIVERSAL RELATION DATABASES ACM TRANSACTIONS ON DATABASE SYSTEMS Maier, D., ULLMAN, J. D. 1983; 8 (1): 1-14
  • THE THEORY OF FUNCTIONAL AND TEMPLATE DEPENDENCIES THEORETICAL COMPUTER SCIENCE Sadri, F., ULLMAN, J. D. 1982; 17 (3): 317-331
  • TEMPLATE DEPENDENCIES - A LARGE CLASS OF DEPENDENCIES IN RELATIONAL DATABASES AND ITS COMPLETE AXIOMATIZATION JOURNAL OF THE ACM Sadri, F., ULLMAN, J. D. 1982; 29 (2): 363-372
  • BOUNDS ON THE SIZE AND TRANSMISSION RATE OF COMMUNICATIONS PROTOCOLS COMPUTERS & MATHEMATICS WITH APPLICATIONS Aho, A. V., WYNER, A. D., Yannakakis, M., ULLMAN, J. D. 1982; 8 (3): 205-214
  • THE COMPILATION OF REGULAR EXPRESSIONS INTO INTEGRATED-CIRCUITS JOURNAL OF THE ACM FLOYD, R. W., ULLMAN, J. D. 1982; 29 (3): 603-622
  • A SIMPLIFIED UNIVERSAL RELATION ASSUMPTION AND ITS PROPERTIES ACM TRANSACTIONS ON DATABASE SYSTEMS Fagin, R., Mendelzon, A. O., ULLMAN, J. D. 1982; 7 (3): 343-360
  • DEADLOCK-FREE PACKET SWITCHING-NETWORKS SIAM JOURNAL ON COMPUTING Toueg, S., ULLMAN, J. D. 1981; 10 (3): 594-611
  • EQUIVALENCE OF RELATIONAL DATABASE SCHEMES SIAM JOURNAL ON COMPUTING Beeri, C., Mendelzon, A. O., Sagiv, Y., ULLMAN, J. D. 1981; 10 (2): 352-370
  • INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS SIAM JOURNAL ON COMPUTING Aho, A. V., Sagiv, Y., SZYMANSKI, T. G., ULLMAN, J. D. 1981; 10 (3): 405-421
  • ADEQUACY OF DECOMPOSITIONS OF RELATIONAL DATABASES JOURNAL OF COMPUTER AND SYSTEM SCIENCES Maier, D., Mendelzon, A. O., Sadri, F., ULLMAN, J. D. 1980; 21 (3): 368-379
  • EQUIVALENCES AMONG RELATIONAL EXPRESSIONS SIAM JOURNAL ON COMPUTING Aho, A. V., Sagiv, Y., ULLMAN, J. D. 1979; 8 (2): 218-246
  • CODE GENERATION FOR EXPRESSIONS WITH COMMON SUB-EXPRESSIONS JOURNAL OF THE ACM Aho, A. V., Johnson, S. C., ULLMAN, J. D. 1977; 24 (1): 146-160
  • OPERATIONS ON SPARSE RELATIONS COMMUNICATIONS OF THE ACM Hunt, H. B., SZYMANSKI, T. G., ULLMAN, J. D. 1977; 20 (3): 171-176
  • NODE LISTINGS FOR REDUCIBLE FLOW GRAPHS JOURNAL OF COMPUTER AND SYSTEM SCIENCES Aho, A. V., ULLMAN, J. D. 1976; 13 (3): 286-299
  • BOUNDS ON COMPLEXITY OF LONGEST COMMON SUBSEQUENCE PROBLEM JOURNAL OF THE ACM Aho, A. V., Hirschberg, D. S., ULLMAN, J. D. 1976; 23 (1): 1-12
  • DETERMINISTIC PARSING OF AMBIGUOUS GRAMMARS COMMUNICATIONS OF THE ACM Aho, A. V., Johnson, S. C., ULLMAN, J. D. 1975; 18 (8): 441-452
  • COMPLEXITY OF LR(K) TESTING COMMUNICATIONS OF THE ACM Hunt, H. B., SZYMANSKI, T. G., ULLMAN, J. D. 1975; 18 (12): 707-716
  • DYNAMIC MEMORIES WITH RAPID RANDOM AND SEQUENTIAL ACCESS IEEE TRANSACTIONS ON COMPUTERS Aho, A. V., ULLMAN, J. D. 1974; C 23 (3): 272-276
  • LINEAR PRECEDENCE FUNCTIONS FOR WEAK PRECEDENCE GRAMMARS INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS Aho, A. V., ULLMAN, J. D. 1972; 3 (2-3): 149-155
  • TRANSLATIONS ON A CONTEXT FREE GRAMMAR INFORMATION AND CONTROL Aho, A. V., ULLMAN, J. D. 1971; 19 (5): 439-?