Yehoshua Sagiv Online DBLP entries are available for Yehoshua Sagiv and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.) Werner Nutt, Yehoshua Sagiv, Sara Shurin: Deciding Equivalences Among Aggregate Queries. PODS 1998: 214-223 Yakov A. Kogan, David Michaeli, Yehoshua Sagiv, Oded Shmueli: Utilizing the Multiple Facets of WWW Contents. DKE 28(3): 255-275 (1998) Naomi Lindenstrauss, Yehoshua Sagiv, A. Serebrenik: TermiLog: A System for Checking Termination of Queries to Logic Programs. CAV 1997: 444-447 Naomi Lindenstrauss, Yehoshua Sagiv: Automatic Termination Analysis of Logic Programs. ICLP 1997: 63-77 Yakov A. Kogan, David Michaeli, Yehoshua Sagiv, Oded Shmueli: Utilizing the Multiple Facets of WWW Contents. NGITS 1997: 0- Alon Y. Levy, Richard Fikes, Yehoshua Sagiv: Speeding up Inferences Using Relevance Reasoning: A Formalism and Algorithms. Artificial Intelligence 97(1-2): 83-136 (1997) Kenneth A. Ross, Yehoshua Sagiv: Monotonic Aggregation in Deductive Database. JCSS 54(1): 79-97 (1997) Hector Garcia-Molina, Yannis Papakonstantinou, Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Vasilis Vassalos, Jennifer Widom: The TSIMMIS Approach to Mediation: Data Models and Languages. JIIS 8(2): 117-132 (1997) Joachim Biskup, Ralf Menzel, Torsten Polle, Yehoshua Sagiv: Decomposition of Relationships through Pivoting. ER 1996: 28-41 Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: Querying Semistructured Heterogeneous Information. DOOD 1995: 319-344 Hector Garcia-Molina, Dallan Quass, Yannis Papakonstantinou, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: The TSIMMIS Approach to Mediation: Data Models and Languages. NGITS 1995: 0- Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman: Answering Queries Using Templates with Binding Patterns. PODS 1995: 105-112 Alon Y. Levy, Yehoshua Sagiv: Semantic Query Optimization in Datalog Programs. PODS 1995: 163-173 Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, Divesh Srivastava: Answering Queries Using Views. PODS 1995: 95-104 Joachim Biskup, Pratul Dublish, Yehoshua Sagiv: Optimization of a Subclass of Conjunctive Queries. Acta Informatica 32(1): 1-26 (1995) Yehoshua Sagiv: Editor's Forword. JCSS 51(1): 1 (1995) Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Argument Reduction by Factoring. TCS 146(1&2): 269-310 (1995) Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman: Validating Constraints with Partial Information: Research Overview. DAISD 1994: 375-385 Ashid Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: Constraint Checking with Partial Information. PODS 1994: 45-55 Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: Efficient and Complete Tests for Database Integrity Constraint Checking. PPCP 1994: 173-180 Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv: Query Optimization by Predicate Move-Around. VLDB 1994: 96-107 Yehoshua Sagiv: Tools for Deductive Databases (Abstract). LPNMR 1993: 333 Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli: Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions. PODS 1993: 109-122 Alon Y. Levy, Yehoshua Sagiv: Queries Independent of Updates. VLDB 1993: 171-181 Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi: Undecidable Optimization Problems for Database Logic Programs. JACM 40(3): 683-713 (1993) Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi: Logical Query Optimization by Proff-Tree Transformation. JCSS 47(1): 222-248 (1993) Yehoshua Sagiv, Oded Shmueli: Solving Queries by Tree Projections. TODS 18(3): 487-511 (1993) Kenneth A. Ross, Yehoshua Sagiv: Monotonic Aggregation in Deductive Databases. PODS 1992: 114-126 Alon Y. Levy, Yehoshua Sagiv: Constraints and Redundancy in Datalog. PODS 1992: 67-80 Michael Kifer, Won Kim, Yehoshua Sagiv: Querying Object-Oriented Databases. SIGMOD Conference 1992: 393-402 Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli: Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions. Workshop on Deductive Databases, JICSLP 1992: 1-10 Yehoshua Sagiv: On Testing Effective Computability of Magic Programs. DOOD 1991: 244-262 Yehoshua Sagiv: A Termination Test for Logic Programs. ISLP 1991: 518-532 Alexander Brodsky, Yehoshua Sagiv: Inference of Inequality Constraints in Logic Programs. PODS 1991: 227-240 Yehoshua Sagiv: Evaluation of Queries in Independent Database Schemes. JACM 38(1): 120-161 (1991) Jeffrey F. Naughton, Yehoshua Sagiv: A Simple Characterization of Uniform Boundedness for a Class of Recursions. JLP 10(1/2/3&4): 233-252 (1991) Pratul Dublish, Joachim Biskup, Yehoshua Sagiv: Optimizatioin of a Subclass of Conjunctive Queries. ICDT 1990: 455-469 Yehoshua Sagiv: Is There Anything Better than Magic? NACLP 1990: 235-254 Alexander Brodsky, Yehoshua Sagiv: On Termination of Datalog Programs. DOOD 1989: 47-64 Yehoshua Sagiv, Moshe Y. Vardi: Safety of Datalog Queries over Infinite Databases. PODS 1989: 160-171 Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi: Proof-Tree Transformation Theorems and Their Applications. PODS 1989: 172-181 Alexander Brodsky, Yehoshua Sagiv: Inference of Monotonicity Constraints in Datalog Programs. PODS 1989: 190-199 Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989: 235-242 Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Argument Reduction by Factoring. VLDB 1989: 173-182 Witold Litwin, Yehoshua Sagiv, K. Vidyasankar: Concurrency and Trie Hashing. Acta Informatica 26(7): 597-614 (1989) Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman: On the Convergence of Query Evaluation. JCSS 38(2): 341-359 (1989) Yehoshua Sagiv, Oded Shmueli: A Characterization of Finite fd-Acyclicity. JCSS 38(2): 380-404 (1989) Yehoshua Sagiv: Optimizing Datalog Programs. Foundations of DD and LP 1988: 659-698 Yehoshua Sagiv: On Bounded Database Schemes and Bounded Horn-Clause Programs. SIAM J. Comput. 17(1): 1-22 (1988) Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi: Undecidable Optimization Problems for Database Logic Programs. LICS 1987: 106-115 Jeffrey F. Naughton, Yehoshua Sagiv: A Decidable Class of Bounded Recursions. PODS 1987: 227-236 Yehoshua Sagiv: Optimizing Datalog Programs. PODS 1987: 349-362 Yehoshua Sagiv, Claude Delobel, D. Stott Parker, Ronald Fagin: Correction to ``An Equivalence between Relational Database Dependencies and a Fragment of Propositional Logic''. JACM 34(4): 1016-1018 (1987) François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-16 Yehoshua Sagiv, Oded Shmueli: The Equivalence of Solving Queries and Production Tree Projections. PODS 1986: 160-172 Yehoshua Sagiv, Oded Shmueli: On Finite FD-Acyclicity. PODS 1986: 173-182 Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman: Convergence of Sideways Query Evaluation. PODS 1986: 24-30 Yehoshua Sagiv: Concurrent Operations on B*-Trees with Overtaking. JCSS 33(2): 275-296 (1986) Yehoshua Sagiv: On Computing Restricted Projections of Representative Instances. PODS 1985: 171-180 Yehoshua Sagiv: Concurrent Operations on B-Trees with Overtaking. PODS 1985: 28-37 Sharon M. Kuck, Yehoshua Sagiv: Designing Globally Consistent Network Schemas. SIGMOD Conference 1983: 185-195 Yehoshua Sagiv: Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions. SIAM J. Comput. 12(2): 316-328 (1983) Yehoshua Sagiv: A Characterization of Globally Consistent Databases and Their Correct Access Paths. TODS 8(2): 266-286 (1983) Sharon M. Kuck, Yehoshua Sagiv: A Universal Relation Database System Implemented via the Network Model. PODS 1982: 147-157 Yehoshua Sagiv, Scott F. Walecka: Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies. JACM 29(1): 103-117 (1982) Yehoshua Sagiv: Can We Use the Universal Instance Assumption Without Using Nulls? SIGMOD Conference 1981: 108-120 Yehoshua Sagiv, Claude Delobel, D. Stott Parker, Ronald Fagin: An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. JACM 28(3): 435-453 (1981) David Maier, Yehoshua Sagiv, Mihalis Yannakakis: On the Complexity of Testing Implications of Functional and Join Dependencies. JACM 28(4): 680-695 (1981) Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalence of Relational Database Schemes. SIAM J. Comput. 10(2): 352-370 (1981) Alfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. SIAM J. Comput. 10(3): 405-421 (1981) Yehoshua Sagiv: An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic. JACM 27(2): 250-262 (1980) Yehoshua Sagiv, Mihalis Yannakakis: Equivalences Among Relational Expressions with the Union and Difference Operators. JACM 27(4): 633-655 (1980) David Maier, Alberto O. Mendelzon, Yehoshua Sagiv: Testing Implications of Data Dependencies (Abstract). SIGMOD Conference 1979: 152 Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalence of Relational Database Schemes. STOC 1979: 319-329 Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246 (1979) Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions. TODS 4(4): 435-454 (1979) David Maier, Alberto O. Mendelzon, Yehoshua Sagiv: Testing Implications of Data Dependencies. TODS 4(4): 455-469 (1979) Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions (Abstract). SIGMOD Conference 1978: 39 Yehoshua Sagiv, Mihalis Yannakakis: Equivalence among Relational Expressions with the Union and Difference Operation. VLDB 1978: 535-548 DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).