Abstract: This disclosure describes systems and methods for employing interlinking multiple independent and separately-scalable blockchains to create globally verifiable unique identifiers. The disclosed systems and methods facilitate the creation of the globally verifiable unique identifiers to a level of scalability unattainable without employing the underlying two-dimensional blockchain structure, metadata, and cryptographic information stored on the blockchain. Moreover, the system avoids collisions and name conflicts among the globally verifiable unique identifiers, supports post-creation verification of the globally verifiable unique identifiers, and provides a variety of ancillary functions using the globally verifiable unique identifiers.

Abstract: The problem of distinct value estimation has many applications, but is particularly important in the field of database technology where such information is utilized by query planners to generate and optimize query plans. Introduced is a novel technique for estimating the number of distinct values in a given dataset without scanning all of the values in the dataset. In an example embodiment, the introduced technique includes gathering multiple intermediate probabilistic estimates based on varying samples of the dataset, 2) plotting the multiple intermediate probabilistic estimates against indications of sample size, 3) fitting a function to the plotted data points, and 4) determining an overall distinct value estimate by extrapolating the objective function to an estimated or known total number of values in the dataset.

Abstract: Storing and retrieving data in a content management computer system. The method includes configuring the memory to store a document having a plurality of versions, according to a configuration comprising: (i) a plurality of topics, each topic being stored as an XML file and comprising content forming a portion of one or more of the versions of the document; and (ii) a plurality of project maps, each project map corresponding to one of the plurality of versions of the document and including a reference to one or more buildable maps, each buildable map including a reference to one or more of the topics, directly or through a submap. A publication request is received for a selected one of the project maps, and the referenced topics of the buildable maps of the selected project map are combined to form a version of the document corresponding to the selected project map.

Abstract: Methods and systems are provided for selectively employing storage engines in a distributed database environment. The methods and systems can include a processor configured to execute a plurality of system components, that comprise an operation prediction component for determining an expected set of operations to be performed on a portion of the database; a data format selection component for selecting, based on at least one characteristic of the expected set of operations, and at least one storage engine for writing the portion of the database in a selected data format. According to one embodiment, the system includes an encryption API configured to initialize callback functions for encrypting and decrypting database data, a storage API for executing the call back functions, a database API configured to manage database operations (e.g., read and write requests), wherein the database API calls the storage API to access data on a stable storage medium.

Abstract: One embodiment provides a method, including: receiving a natural language query from a user; identifying a plurality of interpretations for interpreting the natural language query, wherein the plurality of interpretations are based upon at least one ambiguity in the received natural language query; generating, for each of the plurality of interpretations, a plurality of example queries; generating, for each of the interpretations, both (i) an answer to the received natural language query and (ii) an answer to each of the generated plurality of example queries; and providing, to the user, (i) the generated answer for each interpretation of the natural language query and (ii) a plurality of question/answer pairs for each of the identified plurality of interpretations that assists in disambiguating the ambiguity, wherein each question/answer pair comprises at least one of the generated plurality of example queries and the corresponding generated answer to the example query.

Abstract: A method of managing alerts in a client instance associated with a configuration management database (CMDB) platform is disclosed. The method includes: receiving a request identifying a particular CI and a particular alert; identifying related CIs from a plurality of CIs associated with the client instance based on the particular CI and the particular alert; identifying alerts, incidents (INTs), changes (CHGs), and problems (PRBs) of the client instance that are associated with either the particular CI or the related CIs; determining frequency data for the alerts, INTs, CHGs, and PRBs associated with the particular CIs and frequency data for the alerts, INTs, CHGs, and PRBs associated with the related CIs; and sending a response that includes the frequency data for the alerts, INTs, CHGs, and PRBs associated with the particular CIs to be presented alongside the frequency data for the alerts, INTs, CHGs, PRBs associated with the related CIs.

Abstract: A method for expanding a word performed by a processor includes (a) obtaining a first word, (b) obtaining, from a memory, a concept map that is unique to a user and that includes a plurality of second words and semantic distances between the plurality of second words, the plurality of second words including words belonging to different categories, (c) determining, if the plurality of second words include a word corresponding to the first word, the word corresponding to the first word as a basic word, (d) selecting, on the basis of the semantic distances to the basic word, at least one of the plurality of second words included in the concept map as an adjacent word, and (e) outputting a result of a search on the basis of the first word and the adjacent word.

Abstract: In accordance with disclosed embodiments, there are provided systems, methods, and apparatuses for implementing a BY PARTITION command term within a multi-tenant aware structured query language within a computing environment.

Abstract: Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.

Abstract: A method of performing XBRL extension taxonomy concept replacement includes analyzing, by a processor, an XBRL document having XBRL tags to identify an XBRL extension taxonomy concept of an XBRL extension taxonomy that is superfluous in comparison with an XBRL base taxonomy concept for an XBRL base taxonomy upon which the XBRL extension taxonomy is based. The processor is configured to identify an extension extended linkrole in the XBRL extension taxonomy that includes the identified XBRL extension taxonomy concept, determine a base extended linkrole in the XBRL base taxonomy that matches the extension extended linkrole, determine an XBRL base taxonomy concept in the base extended linkrole that matches the identified XBRL extension taxonomy concept, and replace the identified XBRL extension taxonomy concept with the XBRL base taxonomy concept in the base extended linkrole.

Abstract: Techniques are provided that include receiving one or more global signatures for a query image in response to an image recognition query, wherein some of the plurality of global signatures are generated using local descriptors corresponding to different cropped versions of the image. A ranking order is determined for a plurality of document images based on nearest neighbor relations between document signatures corresponding to the plurality of document images and each one of the one or more global signatures for the query image. A subset of the plurality of document images is selected based on the determined ranking order. Additional document data corresponding to the selected subset of the plurality of document images is obtained, and a search result is generated based on a geometric verification between the additional document data corresponding to the selected subset of the plurality of document images and the query image.

Abstract: Data structures stored on a source database are migrated to a destination database in which the data are structured in a different format than that of the source database. Dictionaries are stored that are based on representations of the data structures stored on the source database that are formatted in other than the structural format used on the source database for the data structures. One of the data structures and a corresponding one of the dictionaries are transferred from the source database to a destination database. The transferred data structure is loaded onto the destination database in accordance with the transferred dictionary.

Abstract: In accordance with disclosed embodiments, there are provided systems, methods, and apparatuses for implementing dynamic macros within a multi-tenant aware structured query language operable within a computing environment.

Abstract: A data archive constructed from source data, whose structure and associated schemas can evolve based on the generated responses to user data requests. Based on the analysis of the responses, the schema and/or archive structure can be modified to provide greater knowledge, definition and operations available to be performed on the data, as well as to reduce the processing and storage costs associated with housing and accessing the data within the archive.

Abstract: There is disclosed in an example a computer-implemented method of providing automated log analysis, including: receiving a log stream comprising a plurality of transaction log entries, the log entries comprising a time stamp, a component identification (ID), and a name value pair identifying a transaction; creating an index comprising mapping a key ID to a name value pair of a log entry; and selecting from the index a key ID having a relatively large number of repetitions. There is also disclosed an apparatus and computer-readable medium for performing the method.

Abstract: Disclosed systems and methods store interaction data by user and date. A computing device receives a unique visitor interaction data representing a first interaction between an entity and a visitor. The computing device accesses a list of file set identifiers. Each file set identifier corresponds to a respective set of users grouped together into a file set. The computing device computes a target file set identifier and matches the target file set identifier to a file set identifier from the list that identifies a file set that stores user interaction data for the entity. The computing device routes the first visitor interaction data to the identified file set. The computing device stores the first visitor interaction data and the second visitor interaction data sorted according to the first timestamp and the second timestamp.

Abstract: A system for performing a hybrid in-memory faceted search for one or more digital objects, comprising: a media platform comprising one or more processors configured to: store an index for a data set generated using one or more indexing processes, wherein the index includes a mapping of values to identifiers for each digital object in the data set; receive an update for the index; store the index update with a timestamp independent from the stored index; and in response to a request for the stored index, apply the index updates to the index.

Abstract: A system and method is disclosed for using data blocks to optimize file storage in electronic data storage. An example method includes storing data objects in a storage service that correspond to a main block and multiple secondary blocks. The main block is stored in a first bucket and the secondary blocks are stored in one or more second buckets, with the main block including metadata indicating a unique identifier of the second bucket. The method further includes receiving a request to delete the data file to free storage; marking the main block of the data file for deletion that prevents a reading operation or a writing operation of additional data to the data file; deleting the secondary blocks of the data file; and after the secondary blocks are deleted, deleting the marked main block of the data file.

Abstract: A method and system for partitioning large objects for use by an application in a computing environment is described. The large object to be uploaded is analyzed in view of a desired partition size. The desired partition size may be selected by a customer system to generate a partition plan. The partition plan includes instructions identifying multiple partitions to be individually uploaded by respective execution modules. The system splits or partitions the original object into smaller, easier to manage partitions to be processed by the application running in the computing environment. The instructions defining the partitions are distributed to individual computing services for generating and uploading the partitions to the storage accessible by the application.

Abstract: The example embodiments are directed to a system and method for detecting phantom data items in a blockchain transaction. In an example, the method includes one or more of generating a transaction data set during a read phase of a blockchain transaction, the transaction data set including an identification of each query of the transaction executed during the read phase and results of each query, generating a validation data set by re-executing each query during a validation phase of the blockchain transaction, the validation data set including query results of each respective re-executed query, determining whether the blockchain transaction observes one or more phantom data items based on the query results of the transaction data set and the validation data set, and, in response to determining the transaction observes the one or more phantom data items, preventing the transaction data set from being written to the blockchain.