Datenvertragswerk
hot index root audit
A PostgreSQL storage/index fixture maintainer checks which supplied page tuple an initial index-root HOT search may actually return,rather than treating every snapshot-visible physical tuple as reachable from that index entry. PostgreSQL18 first_call=true model only. Visibility and resolved updater are supplied. No MVCC execution,page validity or security diagnosis. Unknown/revisit limits explicit. Fixed price also for successful unknown;invalid profile HTTP400 before settlement. A.
POST https://datenvertrag.halowerk.com/v1/hot-index-root-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| max_offset | integer | Ja | |
| slots | array | Ja | |
| queries | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"properties": {
"max_offset": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"slots": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"offset": {
"type": "integer",
"minimum": 1,
"maximum": 16
},
"kind": {
"enum": [
"NORMAL",
"REDIRECT",
"DEAD",
"UNUSED",
null
]
},
"redirect_to": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 17
},
{
"type": "null"
}
]
},
"heap_only": {
"anyOf": [
{
"type": "boolean"
},
{
"type": "null"
}
]
},
"xmin": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4294967295
},
{
"type": "null"
}
]
},
"update_xid": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4294967295
},
{
"type": "null"
}
]
},
"visible": {
"anyOf": [
{
"type": "boolean"
},
{
"type": "null"
}
]
},
"hot_updated": {
"anyOf": [
{
"type": "boolean"
},
{
"type": "null"
}
]
},
"next_offset": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 17
},
{
"type": "null"
}
]
},
"same_page": {
"anyOf": [
{
"type": "boolean"
},
{
"type": "null"
}
]
}
},
"required": [
"offset",
"kind",
"redirect_to",
"heap_only",
"xmin",
"update_xid",
"visible",
"hot_updated",
"next_offset",
"same_page"
]
},
"minItems": 0,
"maxItems": 16
},
"queries": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"root": {
"type": "integer",
"minimum": 0,
"maximum": 17
},
"claimed_offset": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 16
},
{
"type": "null"
}
]
}
},
"required": [
"root",
"claimed_offset"
]
},
"minItems": 1,
"maxItems": 16
}
},
"required": [
"max_offset",
"slots",
"queries"
]
}Veröffentlichtes Eingabebeispiel
{
"max_offset": 3,
"slots": [
{
"offset": 1,
"kind": "NORMAL",
"redirect_to": null,
"heap_only": false,
"xmin": 10,
"update_xid": 20,
"visible": false,
"hot_updated": true,
"next_offset": 2,
"same_page": true
},
{
"offset": 2,
"kind": "NORMAL",
"redirect_to": null,
"heap_only": true,
"xmin": 20,
"update_xid": 20,
"visible": true,
"hot_updated": false,
"next_offset": 2,
"same_page": true
},
{
"offset": 3,
"kind": "NORMAL",
"redirect_to": null,
"heap_only": true,
"xmin": 20,
"update_xid": 20,
"visible": true,
"hot_updated": false,
"next_offset": 2,
"same_page": true
}
],
"queries": [
{
"root": 1,
"claimed_offset": 2
}
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden