RonyForAI/Mirage_DB_RL
0
1o
2 Z�i�3 � @ s` d dl mZmZmZ d dlmZ d dlmZ G dd� de�ZG dd� de�Z G dd � d e�Z4d5S ) � )�Action� Observation�State)�Field)�Listc @ sT e Zd ZU edddd�Zeed< eddddd�Zeed < eddd6d d�Zeed < d
S )� QueryAction.r z3Index of next table to join (from remaining_tables))�ge� description�7next_table� uF Join algorithm: 0=hash(1.0×) 1=nested-loop(2.0×) 2=merge-sort(0.8×))r �ler � join_type� zMIndex scan: 0=full-table-scan 1=index-scan(halves base rows if index present)� use_indexN) �__name__�8__module__� __qualname__r r9 �int�__annotations__r
r � r r �4D:\Meta Hackathon DBMS Optimizer\Mirage_RL\models.pyr s 10 r c @ s� e Zd ZU ee ed< ee ed< ee ed< ee ed< ee ed< ee ed< eed< eed< ed d11d �Z eed < ed
dd �Z12eed< dS )�QueryObservation�tables�13table_rows�
selectivities� has_index� chosen_order�remaining_tables� step_number� current_costg �?u Estimated size of the intermediate result accumulated so far. Computed as the product of (est_rows × selectivity) for each joined table. Joining large-output tables early causes this to explode, compounding all subsequent join costs. Keep this small by joining selective tables first.)�defaultr �intermediate_size� z1SQL-like description of the query being optimized�
query_contextN) r r r r �strr r �floatr r! r# r r r r r s 14 � r c @ s^ e Zd ZU eed�Zee ed< eed�Z ee ed< dZ15e ed< dZ e ed< dZ
eed< d S )16�17QueryState)�default_factoryr r g r �18final_costr" �
scenario_nameN)r r r r �listr r r r r r r% r( r) r$ r r r r r& & s 19 r& N) Z openenv.core.env_server.typesr r r �pydanticr �typingr r r r& r r r r �<module> s