Bibtex entries of Associate Professor Benny Kimelfeld

@article{DBLP:journals/jacm/KimelfeldR14,
  author = {Benny Kimelfeld and Christopher Re},
  title = {Transducing Markov sequences},
  journal = {Journal of the ACM (JACM)},
  year = {2014},
  volume = {61},
  number = {5},
  pages = {32},
  url = {http://doi.acm.org/10.1145/2630065},
  doi = {10.1145/2630065},
  timestamp = {Tue, 21 Oct 2014 06:51:10 +0200},
  biburl = {http://dblp.uni-trier.de/rec/bib/journals/jacm/KimelfeldR14},
  bibsource = {dblp computer science bibliography, http://dblp.org},
}

@article{DBLP:journals/tods/KimelfeldK14,
  author = {Benny Kimelfeld and Phokion G. Kolaitis},
  title = {The Complexity of Mining Maximal Frequent Subgraphs},
  journal = {ACM Trans. Database Syst. (TODS)},
  volume = {39},
  number = {4},
  pages = {32},
  year = {2014},
  url = {http://doi.acm.org/10.1145/2629550},
  doi = {10.1145/2629550},
  timestamp = {Tue, 27 Jan 2015 18:48:24 +0100},
  biburl = {http://dblp.uni-trier.de/rec/bib/journals/tods/KimelfeldK14},
  bibsource = {dblp computer science bibliography, http://dblp.org},
}

@inproceedings{DBLP:conf/pods/Kimelfeld14,
  author = {Benny Kimelfeld},
  title = {Database principles in information extraction},
  booktitle = {PODS},
  year = {2014},
  pages = {156--163},
  publisher = {ACM},
}

@inproceedings{DBLP:conf/pods/FaginKRV14,
  author = {Ronald Fagin and Benny Kimelfeld and Frederick Reiss and Stijn Vansummeren},
  title = {Cleaning inconsistencies in information extraction via prioritized repairs},
  booktitle = {PODS},
  year = {2014},
  pages = {164--175},
  publisher = {ACM},
}

@article{DBLP:journals/pvldb/KimelfeldVW13,
  author = {Benny Kimelfeld and Jan Vondrak and David P. Woodruff},
  title = {Multi-Tuple Deletion Propagation: Approximations and Complexity},
  journal = {PVLDB},
  volume = {6},
  number = {13},
  pages = {1558--1569},
  year = {2013},
  url = {http://www.vldb.org/pvldb/vol6/p1558-kimelfeld.pdf},
  timestamp = {Mon, 14 Oct 2013 15:18:58 +0200},
  biburl = {http://dblp.uni-trier.de/rec/bib/journals/pvldb/KimelfeldVW13},
  bibsource = {dblp computer science bibliography, http://dblp.org},
}

@inproceedings{DBLP:conf/acl/ZhangBHKL13,
  author = {Congle Zhang and Tyler Baldwin and Howard Ho and Benny Kimelfeld and Yunyao Li},
  title = {Adaptive Parser-Centric Text Normalization},
  booktitle = {ACL (1)},
  year = {2013},
  pages = {1159-1168},
  publisher = {The Association for Computer Linguistics},
}

@inproceedings{DBLP:conf/pods/KimelfeldK13,
  author = {Benny Kimelfeld and Phokion G. Kolaitis},
  title = {The complexity of mining maximal frequent subgraphs},
  booktitle = {PODS},
  year = {2013},
  pages = {13-24},
  publisher = {ACM},
}

@inproceedings{DBLP:conf/pods/FaginKRV13,
  author = {Ronald Fagin and Benny Kimelfeld and Frederick Reiss and Stijn Vansummeren},
  title = {Spanners: a formal framework for information extraction},
  booktitle = {PODS},
  year = {2013},
  pages = {37-48},
}

@inproceedings{DBLP:conf/icdt/KimelfeldS13,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Extracting minimum-weight tree patterns from a schema with neighborhood constraints},
  booktitle = {ICDT},
  year = {2013},
  pages = {249-260},
  publisher = {ACM},
}

@article{KimelfeldVW12,
  author = {Benny Kimelfeld and Jan Vondrak and Ryan Williams},
  title = {Maximizing Conjunctive Views in Deletion Propagation},
  journal = {ACM Transactions on Database Systems (TODS)},
  volume = {37},
  number = {4},
  year = {2012},
  pages = {24},
}

@inproceedings{DBLP:conf/pods/Kimelfeld12,
  author = {Benny Kimelfeld},
  title = {A dichotomy in the complexity of deletion propagation with functional dependencies},
  booktitle = {PODS},
  year = {2012},
  pages = {191-202},
  publisher = {ACM},
}

@inproceedings{DBLP:conf/sigir/BaoKL12,
  author = {Zhuowei Bao and Benny Kimelfeld and Yunyao Li},
  title = {Automatic suggestion of query-rewrite rules for enterprise search},
  booktitle = {SIGIR},
  year = {2012},
  pages = {591-600},
  publisher = {ACM},
}

@article{FaginKK11,
  author = {Ronald Fagin and Benny Kimelfeld and Phokion G. Kolaitis},
  title = {Probabilistic data exchange},
  journal = {Journal of the ACM (JACM)},
  volume = {58},
  number = {4},
  year = {2011},
  pages = {15},
}

@article{DBLP:journals/pvldb/GolenbergKS11,
  author = {Konstantin Golenberg and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Optimizing and Parallelizing Ranked Enumeration},
  journal = {PVLDB},
  volume = {4},
  number = {11},
  year = {2011},
  pages = {1028-1039},
}

@inproceedings{KimelfeldVW11,
  author = {Benny Kimelfeld and Jan Vondrak and Ryan Williams},
  title = {Maximizing conjunctive views in deletion propagation},
  booktitle = {PODS},
  year = {2011},
  pages = {187-198},
  publisher = {ACM},
}

@inproceedings{KimelfeldS11,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Finding a minimal tree pattern under neighborhood constraints},
  booktitle = {PODS},
  year = {2011},
  pages = {235-246},
  publisher = {ACM},
}

@inproceedings{FaginKLRV11,
  author = {Ronald Fagin and Benny Kimelfeld and Yunyao Li and Sriram Raghavan and Shivakumar Vaithyanathan},
  title = {Rewrite rules for search database systems},
  booktitle = {PODS},
  year = {2011},
  pages = {271-282},
  publisher = {ACM},
}

@inproceedings{BaoKL11,
  author = {Zhuowei Bao and Benny Kimelfeld and Yunyao Li},
  title = {A Graph Approach to Spelling Correction in Domain-Centric Search},
  booktitle = {ACL},
  year = {2011},
  pages = {905-914},
  publisher = {The Association for Computer Linguistics},
}

@inproceedings{DBLP:conf/pods/FaginKLRV10,
  author = {Ronald Fagin and Benny Kimelfeld and Yunyao Li and Sriram Raghavan and Shivakumar Vaithyanathan},
  title = {Understanding queries in a search database system},
  booktitle = {PODS},
  year = {2010},
  pages = {273-284},
  publisher = {ACM},
}

@inproceedings{DBLP:conf/pods/KimelfeldR10,
  author = {Benny Kimelfeld and Christopher Re},
  title = {Transducing Markov sequences},
  booktitle = {PODS},
  year = {2010},
  pages = {15-26},
  publisher = {ACM},
}

@inproceedings{PDE,
  author = {Ronald Fagin and Benny Kimelfeld and Phokion Kolaitis},
  title = {Probabilistic Data Exchange},
  year = {2010},
  booktitle = {ICDT},
  publisher = {ACM},
  pages = {76-88},
}

@inproceedings{SCFG,
  author = {Sara Cohen and Benny Kimelfeld},
  title = {Querying Parse Trees of Stochastic Context-Free Grammars},
  year = {2010},
  booktitle = {ICDT},
  publisher = {ACM},
  pages = {62-75},
}

@article{VLDBJ-EVAL,
  author = {Benny Kimelfeld and Yuri Kosharovsky and Yehoshua Sagiv},
  title = {Query evaluation over probabilistic XML},
  journal = {The VLDB Journal},
  year = {2009},
  volume = {18},
  number = {5},
  pages = {1117-1140},
}

@article{VLDBJ-EXPRESS,
  author = {Serge Abiteboul and Benny Kimelfeld and Yehoshua Sagiv and Pierre Senellart},
  journal = {The VLDB Journal},
  title = {On the expressiveness of probabilistic XML models},
  year = {2009},
  volume = {18},
  number = {5},
  pages = {1041-1064},
}

@article{CohenKS09,
  author = {Sara Cohen and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Incorporating constraints in probabilistic XML},
  journal = {ACM Transactions on Database Systems (TODS)},
  volume = {34},
  number = {3},
  year = {2009},
}

@inproceedings{DBLP:conf/pods/CohenKS09,
  author = {Sara Cohen and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Running tree automata on probabilistic XML},
  booktitle = {PODS},
  year = {2009},
  pages = {227-236},
  publisher = {ACM},
}

@inproceedings{REWRITE,
  title = {On Rewriting XPath Queries Using Views},
  author = {Foto Afrati and Rada Chirkova and Manolis Gergatsoulis and Vassia Pavlaki and Benny Kimelfeld and Yehoshua Sagiv},
  booktitle = {EDBT},
  year = {2009},
  pages = {168-179},
  publisher = {ACM},
}

@article{JCSS,
  author = {Sara Cohen and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Generating All Maximal Induced Subgraphs for Hereditary and Connected-Hereditary Graph Properties},
  journal = {Journal of Computer and System Sciences (JCSS)},
  volume = {74},
  number = {7},
  year = {2008},
  pages = {1147-1159},
}

@article{INFOS06,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Efficiently enumerating results of keyword search over data graphs},
  journal = {Information Systems},
  volume = {33},
  number = {4-5},
  year = {2008},
  pages = {335-359},
}

@article{SIGMODRECORD,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  journal = {SIGMOD Record},
  title = {Modeling and Querying Probabilistic XML Data},
  volume = {33},
  number = {4-5},
  year = {2008},
  pages = {335-359},
}

@inproceedings{DBLP:conf/pods/CohenKS08,
  author = {Sara Cohen and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Incorporating constraints in probabilistic XML},
  booktitle = {PODS},
  year = {2008},
  pages = {109-118},
  publisher = {ACM},
}

@inproceedings{SIGMOD08KPS,
  author = {Konstantin Golenberg and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Keyword Proximity Search in Complex Data Graphs},
  booktitle = {SIGMOD},
  year = {2008},
  pages = {927-940},
  publisher = {ACM},
}

@inproceedings{SIGMOD08PROB,
  author = {Benny Kimelfeld and Yuri Kosharovsky and Yehoshua Sagiv},
  title = {Query efficiency in probabilistic XML models},
  booktitle = {SIGMOD},
  year = {2008},
  pages = {701-714},
  publisher = {ACM},
}

@inproceedings{KS-EDBT08,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Revisiting Redundancy and Minimization in an XPath Fragment},
  booktitle = {EDBT},
  year = {2008},
  publisher = {ACM},
  series = {ACM International Conference Proceeding Series},
  volume = {261},
  pages = {61-72},
}

@inproceedings{VLDB07,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Matching Twigs in Probabilistic XML},
  booktitle = {VLDB},
  year = {2007},
  pages = {27-38},
  publisher = {ACM},
}

@inproceedings{DBLP:conf/pods/KimelfeldS07,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Maximally joining probabilistic data},
  booktitle = {PODS},
  year = {2007},
  pages = {303-312},
  publisher = {ACM},
}

@inproceedings{ICDT07,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Combining Incompleteness and Ranking in Tree Queries},
  booktitle = {ICDT},
  year = {2007},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {4353},
  pages = {329-343},
}

@inproceedings{VLDB06,
  author = {Sara Cohen and Itzhak Fadida and Yaron Kanza and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Full Disjunctions: Polynomial-Delay Iterators in Action.},
  booktitle = {VLDB},
  year = {2006},
  pages = {739-750},
  publisher = {ACM},
}

@inproceedings{DBLP:conf/pods/KimelfeldS06,
  author = {Benny Kimelfeld and Yehoshua Sagiv},
  title = {Finding and approximating top-k answers in keyword proximity search},
  booktitle = {PODS},
  year = {2006},
  pages = {173-182},
  publisher = {ACM},
}

@inproceedings{CIKM05,
  author = {Sara Cohen and Yaron Kanza and Benny Kimelfeld and Yehoshua Sagiv},
  title = {Interconnection semantics for keyword search in XML},
  booktitle = {CIKM},
  year = {2005},
  pages = {389-396},
  publisher = {ACM},
}