Benny Kimelfeld
Benny Kimelfeld
Verifierad e-postadress på cs.technion.ac.il - Startsida
TitelCiteras avÅr
Keyword proximity search in complex data graphs
K Golenberg, B Kimelfeld, Y Sagiv
Proceedings of the 2008 ACM SIGMOD international conference on Management of …, 2008
2042008
Finding and approximating top-k answers in keyword proximity search
B Kimelfeld, Y Sagiv
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on …, 2006
1902006
Design and implementation of the LogicBlox system
M Aref, B ten Cate, TJ Green, B Kimelfeld, D Olteanu, E Pasalic, ...
Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015
1572015
Query efficiency in probabilistic XML models
B Kimelfeld, Y Kosharovsky, Y Sagiv
Proceedings of the 2008 ACM SIGMOD international conference on Management of …, 2008
1092008
Matching twigs in probabilistic XML
B Kimelfeld, Y Sagiv
Proceedings of the 33rd international conference on Very large data bases, 27-38, 2007
1022007
On the expressiveness of probabilistic XML models
S Abiteboul, B Kimelfeld, Y Sagiv, P Senellart
The VLDB Journal 18 (5), 1041, 2009
1012009
Interconnection semantics for keyword search in XML
S Cohen, Y Kanza, B Kimelfeld, Y Sagiv
Proceedings of the 14th ACM international conference on Information and …, 2005
1002005
Query evaluation over probabilistic XML
B Kimelfeld, Y Kosharovsky, Y Sagiv
The VLDB Journal 18 (5), 1117, 2009
742009
Probabilistic XML: Models and complexity
B Kimelfeld, P Senellart
Advances in Probabilistic Databases for Uncertain Information Management, 39-66, 2013
642013
Incorporating constraints in probabilistic XML
S Cohen, B Kimelfeld, Y Sagiv
ACM Transactions on Database Systems (TODS) 34 (3), 1-45, 2009
582009
Running tree automata on probabilistic XML
S Cohen, B Kimelfeld, Y Sagiv
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009
582009
Document spanners: A formal approach to information extraction
R Fagin, B Kimelfeld, F Reiss, S Vansummeren
Journal of the ACM (JACM) 62 (2), 1-51, 2015
482015
Revisiting redundancy and minimization in an XPath fragment
B Kimelfeld, Y Sagiv
Proceedings of the 11th international conference on Extending database …, 2008
402008
A dichotomy in the complexity of deletion propagation with functional dependencies
B Kimelfeld
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
392012
Probabilistic data exchange
R Fagin, B Kimelfeld, PG Kolaitis
Journal of the ACM (JACM) 58 (4), 1-55, 2011
392011
Maximizing conjunctive views in deletion propagation
B Kimelfeld, J Vondrák, R Williams
ACM Transactions on Database Systems (TODS) 37 (4), 1-37, 2012
372012
Efficient enumeration of maximal k-plexes
D Berlowitz, S Cohen, B Kimelfeld
Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015
332015
Adaptive parser-centric text normalization
C Zhang, T Baldwin, H Ho, B Kimelfeld, Y Li
Proceedings of the 51st Annual Meeting of the Association for Computational …, 2013
322013
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
S Cohen, B Kimelfeld, Y Sagiv
Journal of Computer and System Sciences 74 (7), 1147-1159, 2008
322008
Full disjunctions: Polynomial-delay iterators in action
S Cohen, I Fadida, Y Kanza, B Kimelfeld, Y Sagiv
Proceedings of the 32nd international conference on Very large data bases …, 2006
322006
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20