transaction graph - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

transaction graph - перевод на русский

IN TEMPORAL DATABASES, THE POINT IN TIME AT WHICH A DATABASE FACT WAS STORED IN THE DATABASE
Transaction Time; Transaction-time
Найдено результатов: 615
transaction graph      

математика

граф транзакций

commercial transaction         
  • Purchases can be made through the use of physical currency, such as cash.
  • Silver coin of the [[Maurya Empire]], from the 3rd century BC
AGREEMENT, OR COMMUNICATION, CARRIED OUT BETWEEN A BUYER AND A SELLER TO EXCHANGE AN ASSET FOR PAYMENT
Payment transactions; Bank transactions; Payment transfer; Financial transactions; Commercial Transaction; Commercial transaction; Cash transactions
коммерческая сделка
transaction cost         
COST INCURRED IN MAKING AN ECONOMIC EXCHANGE
Transaction costs; Transactions costs; Transaction cost economics; Transaction Cost Economics; Entry cost; Transactions cost; Transaction-cost economics; Transaction (economics); Transactional cost; Transactional costs
трансакционные издержки (на совершение сделки)
commercial transaction         
  • Purchases can be made through the use of physical currency, such as cash.
  • Silver coin of the [[Maurya Empire]], from the 3rd century BC
AGREEMENT, OR COMMUNICATION, CARRIED OUT BETWEEN A BUYER AND A SELLER TO EXCHANGE AN ASSET FOR PAYMENT
Payment transactions; Bank transactions; Payment transfer; Financial transactions; Commercial Transaction; Commercial transaction; Cash transactions
торговая сделка
empty graph         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph

математика

пустой граф

null tree         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph

математика

нулевое дерево

empty tree         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph

математика

пустое дерево

rooted graph         
GRAPH IN WHICH ONE VERTEX HAS BEEN DISTINGUISHED AS THE ROOT
Accessible pointed graph; Rooted directed graph; Rooted digraph

математика

корневой граф

граф с корнем

graph grammar         
  • optimization]] from compiler construction: multiplication with 2 replaced by addition). ''Bottom:'' Application of the rule to optimize "y=x*2" into "y=x+x".
TECHNIQUES FOR ALGORITHMICALLY CREATING A NEW GRAPH FROM AN EXISTING GRAPH
Graph grammar; Graph transformation; Hypergraph grammar; Graph rewriting system; Term graph rewriting; Determinate graph rewriting

математика

графовая грамматика

graph search         
  • A non-verbal description of three graph traversal algorithms: randomly, depth-first search, and breadth-first search.
CHECKING AND/OR CHANGING EACH VERTEX IN A GRAPH
Graph exploration algorithm; Graph search algorithm; Graph search; Node traversal

математика

поиск на графе

Определение

graph rewriting system
An extension of a term rewriting system which uses {graph reduction} on terms represented by directed graphs to avoid duplication of work by sharing expressions.

Википедия

Transaction time

In temporal databases, transaction time (TT) is the time during which a fact stored in the database is considered to be true. As of December 2011, ISO/IEC 9075, Database Language SQL:2011 Part 2: SQL/Foundation included clauses in table definitions to define "system-versioned tables" (that is, transaction-time tables).

In a database table transaction interval is often represented as an interval allowing the system to "remove" entries by using two table-columns StartTT and EndTT. The time interval is closed at its lower bound and open at its upper bound.

When the ending transaction time is unknown, it may be considered as "Until Changed". Academic researchers and some RDBMS have represented "Until Changed" with the largest timestamp supported or the keyword "forever". This convention is not technically precise.

The term was coined by Richard T. Snodgrass and his doctoral student Ilsoo Ahn.

Как переводится transaction graph на Русский язык