BibSLEIGH — Benny

Travelled to:

1 × Austria
1 × China
1 × Germany
1 × Greece
1 × Korea
10 × USA
2 × Australia
2 × Canada

Collaborated with:

Y.Sagiv S.Cohen R.Fagin ∅ Y.Li K.Golenberg P.G.Kolaitis J.Vondrák S.Raghavan Z.Bao F.Reiss S.Vansummeren C.Ré Y.Kanza S.Vaithyanathan D.Berlowitz M.Jacob J.Stoyanovich D.P.Woodruff R.Williams G.Weber Y.Kosharovsky Oren Kalinsky Yoav Etsion H.Achiezra H.Yang I.Fadida O.Hassanzadeh A.Kementsietsidis R.Krishnamurthy F.Özcan I.Pandis M.Aref B.t.Cate T.J.Green D.Olteanu E.Pasalic T.L.Veldhuizen G.Washburn

Talks about:

search (8) xml (6) probabilist (5) complex (5) data (5) keyword (4) system (4) queri (4) maxim (4) extract (3)

Person: Benny Kimelfeld

DBLP: Kimelfeld:Benny

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2020

Wrote 31 papers:

PODS-2015-FaginKK #complexity: Dichotomies in the Complexity of Preferred Repairs (RF, BK, PGK), pp. 3–15.
SIGMOD-2015-ArefCGKOPVW #design #implementation: Design and Implementation of the LogicBlox System (MA, BtC, TJG, BK, DO, EP, TLV, GW), pp. 1371–1382.
SIGMOD-2015-BerlowitzCK #performance: Efficient Enumeration of Maximal k-Plexes (DB, SC, BK), pp. 431–444.
PODS-2014-FaginKRV #consistency #information management #nondeterminism: Cleaning inconsistencies in information extraction via prioritized repairs (RF, BK, FR, SV), pp. 164–175.
PODS-2014-Kimelfeld #database #information management: Database principles in information extraction (BK), pp. 156–163.
VLDB-2014-JacobKS #analysis: A System for Management and Analysis of Preference Data (MJ, BK, JS), pp. 1255–1258.
PODS-2013-FaginKRV #framework #information management #named: Spanners: a formal framework for information extraction (RF, BK, FR, SV), pp. 37–48.
PODS-2013-KimelfeldK #complexity #mining: The complexity of mining maximal frequent subgraphs (BK, PGK), pp. 13–24.
VLDB-2013-HassanzadehKKKOP #data analysis #generative: Next Generation Data Analytics at IBM Research (OH, AK, BK, RK, FÖ, IP), pp. 1174–1175.
VLDB-2013-KimelfeldVW #approximate #complexity #multi: Multi-Tuple Deletion Propagation: Approximations and Complexity (BK, JV, DPW), pp. 1558–1569.
CIKM-2012-BaoKLRY #programmable #quality #tool support: Gumshoe quality toolkit: administering programmable search (ZB, BK, YL, SR, HY), pp. 2716–2718.
PODS-2012-Kimelfeld #complexity #dependence #functional: A dichotomy in the complexity of deletion propagation with functional dependencies (BK), pp. 191–202.
SIGIR-2012-BaoKL #automation #enterprise: Automatic suggestion of query-rewrite rules for enterprise search (ZB, BK, YL), pp. 591–600.
PODS-2011-FaginKLRV #database: Rewrite rules for search database systems (RF, BK, YL, SR, SV), pp. 271–282.
PODS-2011-KimelfeldS #constraints: Finding a minimal tree pattern under neighborhood constraints (BK, YS), pp. 235–246.
PODS-2011-KimelfeldVW: Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.
VLDB-2011-GolenbergKS #optimisation: Optimizing and Parallelizing Ranked Enumeration (KG, BK, YS), pp. 1028–1039.
PODS-2010-FaginKLRV #comprehension #database #query: Understanding queries in a search database system (RF, BK, YL, SR, SV), pp. 273–284.
PODS-2010-KimelfeldR #markov #sequence: Transducing Markov sequences (BK, CR), pp. 15–26.
SIGMOD-2010-AchiezraGKS #graph #keyword: Exploratory keyword search on data graphs (HA, KG, BK, YS), pp. 1163–1166.
PODS-2009-CohenKS #automaton #probability #xml: Running tree automata on probabilistic XML (SC, BK, YS), pp. 227–236.
SIGMOD-2009-KimelfeldSW #documentation #named #query #xml: ExQueX: exploring and querying XML documents (BK, YS, GW), pp. 1103–1106.
PODS-2008-CohenKS #constraints #probability #xml: Incorporating constraints in probabilistic XML (SC, BK, YS), pp. 109–118.
SIGMOD-2008-GolenbergKS #graph #keyword #proximity: Keyword proximity search in complex data graphs (KG, BK, YS), pp. 927–940.
SIGMOD-2008-KimelfeldKS #modelling #performance #probability #query #xml: Query efficiency in probabilistic XML models (BK, YK, YS), pp. 701–714.
PODS-2007-KimelfeldS #probability: Maximally joining probabilistic data (BK, YS), pp. 303–312.
VLDB-2007-KimelfeldS #probability #xml: Matching Twigs in Probabilistic XML (BK, YS), pp. 27–38.
PODS-2006-KimelfeldS #approximate #keyword #proximity: Finding and approximating top-k answers in keyword proximity search (BK, YS), pp. 173–182.
VLDB-2006-CohenFKKS: Full Disjunctions: Polynomial-Delay Iterators in Action (SC, IF, YK, BK, YS), pp. 739–750.
CIKM-2005-CohenKKS #keyword #semantics #xml: Interconnection semantics for keyword search in XML (SC, YK, BK, YS), pp. 389–396.
ASPLOS-2020-KalinskyKE #architecture #graph #relational: The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins (OK, BK, YE), pp. 1217–1231.