126 results about "Search data structure" patented technology

A simple and therefore highly usable non-blocking implementations of linked-lists can be provided using read, write, and CAS operations. Several realizations of linked-list based data-structures are described, which are non-blocking, linearizable, and exhibit disjoint-access for most operations. In other words, the realizations are non-blocking and linearizable while maintaining the property that operations on disjoint parts of the list do not interact, effectively lowering contention and increasing concurrency. We implement three exemplary data structures: sets, multi-sets, and ordered-sets. The exemplary implementations support insert, remove, and find operations, with natural semantics. An ordered-set implementation supports an additional removeGE operation.

Systems and methods (e.g., utilities) for use in providing automated data quality detection that can be used multiple times across various domains and across multiple data quality spheres. A data structure or schema of an incoming data set is initially mapped to a desired data or knowledge state in a domain ontology made up of a number of TBox statements. Data quality issues in the incoming data set can then be detected as instances of the incoming data set are attempted to be inferenced against or otherwise matched to anticipated TBox statements of the domain ontology.

Methods, systems, and computer program products for ensuring data quality and integrity of a data set derived from a data source are described. The data source may be one or more data repositories or data warehouses, or one or more transaction systems. Data from the data source may be stored in a staging area. A data repository is built using the data. The data repository comprises a data structure that forms a model of the data from the data source. The building step involves applying business rules from a rules database to the data. The business rules are dependent upon meta data. The building step further involves detecting any errors in the data and storing data satisfying the business rules in the data repository. A log of any detected errors may be maintained in the data repository.

An intelligent caching data structure and mechanisms for storing visual information via objects and data representing graphics information. The data structure is generally associated with mechanisms that intelligently control how the visual information therein is populated and used. The cache data structure can be traversed for direct rendering, or traversed for pre-processing the visual information into an instruction stream for another entity. Much of the data typically has no external reference to it, thereby enabling more of the information stored in the data structure to be processed to conserve resources. A transaction/batching-like model for updating the data structure enables external modifications to the data structure without interrupting reading from the data structure, and such that changes received are atomically implemented. A method and mechanism are provided to call back to an application program in order to create or re-create portions of the data structure as needed, to conserve resources.

An indexing system uses a graph-like data structure that clusters features indexes together. The minimum atomic value in the data structure is represented as a leaf node which is either a single feature index or a sequence of two or more feature indexes when a minimum sequence length is imposed. Root nodes are formed as clustered collections of leaf nodes and/or other root nodes. Context nodes are formed from root nodes that are associated with content that is being indexed. Links between a root node and other nodes each include a sequence order value that is used to maintain the sequencing order for feature indexes relative to the root node. The collection of nodes forms a graph-like data structure, where each context node is indexed according to the sequenced pattern of feature indexes. Clusters can be split, merged, and promoted to increase the efficiency in searching the data structure.

A method of flow of an outbound communication to another module with interface using a broker which is able to review all data structures, regardless of complexity, as being comprised of a finite set of primitive data types (e.g. integer, float etc.) and with reference to the repository determine a mechanism for reading and writing these types to enable processing of structures of arbitrary complexity, wherein the rules and mechanisms for reading these basic types are defined by the protocol and once the rules are captured allow processing of any message over this protocol

A method, system, and computer program product are provided for identifying an object placed on a surface. An indication is received that an object has been placed on the surface. A plurality of physical characteristics are identified that are associated with the object. Using the plurality of physical characteristics, a data structure is searched to determine the existence of a single object with physical characteristics that matches the plurality of physical characteristics. Responsive to a match, a determination is made as to whether the single object has an associated presentation. Responsive to the existence of the associated presentation, the associated presentation is presented to a user.

The present invention improves a network forwarding device, such as a router, in a computer network system. When an address to which a received packet is to be forwarded is searched for based on path information, a path search data structure is changed to the one in which, in a 2-branch tree search in which a destination address of the received packet is checked, one bit at a time beginning at a highest-order bit, p (p is an integer equal to or larger than 2) levels are combined into one 2^P-branch tree to perform a search of the p levels of the 2-branch tree as a one-level search. This data structure speeds up path search processing.

In a computer system having different memory address spaces, for example, user space and kernel space, a method and system is provided for communicating data. A data structure is defined in the kernel space to store data. The data structure is virtually mapped to an application in user space such that the application can access the data structure through virtual memory addresses. By directly accessing the data structure, data transfers between the address spaces using system calls and/or interrupts can be reduced.

A persistent data structure store may include an architecture that utilizes dual representations of data hosted in persistent storage coupled with a faster non-persistent cache residing in volatile memory. The persistent data structure store may maintain, in a non-volatile persistent memory, a byte-addressable persistent copy of a data structure storing multiple data values. The persistent data structure store may also maintain a copy of at least some of the data values in a cache copy of the data structure in a volatile memory. When updating values in the data structure, the targeted data value may be updated in the cache copy of the data structure and a log entry specifying the data update may be added to a cross-referencing data operations log from which the data operation will be subsequently applied to the persistent copy of the data structure.

A system and method of identifying relational patterns across a plurality of databases using a data structure and the data structure itself. The data structure including one or more data node branches, each of the one or more data node branches including one or more data nodes, each of the one or more data nodes representing a data item of interest and corresponding data item support values for the data item across the plurality of databases in relation to other data items represented in the data node branch. The data structure can be used to mine one or more relational patterns considering pattern support data across the plurality of databases at the same time.

A method of using synchronized search and order data structures to access a collection of data comprising organizing the search data structure by encrypted key value, wherein the search data structure contains only references to elements in the collection and their associated encrypted keys, organizing the order data structure by unencrypted key value, wherein the order data structure contains only references to elements in the collection and their associated encrypted keys, exposing a maximum of two pieces of clear text data during operations on the collection, engaging in insert or delete operations, engaging in update operations; engaging in search operations, engaging in sort operations, engaging in merge operations, and reporting the results of those operations to the user.

Methods of predicting stack pointer values of variables stored in a stack are described. When an instruction is seen which stores a variable in the stack in a position offset from the stack pointer, an entry is added to a data structure which identifies the physical register which currently stores the stack pointer, the physical register which stores the value of the variable and the offset value. Subsequently when an instruction to load a variable from the stack from a position which is identified by reference to the stack pointer is seen, the data structure is searched to see if there is a corresponding entry which includes the same offset and the same physical register storing the stack pointer as the load instruction. If a corresponding entry is found the architectural register in the load instruction is mapped to the physical register storing the value of the variable from the entry.

The invention is applicable to the technical field of data structures in cloud computing, and provides a data structure based on a cloud computing database system. The data structure comprises a primary key and a data sheet, wherein the primary key is used for storing data information with the unique identification in a binary code form and serves as a retrieval index; the data structure further comprises a primary key control module which is used for transforming data containing the time attribute in data information of the primary key into binary codes and storing the binary codes into the primary key in a hash distribution way. According to the design method and the system of the data structure, the primary key structure of transaction data and statistical data is the core of the data structure, and storage and retrieval efficiencies of a big data system during cloud computing can be greatly improved.

The present invention provides novel naming and manipulation functions for user defined data structures in a data system using transaction service. In particular, in an electronics assembly engineering system having a computer subsystem in which user-defined data structures accessible to editor software have referential integrity and in which user modifications to the data structures during editing are made directly to the data structures rather than indirectly by way of a temporary file, the invention provides a method for permitting naming and manipulation of the data structures. The method includes the steps of (i) providing close, discard and rename functions for the data structures in the case where a newly-created data structure is being edited; (ii) providing close and copy functions for the data structures if an existing data structure is being edited; and (iii) excluding a save-as function for the data structures.