| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
| |
Co-authored-by: ivanmorozov333 <imorozov333@ya.ru>
|
| |
|
|\ |
|
| |
| |
| |
| | |
commit_hash:7c9afc1d7ac6f6da4fa13ea646fab5b4dfd68e72
|
| |
| |
| |
| | |
commit_hash:8d4756246e6c1a67ddfc4402f19c1101171487d0
|
| | |
|
|\| |
|
| |
| |
| |
| | |
commit_hash:e6ea4db1e3a66694223008fec3b5064a4d58a8e1
|
| |
| |
| |
| |
| |
| | |
PROGRAM/LIBRARY->PY2_PROGRAM/PY2_LIBRARY migrations
commit_hash:0acd5ed0633da334085a13689bbda8e1564dbae7
|
| |
| |
| |
| | |
commit_hash:fd68150f685a9af3bdf0d7bf217e8cfbf29f10ba
|
| |
| |
| |
| | |
commit_hash:f887db5aed7670478e94ff9a4f0382e815061583
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
This PR simplifies the calculation of `data_weight_per_job` within the `TUnorderedChunkPool`.
**Current Workflow:**
1\. **TJobSizeConstraints:**
\- Users define constraints in the job specification, such as `data_weight_per_job`, `job_count`, etc.
\- These user constraints are transformed into `job_count`.
\- `data_weight_per_job` is then calculated based on this `job_count`.
2\. **TUnorderedChunkPool:**
\- Within this pool, `data_weight_per_job` is again transformed into `job_count`.
\- The ideal `data_weight_per_job` for slicing is calculated as `remaining_data_weight / remaining_job_count`.
**Proposed Changes:**
This PR simplifies the algorithm by directly using the `data_weight_per_job` from `TJobSizeConstraints` in the `TUnorderedChunkPool`. Previously, the approach could lead to an increase or a decrease in `data_weight_per_job` during the slicing process. For instance, with an initial `data_weight_per_job` of `400`, the previous algorithm might split inputs into jobs with data weights of `[433, 433, 394, 394, 394]`. In contrast, the updated algorithm consistently maintains job sizes, resulting in a distribution of `[433, 433, 433, 433, 316]`.
**Additional Notes:**
\- The current algorithm has special handling for the AutoMerge task, using `data_weight_per_job` directly from `TJobSizeConstraints`.
\- Although the current algorithm might provide speed improvements in certain specific scenarios, it is not a consistently reliable solution overall. To more effectively reduce tail latency in operations, it is preferable to use a job splitting mechanism.
\- The simplified logic facilitates the future introduction of slicing mechanisms based on compressed data size, which the old approach would complicate.
commit_hash:2d450fb007e35c6a59dc136f504e2e77f46db625
|
| |
| |
| |
| | |
commit_hash:b75b33333fec1dfa4a998bd8ea1b8c538223f2ca
|
| |
| |
| |
| | |
commit_hash:95759d29eb7d2dd541751b1b6f4db0605c3b37dc
|
| |
| |
| |
| | |
commit_hash:404c76a4ce7d29b42f27d1a0cd72424faad00313
|
| |
| |
| |
| | |
commit_hash:cf346718d9edcad89c318fd6e8b49aedd93f0fba
|
|\ \ |
|
| | | |
|
| |\| |
|
| | |
| | |
| | |
| | | |
commit_hash:d4e265c03467c90626a9303475ec66dae1d86fca
|
| | |
| | |
| | |
| | | |
commit_hash:b4e93de24dabfc523769bc504619e926eee6cafe
|
| | |
| | |
| | |
| | |
| | | |
Support absolute path in globs
commit_hash:98179de980b86fa5c380b18da2dcc8c39d10e8ec
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
We faced with a failing assertion at `NYql::NormalizeName`. This patch expects it and fallbacks to `ToLowerUTF8`.
---
- Related to `YQL-19747`
- Related to https://github.com/ydb-platform/ydb/issues/9056
- Related to https://github.com/vityaman/ydb/issues/38
---
Pull Request resolved: https://github.com/ytsaurus/ytsaurus/pull/1255
commit_hash:946162904ce3b74f490debb7f9e0587f136b4075
|
| | |
| | |
| | |
| | | |
commit_hash:e37eb68f940d5c686451da8a77ed31e4b0c76fe1
|
| | |
| | |
| | |
| | |
| | | |
Minimize deps by unique, exclude deps from test deps
commit_hash:7cb7ac6eb6333713ac5ad55f17eec8a420a6ad8d
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
* Changelog entry
Type: fix
Component: proxy
Fixing the reading of tables with date type columns in arrow format.
commit_hash:2b6c31c267c7bc3b3dba247387edce1713d3625a
|
| | |
| | |
| | |
| | |
| | | |
Many fixes around kotlin and fix copy codegen
commit_hash:63e388f3b3d56c95287e71d0624b51288c07379c
|
| | |
| | |
| | |
| | |
| | | |
Update tools: yexport, os-yexport
commit_hash:1ce4768aa52ccbe1397bea46f76ef6cfc1cafed8
|
| | |
| | |
| | |
| | |
| | | |
PascalCase is recommended for type notation by internal Yandex documentation.
commit_hash:23511d2da6cc035bb83e0188da48310c5ee213cd
|
| | |
| | |
| | |
| | | |
commit_hash:6dfa7e501185edbc8f6274bcd45c112dc83bc411
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Essentially we need the `UnionNameService` to integrate dynamic name services into the `sql/v1/complete`. This decorator queries multiple name services and merges their responses. We will use it to union static `NameServices` and the `SchemaNameService` (and the `ClusterNameService`, and so on).
It does not deal with exceptions and fails the whole request on some subtask failed. Client should prepare robust children (later `SwallowingNameService` will be added to return an empty `NameResponse` on errors to provide best-effort dynamic object loading).
`StaticNameService` was split into micro-`NameService`s :)
`NameConstraints` are extracted to provide name qualification via `Qualified` and `Unqualified` methods. This is needed because depending on a context `NameService` can return unqualified names (for example, on `PRAGMA yt.#`). As internal indexes for scanning and ranking are built on a sorted list of, then `Ranking` actually needs an ability to get fully-qualified names, so now it via the `NameConstraints`.
Also this design potentially let us to improve internal indexes by using partitioning by a namespace. Other option was to make `PragmaName` and `FunctionName` more structured via adding a separate field for a namespace, but it seems to me that it will force to do more parsing from indexes results to a `Name`. Anyway this is an internal component so it can be changed if needed. I still doubt this decision because structured `PragmaName { Namespace, Identifier }` seems to be cleaner and there should be no noticeable overhead because of COW strings.
---
Pull Request resolved: https://github.com/ytsaurus/ytsaurus/pull/1252
commit_hash:e8a1fbb17e2ca3ffe72aafbea943a38624d74491
|
| | |
| | |
| | |
| | | |
commit_hash:eeef7afb6fc55fee3a27d48abc3d015c76b16283
|
| | |
| | |
| | |
| | |
| | | |
Update tools: yexport, os-yexport
commit_hash:c7793181b971c26feb492b293eb78bdf173127cd
|
| | |
| | |
| | |
| | | |
commit_hash:a25a8948b4adb3b8a9453d784b6560b4b64bc0d8
|
| | |
| | |
| | |
| | |
| | |
| | | |
from JAVA_LIBRARY/PROGRAM to JTEST/JUNIT5/JAVA_TEST_LIBRARY just now, but TODO remove future
commit_hash:9f8630604c4f0816349bc1a22130062bbfd96ac6
|
| | |
| | |
| | |
| | |
| | | |
Rename, improve filtering errorprone
commit_hash:5d4dd24a0242a437d8c0a84fa82b5934979a33bc
|
| | |
| | |
| | |
| | | |
commit_hash:0b9dce1e145a3841b5c1a63d7feb3868d3d25b06
|
| | |
| | |
| | |
| | | |
commit_hash:42980de83cc65d4d533f6b690391a0e1038fe372
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
A client might want to have completions of its own private UDFs. Then a client should make a JSON document and parse it to create a custom `TNameSet`.
---
- Related to https://github.com/ydb-platform/ydb/issues/9056
- Related to https://github.com/vityaman/ydb/issues/36
---
Pull Request resolved: https://github.com/ytsaurus/ytsaurus/pull/1251
commit_hash:bbee9be4a480262aa788e7b242b7abdc90882ba7
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Introduce the `SimpleSchemaGateway` to make it easier to implement `SchemaGateway`s. The idea is that actually existing schema providers really do not support filtration such as by name and type, so in practice they return us the whole list and we need to filter it by hand. The `SimpleSchemaGateway` to `SchemaGateway` adapter does this for us -- we only need to implement a path splitting and folder listing.
The other and important feature of the `SimpleSchemaGateway` is that it is simple to implement a caching decorator for it -- just store a mapping `Path -> [FolderEntry]`, while caching a `SchemaGateway` with filters is soooo not trivial.
I also added string constants for known folder entry types, because they should be documented somewhere.
---
- Related to `YQL-19747`
- Related to https://github.com/vityaman/ydb/issues/14
- Related to https://github.com/vityaman/ydb/issues/34
---
Pull Request resolved: https://github.com/ytsaurus/ytsaurus/pull/1245
commit_hash:dda6dcac544ca95d5e8e08f1e7de9de6b5770f25
|
| | |
| | |
| | |
| | |
| | | |
Откатываем дефолт cuDNN на 8.6.0 из-за поломок SDG
commit_hash:87f0d67e1556c6dcf4c4a15e1e9414deed7678de
|
| | |
| | |
| | |
| | | |
commit_hash:8b9d6c96730cd0cf3b23f28bc7b7e53e56bec98c
|
| | |
| | |
| | |
| | | |
commit_hash:dca0ce521902d22da45fdfc92465b78e56fce9f4
|
| | |
| | |
| | |
| | | |
commit_hash:cda276d5db05eb78582444a3f662d3abc0518d0a
|
| | |
| | |
| | |
| | | |
commit_hash:6d34e85695c9a9b2e24f87b1d5dd4c4d06514ec7
|
| | |
| | |
| | |
| | | |
commit_hash:8152cafb3d167774615b4df5bf4470b6269e88a7
|
| | |
| | |
| | |
| | |
| | | |
Fix for yql
commit_hash:81765a279c4df03675ae3b78e90d925ffc437c4f
|
| | |
| | |
| | |
| | | |
commit_hash:6ed396efc31982c8ce5cc34f1f933d195ad1439f
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Cython is not yet subinterpreter compatible. There are no ETA when cython is going to support subinterpreters.
This PR removes cython from hermetic python imoprt hooks in order to make them subinterpretr-compatible.
commit_hash:427b6f9db6afa6695659ee147621e1ccb391d3cb
|
| | |
| | |
| | | |
Closes #17953
|