Efficient Optimization of a Class of Relational Expressions (Abstract). - Alfred V. Aho; Yehoshua Sagiv; Jeffrey D. Ullman (SIGMOD Conference, 1978)

Equivalence among Relational Expressions with the Union and Difference Operation. - Yehoshua Sagiv; Mihalis Yannakakis (VLDB, 1978)

Report on ACM-SIGMOD International Conference on Management of Data. - Yehoshua Sagiv (IEEE Database Eng. Bull., 1978)

Testing Implications of Data Dependencies (Abstract). - David Maier 001; Alberto O. Mendelzon; Yehoshua Sagiv (SIGMOD Conference, 1979)

Equivalences Among Relational Expressions. - Alfred V. Aho; Yehoshua Sagiv; Jeffrey D. Ullman (SIAM J. Comput., 1979)

Efficient Optimization of a Class of Relational Expressions. - Alfred V. Aho; Yehoshua Sagiv; Jeffrey D. Ullman (ACM Trans. Database Syst., 1979)

Testing Implications of Data Dependencies. - David Maier 001; Alberto O. Mendelzon; Yehoshua Sagiv (ACM Trans. Database Syst., 1979)

An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic. - Yehoshua Sagiv (J. ACM, 1980)

Equivalences Among Relational Expressions with the Union and Difference Operators. - Yehoshua Sagiv; Mihalis Yannakakis (J. ACM, 1980)

Can We Use the Universal Instance Assumption Without Using Nulls? - Yehoshua Sagiv (SIGMOD Conference, 1981)

On the Complexity of Testing Implications of Functional and Join Dependencies. - David Maier 001; Yehoshua Sagiv; Mihalis Yannakakis (J. ACM, 1981)

An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. - Yehoshua Sagiv; Claude Delobel; Douglas Stott Parker Jr.; Ronald Fagin (J. ACM, 1981)

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. - Alfred V. Aho; Yehoshua Sagiv; Thomas G. Szymanski; Jeffrey D. Ullman (SIAM J. Comput., 1981)

Equivalence of Relational Database Schemes. - Catriel Beeri; Alberto O. Mendelzon; Yehoshua Sagiv; Jeffrey D. Ullman (SIAM J. Comput., 1981)

A Universal Relation Database System Implemented via the Network Model. - Sharon McCure Kuck; Yehoshua Sagiv (PODS, 1982)

Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies. - Yehoshua Sagiv; Scott F. Walecka (J. ACM, 1982)

Designing Globally Consistent Network Schemas. - Sharon McCure Kuck; Yehoshua Sagiv (SIGMOD Conference, 1983)

Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions. - Yehoshua Sagiv (SIAM J. Comput., 1983)

A Characterization of Globally Consistent Databases and Their Correct Access Paths. - Yehoshua Sagiv (ACM Trans. Database Syst., 1983)

On Computing Restricted Projections of Representative Instances. - Yehoshua Sagiv (PODS, 1985)

Convergence of Sideways Query Evaluation. - Foto N. Afrati; Christos H. Papadimitriou; George Papageorgiou; Athena Roussou; Yehoshua Sagiv; Jeffrey D. Ullman (PODS, 1986)

Magic Sets and Other Strange Ways to Implement Logic Programs. - François Bancilhon; David Maier 001; Yehoshua Sagiv; Jeffrey D. Ullman (PODS, 1986)

The Equivalence of Solving Queries and Production Tree Projections. - Yehoshua Sagiv; Oded Shmueli (PODS, 1986)

On Finite FD-Acyclicity. - Yehoshua Sagiv; Oded Shmueli (PODS, 1986)

Optimizing Datalog Programs. - Yehoshua Sagiv (XP7.52 Workshop on Database Theory, 1986)

Concurrent Operations on B*-Trees with Overtaking. - Yehoshua Sagiv (J. Comput. Syst. Sci., 1986)

A Decidable Class of Bounded Recursions. - Jeffrey F. Naughton; Yehoshua Sagiv (PODS, 1987)

Correction to "An equivalence between relational database dependencies and a fragment of propositional logic". - Yehoshua Sagiv; Claude Delobel; Douglas Stott Parker Jr.; Ronald Fagin (J. ACM, 1987)

Optimizing Datalog Programs. - Yehoshua Sagiv (Foundations of Deductive Databases and Logic Programming., 1988)

On Bounded Database Schemes and Bounded Horn-Clause Programs. - Yehoshua Sagiv (SIAM J. Comput., 1988)

On Termination of Datalog Programs. - Alexander Brodsky 001; Yehoshua Sagiv (DOOD, 1989)

Proof-Tree Transformation Theorems and Their Applications. - Raghu Ramakrishnan 001; Yehoshua Sagiv; Jeffrey D. Ullman; Moshe Y. Vardi (PODS, 1989)

Safety of Datalog Queries over Infinite Databases. - Yehoshua Sagiv; Moshe Y. Vardi (PODS, 1989)

Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. - Jeffrey F. Naughton; Raghu Ramakrishnan 001; Yehoshua Sagiv; Jeffrey D. Ullman (SIGMOD Conference, 1989)

Concurrency and Trie Hashing. - Witold Litwin; Yehoshua Sagiv; K. Vidyasankar (Acta Informatica, 1989)

On the Convergence of Query Evaluation. - Foto N. Afrati; Christos H. Papadimitriou; George Papageorgiou; Athena Roussou; Yehoshua Sagiv; Jeffrey D. Ullman (J. Comput. Syst. Sci., 1989)

A Characterization of Finite fd-Acyclicity. - Yehoshua Sagiv; Oded Shmueli (J. Comput. Syst. Sci., 1989)

Optimizatioin of a Subclass of Conjunctive Queries. - Pratul Dublish; Joachim Biskup; Yehoshua Sagiv (ICDT, 1990)

Is There Anything Better than Magic? - Yehoshua Sagiv (NACLP, 1990)

On Testing Effective Computability of Magic Programs. - Yehoshua Sagiv (DOOD, 1991)

Inference of Inequality Constraints in Logic Programs. - Alexander Brodsky 001; Yehoshua Sagiv (PODS, 1991)

A Termination Test for Logic Programs. - Yehoshua Sagiv (ISLP, 1991)

Evaluation of Queries in Independent Database Schemes. - Yehoshua Sagiv (J. ACM, 1991)

A Simple Characterization of Uniform Boundedness for a Class of Recursions. - Jeffrey F. Naughton; Yehoshua Sagiv (J. Log. Program., 1991)

Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions. - Alon Y. Levy; Inderpal Singh Mumick; Yehoshua Sagiv; Oded Shmueli (Workshop on Deductive Databases, JICSLP, 1992)

Constraints and Redundancy in Datalog. - Alon Y. Levy; Yehoshua Sagiv (PODS, 1992)

Monotonic Aggregation in Deductive Databases. - Kenneth A. Ross; Yehoshua Sagiv (PODS, 1992)

Querying Object-Oriented Databases. - Michael Kifer; Won Kim 001; Yehoshua Sagiv (SIGMOD Conference, 1992)

Minimizing Restricted-Fanout Queries. - Yehoshua Sagiv; Yatin P. Saraiya (Discret. Appl. Math., 1992)

Exploiting Irrelevance Reasoning to Guide Problem Solving. - Alon Y. Levy; Yehoshua Sagiv (IJCAI, 1993)

Tools for Deductive Databases (Abstract). - Yehoshua Sagiv (LPNMR, 1993)

Queries Independent of Updates. - Alon Y. Levy; Yehoshua Sagiv (VLDB, 1993)

Undecidable Optimization Problems for Database Logic Programs. - Haim Gaifman; Harry G. Mairson; Yehoshua Sagiv; Moshe Y. Vardi (J. ACM, 1993)

Logical Query Optimization by Proff-Tree Transformation. - Raghu Ramakrishnan 001; Yehoshua Sagiv; Jeffrey D. Ullman; Moshe Y. Vardi (J. Comput. Syst. Sci., 1993)

Solving Queries by Tree Projections. - Yehoshua Sagiv; Oded Shmueli (ACM Trans. Database Syst., 1993)

Validating Constraints with Partial Information: Research Overview. - Jennifer Widom; Ashish Gupta 001; Yehoshua Sagiv; Jeffrey D. Ullman (DAISD, 1994)

Constraint Checking with Partial Information. - Ashish Gupta 001; Yehoshua Sagiv; Jeffrey D. Ullman; Jennifer Widom (PODS, 1994)

Efficient and Complete Tests for Database Integrity Constraint Checking. - Ashish Gupta 001; Yehoshua Sagiv; Jeffrey D. Ullman; Jennifer Widom (PPCP, 1994)

Semantic Query Optimization in Datalog Programs. - Alon Y. Levy; Yehoshua Sagiv (ILPS Workshop: Constraints and Databases, 1994)

Query Optimization by Predicate Move-Around. - Alon Y. Levy; Inderpal Singh Mumick; Yehoshua Sagiv (VLDB, 1994)

The TSIMMIS Approach to Mediation: Data Models and Languages. - Hector Garcia-Molina; Dallan Quass; Yannis Papakonstantinou; Anand Rajaraman; Yehoshua Sagiv; Jeffrey D. Ullman; Jennifer Widom (NGITS, 1995)

Answering Queries Using Views. - Alon Y. Levy; Alberto O. Mendelzon; Yehoshua Sagiv; Divesh Srivastava (PODS, 1995)

Answering Queries Using Templates with Binding Patterns. - Anand Rajaraman; Yehoshua Sagiv; Jeffrey D. Ullman (PODS, 1995)

Optimization of a Subclass of Conjunctive Queries. - Joachim Biskup; Pratul Dublish; Yehoshua Sagiv (Acta Informatica, 1995)

Editor's Forword. - Yehoshua Sagiv (J. Comput. Syst. Sci., 1995)

Argument Reduction by Factoring. - Jeffrey F. Naughton; Raghu Ramakrishnan 001; Yehoshua Sagiv; Jeffrey D. Ullman (Theor. Comput. Sci., 1995)

Decomposition of Relationships through Pivoting. - Joachim Biskup; Ralf Menzel; Torsten Polle; Yehoshua Sagiv (ER, 1996)

TermiLog: A System for Checking Termination of Queries to Logic Programs. - Naomi Lindenstrauss; Yehoshua Sagiv; Alexander Serebrenik (CAV, 1997)

Classification Rules for Semi-Structured Data. - David Michaeli; Werner Nutt; Yehoshua Sagiv (Description Logics, 1997)

Automatic Termination Analysis of Logic Programs. - Naomi Lindenstrauss; Yehoshua Sagiv (ICLP, 1997)

Unfolding the Mystery of Mergesort. - Naomi Lindenstrauss; Yehoshua Sagiv; Alexander Serebrenik (LOPSTR, 1997)

Speeding up Inferences Using Relevance Reasoning: A Formalism and Algorithms. - Alon Y. Levy; Richard Fikes; Yehoshua Sagiv (Artif. Intell., 1997)

Monotonic Aggregation in Deductive Database. - Kenneth A. Ross; Yehoshua Sagiv (J. Comput. Syst. Sci., 1997)

The TSIMMIS Approach to Mediation: Data Models and Languages. - Hector Garcia-Molina; Yannis Papakonstantinou; Dallan Quass; Anand Rajaraman; Yehoshua Sagiv; Jeffrey D. Ullman; Vasilis Vassalos; Jennifer Widom (J. Intell. Inf. Syst., 1997)

Querying Semistructured Heterogeneous Information. - Dallan Quass; Anand Rajaraman; Jeffrey D. Ullman; Jennifer Widom; Yehoshua Sagiv (J. Syst. Integr., 1997)

Deciding Equivalences Among Aggregate Queries. - Werner Nutt; Yehoshua Sagiv; Sara Shurin (PODS, 1998)

WebSuite: A Tool Suite for Harnessing Web Data. - Catriel Beeri; Gershon Elber; Tova Milo; Yehoshua Sagiv; Oded Shmueli; Naftali Tishby; Yakov A. Kogan; David Konopnicki; Pini Mogilevski; Noam Slonim (WebDB, 1998)

Utilizing the Multiple Facets of WWW Contents. - Yakov A. Kogan; David Michaeli; Yehoshua Sagiv; Oded Shmueli (Data Knowl. Eng., 1998)

Incomplete Answers for Queries over Semistructured Data. - Yaron Kanza; Werner Nutt; Yehoshua Sagiv (KRDB, 1999)

Querying Semantically Tagged Documents on the World-Wide Web. - Ziv Bar-Yossef; Yaron Kanza; Yakov A. Kogan; Werner Nutt; Yehoshua Sagiv (NGITS, 1999)

Queries with Incomplete Answers over Semistructured Data. - Yaron Kanza; Werner Nutt; Yehoshua Sagiv (PODS, 1999)

EquiX Easy Querying in XML Databases. - Sara Cohen; Yaron Kanza; Yakov A. Kogan; Werner Nutt; Yehoshua Sagiv; Alexander Serebrenik (WebDB (Informal Proceedings), 1999)

Inference of monotonicity constraints in Datalog programs. - Alexander Brodsky 001; Yehoshua Sagiv (Ann. Math. Artif. Intell., 1999)

Automatic Termination Analysis of Programs Containing Arithmetic Predicates. - Nachum Dershowitz; Naomi Lindenstrauss; Yehoshua Sagiv; Alexander Serebrenik (Verification of Logic Programs@ICLP, 1999)

Combining the Power of Searching and Querying. - Sara Cohen; Yaron Kanza; Yakov A. Kogan; Werner Nutt; Yehoshua Sagiv; Alexander Serebrenik (CoopIS, 2000)

SQL4X: A Flexible Query Language for XML and Relational Databases. - Sara Cohen; Yaron Kanza; Yehoshua Sagiv (DBPL, 2001)

Flexible Queries Over Semistructured Data. - Yaron Kanza; Yehoshua Sagiv (PODS, 2001)

A General Framework for Automatic Termination Analysis of Logic Programs. - Nachum Dershowitz; Naomi Lindenstrauss; Yehoshua Sagiv; Alexander Serebrenik (Appl. Algebra Eng. Commun. Comput., 2001)

Static analysis in datalog extensions. - Alon Y. Halevy; Inderpal Singh Mumick; Yehoshua Sagiv; Oded Shmueli (J. ACM, 2001)

Select-Project Queries over XML Documents. - Sara Cohen; Yaron Kanza; Yehoshua Sagiv (NGITS, 2002)

A Formal Yet Practical Approach to Electronic Commerce. - David Konopnicki; Lior Leiba; Oded Shmueli; Yehoshua Sagiv (Int. J. Cooperative Inf. Syst., 2002)

EquiX - A search and query language for XML. - Sara Cohen; Yaron Kanza; Yakov A. Kogan; Yehoshua Sagiv; Werner Nutt; Alexander Serebrenik (J. Assoc. Inf. Sci. Technol., 2002)

Querying Incomplete Information in Semistructured Data. - Yaron Kanza; Werner Nutt; Yehoshua Sagiv (J. Comput. Syst. Sci., 2002)

Generating Relations from XML Documents. - Sara Cohen; Yaron Kanza; Yehoshua Sagiv (ICDT, 2003)

Containment of Aggregate Queries. - Sara Cohen; Werner Nutt; Yehoshua Sagiv (ICDT, 2003)

Searching in an XML Corpus Using Content and Structure. - Yiftah Ben-Aharon; Sara Cohen; Yael Grumbach; Yaron Kanza; Jonathan Mamou; Yehoshua Sagiv; Benjamin Sznajder; Efrat Twito (INEX, 2003)

Computing full disjunctions. - Yaron Kanza; Yehoshua Sagiv (PODS, 2003)

XSEarch: A Semantic Search Engine for XML. - Sara Cohen; Jonathan Mamou; Yaron Kanza; Yehoshua Sagiv (VLDB, 2003)

Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. - Naomi Lindenstrauss; Yehoshua Sagiv; Alexander Serebrenik (Program Development in Computational Logic, 2004)

Object Fusion in Geographic Information Systems. - Catriel Beeri; Yaron Kanza; Eliyahu Safra; Yehoshua Sagiv (VLDB, 2004)

Generating All Maximal Induced Subgraphs for Hereditary Connected-Hereditary and Rooted-Hereditary Properties - Sara Cohen; Yehoshua Sagiv (CoRR, 2004)

Interconnection semantics for keyword search in XML. - Sara Cohen; Yaron Kanza; Benny Kimelfeld; Yehoshua Sagiv (CIKM, 2005)

Efficiently Enumerating Results of Keyword Search. - Benny Kimelfeld; Yehoshua Sagiv (DBPL, 2005)

Finding corresponding objects when integrating several geo-spatial datasets. - Catriel Beeri; Yerach Doytsher; Yaron Kanza; Eliyahu Safra; Yehoshua Sagiv (GIS, 2005)

An Abstract Framework for Generating Maximal Answers to Queries. - Sara Cohen; Yehoshua Sagiv (ICDT, 2005)

Efficient Engines for Keyword Proximity Search. - Benny Kimelfeld; Yehoshua Sagiv (WebDB, 2005)

Equivalences among aggregate queries with negation. - Sara Cohen; Yehoshua Sagiv; Werner Nutt (ACM Trans. Comput. Log., 2005)

Efficient integration of road maps. - Eliyahu Safra; Yaron Kanza; Yehoshua Sagiv; Yerach Doytsher (GIS, 2006)

Using Language Models and the HITS Algorithm for XML Retrieval. - Benny Kimelfeld; Eitan Kovacs; Yehoshua Sagiv; Dan Yahav (INEX, 2006)

Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. - Benny Kimelfeld; Yehoshua Sagiv (NGITS, 2006)

Finding and approximating top-k answers in keyword proximity search. - Benny Kimelfeld; Yehoshua Sagiv (PODS, 2006)

Full Disjunctions: Polynomial-Delay Iterators in Action. - Sara Cohen; Itzhak Fadida; Yaron Kanza; Benny Kimelfeld; Yehoshua Sagiv (VLDB, 2006)

Integrating Data from Maps on the World-Wide Web. - Eliyahu Safra; Yaron Kanza; Yehoshua Sagiv; Yerach Doytsher (W2GIS, 2006)

Twig Patterns: From XML Trees to Graphs. - Benny Kimelfeld; Yehoshua Sagiv (WebDB, 2006)

Rewriting queries with arbitrary aggregation functions using views. - Sara Cohen; Werner Nutt; Yehoshua Sagiv (ACM Trans. Database Syst., 2006)

Combining Incompleteness and Ranking in Tree Queries. - Benny Kimelfeld; Yehoshua Sagiv (ICDT, 2007)

Maximally joining probabilistic data. - Benny Kimelfeld; Yehoshua Sagiv (PODS, 2007)

Computing a k -Route over Uncertain Geographical Data. - Eliyahu Safra; Yaron Kanza; Nir Dolev; Yehoshua Sagiv; Yerach Doytsher (SSTD, 2007)

Matching Twigs in Probabilistic XML. - Benny Kimelfeld; Yehoshua Sagiv (VLDB, 2007)

Deciding equivalences among conjunctive aggregate queries. - Sara Cohen; Werner Nutt; Yehoshua Sagiv (J. ACM, 2007)

An incremental algorithm for computing ranked full disjunctions. - Sara Cohen; Yehoshua Sagiv (J. Comput. Syst. Sci., 2007)

Revisiting redundancy and minimization in an XPath fragment. - Benny Kimelfeld; Yehoshua Sagiv (EDBT, 2008)

Heuristic algorithms for route-search queries over geographical data. - Yaron Kanza; Eliyahu Safra; Yehoshua Sagiv; Yerach Doytsher (GIS, 2008)

Keyword proximity search in complex data graphs. - Konstantin Golenberg; Benny Kimelfeld; Yehoshua Sagiv (SIGMOD Conference, 2008)

Query efficiency in probabilistic XML models. - Benny Kimelfeld; Yuri Kosharovsky; Yehoshua Sagiv (SIGMOD Conference, 2008)

Efficiently enumerating results of keyword search over data graphs. - Benny Kimelfeld; Yehoshua Sagiv (Inf. Syst., 2008)

Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties. - Sara Cohen; Benny Kimelfeld; Yehoshua Sagiv (J. Comput. Syst. Sci., 2008)

Modeling and querying probabilistic XML data. - Benny Kimelfeld; Yehoshua Sagiv (SIGMOD Rec., 2008)

A scalable and effective full-text search in P2P networks. - Yosi Mass; Yehoshua Sagiv; Michal Shmueli-Scheuer (CIKM, 2009)

On rewriting XPath queries using views. - Foto N. Afrati; Rada Chirkova; Manolis Gergatsoulis; Benny Kimelfeld; Vassia Pavlaki; Yehoshua Sagiv (EDBT, 2009)

An interactive approach to route search. - Yaron Kanza; Roy Levin; Eliyahu Safra; Yehoshua Sagiv (GIS, 2009)

Running tree automata on probabilistic XML. - Sara Cohen; Benny Kimelfeld; Yehoshua Sagiv (PODS, 2009)

ExQueX: exploring and querying XML documents. - Benny Kimelfeld; Yehoshua Sagiv; Gidi Weber (SIGMOD Conference, 2009)

Route Search over Probabilistic Geospatial Data. - Yaron Kanza; Eliyahu Safra; Yehoshua Sagiv (SSTD, 2009)

Incorporating constraints in probabilistic XML. - Sara Cohen; Benny Kimelfeld; Yehoshua Sagiv (ACM Trans. Database Syst., 2009)

On the expressiveness of probabilistic XML models. - Serge Abiteboul; Benny Kimelfeld; Yehoshua Sagiv; Pierre Senellart (VLDB J., 2009)

Query evaluation over probabilistic XML. - Benny Kimelfeld; Yuri Kosharovsky; Yehoshua Sagiv (VLDB J., 2009)

A peer-selection algorithm for information retrieval. - Yosi Mass; Yehoshua Sagiv; Michal Shmueli-Scheuer (CIKM, 2010)

Exploratory keyword search on data graphs. - Hilit Achiezra; Konstantin Golenberg; Benny Kimelfeld; Yehoshua Sagiv (SIGMOD Conference, 2010)

Location-based algorithms for finding sets of corresponding objects over several geo-spatial data sets. - Eliyahu Safra; Yaron Kanza; Yehoshua Sagiv; Catriel Beeri; Yerach Doytsher (Int. J. Geogr. Inf. Sci., 2010)

Interactive Route Search in the Presence of Order Constraints. - Roy Levin; Yaron Kanza; Eliyahu Safra; Yehoshua Sagiv (Proc. VLDB Endow., 2010)

IQ: The Case for Iterative Querying for Knowledge. - Yosi Mass; Maya Ramanath; Yehoshua Sagiv; Gerhard Weikum (CIDR, 2011)

Finding a minimal tree pattern under neighborhood constraints. - Benny Kimelfeld; Yehoshua Sagiv (PODS, 2011)

KMV-peer: a robust and adaptive peer-selection algorithm. - Yosi Mass; Yehoshua Sagiv; Michal Shmueli-Scheuer (WSDM, 2011)

Optimizing and Parallelizing Ranked Enumeration. - Konstantin Golenberg; Benny Kimelfeld; Yehoshua Sagiv (Proc. VLDB Endow., 2011)

Language models for keyword search over data graphs. - Yosi Mass; Yehoshua Sagiv (WSDM, 2012)

WISER: a web-based interactive route search system for smartphones. - Roi Friedman; Itsik Hefez; Yaron Kanza; Roy Levin; Eliyahu Safra; Yehoshua Sagiv (WWW (Companion Volume), 2012)

Extracting minimum-weight tree patterns from a schema with neighborhood constraints. - Benny Kimelfeld; Yehoshua Sagiv (ICDT, 2013)

A personal perspective on keyword search over data graphs. - Yehoshua Sagiv (ICDT, 2013)

Ad hoc matching of vectorial road networks. - Eliyahu Safra; Yaron Kanza; Yehoshua Sagiv; Yerach Doytsher (Int. J. Geogr. Inf. Sci., 2013)

Knowledge Management for Keyword Search over Data Graphs. - Yosi Mass; Yehoshua Sagiv (CIKM, 2014)

A personalized GeoSocial app for surviving an earthquake. - Shlomo Bekhor; Sara Cohen; Yerach Doytsher; Yaron Kanza; Yehoshua Sagiv (EM-GIS, 2015)

Constructing Data Graphs for Keyword Search. - Konstantin Golenberg; Yehoshua Sagiv (DEXA (2), 2016)

Virtual Documents and Answer Priors in Keyword Search over Data Graphs. - Yosi Mass; Yehoshua Sagiv (EDBT/ICDT Workshops, 2016)

A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs. - Konstantin Golenberg; Yehoshua Sagiv (ICDT, 2016)

Location-Based Distance Measures for Geosocial Similarity. - Yaron Kanza; Elad Kravi; Eliyahu Safra; Yehoshua Sagiv (ACM Trans. Web, 2017)