Susan B. Davidson

Susan B. Davidson

Auto-generated profile, based on publicly available information

Susan B. Davidson

University of Pennsylvania, Philadelphia, PA, USA

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 May 2018
Verified
Conference Paper
Open access
PDF file
YWYinjun Wu
Yinjun Wu
AAAbdussalam Alawini
Abdussalam Alawini
SDSusan B. Davidson
Susan B. Davidson
GSGianmaria Silvello
Gianmaria Silvello

4 November 2002
Verified
Conference Paper
Open access
YCYi Chen
Yi Chen
SDSusan B. Davidson
Susan B. Davidson
YZYingfeng Zheng
Yingfeng Zheng

18 March 2011 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
ZLZiyang Liu
Ziyang Liu
SDSusan B. Davidson
Susan B. Davidson
YCYi Chen
Yi Chen
Workflow views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse subworkflows and facilitate provenance analysis. However, unless a view is carefully designed, it may not preserve the dataflow between tasks in the workflow, that is, it may not be sound . Unsound views can be misleading and cause incorrect provenance analysis. This article studies the problem of efficiently identifying and correcting unsound workflow views with minimal changes, and constructing minimal sound and elucidative workflow views with a set of user-specified relevant tasks. In particular, two related problems are investigated. First, given a workflow view, we wish to split each unsound composite task into the minimal number of tasks, such that the resulting view is sound. Second, given a workflow and a set of user specified relevant tasks, we generate a sound view, such that each composite task contains at most one relevant task, and the total number of tasks is minimized. We prove that both problems are NP-hard by reduction from independent set. We then propose two local optimality conditions (weak and strong) for each problem, and design polynomial time algorithms for both problems to meet these conditions. Experiments show that our proposed algorithms are reasonably effective and efficient. The proposed techniques are useful for view analysis/construction for not only workflows, but general networks as well.

10 February 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
HBHadar Ben-Efraim
Hadar Ben-Efraim
SDSusan B. Davidson
Susan B. Davidson
ASAmit Somech
Amit Somech
Association rules are an important technique for gaining insights over large relational datasets consisting of tuples of elements (i.e. attribute-value pairs). However, it is difficult to explain the relative importance of data elements with respect to the rules in which they appear. This paper develops a measure of an element's contribution to a set of association rules based on Shapley values, denoted SHARQ (ShApley Rules Quantification). As is the case with many Shapely-based computations, the cost of a naive calculation of the score is exponential in the number of elements. To that end, we present an efficient framework for computing the exact SHARQ value of a single element whose running time is practically linear in the number of rules. Going one step further, we develop an efficient multi-element SHARQ algorithm which amortizes the cost of the single element SHARQ calculation over a set of elements. Based on the definition of SHARQ for elements we describe two additional use-cases for association rules explainability: rule importance and attribute importance. Extensive experiments over a novel benchmark dataset containing 67 instances of mined rule sets show the effectiveness of our approach.

9 June 2024
Verified
Conference Paper
Open access
SDSusan B. Davidson
Susan B. Davidson
TMTova Milo
Tova Milo
KRKathy Razmadze
Kathy Razmadze
GZGal Zeevi
Gal Zeevi
We demonstrate the Approximate Selection Query Processing (ASQP-RL) system, which uses Reinforcement Learning to select a subset of a large external dataset to process locally in a notebook during data exploration. Given a query workload over an external database and notebook memory size, the system translates the workload to select-project-join (non-aggregate) queries and finds a subset of each relation such that the data subset - called the approximation set - fits into the notebook memory and maximizes query result quality. The data subset can then be loaded into the notebook, and rapidly queried by the analyst. Our demonstration shows how ASQP-RL can be used during data exploration and achieve comparable results to external queries over the large dataset at significantly reduced query times. It also shows how ASQP-RL can be used for aggregation queries, achieving surprisingly good results compared to state-of-the-art techniques.

1 January 1993
Verified
Book Chapter
Closed access
PDF file
PBPatrice Brémond-Grégoire
Patrice Brémond-Grégoire
SDSusan Davidson
Susan Davidson
ILInsup Lee
Insup Lee