BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Information Systems Group
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230519T130000
DTEND;TZID=America/Los_Angeles:20230519T140000
DTSTAMP:20260711T102919
CREATED:20230516T180316Z
LAST-MODIFIED:20230516T180316Z
UID:1567-1684501200-1684504800@isg.ics.uci.edu
SUMMARY:Yiming Lin: Auto-BI: Automatically Build BI-Models Leveraging Local Join Prediction and Global Schema Graph
DESCRIPTION:Abstract: \nBusiness Intelligence (BI) is crucial in modern enterprises and billion-dollar business. Traditionally\, technical experts like database administrators would manually prepare BI-models (e.g.\, in star or snowflake schemas) that join tables in data warehouses\, before less-technical business users can run analytics using end-user dashboarding tools. However\, the popularity of self-service BI (e.g.\, Tableau and Power-BI) in recent years creates a strong demand for less technical end-users to build BI-models themselves. We develop an Auto-BI system that can accurately predict BI models given a set of input tables\, using a principled graph-based optimization problem we propose called k-Min-Cost-Arborescence (k-MCA)\, which holistically considers both local join prediction and global schema-graph structures\, leveraging a graph-theoretical structure called arborescence. While we prove k-MCA is intractable and inapproximate in general\, we develop novel algorithms that can solve k-MCA optimally\, which is shown to be efficient in practice with sub-second latency and can scale to the largest BI-models we encounter (with close to 100 tables). Auto-BI is rigorously evaluated on a unique dataset with over 100K real BI models we harvested\, as well as on 12 popular TPC benchmarks. It is shown to be both efficient and accurate\, achieving over 0.9 F1-score on both real and synthetic benchmarks.\n\n\nBio:\nYiming is a final year PhD student working with Prof. Sharad Mehrotra. His research area focuses on data management\, and especially on efficient query processing\, query optimization\, data quality and data integration.
URL:https://isg.ics.uci.edu/event/yiming-lin-auto-bi-automatically-build-bi-models-leveraging-local-join-prediction-and-global-schema-graph/
LOCATION:DBH 4011
END:VEVENT
END:VCALENDAR