摘要:
A system and method of logless atomic data movement. An internal transaction is started within a multi-level storage architecture, the internal transaction to merge data from the first level storage structure to the second level storage structure. Committed data is read from a first level storage structure of the multi-level storage architecture as specified by the internal transaction. The committed data from the first level storage structure is inserted into a second level storage structure in a bulk insertion process, and the committed data is marked as being deleted from the first level storage. The internal transaction is then committed to the multi-level storage architecture when the committed data has been inserted into the second level storage structure.
摘要:
Various embodiments of systems and methods for generating information models in an in-memory database system by importing data foundation from existing Semantic layer files are described herein. The method includes specifying a type of information view to be generated to model content data. Further the method includes invoking the content data from existing semantic layer files using an import option of a content data editor interface. Subsequent to selecting one or more semantic layer files, automatically extracting table objects corresponding to the selected semantic layer files along with data foundation objects from a file source.
摘要:
A plurality of data items that are annotated with progress markers may be obtained. The progress markers may indicate progress points associated with atemporal processing progress of the respective data items. Deterministic, massively parallel, progressive processing may be initiated on the plurality of data items on a plurality of devices, the progress markers indicating which of the plurality of data items are to be incorporated into results of the progressive processing, the progress markers further indicating an ordering for incorporation of the respective data items into the results.
摘要:
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for scoring criteria for content items. In one aspect, a method includes identifying a primary ranking signal and a set of auxiliary ranking signals for ranking a set of criteria for a content item. A primary score and a set of auxiliary scores can be identified for each particular criterion in the set of criteria. Each auxiliary score can be adjusted to generate adjusted auxiliary scores. The adjusting can include applying, to at least a portion of the auxiliary scores, a transformation function that reduces an amount of skewness among the auxiliary scores. A ranking score can be determined for each particular criterion based on a function of the primary score for the particular criterion and the adjusted auxiliary scores.
摘要:
A method of matching a first entity to a second entity by evaluating Boolean expressions includes identifying a set of criteria vertices for a second entity vertex by traversing a graph database in a manner constrained to fact vertices identified for the second entity. The graph database relates fact vertices to the criteria vertices by edges corresponding to Boolean expressions for satisfying criteria for matching first entities to second entities. The method additionally includes selecting one of the first entities based on the criteria vertices of the set. The method further includes matching the first entity to the second entity based on the selection.
摘要:
A method and an apparatus of maintaining data for online analytical processing in a database system. The method includes: tracking a changed page in a main process; and synchronizing the changed page to a child process for online analytical processing. In the method and apparatus of maintaining data for online analytical processing, the changed pages are tracked and then the child process is synchronized with the changed pages. Therefore, periodic forking is avoided, fork overhead due to periodic forking in the prior art is removed, the synchronization is faster since only the changed pages are synchronized, and the performance of online data processing is enhanced.
摘要:
A method and apparatus for partitioning a graph database that includes nodes connected to one another is presented. The method entails determining a node type indicating a type of node that is to be used as mapped nodes, and upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node. The apparatus includes modules containing computer-executable instructions to perform the above method.
摘要:
In a computer-implemented method for creating a graph database of a virtualization infrastructure, data defining entities and relationships of the entities of a virtualization infrastructure is received at a graph database, wherein the relationships of the entities are in accordance with an inventory structure of the virtualization infrastructure. The graph database is populated with the entities and the relationships of the entities of the virtualization infrastructure.
摘要:
A system for providing context tree based on data model is disclosed. The system comprises an interface, a processor, and a memory. The interface is configured to receive a data model entry point, and to receive one or more context filters. The processor is configured to determine context tree data based on the one or more context filters and the data model entry point from any context tree provider that has appropriate context tree information. The memory is coupled to the processor and is configured to provide the processor with instructions.
摘要:
Systems and methods are provided for creating indices and loading key-value pairs for NoSQL databases. Attributes are created that correspond to records in a NoSQL database based on corresponding record fields. An index is created based on the attributes. A memory is loaded with attributes that correspond to a subset of the index as keys in a key-value pair and identifiers that correspond to records that correspond to the attributes as values in the key-value pair. The attributes that correspond to the subset of the index are sorted in the memory. Any duplicate attributes are identified from the sorted attributes in the memory. Any identifiers that correspond to any duplicate attributes also identify records in the NoSQL database to be evaluated as potential duplicate records.