Yehoshua Sagiv

From MaRDI portal
Person:199249

Available identifiers

zbMath Open sagiv.yehoshuaMaRDI QIDQ199249

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q52762052017-07-14Paper
Equivalences among aggregate queries with negation2017-07-12Paper
Static analysis in datalog extensions2015-10-30Paper
Deciding equivalences among conjunctive aggregate queries2008-12-21Paper
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties2008-11-19Paper
An incremental algorithm for computing ranked full disjunctions2007-05-23Paper
Database Programming Languages2006-10-20Paper
https://portal.mardi4nfdi.de/entity/Q57142632005-12-28Paper
Program Development in Computational Logic2005-12-23Paper
Database Theory - ICDT 20052005-09-13Paper
https://portal.mardi4nfdi.de/entity/Q44145292003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q44145422003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q44128722003-07-17Paper
Querying incomplete information in semistructured data2002-09-12Paper
A general framework for automatic termination analysis od logic programs2001-08-26Paper
https://portal.mardi4nfdi.de/entity/Q44992422001-03-05Paper
Inference of monotonicity constraints in Datalog programs2000-06-07Paper
Utilizing the multiple facets of WWW contents1999-01-12Paper
Speeding up inferences using relevance reasoning: a formalism and algorithms1998-08-13Paper
Monotonic aggregation in deductive databases1997-03-18Paper
Argument reduction by factoring1997-02-28Paper
Optimization of a subclass of conjunctive queries1995-03-22Paper
Evaluation of queries in independent database schemes1994-08-21Paper
Undecidable optimization problems for database logic programs1993-12-06Paper
Logical query optimization by proof-tree transformation1993-10-10Paper
https://portal.mardi4nfdi.de/entity/Q46947061993-06-29Paper
Minimizing restricted-fanout queries1993-01-31Paper
A simple characterization of uniform boundedness for a class of recursions1991-01-01Paper
On the convergence of query evaluation1989-01-01Paper
Concurrency and trie hashing1989-01-01Paper
A characterization of finite fd-acyclicity1989-01-01Paper
On Bounded Database Schemes and Bounded Horn-Clause Programs1988-01-01Paper
Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”1987-01-01Paper
Concurrent operations on \(B^ *\)-trees with overtaking1986-01-01Paper
A characterization of globally consistent databases and their correct access paths1983-01-01Paper
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions1983-01-01Paper
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies1982-01-01Paper
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic1981-01-01Paper
On the Complexity of Testing Implications of Functional and Join Dependencies1981-01-01Paper
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions1981-01-01Paper
Equivalence of Relational Database Schemes1981-01-01Paper
Equivalences Among Relational Expressions with the Union and Difference Operators1980-01-01Paper
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic1980-01-01Paper
Equivalences among Relational Expressions1979-01-01Paper

Research outcomes over time

This page was built for person: Yehoshua Sagiv