A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
A hierarchical framework for the recognition of complex deformable shapes is developed. In extension to traditional approaches an additional layer of control is introduced to guid...
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 1 and 2 and a mapping over schemas 2 and 3, the composition problem is...
Philip A. Bernstein, Todd J. Green, Sergey Melnik,...