From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Knowledge Management for Keyword Search over Data Graphs.

Y. Mass, и Y. Sagiv. CIKM, стр. 2051-2053. ACM, (2014)

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.

No persons found for author name Sagiv, Yehoshua

The TSIMMIS approach to mediation: Data models and languagesH. Garcia-Molina, Y. Papakonstantinou, D. Quass, A. Rajaraman, Y. Sagiv, J. Ullman, V. Vassalos, и J. Widom. Journal of Intelligent Information Systems, 8 (2): 117--132 (2004)Modeling and querying probabilistic XML data.B. Kimelfeld, и Y. Sagiv. SIGMOD Record, 37 (4): 69-77 (2008)The Equivalence of Solving Queries and Production Tree Projections.Y. Sagiv, и O. Shmueli. PODS, стр. 160-172. ACM, (1986)A Decidable Class of Bounded Recursions.J. Naughton, и Y. Sagiv. PODS, стр. 227-236. ACM, (1987)Optimizing Datalog Programs.Y. Sagiv. XP7.52 Workshop on Database Theory, (1986)Is There Anything Better than Magic?Y. Sagiv. NACLP, стр. 235-254. MIT Press, (1990)Efficiently Enumerating Results of Keyword Search.B. Kimelfeld, и Y. Sagiv. DBPL, том 3774 из Lecture Notes in Computer Science, стр. 58-73. Springer, (2005)Combining Incompleteness and Ranking in Tree Queries.B. Kimelfeld, и Y. Sagiv. ICDT, том 4353 из Lecture Notes in Computer Science, стр. 329-343. Springer, (2007)An Abstract Framework for Generating Maximal Answers to Queries.S. Cohen, и Y. Sagiv. ICDT, том 3363 из Lecture Notes in Computer Science, стр. 129-143. Springer, (2005)On Testing Effective Computability of Magic Programs.Y. Sagiv. DOOD, том 566 из Lecture Notes in Computer Science, стр. 244-262. Springer, (1991)