( en | de | ru )

 

Disambiguation of "Sagiv, Yehoshua"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Optimization of a Class of Relational Expressions (Abstract).

, , and . SIGMOD Conference, page 39. ACM, (1978)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Sagiv, Yehoshua
add a person with the name Sagiv, Yehoshua
 

Other publications of authors with the same name

The TSIMMIS approach to mediation: Data models and languages, , , , , , , and . Journal of Intelligent Information Systems, 8 (2): 117--132 (2004)An Abstract Framework for Generating Maximal Answers to Queries., and . ICDT, volume 3363 of Lecture Notes in Computer Science, page 129-143. Springer, (2005)Combining Incompleteness and Ranking in Tree Queries., and . ICDT, volume 4353 of Lecture Notes in Computer Science, page 329-343. Springer, (2007)Efficiently Enumerating Results of Keyword Search., and . DBPL, volume 3774 of Lecture Notes in Computer Science, page 58-73. Springer, (2005)On Testing Effective Computability of Magic Programs.. DOOD, volume 566 of Lecture Notes in Computer Science, page 244-262. Springer, (1991)On Termination of Datalog Programs., and . DOOD, page 47-64. North-Holland/Elsevier Science Publishers, (1989)Optimizing Datalog Programs.. XP7.52 Workshop on Database Theory, (1986)Is There Anything Better than Magic?. NACLP, page 235-254. MIT Press, (1990)A Decidable Class of Bounded Recursions., and . PODS, page 227-236. ACM, (1987)The Equivalence of Solving Queries and Production Tree Projections., and . PODS, page 160-172. ACM, (1986)