Conference paper
Finding a minimal tree pattern under neighborhood constraints
Benny Kimelfeld, Yehoshua Sagiv
SIGMOD/PODS 2011
Presented is a computation method—the chase—for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. The chase includes previous tableau computation methods as special cases. By interpreting tableaux alternately as mappings or as templates for relations, it is possible to test implication of join dependencies (including multivalued dependencies) and functional dependencies by a set of dependencies. © 1979, ACM. All rights reserved.
Benny Kimelfeld, Yehoshua Sagiv
SIGMOD/PODS 2011
Yosi Mass, Yehoshua Sagiv, et al.
CIKM 2009
Olga Poppe, Allison Rozet, et al.
ICDE 2018
Benny Kimelfeld, Yehoshua Sagiv, et al.
SIGMOD/PODS 2009