default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYehoshua Sagiv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j54]Yaron Kanza, Elad Kravi, Eliyahu Safra, Yehoshua Sagiv:
Location-Based Distance Measures for Geosocial Similarity. ACM Trans. Web 11(3): 17:1-17:32 (2017)- 2016
- [c113]Konstantin Golenberg, Yehoshua Sagiv:
Constructing Data Graphs for Keyword Search. DEXA (2) 2016: 399-409 - [c112]Yosi Mass, Yehoshua Sagiv:
Virtual Documents and Answer Priors in Keyword Search over Data Graphs. EDBT/ICDT Workshops 2016 - [c111]Konstantin Golenberg, Yehoshua Sagiv:
A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs. ICDT 2016: 23:1-23:17 - [i8]Konstantin Golenberg, Yehoshua Sagiv:
Constructing Data Graphs for Keyword Search. CoRR abs/1605.07865 (2016) - 2015
- [c110]Shlomo Bekhor
, Sara Cohen, Yerach Doytsher, Yaron Kanza, Yehoshua Sagiv:
A personalized GeoSocial app for surviving an earthquake. EM-GIS 2015: 21:1-21:6 - [i7]Konstantin Golenberg, Yehoshua Sagiv:
A Practically Efficient Algorithm for Generating Answers to Keyword Search over Data Graphs. CoRR abs/1512.06635 (2015) - 2014
- [c109]Yosi Mass, Yehoshua Sagiv:
Knowledge Management for Keyword Search over Data Graphs. CIKM 2014: 2051-2053 - 2013
- [j53]Eliyahu Safra, Yaron Kanza, Yehoshua Sagiv, Yerach Doytsher:
Ad hoc matching of vectorial road networks. Int. J. Geogr. Inf. Sci. 27(1): 114-153 (2013) - [c108]Yehoshua Sagiv:
A personal perspective on keyword search over data graphs. ICDT 2013: 21-32 - [c107]Benny Kimelfeld, Yehoshua Sagiv:
Extracting minimum-weight tree patterns from a schema with neighborhood constraints. ICDT 2013: 249-260 - 2012
- [c106]Yosi Mass, Yehoshua Sagiv:
Language models for keyword search over data graphs. WSDM 2012: 363-372 - [c105]Roi Friedman, Itsik Hefez, Yaron Kanza, Roy Levin, Eliyahu Safra, Yehoshua Sagiv:
WISER: a web-based interactive route search system for smartphones. WWW (Companion Volume) 2012: 337-340 - 2011
- [j52]Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv:
Optimizing and Parallelizing Ranked Enumeration. Proc. VLDB Endow. 4(11): 1028-1039 (2011) - [c104]Yosi Mass, Maya Ramanath, Yehoshua Sagiv, Gerhard Weikum:
IQ: The Case for Iterative Querying for Knowledge. CIDR 2011: 38-44 - [c103]Benny Kimelfeld, Yehoshua Sagiv:
Finding a minimal tree pattern under neighborhood constraints. PODS 2011: 235-246 - [c102]Yosi Mass, Yehoshua Sagiv, Michal Shmueli-Scheuer:
KMV-peer: a robust and adaptive peer-selection algorithm. WSDM 2011: 157-166 - 2010
- [j51]Eliyahu Safra, Yaron Kanza, Yehoshua Sagiv, Catriel Beeri, Yerach Doytsher:
Location-based algorithms for finding sets of corresponding objects over several geo-spatial data sets. Int. J. Geogr. Inf. Sci. 24(1): 69-106 (2010) - [j50]Roy Levin, Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv:
Interactive Route Search in the Presence of Order Constraints. Proc. VLDB Endow. 3(1): 117-128 (2010) - [c101]Yosi Mass, Yehoshua Sagiv, Michal Shmueli-Scheuer:
A peer-selection algorithm for information retrieval. CIKM 2010: 1601-1604 - [c100]Hilit Achiezra, Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv:
Exploratory keyword search on data graphs. SIGMOD Conference 2010: 1163-1166
2000 – 2009
- 2009
- [j49]Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Incorporating constraints in probabilistic XML. ACM Trans. Database Syst. 34(3): 18:1-18:45 (2009) - [j48]Serge Abiteboul, Benny Kimelfeld, Yehoshua Sagiv, Pierre Senellart:
On the expressiveness of probabilistic XML models. VLDB J. 18(5): 1041-1064 (2009) - [j47]Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv:
Query evaluation over probabilistic XML. VLDB J. 18(5): 1117-1140 (2009) - [c99]Yosi Mass, Yehoshua Sagiv, Michal Shmueli-Scheuer:
A scalable and effective full-text search in P2P networks. CIKM 2009: 1979-1982 - [c98]Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv:
On rewriting XPath queries using views. EDBT 2009: 168-179 - [c97]Yaron Kanza, Roy Levin, Eliyahu Safra, Yehoshua Sagiv:
An interactive approach to route search. GIS 2009: 408-411 - [c96]Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Running tree automata on probabilistic XML. PODS 2009: 227-236 - [c95]Benny Kimelfeld, Yehoshua Sagiv, Gidi Weber:
ExQueX: exploring and querying XML documents. SIGMOD Conference 2009: 1103-1106 - [c94]Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv:
Route Search over Probabilistic Geospatial Data. SSTD 2009: 153-170 - 2008
- [j46]Benny Kimelfeld, Yehoshua Sagiv:
Efficiently enumerating results of keyword search over data graphs. Inf. Syst. 33(4-5): 335-359 (2008) - [j45]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) - [j44]Benny Kimelfeld, Yehoshua Sagiv:
Modeling and querying probabilistic XML data. SIGMOD Rec. 37(4): 69-77 (2008) - [c93]Benny Kimelfeld, Yehoshua Sagiv:
Revisiting redundancy and minimization in an XPath fragment. EDBT 2008: 61-72 - [c92]Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach Doytsher:
Heuristic algorithms for route-search queries over geographical data. GIS 2008: 11 - [c91]Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Incorporating constraints in probabilistic XML. PODS 2008: 109-118 - [c90]Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv:
Query efficiency in probabilistic XML models. SIGMOD Conference 2008: 701-714 - [c89]Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv:
Keyword proximity search in complex data graphs. SIGMOD Conference 2008: 927-940 - 2007
- [j43]Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Deciding equivalences among conjunctive aggregate queries. J. ACM 54(2): 5 (2007) - [j42]Sara Cohen, Yehoshua Sagiv:
An incremental algorithm for computing ranked full disjunctions. J. Comput. Syst. Sci. 73(4): 648-668 (2007) - [c88]Benny Kimelfeld, Yehoshua Sagiv:
Combining Incompleteness and Ranking in Tree Queries. ICDT 2007: 329-343 - [c87]Benny Kimelfeld, Yehoshua Sagiv:
Maximally joining probabilistic data. PODS 2007: 303-312 - [c86]Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sagiv, Yerach Doytsher:
Computing a k -Route over Uncertain Geographical Data. SSTD 2007: 276-293 - [c85]Benny Kimelfeld, Yehoshua Sagiv:
Matching Twigs in Probabilistic XML. VLDB 2007: 27-38 - 2006
- [j41]Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Rewriting queries with arbitrary aggregation functions using views. ACM Trans. Database Syst. 31(2): 672-715 (2006) - [c84]Eliyahu Safra, Yaron Kanza, Yehoshua Sagiv, Yerach Doytsher:
Efficient integration of road maps. GIS 2006: 59-66 - [c83]Benny Kimelfeld, Eitan Kovacs, Yehoshua Sagiv, Dan Yahav:
Using Language Models and the HITS Algorithm for XML Retrieval. INEX 2006: 253-260 - [c82]Benny Kimelfeld, Yehoshua Sagiv:
Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. NGITS 2006: 141-152 - [c81]Benny Kimelfeld, Yehoshua Sagiv:
Finding and approximating top-k answers in keyword proximity search. PODS 2006: 173-182 - [c80]Sara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv:
Full Disjunctions: Polynomial-Delay Iterators in Action. VLDB 2006: 739-750 - [c79]Eliyahu Safra, Yaron Kanza, Yehoshua Sagiv, Yerach Doytsher:
Integrating Data from Maps on the World-Wide Web. W2GIS 2006: 180-191 - [c78]Benny Kimelfeld, Yehoshua Sagiv:
Twig Patterns: From XML Trees to Graphs. WebDB 2006 - 2005
- [j40]Sara Cohen, Yehoshua Sagiv, Werner Nutt:
Equivalences among aggregate queries with negation. ACM Trans. Comput. Log. 6(2): 328-360 (2005) - [c77]Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv:
Interconnection semantics for keyword search in XML. CIKM 2005: 389-396 - [c76]Benny Kimelfeld, Yehoshua Sagiv:
Efficiently Enumerating Results of Keyword Search. DBPL 2005: 58-73 - [c75]Catriel Beeri, Yerach Doytsher, Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv:
Finding corresponding objects when integrating several geo-spatial datasets. GIS 2005: 87-96 - [c74]Sara Cohen, Yehoshua Sagiv:
An Abstract Framework for Generating Maximal Answers to Queries. ICDT 2005: 129-143 - [c73]Sara Cohen, Yehoshua Sagiv:
An incremental algorithm for computing ranked full disjunctions. PODS 2005: 98-107 - [c72]Benny Kimelfeld, Yehoshua Sagiv:
Efficient Engines for Keyword Proximity Search. WebDB 2005: 67-72 - 2004
- [c71]Catriel Beeri, Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv:
Object Fusion in Geographic Information Systems. VLDB 2004: 816-827 - [p2]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 - [i6]Sara Cohen, Yehoshua Sagiv:
Generating All Maximal Induced Subgraphs for Hereditary Connected-Hereditary and Rooted-Hereditary Properties. CoRR cs.DS/0410039 (2004) - 2003
- [c70]Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Containment of Aggregate Queries. ICDT 2003: 111-125 - [c69]Sara Cohen, Yaron Kanza, Yehoshua Sagiv:
Generating Relations from XML Documents. ICDT 2003: 282-296 - [c68]Yiftah Ben-Aharon, Sara Cohen, Yael Grumbach, Yaron Kanza, Jonathan Mamou, Yehoshua Sagiv, Benjamin Sznajder, Efrat Twito:
Searching in an XML Corpus Using Content and Structure. INEX 2003: 46-52 - [c67]Yaron Kanza, Yehoshua Sagiv:
Computing full disjunctions. PODS 2003: 78-89 - [c66]Sara Cohen, Jonathan Mamou, Yaron Kanza, Yehoshua Sagiv:
XSEarch: A Semantic Search Engine for XML. VLDB 2003: 45-56 - 2002
- [j39]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) - [j38]Sara Cohen, Yaron Kanza, Yakov A. Kogan, Yehoshua Sagiv, Werner Nutt, Alexander Serebrenik:
EquiX - A search and query language for XML. J. Assoc. Inf. Sci. Technol. 53(6): 454-466 (2002) - [j37]Yaron Kanza, Werner Nutt, Yehoshua Sagiv:
Querying Incomplete Information in Semistructured Data. J. Comput. Syst. Sci. 64(3): 655-693 (2002) - [c65]Sara Cohen, Yaron Kanza, Yehoshua Sagiv:
Select-Project Queries over XML Documents. NGITS 2002: 2-13 - [i5]Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Equivalences Among Aggregate Queries with Negation. CoRR cs.DB/0210028 (2002) - 2001
- [j36]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) - [j35]Alon Y. Halevy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli:
Static analysis in datalog extensions. J. ACM 48(5): 971-1012 (2001) - [c64]Sara Cohen, Yaron Kanza, Yehoshua Sagiv:
SQL4X: A Flexible Query Language for XML and Relational Databases. DBPL 2001: 263-280 - [c63]Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Equivalences among Aggregate Queries with Negation. PODS 2001 - [c62]Yaron Kanza, Yehoshua Sagiv:
Flexible Queries Over Semistructured Data. PODS 2001 - [i4]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) - 2000
- [c61]Sara Cohen, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, Alexander Serebrenik:
Combining the Power of Searching and Querying. CoopIS 2000: 54-65 - [e2]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. Lecture Notes in Computer Science 1861, Springer 2000, ISBN 3-540-67797-6 [contents] - [i3]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) - [i2]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates. CoRR cs.PL/0011036 (2000) - [i1]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
A General Framework for Automatic Termination Analysis of Logic Programs. CoRR cs.PL/0012008 (2000)
1990 – 1999
- 1999
- [j34]Alexander Brodsky, Yehoshua Sagiv:
Inference of monotonicity constraints in Datalog programs. Ann. Math. Artif. Intell. 26(1-4): 29-57 (1999) - [c60]David Konopnicki, Lior Leiba, Oded Shmueli, Yehoshua Sagiv:
A Formal Yet Practical Approach to Electronic Commerce. CoopIS 1999: 197-208 - [c59]Yaron Kanza, Werner Nutt, Yehoshua Sagiv:
Incomplete Answers for Queries over Semistructured Data. KRDB 1999: 21-25 - [c58]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 - [c57]Yaron Kanza, Werner Nutt, Yehoshua Sagiv:
Queries with Incomplete Answers over Semistructured Data. PODS 1999: 227-236 - [c56]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 - [c55]Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Verification of Logic Programs@ICLP 1999: 39-58 - 1998
- [j33]Yakov A. Kogan, David Michaeli, Yehoshua Sagiv, Oded Shmueli:
Utilizing the Multiple Facets of WWW Contents. Data Knowl. Eng. 28(3): 255-275 (1998) - [c54]Werner Nutt, Yehoshua Sagiv, Sara Shurin:
Deciding Equivalences Among Aggregate Queries. PODS 1998: 214-223 - [c53]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 - 1997
- [j32]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) - [j31]Kenneth A. Ross, Yehoshua Sagiv:
Monotonic Aggregation in Deductive Database. J. Comput. Syst. Sci. 54(1): 79-97 (1997) - [j30]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) - [j29]Dallan Quass, Anand Rajaraman, Jeffrey D. Ullman, Jennifer Widom, Yehoshua Sagiv:
Querying Semistructured Heterogeneous Information. J. Syst. Integr. 7(3/4): 381-407 (1997) - [c52]Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
TermiLog: A System for Checking Termination of Queries to Logic Programs. CAV 1997: 444-447 - [c51]David Michaeli, Werner Nutt, Yehoshua Sagiv:
Classification Rules for Semi-Structured Data. Description Logics 1997 - [c50]Naomi Lindenstrauss, Yehoshua Sagiv:
Automatic Termination Analysis of Logic Programs. ICLP 1997: 63-77 - [c49]Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Unfolding the Mystery of Mergesort. LOPSTR 1997: 206-225 - [c48]Yakov A. Kogan, David Michaeli, Yehoshua Sagiv, Oded Shmueli:
Utilizing the Multiple Facets of WWW Contents. NGITS 1997 - 1996
- [c47]Joachim Biskup, Ralf Menzel, Torsten Polle, Yehoshua Sagiv:
Decomposition of Relationships through Pivoting. ER 1996: 28-41 - 1995
- [j28]Joachim Biskup, Pratul Dublish, Yehoshua Sagiv:
Optimization of a Subclass of Conjunctive Queries. Acta Informatica 32(1): 1-26 (1995) - [j27]Yehoshua Sagiv:
Editor's Forword. J. Comput. Syst. Sci. 51(1): 1 (1995) - [j26]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
Argument Reduction by Factoring. Theor. Comput. Sci. 146(1&2): 269-310 (1995) - [c46]Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
Querying Semistructured Heterogeneous Information. DOOD 1995: 319-344 - [c45]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 - [c44]Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, Divesh Srivastava:
Answering Queries Using Views. PODS 1995: 95-104 - [c43]Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman:
Answering Queries Using Templates with Binding Patterns. PODS 1995: 105-112 - [c42]Alon Y. Levy, Yehoshua Sagiv:
Semantic Query Optimization in Datalog Programs. PODS 1995: 163-173 - 1994
- [c41]Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman:
Validating Constraints with Partial Information: Research Overview. DAISD 1994: 375-385 - [c40]Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
Constraint Checking with Partial Information. PODS 1994: 45-55 - [c39]Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
Efficient and Complete Tests for Database Integrity Constraint Checking. PPCP 1994: 173-180 - [c38]Alon Y. Levy, Yehoshua Sagiv:
Semantic Query Optimization in Datalog Programs. ILPS Workshop: Constraints and Databases 1994 - [c37]Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv:
Query Optimization by Predicate Move-Around. VLDB 1994: 96-107 - 1993
- [j25]Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs. J. ACM 40(3): 683-713 (1993) - [j24]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) - [j23]Yehoshua Sagiv, Oded Shmueli:
Solving Queries by Tree Projections. ACM Trans. Database Syst. 18(3): 487-511 (1993) - [c36]Alon Y. Levy, Yehoshua Sagiv:
Exploiting Irrelevance Reasoning to Guide Problem Solving. IJCAI 1993: 138-145 - [c35]Yehoshua Sagiv:
Tools for Deductive Databases (Abstract). LPNMR 1993: 333 - [c34]Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli:
Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions. PODS 1993: 109-122 - [c33]Alon Y. Levy, Yehoshua Sagiv:
Queries Independent of Updates. VLDB 1993: 171-181 - 1992
- [j22]Yehoshua Sagiv, Yatin P. Saraiya:
Minimizing Restricted-Fanout Queries. Discret. Appl. Math. 40(2): 245-264 (1992) - [c32]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 - [c31]Alon Y. Levy, Yehoshua Sagiv:
Constraints and Redundancy in Datalog. PODS 1992: 67-80 - [c30]Kenneth A. Ross, Yehoshua Sagiv:
Monotonic Aggregation in Deductive Databases. PODS 1992: 114-126 - [c29]Michael Kifer, Won Kim, Yehoshua Sagiv:
Querying Object-Oriented Databases. SIGMOD Conference 1992: 393-402 - 1991
- [j21]Yehoshua Sagiv:
Evaluation of Queries in Independent Database Schemes. J. ACM 38(1): 120-161 (1991) - [j20]Jeffrey F. Naughton, Yehoshua Sagiv:
A Simple Characterization of Uniform Boundedness for a Class of Recursions. J. Log. Program. 10(3&4): 233-252 (1991) - [c28]Yehoshua Sagiv:
On Testing Effective Computability of Magic Programs. DOOD 1991: 244-262 - [c27]Alexander Brodsky, Yehoshua Sagiv:
Inference of Inequality Constraints in Logic Programs. PODS 1991: 227-240 - [c26]Yehoshua Sagiv:
A Termination Test for Logic Programs. ISLP 1991: 518-532 - 1990
- [c25]Pratul Dublish, Joachim Biskup, Yehoshua Sagiv:
Optimizatioin of a Subclass of Conjunctive Queries. ICDT 1990: 455-469 - [c24]Yehoshua Sagiv:
Is There Anything Better than Magic? NACLP 1990: 235-254 - [e1]Daniel J. Rosenkrantz, Yehoshua Sagiv:
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee, USA. ACM Press 1990, ISBN 0-89791-352-3 [contents]
1980 – 1989
- 1989
- [j19]Witold Litwin, Yehoshua Sagiv, K. Vidyasankar:
Concurrency and Trie Hashing. Acta Informatica 26(7): 597-614 (1989) - [j18]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) - [j17]Yehoshua Sagiv, Oded Shmueli:
A Characterization of Finite fd-Acyclicity. J. Comput. Syst. Sci. 38(2): 380-404 (1989) - [c23]Alexander Brodsky, Yehoshua Sagiv:
On Termination of Datalog Programs. DOOD 1989: 47-64 - [c22]Yehoshua Sagiv, Moshe Y. Vardi:
Safety of Datalog Queries over Infinite Databases. PODS 1989: 160-171 - [c21]Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi:
Proof-Tree Transformation Theorems and Their Applications. PODS 1989: 172-181 - [c20]Alexander Brodsky, Yehoshua Sagiv:
Inference of Monotonicity Constraints in Datalog Programs. PODS 1989: 190-199 - [c19]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989: 235-242 - [c18]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
Argument Reduction by Factoring. VLDB 1989: 173-182 - 1988
- [j16]Yehoshua Sagiv:
On Bounded Database Schemes and Bounded Horn-Clause Programs. SIAM J. Comput. 17(1): 1-22 (1988) - [p1]Yehoshua Sagiv:
Optimizing Datalog Programs. Foundations of Deductive Databases and Logic Programming. 1988: 659-698 - 1987
- [j15]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) - [c17]Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs. LICS 1987: 106-115 - [c16]Jeffrey F. Naughton, Yehoshua Sagiv:
A Decidable Class of Bounded Recursions. PODS 1987: 227-236 - [c15]Yehoshua Sagiv:
Optimizing Datalog Programs. PODS 1987: 349-362 - 1986
- [j14]Yehoshua Sagiv:
Concurrent Operations on B*-Trees with Overtaking. J. Comput. Syst. Sci. 33(2): 275-296 (1986) - [c14]François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman:
Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15 - [c13]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman:
Convergence of Sideways Query Evaluation. PODS 1986: 24-30 - [c12]Yehoshua Sagiv, Oded Shmueli:
The Equivalence of Solving Queries and Production Tree Projections. PODS 1986: 160-172 - [c11]Yehoshua Sagiv, Oded Shmueli:
On Finite FD-Acyclicity. PODS 1986: 173-182 - [c10]Yehoshua Sagiv:
Optimizing Datalog Programs. XP7.52 Workshop on Database Theory 1986 - 1985
- [c9]Yehoshua Sagiv:
Concurrent Operations on B-Trees with Overtaking. PODS 1985: 28-37 - [c8]Yehoshua Sagiv:
On Computing Restricted Projections of Representative Instances. PODS 1985: 171-180 - 1983
- [j13]Yehoshua Sagiv:
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions. SIAM J. Comput. 12(2): 316-328 (1983) - [j12]Yehoshua Sagiv:
A Characterization of Globally Consistent Databases and Their Correct Access Paths. ACM Trans. Database Syst. 8(2): 266-286 (1983) - [c7]Sharon McCure Kuck, Yehoshua Sagiv:
Designing Globally Consistent Network Schemas. SIGMOD Conference 1983: 185-195 - 1982
- [j11]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) - [c6]Sharon McCure Kuck, Yehoshua Sagiv:
A Universal Relation Database System Implemented via the Network Model. PODS 1982: 147-157 - 1981
- [j10]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) - [j9]David Maier, Yehoshua Sagiv, Mihalis Yannakakis:
On the Complexity of Testing Implications of Functional and Join Dependencies. J. ACM 28(4): 680-695 (1981) - [j8]Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalence of Relational Database Schemes. SIAM J. Comput. 10(2): 352-370 (1981) - [j7]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) - [c5]Yehoshua Sagiv:
Can We Use the Universal Instance Assumption Without Using Nulls? SIGMOD Conference 1981: 108-120 - 1980
- [j6]Yehoshua Sagiv:
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic. J. ACM 27(2): 250-262 (1980) - [j5]Yehoshua Sagiv, Mihalis Yannakakis:
Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM 27(4): 633-655 (1980)
1970 – 1979
- 1979
- [j4]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246 (1979) - [j3]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) - [j2]David Maier, Alberto O. Mendelzon, Yehoshua Sagiv:
Testing Implications of Data Dependencies. ACM Trans. Database Syst. 4(4): 455-469 (1979) - [c4]David Maier, Alberto O. Mendelzon, Yehoshua Sagiv:
Testing Implications of Data Dependencies (Abstract). SIGMOD Conference 1979: 152 - [c3]Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalence of Relational Database Schemes. STOC 1979: 319-329 - 1978
- [j1]Yehoshua Sagiv:
Report on ACM-SIGMOD International Conference on Management of Data. IEEE Database Eng. Bull. 2(2): 11 (1978) - [c2]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions (Abstract). SIGMOD Conference 1978: 39 - [c1]Yehoshua Sagiv, Mihalis Yannakakis:
Equivalence among Relational Expressions with the Union and Difference Operation. VLDB 1978: 535-548
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
