Abstract: Method and system to extract domain concepts to create domain dictionaries and ontologies comprises collecting a plurality of reference papers and further classifying the collected plurality of reference papers as relevant and irrelevant. Each of the ‘relevant’ reference papers is further processed by the system, during which the system identifies relevant sections from each document and further processes data in the relevant sections to extract required information and also to identify a relationship between different extracted information, which is further used to create domain dictionaries and ontologies.

Abstract: The present technology pertains to a organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

Abstract: The described technology is generally directed towards improving indexes and queries for files by indexing file directories. According to an embodiment, a system can comprise a memory and a processor that can execute the components stored in the memory. The components can comprise a data interface to couple to a database system comprising a database storing metadata describing a file system, wherein the database comprises records that correspond to ones of directories of the file system, and wherein the records comprise a field that corresponds to files logically stored in the directories of the file system. The system can further comprise an indexing component that creates an index for the records based on an index key and an analysis of the ones of the files and the directories to which the records correspond, wherein the index comprises links between instances of the index key and ones of the directories.

Abstract: In some instances, a method for ingesting data files is provided. The method comprises: obtaining, by an ingestion system associated with a distributed file system, a data file from an external data source; determining, by the ingestion system, a plurality of processing threads within the ingestion system to use to process the data file; determining, by the ingestion system, one or more offsets within the data file based on the plurality of determined processing threads; and ingesting, by the ingestion system, the data file by having each of the plurality of processing threads begin processing the data file at a plurality of different locations within the data file, wherein the plurality of different locations are associated with the one or more offsets.

Abstract: A data migration system 10 includes: a management server 20 configured to obtain transaction information from a distributed ledger at a data migration source, and transmit a migration transaction to a distributed ledger node at a data migration destination, the migration transaction specifying a transaction ID indicated by the transaction information obtained; and the distributed ledger node 100 configured to receive the migration transaction, obtain transaction information in the distributed ledger at the data migration source based on the transaction ID, extract data on a predetermined processing result from the transaction information obtained, execute a transaction using the extracted data as an argument, and transmit a result of the executed transaction to a transaction distribution node 300 at the data migration destination.

Abstract: Aspects of the present disclosure relate to managing concurrent updates on data. A transactional update on at least one record within a data set is detected. A log is generated for the transactional update, the log including an image of the at least one record within the data set before the transactional update. A batch update is detected. A determination is made whether the batch update collides with the transactional update by referencing the log. In response to determining that the batch update collides with the transactional update, a collision policy is referenced. A collision action indicated in the collision policy is then issued.

Abstract: Systems and methods for scanning signatures in a string field. In one implementation, the invention provides a method for signature scanning. The method includes receiving a particular string field, scanning the particular string field for a plurality of signatures using a larger scan step size, scanning the particular string field for the remaining signatures that are shorter than what can be scanned by the larger scan step size separately either using the same scanning method but a smaller scan step size or using a different scan method and the same or a smaller scan step size, and outputting any identified signatures in the particular string field.

Abstract: Performing quantum file concatenation is disclosed herein. In one example, a quantum file manager receives a request to concatenate a first quantum file comprising a first plurality of qubits and a second quantum file comprising a second plurality of qubits. Responsive to receiving the request, the quantum file manager concatenates the first quantum file and the second quantum file into a concatenated quantum file comprising a third plurality of qubits, wherein the third plurality of qubits comprises a same number of qubits as a union of the first plurality of qubits and the second plurality of qubits, and stores an identical sequence of data values as the first plurality of qubits followed by the second plurality of qubits.

Abstract: A computer-implemented method for extracting semantic relations is disclosed. In the method, a plurality of hierarchal structures that originates from a corpus of documents is obtained. Each hierarchal structure includes a plurality of elements having respective recitations included in a corresponding document. In the method, for each predetermined relationship between ancestor and descendant elements in the hierarchal structures, a first keyword list is extracted from the ancestor element and a second keyword list is extracted from the descendant element. A statistical index is calculated for each pair of first and second keywords using the first keyword lists and the second keyword lists. The index indicates a strength of association between the first and second keywords. In the method, a candidate list of keyword pairs having semantic relationships is output using the statistical index calculated for each pair.

Abstract: Provided are a data archiving method and apparatus capable of providing a remote near-line data archiving function by receiving remote function invoking from a target system in which data is stored, providing the target system with a first function for archiving, in a storage system, at least some of the data stored in the target system over a network in response to the remote function invoking, and providing the target system with a second function for the query of the data archived in the storage system over the network.

Abstract: A system and method includes using a queue with reduce operations. A method can include, responsive to generation of one or more markers by a first node or a second node, causing a submission of one or more markers to a queue associated with a computing cluster. Additionally, responsive to a determination that the first node has completed a first reduce operation, directing the first node to perform a first copy operation to copy first data identified by a first marker of the one or more markers in the queue, where the first copy operation is performed concurrently with the second reduce operation.

Abstract: A computer-implemented method improves the performance of write ahead logging. The method includes generating a set of query data and a set of log data, where the set of log data is configured to create a write ahead log, and the set of query data is configured to make changes to data in a database. The method also includes writing the set of query data to a virtual file system. The method further includes separating the set of log data into a set of control intervals, where each control interval includes an entry. The method includes writing, each entry into a log buffer, where the writing the set of query data to the virtual file system and the writing each entry into the log buffer are performed in parallel. The method also includes combining each entry into a complete log.

Abstract: The present disclosure relates to computer-implemented methods, software, and systems for database persistency. A first data request is received at a first instance of an application. The application is associated with multiple instances that share the database layer. In response to determining that the database is available for accessing after receiving the first request, the database is identified as a primary storage for the application, the data is written in the database and at an in-memory persistence storage of the first instance of the application. In response to determining that the database has become unavailable after identifying the database layer as the primary storage, the in-memory persistence storage is configured as the primary storage for the first instance of the application. A second request received at the first instance of the application is routed to the in-memory persistence storage while the in-memory persistence storage is configured as the primary storage.

Abstract: In some examples, a database management node updates object metadata with indicators of access frequencies of a plurality of objects in a data store that is remotely accessible by the database management node over a network. The database management node selects a subset of the plurality of objects based on the indicators, and caches the subset in the local storage.

Abstract: A method, system and computer-usable medium for detecting headers in various documents, such as PDF and HTML files. The files are converted to a two dimensional array or table, having orthogonal rows and columns. Either rows or columns are determined to include headers. For determining if rows include headers. For each row in the array or table, pair wise comparison is performed for each cell of each column that is orthogonal to that row. The pair wise comparison scores or values are summed up for each orthogonal column to that row and the sum across for all the orthogonal columns to row provide a score or value for that row. Row scores are evaluated relative to one another to determine likelihood of headers in the row. For determining if columns have headers, similar calculation is performed between columns and their orthogonal rows.

Abstract: Input records are obtained based on a request to process an application. References to the input records are stored as entries in a queue. A total thread number for threads and a total server number for servers are determined. The threads are initiated on the servers and are asynchronously processed in parallel on the servers. Each thread obtains a reference from a unique entry of the queue, marks that entry as being addressed, processes the input record corresponding to the entry using values provided with a request to process the application, stores results associated with processing the input record in a data store, and iterates back to obtain a next unique entry from the queue until every entry of the queue is marked as having been addressed. When every entry of the queue is marked, a reference is returned to the data store as application results for processing the application.

Abstract: Techniques for processing composite commands in a file system are disclosed. A file system receives a composite command that includes an argument. The file system parses the argument and encounters a particular flag indicating that the argument includes an additional command. The file system executes the additional command using an application programming interface (API).

Abstract: Embodiments of the present disclosure relate to systems and methods for executing queries on a database platform. A processing device may execute a first operator in a query plan to process a set of data and generate an intermediate result of a query. the intermediate result of the first operator may be pushed, during execution of the query plan, to a plurality of secondary operators as the intermediate result is generated. Each of the plurality of secondary operators may be initiated to concurrently process the intermediate result to generate a plurality of second results, and a timing of processing of the intermediate result by one or more of the plurality of secondary operators is adjusted to coordinate the generation of the plurality of second results. The processor may execute the final operation on the plurality of second results to generate a final result.

Abstract: A set of conversations taking place by users within a geographic location are identified. Keywords for a conversation under analysis, in that geographic location, are identified based on a frequency with which terms are used in the conversation under analysis and in the related conversations. The keywords are automatically added as searchable terms corresponding to the conversation under analysis, and a communication system is controlled to notify client components of the keywords.

Abstract: Embodiments described herein are related to a method of scanning a B-tree. For example, a method comprises receiving a scan request to scan a B-tree having a plurality of levels, each level comprising one or more nodes, wherein for each of one or more levels of the plurality of levels, nodes are grouped into groups, where nodes of any given group are stored across sequential disk blocks. The method further comprises generating a queue for each level of the B-tree. For each queue, the method further comprises loading into memory a next group of nodes based upon determining a storage location of a node of the next group of nodes.