BibSLEIGH — Jeffrey_D

Travelled to:

1 × Israel
1 × The Netherlands
1 × United Kingdom
4 × Canada
41 × USA

Collaborated with:

A.V.Aho ∅ Y.Sagiv A.Rajaraman D.Maier M.Y.Vardi A.C.Fong H.Garcia-Molina F.Sadri S.C.Johnson M.S.Hecht M.Yannakakis R.Motwani J.Widom R.Ramakrishnan F.N.Afrati A.D.Sarma S.Brin J.F.Naughton A.M.Keller R.Fagin S.Toueg M.A.Kaplan D.Dolev C.Beeri A.O.Mendelzon R.Yerneni C.Li S.Tsur A.G.Parameswaran A.Y.Levy V.Harinarayan K.A.Morris A.V.Gelder G.M.Kuper J.B.Kam H.B.H.III T.G.Szymanski M.A.Harrison W.L.Ruzzo J.E.Hopcroft M.R.Garey R.L.Graham Y.Papakonstantinou D.Delorey M.Pasumansky S.Salihoglu P.Agrawal J.Gray H.Schek M.Stonebraker C.Silverstein A.Gupta F.Bancilhon H.G.Mairson S.Abiteboul S.Nestorov M.Fang N.Shivakumar K.Karplus A.Siegel A.Strong J.Hammer K.Ireland C.H.Papadimitriou G.Papageorgiou A.Roussou V.Vassalos M.Valiveti C.Clifton A.Rosenthal D.Quass R.Goldman K.Haas Q.Luo J.McHugh H.Rivero J.L.Wiener

Talks about:

databas (10) queri (8) effici (6) data (6) relat (5) implement (4) system (4) inform (4) flow (4) languag (3)

Person: Jeffrey D. Ullman

DBLP: Ullman:Jeffrey_D=

Facilitated 6 volumes:

Contributed to:

2014

2013

2010

2003

2001

1999

1998

1997

1996

1995

1994

1990

1989

1988

1987

1986

1985

1984

1983

1982

1981

1980

1979

1978

1977

1976

1975

1973

1972

1971

1970

1969

Wrote 69 papers:

VLDB-2014-AfratiDPU #query: Storing and Querying Tree-Structured Records in Dremel (FNA, DD, MP, JDU), pp. 1131–1142.
VLDB-2013-AfratiSSU #bound #cost analysis: Upper and Lower Bounds on the Cost of a Map-Reduce Computation (FNA, ADS, SS, JDU), pp. 277–288.
CIKM-2010-ParameswaranGU #recommendation: Evaluating, combining and generalizing recommendations with prerequisites (AGP, HGM, JDU), pp. 919–928.
VLDB-2010-AgrawalSUW #integration: Foundations of Uncertain-Data Integration (PA, ADS, JDU, JW), pp. 1080–1090.
SIGMOD-2003-GraySSU: The Lowell Report (JG, HJS, MS, JDU), p. 680.
SIGMOD-2003-Ullman #education #performance: Improving the Efficiency of Database-System Teaching (JDU), pp. 1–3.
PODS-2001-RajaramanU #query #using: Querying Websites Using Compact Skeletons (AR, JDU).
SIGMOD-1999-YerneniLGU: Computing Capabilities of Mediators (RY, CL, HGM, JDU), pp. 443–454.
SIGMOD-1998-LiYVGPUV: Capability Based Mediation in TSIMMIS (CL, RY, VV, HGM, YP, JDU, MV), pp. 564–566.
SIGMOD-1998-TsurUACMNR #mining #query: Query Flocks: A Generalization of Association-Rule Mining (ST, JDU, SA, CC, RM, SN, AR), pp. 1–12.
VLDB-1998-FangSGMU #query: Computing Iceberg Queries Efficiently (MF, NS, HGM, RM, JDU), pp. 299–310.
VLDB-1998-SilversteinBMU #mining #scalability: Scalable Techniques for Mining Causal Structures (CS, SB, RM, JDU), pp. 594–605.
SIGMOD-1997-BrinMUT: Dynamic Itemset Counting and Implication Rules for Market Basket Data (SB, RM, JDU, ST), pp. 255–264.
KDD-1996-Ullman #implementation #performance: Efficient Implementation of Data Cubes Via Materialized Views (JDU), pp. 386–388.
PODS-1996-LevyRU #query #using: Answering Queries Using Limited External Processors (AYL, AR, JDU), pp. 227–237.
PODS-1996-RajaramanU: Integrating Information by Outerjoins and Full Disjunctions (AR, JDU), pp. 238–248.
SIGMOD-1996-HarinarayanRU #implementation: Implementing Data Cubes Efficiently (VH, AR, JDU), pp. 205–216.
SIGMOD-1996-QuassWGHLMNRRAUW #lightweight #named #repository #semistructured data: LORE: A Lightweight Object REpository for Semistructured Data (DQ, JW, RG, KH, QL, JM, SN, AR, HR, SA, JDU, JLW), p. 549.
PODS-1995-RajaramanSU #query #using: Answering Queries Using Templates with Binding Patterns (AR, YS, JDU), pp. 105–112.
SIGMOD-1995-HammerGIPUW: Information Translation, Mediation, and Mosaic-Based Browsing in the TSIMMIS System (JH, HGM, KI, YP, JDU, JW), p. 483.
PODS-1994-GuptaSUW #constraints: Constraint Checking with Partial Information (AG, YS, JDU, JW), pp. 45–55.
SIGMOD-1990-UllmanY #complexity #transitive: The Input/Output Complexity of Transitive Closure (JDU, MY), pp. 44–53.
PODS-1989-RamakrishnanSUV #program transformation #theorem: Proof-Tree Transformation Theorems and Their Applications (RR, YS, JDU, MYV), pp. 172–181.
PODS-1989-Ullman #bottom-up #datalog #top-down: Bottom-Up Beats Top-Down for Datalog (JDU), pp. 140–149.
SIGMOD-1989-NaughtonRSU #evaluation #performance: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules (JFN, RR, YS, JDU), pp. 235–242.
VLDB-1989-NaughtonRSU #reduction: Argument Reduction by Factoring (JFN, RR, YS, JDU), pp. 173–182.
PODS-1988-UllmanV #complexity: The Complexity of Ordering Subgoals (JDU, MYV), pp. 74–81.
PODS-1987-Ullman #database #past present future: Database Theory: Past and Future (JDU), pp. 1–10.
ICLP-1986-MorrisUG86 #design #exclamation #overview: Design Overview of the NAIL! System (KAM, JDU, AVG), pp. 554–568.
PODS-1986-AfratiPPRSU #convergence #evaluation #query: Convergence of Sideways Query Evaluation (FNA, CHP, GP, AR, YS, JDU), pp. 24–30.
PODS-1986-BancilhonMSU #logic programming #set #source code: Magic Sets and Other Strange Ways to Implement Logic Programs (FB, DM, YS, JDU), pp. 1–15.
SIGMOD-1985-Ullman #database #implementation #logic #query: Implementation of Logical Query Languages for Databases (JDU), p. 444.
PODS-1984-KuperUV #database #equivalence #logic #on the: On the Equivalence of Logical Databases (GMK, JDU, MYV), pp. 221–228.
SIGMOD-1984-KellerU #database #independence #on the: On Complementary and Independent Mappings on Databases (AMK, JDU), pp. 143–148.
STOC-1984-DolevMMU #fault #memory management: Correcting Faults in Write-Once Memory (DD, DM, HGM, JDU), pp. 225–229.
PODS-1983-FaginUV #database #on the #semantics: On the Semantics of Updates in Databases (RF, JDU, MYV), pp. 352–365.
PODS-1983-MaierUV: The Revenge of the JD (DM, JDU, MYV), pp. 279–287.
SIGMOD-1983-MaierU: Fragments of Relations (DM, JDU), pp. 15–22.
STOC-1983-AhoUY #on the: On Notions of Information Transfer in VLSI Circuits (AVA, JDU, MY), pp. 133–139.
PODS-1982-MaierU: Connections in Acyclic Hypergraphs (DM, JDU), pp. 34–39.
PODS-1982-Ullman: The U. R. Strikes Back (JDU), pp. 10–22.
ICALP-1981-Ullman #database #relational: A View of Directions in Relational Database Theory (JDU), pp. 165–176.
STOC-1981-BeeriFMMUY #database: Properties of Acyclic Database Schemes (CB, RF, DM, AOM, JDU, MY), pp. 355–362.
STOC-1981-DolevKSSU: Optimal Wiring between Rectangles (DD, KK, AS, AS, JDU), pp. 312–317.
SIGMOD-1980-SadriU #dependence #functional #interactive: The Interaction between Functional Dependencies and Template Dependencies (FS, JDU), pp. 45–51.
STOC-1980-SadriU #axiom #database #dependence #relational #scalability: A Complete Axiomatization for a Large Class of Dependencies in Relational Databases (FS, JDU), pp. 117–122.
POPL-1979-AhoU #retrieval: The Universality of Data Retrieval Languages (AVA, JDU), pp. 110–120.
STOC-1979-BeeriMSU #database #equivalence #relational: Equivalence of Relational Database Schemes (CB, AOM, YS, JDU), pp. 319–329.
STOC-1979-TouegU #concurrent #network: Deadlock-Free Packet Switching Networks (ST, JDU), pp. 89–98.
POPL-1978-KaplanU #automation: A General Scheme for the Automatic Inference of Variable Types (MAK, JDU), pp. 60–75.
SIGMOD-1978-AhoSU #optimisation #performance #relational: Efficient Optimization of a Class of Relational Expressions (AVA, YS, JDU), p. 39.
POPL-1977-AhoJU #code generation #multi: Code Generation for Machines with Multiregister Operations (AVA, SCJ, JDU), pp. 21–28.
POPL-1976-AhoJU #code generation: Code Generation for Expressions with Common Subexpressions (AVA, SCJ, JDU), pp. 19–31.
POPL-1976-FongU #induction: Induction Variables in Very High Level Languages (ACF, JDU), pp. 104–112.
STOC-1976-FongU #graph: Finding the Depth of a Flow Graph (ACF, JDU), pp. 121–125.
POPL-1975-FongKU #algebra #optimisation: Application of Lattice Algebra to Loop Optimization (ACF, JBK, JDU), pp. 1–9.
POPL-1975-HuntSU #complexity #lr #on the #testing: On the Complexity of LR(k) Testing (HBHI, TGS, JDU), pp. 130–136.
SOSP-1975-HarrisonRU #on the #operating system: On Protection in Operating System (MAH, WLR, JDU), pp. 14–24.
STOC-1975-AhoU #graph: Node Listings for Reducible Flow Graphs (AVA, JDU), pp. 177–185.
POPL-1973-AhoJU #ambiguity #parsing: Deterministic Parsing of Ambiguous Grammars (AVA, SCJ, JDU), pp. 1–21.
POPL-1973-HechtU #algorithm #analysis #problem: Analysis of a Simple Algorithm for Global Flow Problems (MSH, JDU), pp. 207–217.
SOSP-1973-Ullman #polynomial #problem #scheduling: Polynomial Complete Scheduling Problems (JDU), pp. 96–101.
STOC-1973-AhoHU #on the: On Finding Lowest Common Ancestors in Trees (AVA, JEH, JDU), pp. 253–265.
STOC-1972-AhoU #lr #parsing: A Technique for Speeding Up LR(k) Parsers (AVA, JDU), pp. 251–263.
STOC-1972-GareyGU #algorithm #analysis #memory management #worst-case: Worst-Case Analysis of Memory Allocation Algorithms (MRG, RLG, JDU), pp. 143–150.
STOC-1972-HechtU #graph: Flow Graph Reducibility (MSH, JDU), pp. 238–250.
STOC-1971-AhoU #lr: The Care and Feeding of LR(k) Grammars (AVA, JDU), pp. 159–170.
STOC-1970-AhoU: Transformations on Straight Line Programs-Preliminary Version (AVA, JDU), pp. 136–148.
STOC-1969-AhoU #context-free grammar: Translations on a Context Free Grammar (AVA, JDU), pp. 93–112.