10 results about "Iterator" patented technology

Various techniques are provided for enabling an iterator (called persistent key-value (KV) iterator) that uses a special key structure embedded with secondary index information for efficient search (or query) of a key-value database (KVDB). In some embodiments, the key structure comprises a plurality of fields categorized into two groups, infrastructure hierarchy fields and object characteristic fields. Keys for the KVDB may be partitioned into one or more levels of hierarchy to generate many smaller key lists for easy search / query of the KVDB. These smaller key lists can be used for concurrent searches / queries.

A Loop Pointer (LP) construct is disclosed for identifying terms in a recursive expression operated with an iterator. A Loop Pointer Variable (LPV) is assigned the current value of the recursive expression comprising one or more previous values or prior terms of the LPV. The prior terms or values are identified in source code by a loop pointer construct modifying a reference to the loop pointer variable. A compiler, responsive to encountering a loop pointer construct, generates instructions to access each of the one or more identified variable values for use in computation of the current value of the loop pointer variable at runtime. An access to the iterator construct output can request the terminal value of the loop pointer variable.

Various techniques are provided for enabling an iterator (called persistent key-value (KV) iterator) that uses a special key structure embedded with secondary index information for efficient search (or query) of a key-value database (KVDB). In some embodiments, the key structure comprises a plurality of fields categorized into two groups, infrastructure hierarchy fields and object characteristic fields. Keys for the KVDB may be partitioned into one or more levels of hierarchy to generate many smaller key lists for easy search / query of the KVDB. These smaller key lists can be used for concurrent searches / queries.

Methods are described herein related to extracting tabular data from a transmission server to a remote subscriber computer in a setting wherein the tabular data can only be transferred in a textual representation over an Internet connection, such as a web service, for example. An architecture based on parallel processing may speed up the extraction process by separating iteration from data processing and by introducing forward and reverse iterators for iterating a table from two ends simultaneously.

Architectures and instruction sets for non-general matrix multiplication operations are described. An example programmable processor, which implements these architectures and instruction sets, includes multiple processing engines, multiple buffers (with at least one buffer storing a multidimensional array), and multiple iterator tables stored in one of the multiple buffers. The multiple processing engines and multiple buffers are tightly coupled within an area of the programmable processor to enable high-bandwidth data communications between components of the programmable processor. Furthermore, the multiple iterator tables include an iterator table for each of the multiple buffers, and an iterator table enables read or write access to a respective buffer based on using multiple offset-stride tuples stored in the iterator table to derive addresses to access the multidimensional array stored in the respective buffer. Memory elements used by the multiple processing engines to perform operations using the multiple iterator tables consist of the multiple buffers.

A Loop Pointer (LP) construct is disclosed for identifying terms in a recursive expression operated within a branching construct, having a condition, within an iterator construct. A Loop Pointer Variable (LPV) is assigned the current value of the recursive expression comprising one or more previous values or prior terms of the LPV. The prior terms or values are identified in source code by a loop pointer construct modifying a reference to the loop pointer variable. A compiler generates instructions to access each of the one or more identified variable values for use in computation of the current value when the condition of the branching construct is met at runtime. An access to the iterator construct output can request the terminal value of the loop pointer value, a sequence of one or more of a series comprising updates to the value when the condition is met, or a series of the values in each iteration.

Compiler techniques lot inline parallelism and re-targetable parallel runtime execution of logic iterators enables selection thereof from the source code or dynamically during the object code execution.

The application provides a type inference method and device of a programming language, the method comprising: in the development process of program code, obtaining a node to be inferred in an abstract syntax tree, the node to be inferred indicating a field to be inferred in the program code, the field to be inferred comprising one of the following: a variable, a class, a function or a parameter; obtaining a constraint related to the node to be inferred, the constraint being used to indicate a relationship involved by the node to be inferred in the abstract syntax tree; determining a type of the node to be inferred according to the constraint, the type of the node to be inferred being one of the following: a numeric type, a sequence type, a mapping type, a set type, an iterator type, a context manager type, a module type, a metatype, a null type or a callable type. The scheme of the application is beneficial to reducing the memory occupation of type inference.

The application provides a performance portable numerical simulation unified acceleration interface method, and relates to the technical field of data processing, and comprises the following steps: a topological matrix of data relations is traversed through an iterator; the iterator calculates position information of data in the topological matrix, and obtains data sequences; and each data sequence element is subjected to operator operation through the iterator. The application takes the iterator as the core, can support any number of arrays and parameters to participate in calculation, supports flexible calculation function definition of a user, supports a structure array to participate in calculation, makes the acceleration interface more intuitive to use, and meets actual requirements of acceleration calculation development and optimization.

The application discloses a key value storage method based on a multi-log structure merge tree, and comprises the following steps: 1, when a read-write request is received by a multi-log structure merge tree (MLSMT), the hash value of a key in the request is used to determine the log structure merge tree (LSMT) to which the key belongs i , and read-write operation is performed on the LSMT i ; 2, when a scanning request is received by the MLSMT structure, a grouping iterator is established for a file in the log structure merge tree, parallel threads are used to perform a key positioning operation (Seek), and a heap sorting is used to find a next key, so that data is read out; 3, a compaction operation is processed by using parallel threads in the background, and data belonging to a current LSMT i is read out from an LSMT i split from the LSMT s and written into an SST file of the LSMT i . The application can realize accelerated writing and merging of data, reduce the number of layers of a single log structure merge tree, and thus improve the read-write performance of a system.