Yehoshua Sagiv

Available identifiers

zbMath Open sagiv.yehoshuaMaRDI QIDQ199249

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5276205	2017-07-14	Paper
Equivalences among aggregate queries with negation	2017-07-12	Paper
Static analysis in datalog extensions	2015-10-30	Paper
Deciding equivalences among conjunctive aggregate queries	2008-12-21	Paper
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties	2008-11-19	Paper
An incremental algorithm for computing ranked full disjunctions	2007-05-23	Paper
Database Programming Languages	2006-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q5714263	2005-12-28	Paper
Program Development in Computational Logic	2005-12-23	Paper
Database Theory - ICDT 2005	2005-09-13	Paper
https://portal.mardi4nfdi.de/entity/Q4414529	2003-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4414542	2003-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4412872	2003-07-17	Paper
Querying incomplete information in semistructured data	2002-09-12	Paper
A general framework for automatic termination analysis od logic programs	2001-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4499242	2001-03-05	Paper
Inference of monotonicity constraints in Datalog programs	2000-06-07	Paper
Utilizing the multiple facets of WWW contents	1999-01-12	Paper
Speeding up inferences using relevance reasoning: a formalism and algorithms	1998-08-13	Paper
Monotonic aggregation in deductive databases	1997-03-18	Paper
Argument reduction by factoring	1997-02-28	Paper
Optimization of a subclass of conjunctive queries	1995-03-22	Paper
Evaluation of queries in independent database schemes	1994-08-21	Paper
Undecidable optimization problems for database logic programs	1993-12-06	Paper
Logical query optimization by proof-tree transformation	1993-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q4694706	1993-06-29	Paper
Minimizing restricted-fanout queries	1993-01-31	Paper
A simple characterization of uniform boundedness for a class of recursions	1991-01-01	Paper
On the convergence of query evaluation	1989-01-01	Paper
Concurrency and trie hashing	1989-01-01	Paper
A characterization of finite fd-acyclicity	1989-01-01	Paper
On Bounded Database Schemes and Bounded Horn-Clause Programs	1988-01-01	Paper
Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”	1987-01-01	Paper
Concurrent operations on \(B^ *\)-trees with overtaking	1986-01-01	Paper
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions	1983-01-01	Paper
A characterization of globally consistent databases and their correct access paths	1983-01-01	Paper
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies	1982-01-01	Paper
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic	1981-01-01	Paper
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions	1981-01-01	Paper
Equivalence of Relational Database Schemes	1981-01-01	Paper
On the Complexity of Testing Implications of Functional and Join Dependencies	1981-01-01	Paper
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic	1980-01-01	Paper
Equivalences Among Relational Expressions with the Union and Difference Operators	1980-01-01	Paper
Equivalences among Relational Expressions	1979-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Yehoshua Sagiv