| 2009 |
|---|
| 147 | EE | Foto N. Afrati,
Rada Chirkova,
Manolis Gergatsoulis,
Benny Kimelfeld,
Vassia Pavlaki,
Yehoshua Sagiv:
On rewriting XPath queries using views.
EDBT 2009: 168-179 |
| 2008 |
|---|
| 146 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Revisiting redundancy and minimization in an XPath fragment.
EDBT 2008: 61-72 |
| 145 | EE | Yaron Kanza,
Eliyahu Safra,
Yehoshua Sagiv,
Yerach Doytsher:
Heuristic algorithms for route-search queries over geographical data.
GIS 2008: 11 |
| 144 | EE | Sara Cohen,
Benny Kimelfeld,
Yehoshua Sagiv:
Incorporating constraints in probabilistic XML.
PODS 2008: 109-118 |
| 143 | EE | Benny Kimelfeld,
Yuri Kosharovsky,
Yehoshua Sagiv:
Query efficiency in probabilistic XML models.
SIGMOD Conference 2008: 701-714 |
| 142 | EE | Konstantin Golenberg,
Benny Kimelfeld,
Yehoshua Sagiv:
Keyword proximity search in complex data graphs.
SIGMOD Conference 2008: 927-940 |
| 141 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Efficiently enumerating results of keyword search over data graphs.
Inf. Syst. 33(4-5): 335-359 (2008) |
| 140 | EE | Sara Cohen,
Benny Kimelfeld,
Yehoshua Sagiv:
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties.
J. Comput. Syst. Sci. 74(7): 1147-1159 (2008) |
| 139 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Modeling and querying probabilistic XML data.
SIGMOD Record 37(4): 69-77 (2008) |
| 2007 |
|---|
| 138 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Combining Incompleteness and Ranking in Tree Queries.
ICDT 2007: 329-343 |
| 137 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Maximally joining probabilistic data.
PODS 2007: 303-312 |
| 136 | EE | Eliyahu Safra,
Yaron Kanza,
Nir Dolev,
Yehoshua Sagiv,
Yerach Doytsher:
Computing a k -Route over Uncertain Geographical Data.
SSTD 2007: 276-293 |
| 135 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Matching Twigs in Probabilistic XML.
VLDB 2007: 27-38 |
| 134 | EE | Sara Cohen,
Werner Nutt,
Yehoshua Sagiv:
Deciding equivalences among conjunctive aggregate queries.
J. ACM 54(2): (2007) |
| 133 | EE | Sara Cohen,
Yehoshua Sagiv:
An incremental algorithm for computing ranked full disjunctions.
J. Comput. Syst. Sci. 73(4): 648-668 (2007) |
| 2006 |
|---|
| 132 | EE | Eliyahu Safra,
Yaron Kanza,
Yehoshua Sagiv,
Yerach Doytsher:
Efficient integration of road maps.
GIS 2006: 59-66 |
| 131 | EE | Benny Kimelfeld,
Eitan Kovacs,
Yehoshua Sagiv,
Dan Yahav:
Using Language Models and the HITS Algorithm for XML Retrieval.
INEX 2006: 253-260 |
| 130 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries.
NGITS 2006: 141-152 |
| 129 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Finding and approximating top-k answers in keyword proximity search.
PODS 2006: 173-182 |
| 128 | EE | Sara Cohen,
Itzhak Fadida,
Yaron Kanza,
Benny Kimelfeld,
Yehoshua Sagiv:
Full Disjunctions: Polynomial-Delay Iterators in Action.
VLDB 2006: 739-750 |
| 127 | EE | Eliyahu Safra,
Yaron Kanza,
Yehoshua Sagiv,
Yerach Doytsher:
Integrating Data from Maps on the World-Wide Web.
W2GIS 2006: 180-191 |
| 126 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Twig Patterns: From XML Trees to Graphs.
WebDB 2006 |
| 125 | EE | Sara Cohen,
Werner Nutt,
Yehoshua Sagiv:
Rewriting queries with arbitrary aggregation functions using views.
ACM Trans. Database Syst. 31(2): 672-715 (2006) |
| 2005 |
|---|
| 124 | EE | Sara Cohen,
Yaron Kanza,
Benny Kimelfeld,
Yehoshua Sagiv:
Interconnection semantics for keyword search in XML.
CIKM 2005: 389-396 |
| 123 | EE | Benny Kimelfeld,
Yehoshua Sagiv:
Efficiently Enumerating Results of Keyword Search.
DBPL 2005: 58-73 |
| 122 | EE | Catriel Beeri,
Yerach Doytsher,
Yaron Kanza,
Eliyahu Safra,
Yehoshua Sagiv:
Finding corresponding objects when integrating several geo-spatial datasets.
GIS 2005: 87-96 |
| 121 | EE | Sara Cohen,
Yehoshua Sagiv:
An Abstract Framework for Generating Maximal Answers to Queries.
ICDT 2005: 129-143 |
| 120 | EE | Sara Cohen,
Yehoshua Sagiv:
An incremental algorithm for computing ranked full disjunctions.
PODS 2005: 98-107 |
| 119 | | Benny Kimelfeld,
Yehoshua Sagiv:
Efficient Engines for Keyword Proximity Search.
WebDB 2005: 67-72 |
| 118 | EE | Sara Cohen,
Yehoshua Sagiv,
Werner Nutt:
Equivalences among aggregate queries with negation.
ACM Trans. Comput. Log. 6(2): 328-360 (2005) |
| 2004 |
|---|
| 117 | EE | Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach.
Program Development in Computational Logic 2004: 453-498 |
| 116 | EE | Catriel Beeri,
Yaron Kanza,
Eliyahu Safra,
Yehoshua Sagiv:
Object Fusion in Geographic Information Systems.
VLDB 2004: 816-827 |
| 115 | EE | Sara Cohen,
Yehoshua Sagiv:
Generating All Maximal Induced Subgraphs for Hereditary Connected-Hereditary and Rooted-Hereditary Properties
CoRR cs.DS/0410039: (2004) |
| 2003 |
|---|
| 114 | EE | Sara Cohen,
Werner Nutt,
Yehoshua Sagiv:
Containment of Aggregate Queries.
ICDT 2003: 111-125 |
| 113 | EE | Sara Cohen,
Yaron Kanza,
Yehoshua Sagiv:
Generating Relations from XML Documents.
ICDT 2003: 282-296 |
| 112 | EE | Yaron Kanza,
Yehoshua Sagiv:
Computing full disjunctions.
PODS 2003: 78-89 |
| 111 | EE | Sara Cohen,
Jonathan Mamou,
Yaron Kanza,
Yehoshua Sagiv:
XSEarch: A Semantic Search Engine for XML.
VLDB 2003: 45-56 |
| 2002 |
|---|
| 110 | EE | Sara Cohen,
Yaron Kanza,
Yehoshua Sagiv:
Select-Project Queries over XML Documents.
NGITS 2002: 2-13 |
| 109 | EE | Sara Cohen,
Werner Nutt,
Yehoshua Sagiv:
Equivalences Among Aggregate Queries with Negation
CoRR cs.DB/0210028: (2002) |
| 108 | EE | David Konopnicki,
Lior Leiba,
Oded Shmueli,
Yehoshua Sagiv:
A Formal Yet Practical Approach to Electronic Commerce.
Int. J. Cooperative Inf. Syst. 11(1-2): 93-117 (2002) |
| 107 | EE | Yaron Kanza,
Werner Nutt,
Yehoshua Sagiv:
Querying Incomplete Information in Semistructured Data.
J. Comput. Syst. Sci. 64(3): 655-693 (2002) |
| 106 | | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Yehoshua Sagiv,
Werner Nutt,
Alexander Serebrenik:
EquiX - A search and query language for XML.
JASIST 53(6): 454-466 (2002) |
| 2001 |
|---|
| 105 | EE | Sara Cohen,
Yaron Kanza,
Yehoshua Sagiv:
SQL4X: A Flexible Query Language for XML and Relational Databases.
DBPL 2001: 263-280 |
| 104 | EE | Sara Cohen,
Werner Nutt,
Yehoshua Sagiv:
Equivalences among Aggregate Queries with Negation.
PODS 2001 |
| 103 | EE | Yaron Kanza,
Yehoshua Sagiv:
Flexible Queries Over Semistructured Data.
PODS 2001 |
| 102 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
A General Framework for Automatic Termination Analysis of Logic Programs.
Appl. Algebra Eng. Commun. Comput. 12(1/2): 117-156 (2001) |
| 101 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
EquiX - A Search and Query Language for XML
CoRR cs.DB/0110044: (2001) |
| 100 | EE | Alon Y. Halevy,
Inderpal Singh Mumick,
Yehoshua Sagiv,
Oded Shmueli:
Static analysis in datalog extensions.
J. ACM 48(5): 971-1012 (2001) |
| 2000 |
|---|
| 99 | | John W. Lloyd,
Verónica Dahl,
Ulrich Furbach,
Manfred Kerber,
Kung-Kiu Lau,
Catuscia Palamidessi,
Luís Moniz Pereira,
Yehoshua Sagiv,
Peter J. Stuckey:
Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings
Springer 2000 |
| 98 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
Combining the Power of Searching and Querying.
CoopIS 2000: 54-65 |
| 97 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
EquiX - A Search and Query Language for XML
CoRR cs.DB/0011041: (2000) |
| 96 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
CoRR cs.PL/0011036: (2000) |
| 95 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
A General Framework for Automatic Termination Analysis of Logic Programs
CoRR cs.PL/0012008: (2000) |
| 1999 |
|---|
| 94 | EE | David Konopnicki,
Lior Leiba,
Oded Shmueli,
Yehoshua Sagiv:
A Formal Yet Practical Approach to Electronic Commerce.
CoopIS 1999: 197-208 |
| 93 | EE | Yaron Kanza,
Werner Nutt,
Yehoshua Sagiv:
Incomplete Answers for Queries over Semistructured Data.
KRDB 1999: 21-25 |
| 92 | EE | Ziv Bar-Yossef,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv:
Querying Semantically Tagged Documents on the World-Wide Web.
NGITS 1999: 2-19 |
| 91 | EE | Yaron Kanza,
Werner Nutt,
Yehoshua Sagiv:
Queries with Incomplete Answers over Semistructured Data.
PODS 1999: 227-236 |
| 90 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
EquiX Easy Querying in XML Databases.
WebDB (Informal Proceedings) 1999: 43-48 |
| 89 | | Alexander Brodsky,
Yehoshua Sagiv:
Inference of monotonicity constraints in Datalog programs.
Ann. Math. Artif. Intell. 26(1-4): 29-57 (1999) |
| 88 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates.
Electr. Notes Theor. Comput. Sci. 30(1): (1999) |
| 1998 |
|---|
| 87 | EE | Werner Nutt,
Yehoshua Sagiv,
Sara Shurin:
Deciding Equivalences Among Aggregate Queries.
PODS 1998: 214-223 |
| 86 | | Catriel Beeri,
Gershon Elber,
Tova Milo,
Yehoshua Sagiv,
Oded Shmueli,
Naftali Tishby,
Yakov A. Kogan,
David Konopnicki,
Pini Mogilevski,
Noam Slonim:
WebSuite: A Tool Suite for Harnessing Web Data.
WebDB 1998: 152-171 |
| 85 | EE | Yakov A. Kogan,
David Michaeli,
Yehoshua Sagiv,
Oded Shmueli:
Utilizing the Multiple Facets of WWW Contents.
Data Knowl. Eng. 28(3): 255-275 (1998) |
| 1997 |
|---|
| 84 | | Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
TermiLog: A System for Checking Termination of Queries to Logic Programs.
CAV 1997: 444-447 |
| 83 | EE | David Michaeli,
Werner Nutt,
Yehoshua Sagiv:
Classification Rules for Semi-Structured Data.
Description Logics 1997 |
| 82 | | Naomi Lindenstrauss,
Yehoshua Sagiv:
Automatic Termination Analysis of Logic Programs.
ICLP 1997: 63-77 |
| 81 | EE | Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Unfolding the Mystery of Mergesort.
LOPSTR 1997: 206-225 |
| 80 | | Yakov A. Kogan,
David Michaeli,
Yehoshua Sagiv,
Oded Shmueli:
Utilizing the Multiple Facets of WWW Contents.
NGITS 1997: 0- |
| 79 | EE | Alon Y. Levy,
Richard Fikes,
Yehoshua Sagiv:
Speeding up Inferences Using Relevance Reasoning: A Formalism and Algorithms.
Artif. Intell. 97(1-2): 83-136 (1997) |
| 78 | | Kenneth A. Ross,
Yehoshua Sagiv:
Monotonic Aggregation in Deductive Database.
J. Comput. Syst. Sci. 54(1): 79-97 (1997) |
| 77 | | 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.
J. Intell. Inf. Syst. 8(2): 117-132 (1997) |
| 76 | | Dallan Quass,
Anand Rajaraman,
Jeffrey D. Ullman,
Jennifer Widom,
Yehoshua Sagiv:
Querying Semistructured Heterogeneous Information.
Journal of Systems Integration 7(3/4): 381-407 (1997) |
| 1996 |
|---|
| 75 | EE | Joachim Biskup,
Ralf Menzel,
Torsten Polle,
Yehoshua Sagiv:
Decomposition of Relationships through Pivoting.
ER 1996: 28-41 |
| 1995 |
|---|
| 74 | | Dallan Quass,
Anand Rajaraman,
Yehoshua Sagiv,
Jeffrey D. Ullman,
Jennifer Widom:
Querying Semistructured Heterogeneous Information.
DOOD 1995: 319-344 |
| 73 | | 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- |
| 72 | EE | Anand Rajaraman,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Answering Queries Using Templates with Binding Patterns.
PODS 1995: 105-112 |
| 71 | EE | Alon Y. Levy,
Yehoshua Sagiv:
Semantic Query Optimization in Datalog Programs.
PODS 1995: 163-173 |
| 70 | EE | Alon Y. Levy,
Alberto O. Mendelzon,
Yehoshua Sagiv,
Divesh Srivastava:
Answering Queries Using Views.
PODS 1995: 95-104 |
| 69 | | Joachim Biskup,
Pratul Dublish,
Yehoshua Sagiv:
Optimization of a Subclass of Conjunctive Queries
Acta Inf. 32(1): 1-26 (1995) |
| 68 | | Yehoshua Sagiv:
Editor's Forword.
J. Comput. Syst. Sci. 51(1): 1 (1995) |
| 67 | EE | Jeffrey F. Naughton,
Raghu Ramakrishnan,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Argument Reduction by Factoring.
Theor. Comput. Sci. 146(1&2): 269-310 (1995) |
| 1994 |
|---|
| 66 | | Jennifer Widom,
Ashish Gupta,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Validating Constraints with Partial Information: Research Overview.
DAISD 1994: 375-385 |
| 65 | EE | Ashish Gupta,
Yehoshua Sagiv,
Jeffrey D. Ullman,
Jennifer Widom:
Constraint Checking with Partial Information.
PODS 1994: 45-55 |
| 64 | | Ashish Gupta,
Yehoshua Sagiv,
Jeffrey D. Ullman,
Jennifer Widom:
Efficient and Complete Tests for Database Integrity Constraint Checking.
PPCP 1994: 173-180 |
| 63 | EE | Alon Y. Levy,
Inderpal Singh Mumick,
Yehoshua Sagiv:
Query Optimization by Predicate Move-Around.
VLDB 1994: 96-107 |
| 1993 |
|---|
| 62 | | Alon Y. Levy,
Yehoshua Sagiv:
Exploiting Irrelevance Reasoning to Guide Problem Solving.
IJCAI 1993: 138-145 |
| 61 | | Yehoshua Sagiv:
Tools for Deductive Databases (Abstract).
LPNMR 1993: 333 |
| 60 | EE | Alon Y. Levy,
Inderpal Singh Mumick,
Yehoshua Sagiv,
Oded Shmueli:
Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.
PODS 1993: 109-122 |
| 59 | EE | Alon Y. Levy,
Yehoshua Sagiv:
Queries Independent of Updates.
VLDB 1993: 171-181 |
| 58 | EE | Yehoshua Sagiv,
Oded Shmueli:
Solving Queries by Tree Projections.
ACM Trans. Database Syst. 18(3): 487-511 (1993) |
| 57 | EE | Haim Gaifman,
Harry G. Mairson,
Yehoshua Sagiv,
Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs.
J. ACM 40(3): 683-713 (1993) |
| 56 | | Raghu Ramakrishnan,
Yehoshua Sagiv,
Jeffrey D. Ullman,
Moshe Y. Vardi:
Logical Query Optimization by Proff-Tree Transformation.
J. Comput. Syst. Sci. 47(1): 222-248 (1993) |
| 1992 |
|---|
| 55 | EE | Kenneth A. Ross,
Yehoshua Sagiv:
Monotonic Aggregation in Deductive Databases.
PODS 1992: 114-126 |
| 54 | EE | Alon Y. Levy,
Yehoshua Sagiv:
Constraints and Redundancy in Datalog.
PODS 1992: 67-80 |
| 53 | EE | Michael Kifer,
Won Kim,
Yehoshua Sagiv:
Querying Object-Oriented Databases.
SIGMOD Conference 1992: 393-402 |
| 52 | | 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 |
| 51 | | Yehoshua Sagiv,
Yatin P. Saraiya:
Minimizing Restricted-Fanout Queries.
Discrete Applied Mathematics 40(2): 245-264 (1992) |
| 1991 |
|---|
| 50 | | Yehoshua Sagiv:
On Testing Effective Computability of Magic Programs.
DOOD 1991: 244-262 |
| 49 | | Yehoshua Sagiv:
A Termination Test for Logic Programs.
ISLP 1991: 518-532 |
| 48 | EE | Alexander Brodsky,
Yehoshua Sagiv:
Inference of Inequality Constraints in Logic Programs.
PODS 1991: 227-240 |
| 47 | EE | Yehoshua Sagiv:
Evaluation of Queries in Independent Database Schemes.
J. ACM 38(1): 120-161 (1991) |
| 46 | | Jeffrey F. Naughton,
Yehoshua Sagiv:
A Simple Characterization of Uniform Boundedness for a Class of Recursions.
J. Log. Program. 10(1/2/3&4): 233-252 (1991) |
| 1990 |
|---|
| 45 | EE | Pratul Dublish,
Joachim Biskup,
Yehoshua Sagiv:
Optimizatioin of a Subclass of Conjunctive Queries.
ICDT 1990: 455-469 |
| 44 | | Yehoshua Sagiv:
Is There Anything Better than Magic?
NACLP 1990: 235-254 |
| 1989 |
|---|
| 43 | | Alexander Brodsky,
Yehoshua Sagiv:
On Termination of Datalog Programs.
DOOD 1989: 47-64 |
| 42 | EE | Yehoshua Sagiv,
Moshe Y. Vardi:
Safety of Datalog Queries over Infinite Databases.
PODS 1989: 160-171 |
| 41 | EE | Raghu Ramakrishnan,
Yehoshua Sagiv,
Jeffrey D. Ullman,
Moshe Y. Vardi:
Proof-Tree Transformation Theorems and Their Applications.
PODS 1989: 172-181 |
| 40 | EE | Alexander Brodsky,
Yehoshua Sagiv:
Inference of Monotonicity Constraints in Datalog Programs.
PODS 1989: 190-199 |
| 39 | EE | Jeffrey F. Naughton,
Raghu Ramakrishnan,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules.
SIGMOD Conference 1989: 235-242 |
| 38 | EE | Jeffrey F. Naughton,
Raghu Ramakrishnan,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Argument Reduction by Factoring.
VLDB 1989: 173-182 |
| 37 | | Witold Litwin,
Yehoshua Sagiv,
K. Vidyasankar:
Concurrency and Trie Hashing.
Acta Inf. 26(7): 597-614 (1989) |
| 36 | | Foto N. Afrati,
Christos H. Papadimitriou,
George Papageorgiou,
Athena Roussou,
Yehoshua Sagiv,
Jeffrey D. Ullman:
On the Convergence of Query Evaluation.
J. Comput. Syst. Sci. 38(2): 341-359 (1989) |
| 35 | | Yehoshua Sagiv,
Oded Shmueli:
A Characterization of Finite fd-Acyclicity.
J. Comput. Syst. Sci. 38(2): 380-404 (1989) |
| 1988 |
|---|
| 34 | | Yehoshua Sagiv:
Optimizing Datalog Programs.
Foundations of Deductive Databases and Logic Programming. 1988: 659-698 |
| 33 | | Yehoshua Sagiv:
On Bounded Database Schemes and Bounded Horn-Clause Programs.
SIAM J. Comput. 17(1): 1-22 (1988) |
| 1987 |
|---|
| 32 | | Haim Gaifman,
Harry G. Mairson,
Yehoshua Sagiv,
Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs
LICS 1987: 106-115 |
| 31 | EE | Jeffrey F. Naughton,
Yehoshua Sagiv:
A Decidable Class of Bounded Recursions.
PODS 1987: 227-236 |
| 30 | EE | Yehoshua Sagiv:
Optimizing Datalog Programs.
PODS 1987: 349-362 |
| 29 | EE | Yehoshua Sagiv,
Claude Delobel,
Douglas Stott Parker Jr.,
Ronald Fagin:
Correction to ``An equivalence between relational database dependencies and a fragment of propositional logic''.
J. ACM 34(4): 1016-1018 (1987) |
| 1986 |
|---|
| 28 | EE | François Bancilhon,
David Maier,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Magic Sets and Other Strange Ways to Implement Logic Programs.
PODS 1986: 1-15 |
| 27 | EE | Yehoshua Sagiv,
Oded Shmueli:
The Equivalence of Solving Queries and Production Tree Projections.
PODS 1986: 160-172 |
| 26 | EE | Yehoshua Sagiv,
Oded Shmueli:
On Finite FD-Acyclicity.
PODS 1986: 173-182 |
| 25 | EE | Foto N. Afrati,
Christos H. Papadimitriou,
George Papageorgiou,
Athena Roussou,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Convergence of Sideways Query Evaluation.
PODS 1986: 24-30 |
| 24 | | Yehoshua Sagiv:
Optimizing Datalog Programs.
XP7.52 Workshop on Database Theory 1986 |
| 23 | | Yehoshua Sagiv:
Concurrent Operations on B*-Trees with Overtaking.
J. Comput. Syst. Sci. 33(2): 275-296 (1986) |
| 1985 |
|---|
| 22 | EE | Yehoshua Sagiv:
On Computing Restricted Projections of Representative Instances.
PODS 1985: 171-180 |
| 21 | EE | Yehoshua Sagiv:
Concurrent Operations on B-Trees with Overtaking.
PODS 1985: 28-37 |
| 1983 |
|---|
| 20 | EE | Sharon McCure Kuck,
Yehoshua Sagiv:
Designing Globally Consistent Network Schemas.
SIGMOD Conference 1983: 185-195 |
| 19 | EE | Yehoshua Sagiv:
A Characterization of Globally Consistent Databases and Their Correct Access Paths.
ACM Trans. Database Syst. 8(2): 266-286 (1983) |
| 18 | | Yehoshua Sagiv:
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions.
SIAM J. Comput. 12(2): 316-328 (1983) |
| 1982 |
|---|
| 17 | EE | Sharon McCure Kuck,
Yehoshua Sagiv:
A Universal Relation Database System Implemented via the Network Model.
PODS 1982: 147-157 |
| 16 | EE | Yehoshua Sagiv,
Scott F. Walecka:
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies.
J. ACM 29(1): 103-117 (1982) |
| 1981 |
|---|
| 15 | EE | Yehoshua Sagiv:
Can We Use the Universal Instance Assumption Without Using Nulls?
SIGMOD Conference 1981: 108-120 |
| 14 | EE | Yehoshua Sagiv,
Claude Delobel,
Douglas Stott Parker Jr.,
Ronald Fagin:
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic.
J. ACM 28(3): 435-453 (1981) |
| 13 | EE | David Maier,
Yehoshua Sagiv,
Mihalis Yannakakis:
On the Complexity of Testing Implications of Functional and Join Dependencies.
J. ACM 28(4): 680-695 (1981) |
| 12 | | Catriel Beeri,
Alberto O. Mendelzon,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Equivalence of Relational Database Schemes.
SIAM J. Comput. 10(2): 352-370 (1981) |
| 11 | | 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) |
| 1980 |
|---|
| 10 | EE | Yehoshua Sagiv:
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic.
J. ACM 27(2): 250-262 (1980) |
| 9 | EE | Yehoshua Sagiv,
Mihalis Yannakakis:
Equivalences Among Relational Expressions with the Union and Difference Operators.
J. ACM 27(4): 633-655 (1980) |
| 1979 |
|---|
| 8 | EE | David Maier,
Alberto O. Mendelzon,
Yehoshua Sagiv:
Testing Implications of Data Dependencies (Abstract).
SIGMOD Conference 1979: 152 |
| 7 | | Catriel Beeri,
Alberto O. Mendelzon,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Equivalence of Relational Database Schemes
STOC 1979: 319-329 |
| 6 | EE | Alfred V. Aho,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions.
ACM Trans. Database Syst. 4(4): 435-454 (1979) |
| 5 | EE | David Maier,
Alberto O. Mendelzon,
Yehoshua Sagiv:
Testing Implications of Data Dependencies.
ACM Trans. Database Syst. 4(4): 455-469 (1979) |
| 4 | | Alfred V. Aho,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Equivalences Among Relational Expressions.
SIAM J. Comput. 8(2): 218-246 (1979) |
| 1978 |
|---|
| 3 | EE | Alfred V. Aho,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions (Abstract).
SIGMOD Conference 1978: 39 |
| 2 | EE | Yehoshua Sagiv,
Mihalis Yannakakis:
Equivalence among Relational Expressions with the Union and Difference Operation.
VLDB 1978: 535-548 |
| 1 | EE | Yehoshua Sagiv:
Report on ACM-SIGMOD International Conference on Management of Data.
IEEE Database Eng. Bull. 2(2): 11 (1978) |
