FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3204877237> ?p ?o ?g. }

• W3204877237 abstract "In relational databases stored procedures and user defined functions (UDFs) have been used to express application business logic by using control flow logic and DMLs. Recently their use is increasing with the rising popularity of real-time analytics applications since the applications often contain complex business logic. Thus hybrid transactional and analytical processing systems like SAP HANA have started to put more efforts to optimize the execution of UDFs. There has been much work in the fields of program optimization and query optimization, respectively. However, most of the studies have been done separately in isolated worlds, and cross-optimizations breaking the boundary between declaratives and imperatives were not studied enough. Therefore, unified optimization techniques considering both program and query optimization techniques are essential for achieving optimal query performance. The first part of this talk presents a literature overview of a successful approach to improve the performance of UDF execution. This approach transforms entire UDFs into equivalent relational algebra expressions, then applies existing relational query optimization techniques. It is interesting that the imperative constructs such as branches and loops can be converted into relational algebra expressions. This approach is attractive since we can simply take advantage of existing sophisticated query optimization techniques after the transformation. However, one of the most challenging issues faced by this approach is that transformation rules are currently limited and there are non-transformable imperative expressions. The second part presents our past and ongoing work using another approach, which unifies both program and query optimization techniques in a framework. The framework consists of plan enumeration and cost estimation for the UDFs. We first demonstrate this approach with iterative query processing in a UDF. With the notion of query motion, by which an SQL query is moved in and out of a loop, we enumerate execution plans for the UDF. We choose the best plan by using a cost model which measures the procedure cost based on the cost estimation of the query optimizer and imperative constructs. We next discuss unified optimization using the concept of relational operator motion, where we pull up or push down relational operators among statements in the UDF to obtain a globally optimized plan of the UDF." @default.
• W3204877237 created "2021-10-11" @default.
• W3204877237 creator A5039165136 @default.
• W3204877237 date "2021-08-16" @default.
• W3204877237 modified "2023-09-26" @default.
• W3204877237 title "Unified Optimization of Declarative and Imperative Code in Relational Databases" @default.
• W3204877237 doi "https://doi.org/10.1145/3475726.3476451" @default.
• W3204877237 hasPublicationYear "2021" @default.
• W3204877237 type Work @default.
• W3204877237 sameAs 3204877237 @default.
• W3204877237 citedByCount "0" @default.
• W3204877237 crossrefType "proceedings-article" @default.
• W3204877237 hasAuthorship W3204877237A5039165136 @default.
• W3204877237 hasConcept C104317684 @default.
• W3204877237 hasConcept C157692150 @default.
• W3204877237 hasConcept C185592680 @default.
• W3204877237 hasConcept C192028432 @default.
• W3204877237 hasConcept C199360897 @default.
• W3204877237 hasConcept C204241405 @default.
• W3204877237 hasConcept C24394798 @default.
• W3204877237 hasConcept C40207289 @default.
• W3204877237 hasConcept C41008148 @default.
• W3204877237 hasConcept C55493867 @default.
• W3204877237 hasConcept C5655090 @default.
• W3204877237 hasConcept C77088390 @default.
• W3204877237 hasConcept C80444323 @default.
• W3204877237 hasConcept C95916125 @default.
• W3204877237 hasConcept C99436015 @default.
• W3204877237 hasConceptScore W3204877237C104317684 @default.
• W3204877237 hasConceptScore W3204877237C157692150 @default.
• W3204877237 hasConceptScore W3204877237C185592680 @default.
• W3204877237 hasConceptScore W3204877237C192028432 @default.
• W3204877237 hasConceptScore W3204877237C199360897 @default.
• W3204877237 hasConceptScore W3204877237C204241405 @default.
• W3204877237 hasConceptScore W3204877237C24394798 @default.
• W3204877237 hasConceptScore W3204877237C40207289 @default.
• W3204877237 hasConceptScore W3204877237C41008148 @default.
• W3204877237 hasConceptScore W3204877237C55493867 @default.
• W3204877237 hasConceptScore W3204877237C5655090 @default.
• W3204877237 hasConceptScore W3204877237C77088390 @default.
• W3204877237 hasConceptScore W3204877237C80444323 @default.
• W3204877237 hasConceptScore W3204877237C95916125 @default.
• W3204877237 hasConceptScore W3204877237C99436015 @default.
• W3204877237 hasLocation W32048772371 @default.
• W3204877237 hasOpenAccess W3204877237 @default.
• W3204877237 hasPrimaryLocation W32048772371 @default.
• W3204877237 hasRelatedWork W12098501 @default.
• W3204877237 hasRelatedWork W1544867 @default.
• W3204877237 hasRelatedWork W2932426 @default.
• W3204877237 hasRelatedWork W3489586 @default.
• W3204877237 hasRelatedWork W5839577 @default.
• W3204877237 hasRelatedWork W6917806 @default.
• W3204877237 hasRelatedWork W7085509 @default.
• W3204877237 hasRelatedWork W7814883 @default.
• W3204877237 hasRelatedWork W9389056 @default.
• W3204877237 hasRelatedWork W4472654 @default.
• W3204877237 isParatext "false" @default.
• W3204877237 isRetracted "false" @default.
• W3204877237 magId "3204877237" @default.
• W3204877237 workType "article" @default.