TableMetadata

class ducklake.TableMetadata

Metadata properties for a table.

Attributes:

auto_compact	Whether a table is included when compaction functions are called without a specific table argument.
data_inlining_row_limit	Maximum amount of rows to inline in a single insert.
hive_file_pattern	If partitioned data should be written in a Hive-style folder structure.
parquet_compression	Compression algorithm for Parquet files (uncompressed, snappy, gzip, zstd, brotli, lz4, lz4_raw).
parquet_compression_level	Compression level for Parquet files.
parquet_row_group_size	Number of rows per row group in Parquet files.
parquet_row_group_size_bytes	Number of bytes per row group in Parquet files.
parquet_version	Parquet format version (1 or 2).
rewrite_delete_threshold	Minimum fraction of data (0-1) that must be removed from a file before a rewrite is warranted.
target_file_size	The target data file size for insertion and compaction operations.

Methods:

clear	Remove all items from the dict.
copy	Return a shallow copy of the dict.
fromkeys	Create a new dictionary with keys from iterable and values set to value.
get	Return the value for key if key is in the dictionary, else default.
items	Return a set-like object providing a view on the dict's items.
keys	Return a set-like object providing a view on the dict's keys.
pop	D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
popitem	Remove and return a (key, value) pair as a 2-tuple.
setdefault	Insert key with a value of default if key is not in the dictionary.
update	D.update([E, ]**F) -> None.
values	Return an object providing a view on the dict's values.

auto_compact: bool

Whether a table is included when compaction functions are called without a specific table argument.

clear(/)

Remove all items from the dict.

copy(/)

Return a shallow copy of the dict.

data_inlining_row_limit: int

Maximum amount of rows to inline in a single insert.

classmethod fromkeys(iterable, value=None, /)

Create a new dictionary with keys from iterable and values set to value.

get(key, default=None, /)

Return the value for key if key is in the dictionary, else default.

hive_file_pattern: bool

If partitioned data should be written in a Hive-style folder structure.

items(/)

Return a set-like object providing a view on the dict’s items.

keys(/)

Return a set-like object providing a view on the dict’s keys.

parquet_compression: str

Compression algorithm for Parquet files (uncompressed, snappy, gzip, zstd, brotli, lz4, lz4_raw).

parquet_compression_level: int

Compression level for Parquet files.

parquet_row_group_size: int

Number of rows per row group in Parquet files.

parquet_row_group_size_bytes: int | None

Number of bytes per row group in Parquet files.

parquet_version: int

Parquet format version (1 or 2).

pop(key, default=<unrepresentable>, /)

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem(/)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

rewrite_delete_threshold: float

Minimum fraction of data (0-1) that must be removed from a file before a rewrite is warranted.

setdefault(key, default=None, /)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

target_file_size: int

The target data file size for insertion and compaction operations.

update([E, ]**F) → None.  Update D from mapping/iterable E and F.

If E is present and has a .keys() method, then does: for k in E.keys(): D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values(/)

Return an object providing a view on the dict’s values.