Gesproken tekst vertalen, offlinefuncties, synoniemen, vervoegingen, educatieve spelletjes
Publiciteit
Registreer gratis: toegang tot meer resultaten en functies
tree index data structure
Examples with "tree index data structure" and their translation in Chinees
The tree index data structure includes a directory node having a descendent node and a leaf node without having a descendent node.
树形索引数据结构包括具有后继节点的目录节点和没有后继节点的叶节点。
The node searching method then includes a process of searching descendent nodes to perform a traversing from a root node to leaf nodes according to a tree index data structure (S320).
节点搜索方法还包括搜索后继节点，以根据树形索引数据结构从根节点到叶节点进行遍历的过程（S320）。
The present disclosure relates to a node search using a tree index; and, more particularly, to a method and apparatus for searching nodes by traversing the nodes from a root node to leaf nodes according to a tree index data structure.
本发明涉及一种使用树形索引的节点搜索，特别涉及一种根据树形索引数据结构从根节点到叶节点遍历节点的节点搜索方法和装置。
In a conventional tree index data structure, when there is a process causing a change to the structure of a tree index, it has been required to protect data compatibility of the tree index using a lock in order to compare the tree index while maintaining the data compatibility in another process.
在常规树形索引数据结构中，有改变树形索引的结构的过程时，要求按顺序用锁保护树形索引的数据兼容性，以在保持数据在另一个过程中的兼容性的同时对树形索引进行比较。
Andere resultaten
A B-tree index, one kind of such a tree index, is a data structure commonly used in a database system to organize a large quantity of data in order and allow rapid access thereto.
平衡树索引是一种树形索引，是数据库系统中常用的数据结构，用于按顺序组织大量数据，使其能快速存取。
As well known in the art, an index is a data structure that increases an operating speed for a table in the field of database, and a tree index refers to an index data structure organized in a tree architecture.
在本领域中，众所周知的是，索引是一种数据结构，能增加数据库字段中表格的运算速度，树形索引指以树形结构组织的索引数据结构。
QR-tree, a spatial index structure based on R-tree and a kind of space partition method using Quad-tree, is proposed. Its data structure and algorithms are also stated.
提出了一种基于R-树与"四叉树"空间层次划分的空间索引结构QR-树，给出了其数据结构和算法描述。
A network device that includes an encoding module that generates an encoded value that represents a specified port range including a first element storing an identifier that identifies a frequently occurring port range stored in an associative data structure of most frequently occurring port ranges, a second element storing an index that represents a dynamically-learned port range specifying at least a part of the specified port range, the dynamically-learned port range represented in a tree-structure of dynamically-learned port ranges and identified by the index. The network device also includes a forwarding plane that applies one or more filters associated with the encoded value to a packet that specifies a port included in the specified port range.
网络装置包括生成表示指定端口范围的编码值的编码模块，所述编码值包括存储标识符的第一单元和存储索引的第二单元，标识符对存储于最频繁出现的端口范围的关联数据结构的频繁出现的端口范围进行识别，索引表示指定至少一部分指定端口范围的动态学习端口范围，所述动态学习端口范围表示动态学习端口范围树形结构，并由索引识别。所述网络装置还包括转发平面，用于将与编码值关联的一个或多个过滤器应用在对指定端口范围内包括的端口进行指定的包上。
In contrast to past technique, encoding techniques provided in the present disclosure may improve control plane performance (hardware update) and use fewer CAM entries, e.g., one entry in some cases, to represent port ranges associated with filters. For instance, in some applications, only a small percentage of the filters actually use port ranges, and even when ranges are specified, some ranges are used with higher frequency (for e.g. 1023-65536 is used with higher frequency). Techniques of the present disclosure may avoid costly range encoding in the control plane for filters that don't specify a range. For those filters that do have ranges, encoding module 60 may encode frequently occurring port ranges efficiently and sometimes with at most one TCAM entry. Non-frequently occurring or 揹ynamic? ranges are handled effectively, by representing each 揹ynamic? range as an index in the encoded value. The index values may be managed by a tree data structure as further described herein. By avoiding rule decomposition for well-known/frequently used ports, and by eliminating the need to execute encoding logic for exact port ranges, overall control plane complexity may be reduced.
与先前技术相比，本发明提供的编码技术可提高控制平面性能（硬件更新）并使用更少的CAM条目，例如，某些情况下使用一个条目，以表示与过滤器关联的端口范围。例如，在某些应用中，实际上仅一小部分过滤器使用端口范围，即使指定了范围，某些范围也能在较高频率下使用（例如，1023-65536以较高频率使用）。本发明的技术可避免没有指定范围的过滤器的控制平面中范围编码的高昂成本。对于指定了范围的过滤器，编码模块60可有限地对频繁出现的端口范围进行编码，有时最多用一个TCAM条目进行编码。通过将每个"动态"范围表示为编码值中的索引，可有效处理不频繁出现的或"动态"的范围。所述索引值可由树形数据结构进行管理，具体如本文所述。通过避免已知/频繁使用的端口的规则分解，并免除执行用于精确端口范围的编码逻辑的需要，可减小控制平面的总体复杂性。
The inverted index data structure is a central component of a typical search engine indexing algorithm.
应用 ［ 编辑 ］ 反向索引数据结构是典型的搜索引擎 检索 算法 重要的部分。
In this way, it is possible to protect compatibility of tree index data without needing to use a lock.
这样，可在不需要使用锁的情况下保护树形索引的数据兼容性。
Instead of listing the words per document in the forward index, the inverted index data structure is developed which lists the documents per word. With the inverted index created, the query can now be resolved by jumping to the word id (via random access) in the inverted index.
为了替代正向索引的每个文档的单词列表，能列出每个查询的单词所有所在文档的列表的反向索引数据结构开发了出来。 随着反向索引的创建，如今的查询能通过立即的单词标示迅速获取结果（经过随机存储 ） 。
In computer science, an inverted index (also referred to as postings file or inverted file) is an index data structure storing a mapping from content, such as words or numbers, to its locations in a database file, or in a document or a set of documents (named in contrast to a Forward Index, which maps from documents to content).
倒排索引 （英语：Inverted index ） ， 也常被称为反向索引 、置入档案 或反向档案 ，是一种索引 方法，被用来存储 在全文搜索 下某个单词在一个文档或者一组文档中的存储位置 的映射 。
Ga naar Premium voor toegang tot miljoenen vertaalvoorbeelden, onbeperkt woorden opslaan en leren, zonder advertenties.
Woord & uitdrukking van de dag
Afbeelding van de dag
Resultaten: 1187. Exact: 4. Verstreken tijd: 42 ms.
