The following pages link to Yehoshua Sagiv (Q199249):
Displayed 45 items.
- Concurrent operations on \(B^ *\)-trees with overtaking (Q579974) (← links)
- (Q673138) (redirect page) (← links)
- Argument reduction by factoring (Q673140) (← links)
- Monotonic aggregation in deductive databases (Q676422) (← links)
- Logical query optimization by proof-tree transformation (Q686647) (← links)
- Querying incomplete information in semistructured data (Q696966) (← links)
- An incremental algorithm for computing ranked full disjunctions (Q882441) (← links)
- On the convergence of query evaluation (Q919818) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- Concurrency and trie hashing (Q1112592) (← links)
- Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
- Minimizing restricted-fanout queries (Q1202893) (← links)
- A characterization of finite fd-acyclicity (Q1264004) (← links)
- Optimization of a subclass of conjunctive queries (Q1346219) (← links)
- Inference of monotonicity constraints in Datalog programs (Q1978016) (← links)
- Undecidable optimization problems for database logic programs (Q3140022) (← links)
- Static analysis in datalog extensions (Q3196624) (← links)
- A simple characterization of uniform boundedness for a class of recursions (Q3210151) (← links)
- Deciding equivalences among conjunctive aggregate queries (Q3546330) (← links)
- Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions (Q3657474) (← links)
- Correction to “An equivalence between relational database dependencies and a fragment of propositional logic” (Q3765274) (← links)
- On Bounded Database Schemes and Bounded Horn-Clause Programs (Q3777438) (← links)
- An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic (Q3891803) (← links)
- Equivalences Among Relational Expressions with the Union and Difference Operators (Q3906490) (← links)
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic (Q3912077) (← links)
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions (Q3912082) (← links)
- Equivalence of Relational Database Schemes (Q3925900) (← links)
- On the Complexity of Testing Implications of Functional and Join Dependencies (Q3939277) (← links)
- Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies (Q3945625) (← links)
- Equivalences among Relational Expressions (Q4199525) (← links)
- Utilizing the multiple facets of WWW contents (Q4224404) (← links)
- Evaluation of queries in independent database schemes (Q4302831) (← links)
- (Q4412872) (← links)
- (Q4414529) (← links)
- (Q4414542) (← links)
- (Q4499242) (← links)
- (Q4694706) (← links)
- A characterization of globally consistent databases and their correct access paths (Q4747565) (← links)
- (Q5276205) (← links)
- Equivalences among aggregate queries with negation (Q5277724) (← links)
- Database Theory - ICDT 2005 (Q5316621) (← links)
- Database Programming Languages (Q5493332) (← links)
- Program Development in Computational Logic (Q5712541) (← links)
- (Q5714263) (← links)
- A general framework for automatic termination analysis od logic programs (Q5941755) (← links)