Author of the publication

Constructing Data Graphs for Keyword Search.

, and . DEXA (2), volume 9828 of Lecture Notes in Computer Science, page 399-409. Springer, (2016)

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)Modeling and querying probabilistic XML data., and . SIGMOD Record, 37 (4): 69-77 (2008)The Equivalence of Solving Queries and Production Tree Projections., and . PODS, page 160-172. ACM, (1986)A Decidable Class of Bounded Recursions., and . PODS, page 227-236. ACM, (1987)Maximally joining probabilistic data., and . PODS, page 303-312. ACM, (2007)Knowledge Management for Keyword Search over Data Graphs., and . CIKM, page 2051-2053. ACM, (2014)Optimizing Datalog Programs.. XP7.52 Workshop on Database Theory, (1986)Is There Anything Better than Magic?. NACLP, page 235-254. MIT Press, (1990)Language models for keyword search over data graphs., and . WSDM, page 363-372. ACM, (2012)On Testing Effective Computability of Magic Programs.. DOOD, volume 566 of Lecture Notes in Computer Science, page 244-262. Springer, (1991)