Abstract: A multi-dimensional database and indexes and operations on the multi-dimensional database are described which include video search applications or other similar sequence or structure searches. Traversal indexes utilize highly discriminative information about images and video sequences or about object shapes. Global and local signatures around keypoints are used for compact and robust retrieval and discriminative information content of images or video sequences of interest. For other objects or structures relevant signature of pattern or structure are used for traversal indexes. Traversal indexes are stored in leaf nodes along with distance measures and occurrence of similar images in the database. During a sequence query, correlation scores are calculated for single frame, for frame sequence, and video clips, or for other objects or structures.

Abstract: A multi-dimensional database and indexes and operations on the multi-dimensional database are described which include video search applications or other similar sequence or structure searches. Traversal indexes utilize highly discriminative information about images and video sequences or about object shapes. Global and local signatures around keypoints are used for compact and robust retrieval and discriminative information content of images or video sequences of interest. For other objects or structures relevant signature of pattern or structure are used for traversal indexes. Traversal indexes are stored in leaf nodes along with distance measures and occurrence of similar images in the database. During a sequence query, correlation scores are calculated for single frame, for frame sequence, and video clips, or for other objects or structures.

Abstract: A multi-dimensional database and indexes and operations on the multi-dimensional database are described which include video search applications or other similar sequence or structure searches. Traversal indexes utilize highly discriminative information about images and video sequences or about object shapes. Global and local signatures around keypoints are used for compact and robust retrieval and discriminative information content of images or video sequences of interest. For other objects or structures relevant signature of pattern or structure are used for traversal indexes. Traversal indexes are stored in leaf nodes along with distance measures and occurrence of similar images in the database. During a sequence query, correlation scores are calculated for single frame, for frame sequence, and video clips, or for other objects or structures.

Abstract: A multi-dimensional database and indexes and operations on the multi-dimensional database are described which include video search applications or other similar sequence or structure searches. Traversal indexes utilize highly discriminative information about images and video sequences or about object shapes. Global and local signatures around keypoints are used for compact and robust retrieval and discriminative information content of images or video sequences of interest. For other objects or structures relevant signature of pattern or structure are used for traversal indexes. Traversal indexes are stored in leaf nodes along with distance measures and occurrence of similar images in the database. During a sequence query, correlation scores are calculated for single frame, for frame sequence, and video clips, or for other objects or structures.

Abstract: A transactional replicator applying group commit and barrier concepts is disclosed. Group commit means that the transactional replicator commits multiple transactions in a group and is not restricted to committing single transactions one-at-a-time and is not limited to operating on a single state provider. Barrier means that the transactional replicator does not move forward to commit additional transactions until the previous group of transactions are completed. All state providers must apply their transactions and update state before additional transactions will be committed. A quorum acknowledgement “unlocks” any locks that were acquired to update the state within a state provider. However, as long as there are no lock conflicts, additional transactions can continue to create new group commits as necessary.

Abstract: Systems and methods are disclosed for efficiently detecting alert states within unstructured event data. Alert states are illustratively defined as occurring when a threshold number of journey instances are present within the unstructured event data, each journey instance representing a series of events within the event data representing steps within a pre-defined journey. Detecting journey instances within unstructured event data can require significant computational resources, and thus attempting to detect alert states directly from unstructured event data can lead to inefficiencies. Embodiments of this disclosure enable a structured data set of journey instances to be generated from unstructured event data, and for the structured data set to be evaluated based on criteria of multiple alert states. By utilizing a single structured data set to support evaluation based on multiple alert states, detecting alert states from unstructured event data is rendered more efficient.

Abstract: A method and an apparatus for data backup are disclosed. The method includes querying a slave for check information, where the check information is data inserted into a master when data written to the master is copied into the slave in a form of a log; obtaining a time at which the check information is inserted into the master and setting the time as a backup completion time point; and deleting data record(s) that is/are earlier than the backup completion time point from mirrored data, the mirrored data being data that is synchronously written to a defined storage space when the data is written to the master. The method for data backup is easy to implement at a low cost, and provides highly secure data backup.

Abstract: A server includes a content storage medium configured to store content data of content usable in different types of games. The server, upon a transmission request, sends content data to an information-processing device, and retains the sent content data in the content storage medium wherein sending the content data again is prohibited. The server, when the content data is sent from the information-processing device, receives the content data, assigns a new ID to the received content data in case the received content data lacks the ID, and stores the received content data in the content storage medium wherein sending the content data is allowed.

Abstract: A method of facilitating construction of a user interface for policing input of user-defined data to a database. An ontology expressed in a first-order logic language is obtained, the ontology describing one or more predefined classes, a plurality of predefined properties and at least one predefined restriction. Data useable to identify a first class is received, and in response, an intermediate data structure is generated for the first class, the intermediate data structure configured to facilitate construction of a user interface for policing input of user-defined data to the database. Generating the intermediate data structure comprises identifying a property from the ontology that is applicable to the first class, determining a property restriction function indicating whether the at least one restriction is applicable to the property, and associating the at least one restriction with the property in the intermediate data structure.

Abstract: A multiresolution parser (MRP) can selectively extract one or more information units from a dataset based on the available processing capacity and/or the arrival rate of the dataset. Should any of these parameters change, the MRP can adaptively change the information units to be extracted such that the benefit or value of the extracted information is maximized while minimizing the cost of extraction. This tradeoff is facilitated, at least in part, by an analysis of the spectral energy of the datasets expected to be processed by the MRP. The MRP can also determine its state after a processing iteration and use that state information in subsequent iterations to minimize the required computations in such subsequent iterations, so as to improve processing efficiency.

Abstract: Techniques are described herein for a vectorized hash table that uses very efficient grow and insert techniques. A single-probe hash table is grown via vectorized instructions that split each bucket, of the hash table, into a respective upper and lower bucket of the expanded hash table. Further, vacant slots are indicated using a vacant-slot-indicator value, e.g., ‘0’, and all vacant slots follow to the right of all occupied slots in a bucket. A vectorized compare instruction determines whether a value is already in the bucket. If not, the vectorized compare instruction is also used to determine whether the bucket has a vacant slot based on whether the bucket contains the vacant-slot-indicator value. To insert the value into the bucket, vectorized instructions are used to shift the values in the bucket to the right by one slot and to insert the new value into the left-most slot.

Abstract: A method, apparatus, and computer-readable medium for dynamic hierarchical data flow mapping, including storing dynamic data flow mappings, each dynamic data flow mapping including a mapping of data from an input port corresponding to a source data container to an output port corresponding to a destination data container and a dynamic hierarchical field having a dynamic hierarchical data type, determining a rule language corresponding to each dynamic hierarchical field in the dynamic data flow mappings, the rule language defining acceptable parameters for sub-fields of that dynamic hierarchical data type, and generating static data flow mappings by resolving all dynamic hierarchical fields into static hierarchical fields during compilation of the dynamic data flow mappings with the source data container and the destination data container, the static data flow mappings being generated based at least in part on the rule language corresponding to each dynamic hierarchical field and underlying data in one or more

Abstract: A method for constructing a sub-blockchain in a blockchain system comprising a distributed network of nodes comprises generating and propagating, by one of the nodes, a candidate sub-block comprised in a sub-blockchain to be connected to one of main blocks included in a main blockchain; validating the candidate sub-block and storing and propagating the validated candidate sub-block by one of the nodes; validating a content block received from a node which generated the candidate sub-block corresponding to content queried by a user and storing and propagating an end block connected to the content block by one of the nodes; and if the number of the same end blocks received from other nodes is larger than a preconfigured value, generating an approved sub-block, and propagating the approved sub-block by one of the nodes while updating the approved sub-block to a local copy of a blockchain.

Abstract: In accordance with an embodiment, dependency analysis is done for each dynamic (or temporary) member to collect list of runtime as well as static dependents in both BSO (block storage option) and ASO (aggregate storage option) cubes. This enables the member to join hybrid flow for its execution in bottom up approach.

Abstract: Personalized network searching, in which a search query is received from a user, and a request is received to personalize a search result. Responsive to the search query and the request to personalize the search result, a personalized search result is generated by searching a personalized search object. Responsive to the search query, a general search result is generated by searching the general search object. The personalized search result and the general search result are provided to a client device, an advertisement is selected based at least in part upon the personalized search object, and the advertisement, the personalized search result, and the general search result are displayed.

Abstract: The overall architecture and details of a scalable video fingerprinting and identification system that is robust with respect to many classes of video distortions is described. In this system, a fingerprint for a piece of multimedia content is composed of a number of compact signatures, along with traversal hash signatures and associated metadata. Numerical descriptors are generated for features found in a multimedia clip, signatures are generated from these descriptors, and a reference signature database is constructed from these signatures. Query signatures are also generated for a query multimedia clip. These query signatures are searched against the reference database using a fast similarity search procedure, to produce a candidate list of matching signatures. This candidate list is further analyzed to find the most likely reference matches. Signature correlation is performed between the likely reference matches and the query clip to improve detection accuracy.

Abstract: The overall architecture and details of a scalable video fingerprinting and identification system that is robust with respect to many classes of video distortions is described. In this system, a fingerprint for a piece of multimedia content is composed of a number of compact signatures, along with traversal hash signatures and associated metadata. Numerical descriptors are generated for features found in a multimedia clip, signatures are generated from these descriptors, and a reference signature database is constructed from these signatures. Query signatures are also generated for a query multimedia clip. These query signatures are searched against the reference database using a fast similarity search procedure, to produce a candidate list of matching signatures. This candidate list is further analyzed to find the most likely reference matches. Signature correlation is performed between the likely reference matches and the query clip to improve detection accuracy.

Abstract: The overall architecture and details of a scalable video fingerprinting and identification system that is robust with respect to many classes of video distortions is described. In this system, a fingerprint for a piece of multimedia content is composed of a number of compact signatures, along with traversal hash signatures and associated metadata. Numerical descriptors are generated for features found in a multimedia clip, signatures are generated from these descriptors, and a reference signature database is constructed from these signatures. Query signatures are also generated for a query multimedia clip. These query signatures are searched against the reference database using a fast similarity search procedure, to produce a candidate list of matching signatures. This candidate list is further analyzed to find the most likely reference matches. Signature correlation is performed between the likely reference matches and the query clip to improve detection accuracy.

Abstract: A system links data objects for common entities across source systems and includes at least one processor. The system compares data objects within each of a plurality of source systems to identify data objects associated with corresponding common entities. The identified data objects for each common entity within each of the plurality of source systems are linked to form a group of data objects for each common entity. The groups of data objects for each of the common entities are compared across the plurality of source systems to identify groups of data objects associated with common entities. The identified groups of data objects for common entities are linked across the plurality of source systems to form a set of data objects for each corresponding common entity. Embodiments of the present invention further include a method and computer program product for linking data objects for common entities across source systems.

Abstract: Aspects of the disclosure relate to providing metadata access to distributed data lake users. In some embodiments, a computing platform may load metadata from an external metadata database into a staging database. Then, the computing platform may transform the metadata in the staging database and move the transformed metadata to a master database. The master database may comprise information indicating a relationship between the transformed metadata and one or more distributed data lakes. The computing platform may receive a request to access one or more metadata items. Then, the computing platform may authorize a distributed computing cluster user to access at least one metadata item based on the information. Based on the authorization, the computing platform may provide, to the distributed computing cluster user, access to the at least one metadata item of the one or more metadata items.