<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>ranking on DASYA</title>
    <link>https://dasya.itu.dk/tags/ranking/</link>
    <description>Recent content in ranking on DASYA</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>© DASYA, IT University of Copenhagen</copyright>
    <lastBuildDate>Mon, 09 Jun 2025 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://dasya.itu.dk/tags/ranking/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Learning-to-rank methods for query optimization</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/zk-lrt/</link>
      <pubDate>Mon, 09 Jun 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/zk-lrt/</guid>
      <description>Query optimization is crucial for any data management system to achieve good performance. Recent advancements in AI have led academia and industry to investigate learning-based techniques in query optimization. In particular, many works propose replacing the cost model used during plan enumeration with a machine learning model (typically a regression model) that estimates the runtime of a query plan. Interestingly though, it is well-known that what really matters in query optimization is the relative order of the query plan alternatives and not their actual cost or runtime.</description>
    </item>
    
  </channel>
</rss>