Photo of Associate Professor Benny Kimelfeld

Associate Professor Benny Kimelfeld

Contact information
Homepage:
http://benny.net.technion.ac.il
Email:
bennykcs.technion.ac.il
Office:
703
Phone:
5528
Office Hours:
Sunday, 17:00-18:00
Research interests
Database systems and theory, information extraction, information retrieval, data mining, probabilistic and inconsistent databases
Selected publications
  • Benny Kimelfeld and Christopher Re.
    Transducing Markov sequences.
    Journal of the ACM (JACM), 61(5):32, 2014 [bibtex]
  • Benny Kimelfeld and Phokion G. Kolaitis.
    The Complexity of Mining Maximal Frequent Subgraphs.
    ACM Trans. Database Syst. (TODS), 39(4):32, 2014 [bibtex]
  • Benny Kimelfeld.
    Database principles in information extraction.
    In PODS, 156--163, ACM, 2014 [bibtex]
  • Ronald Fagin, Benny Kimelfeld, Frederick Reiss and Stijn Vansummeren.
    Cleaning inconsistencies in information extraction via prioritized repairs.
    In PODS, 164--175, ACM, 2014 [bibtex]
  • Benny Kimelfeld, Jan Vondrak and David P. Woodruff.
    Multi-Tuple Deletion Propagation: Approximations and Complexity.
    PVLDB, 6(13):1558--1569, 2013 [bibtex]
  • Congle Zhang, Tyler Baldwin, Howard Ho, Benny Kimelfeld and Yunyao Li.
    Adaptive Parser-Centric Text Normalization.
    In ACL (1), 1159-1168, The Association for Computer Linguistics, 2013 [bibtex]
  • Benny Kimelfeld and Phokion G. Kolaitis.
    The complexity of mining maximal frequent subgraphs.
    In PODS, 13-24, ACM, 2013 [bibtex]
  • Ronald Fagin, Benny Kimelfeld, Frederick Reiss and Stijn Vansummeren.
    Spanners: a formal framework for information extraction.
    In PODS, 37-48, 2013 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Extracting minimum-weight tree patterns from a schema with neighborhood constraints.
    In ICDT, 249-260, ACM, 2013 [bibtex]
  • Benny Kimelfeld, Jan Vondrak and Ryan Williams.
    Maximizing Conjunctive Views in Deletion Propagation.
    ACM Transactions on Database Systems (TODS), 37(4):24, 2012 [bibtex]
  • Benny Kimelfeld.
    A dichotomy in the complexity of deletion propagation with functional dependencies.
    In PODS, 191-202, ACM, 2012 [bibtex]
  • Zhuowei Bao, Benny Kimelfeld and Yunyao Li.
    Automatic suggestion of query-rewrite rules for enterprise search.
    In SIGIR, 591-600, ACM, 2012 [bibtex]
  • Ronald Fagin, Benny Kimelfeld and Phokion G. Kolaitis.
    Probabilistic data exchange.
    Journal of the ACM (JACM), 58(4):15, 2011 [bibtex]
  • Konstantin Golenberg, Benny Kimelfeld and Yehoshua Sagiv.
    Optimizing and Parallelizing Ranked Enumeration.
    PVLDB, 4(11):1028-1039, 2011 [bibtex]
  • Benny Kimelfeld, Jan Vondrak and Ryan Williams.
    Maximizing conjunctive views in deletion propagation.
    In PODS, 187-198, ACM, 2011 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Finding a minimal tree pattern under neighborhood constraints.
    In PODS, 235-246, ACM, 2011 [bibtex]
  • Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan and Shivakumar Vaithyanathan.
    Rewrite rules for search database systems.
    In PODS, 271-282, ACM, 2011 [bibtex]
  • Zhuowei Bao, Benny Kimelfeld and Yunyao Li.
    A Graph Approach to Spelling Correction in Domain-Centric Search.
    In ACL, 905-914, The Association for Computer Linguistics, 2011 [bibtex]
  • Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan and Shivakumar Vaithyanathan.
    Understanding queries in a search database system.
    In PODS, 273-284, ACM, 2010 [bibtex]
  • Benny Kimelfeld and Christopher Re.
    Transducing Markov sequences.
    In PODS, 15-26, ACM, 2010 [bibtex]
  • Ronald Fagin, Benny Kimelfeld and Phokion Kolaitis.
    Probabilistic Data Exchange.
    In ICDT, 76-88, ACM, 2010 [bibtex]
  • Sara Cohen and Benny Kimelfeld.
    Querying Parse Trees of Stochastic Context-Free Grammars.
    In ICDT, 62-75, ACM, 2010 [bibtex]
  • Benny Kimelfeld, Yuri Kosharovsky and Yehoshua Sagiv.
    Query evaluation over probabilistic XML.
    The VLDB Journal, 18(5):1117-1140, 2009 [bibtex]
  • Serge Abiteboul, Benny Kimelfeld, Yehoshua Sagiv and Pierre Senellart.
    On the expressiveness of probabilistic XML models.
    The VLDB Journal, 18(5):1041-1064, 2009 [bibtex]
  • Sara Cohen, Benny Kimelfeld and Yehoshua Sagiv.
    Incorporating constraints in probabilistic XML.
    ACM Transactions on Database Systems (TODS), 34(3), 2009 [bibtex]
  • Sara Cohen, Benny Kimelfeld and Yehoshua Sagiv.
    Running tree automata on probabilistic XML.
    In PODS, 227-236, ACM, 2009 [bibtex]
  • Foto Afrati, Rada Chirkova, Manolis Gergatsoulis, Vassia Pavlaki, Benny Kimelfeld and Yehoshua Sagiv.
    On Rewriting XPath Queries Using Views.
    In EDBT, 168-179, ACM, 2009 [bibtex]
  • Sara Cohen, Benny Kimelfeld and Yehoshua Sagiv.
    Generating All Maximal Induced Subgraphs for Hereditary and Connected-Hereditary Graph Properties.
    Journal of Computer and System Sciences (JCSS), 74(7):1147-1159, 2008 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Efficiently enumerating results of keyword search over data graphs.
    Information Systems, 33(4-5):335-359, 2008 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Modeling and Querying Probabilistic XML Data.
    SIGMOD Record, 33(4-5):335-359, 2008 [bibtex]
  • Sara Cohen, Benny Kimelfeld and Yehoshua Sagiv.
    Incorporating constraints in probabilistic XML.
    In PODS, 109-118, ACM, 2008 [bibtex]
  • Konstantin Golenberg, Benny Kimelfeld and Yehoshua Sagiv.
    Keyword Proximity Search in Complex Data Graphs.
    In SIGMOD, 927-940, ACM, 2008 [bibtex]
  • Benny Kimelfeld, Yuri Kosharovsky and Yehoshua Sagiv.
    Query efficiency in probabilistic XML models.
    In SIGMOD, 701-714, ACM, 2008 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Revisiting Redundancy and Minimization in an XPath Fragment.
    In EDBT, ACM International Conference Proceeding Series, 261:61-72, ACM, 2008 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Matching Twigs in Probabilistic XML.
    In VLDB, 27-38, ACM, 2007 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Maximally joining probabilistic data.
    In PODS, 303-312, ACM, 2007 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Combining Incompleteness and Ranking in Tree Queries.
    In ICDT, Lecture Notes in Computer Science, 4353:329-343, Springer, 2007 [bibtex]
  • Sara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld and Yehoshua Sagiv.
    Full Disjunctions: Polynomial-Delay Iterators in Action.
    In VLDB, 739-750, ACM, 2006 [bibtex]
  • Benny Kimelfeld and Yehoshua Sagiv.
    Finding and approximating top-k answers in keyword proximity search.
    In PODS, 173-182, ACM, 2006 [bibtex]
  • Sara Cohen, Yaron Kanza, Benny Kimelfeld and Yehoshua Sagiv.
    Interconnection semantics for keyword search in XML.
    In CIKM, 389-396, ACM, 2005 [bibtex]