Abstract: Metadata of a root node from a serialized representation of a file system metadata tree data structure is obtained. A representation of the root node that references a stub intermediate node that is a placeholder for an intermediate node stored in the serialized representation is created. A request to access data of a leaf node in a tree path including the intermediate node is received. In response to the request, metadata of the intermediate node is obtained from serialized metadata representation.

Abstract: Systems and methods for pre-allocating and utilizing storage space in a relational database are provided. In embodiments a method includes: obtaining transaction data including data regarding record insertions in a relational database, wherein each record of the record insertions is associated with a key value; identifying a type of each of the record insertions as either a random insertion type or a key range insertion type based on the database transaction data, wherein the random insertion type comprises records associated with respective key values inserted in a random order, and the key range insert type comprises records associated with a range of key values inserted within a certain time period; predicting a new range of key values associated with future record insertions based on the type of each of the record insertions; and pre-allocating page space in one or more pages of the relational database for the future record insertions.

Abstract: A processing device receives a first query comprising a first field value and a first time period. The processing device performs a first search of a data store to identify a first plurality of events having the first time period and at least one field that comprises the first field value. The processing device generates a first search object comprising the first field value. The first search object may be a data structure, file or data record, and is stored in the data store. The processing device generates a search event comprising the first field value and a reference to the first search object. An event entry for the first search event is then written to the data store. Future searches may return both the first search event and other events, as well as search objects.

Abstract: A method includes executing an initial instance of a change log process for a distributed system, each instance of the change log process configured to store, on memory hardware in communication with the data processing hardware, a transaction history of transactions executed on the distributed system. The method also includes receiving transaction requests for executing corresponding transactions on the distributed system and determining a change log load based on the received transaction requests. The method includes executing at least one subsequent instance of the change log process when the change log load satisfied a threshold load. When multiple instances of the change log process are executing, the method includes ceasing execution of the at least one subsequent instance of the change log process and merging the transaction history of the initial instance of the change log process and the transaction history of the at least one subsequent instance of the change log process.

Abstract: Embodiments of the present invention train multiple Perception models to predict contextual metadata (tags) with respect to target content items. By extracting context from content items, and generating associations among the Perception models, individual Perceptions trigger one another based on the extracted context to generate a more robust set of contextual metadata. A Perception Identifier predicts core tags that make coarse distinctions among content items at relatively higher levels of abstraction, while also triggering other Perception models to predict additional perception tags at lower levels of abstraction. A Dense Classifier identifies sub-content items at various levels of abstraction, and facilitates the iterative generation of additional dense tags across integrated Perceptions.

Abstract: A method of electronic file format conversion and optimization includes requesting a second set of information following receipt of a first set of information used to transfer an electronic file on a website. The method includes receiving the second set of information from a first computing device associated with a first entity. The method includes receiving user input from a second computing device associated with a second entity that initiates transfer of the electronic file from the first computing device to the second computing device. In response to additional user input from the second computing device used to access the electronic file, the method includes accessing an additional set of information related to the electronic file and converting the electronic file to an optimized file based on the second information and the additional information. At least a version of the optimized file being formatted for display on the second computing device.

Abstract: There has been desired a technique for creating a table on a database without formulating an SQL statement. A control program for a controller includes a generation module configured to output an SQL statement for creating, on a database, a table in which collection target variables included in the control program are stored. The generation module determines an identification name, on the database, of each collection target variable, identifies, based on a correspondence between a data type usable in the control program and a data type usable in the database, a data type on the database corresponding to the data type of the collection target variable in the control program, and generates the SQL statement based on the determined identification name and the identified data type.

Abstract: Systems, components, devices, and methods for generating suggestions for content files are provided. A non-limiting example is a method for generating suggestions for arranging content. The method includes the step of receiving a content file from a client, the content file including a content region and a content element. The method also includes the step of analyzing the content file to select a blueprint for the content region. The method further includes the step of generating a suggestion for arranging the content region based on the selected blueprint. Additionally, the method includes the step of transmitting the suggestion to the client.

Abstract: A method for execution by a record processing and storage system includes receiving a plurality of records and corresponding row numbers. Pages are generated from the received records. Page metadata is generated for each page that includes row number span data based on row numbers of the records included in each page. Pairs of pages are identified in the plurality of pages based on having row number span data in their page metadata that include a row number span overlap. For each pair of pages, row number span data is updated for a first page in the pair by removing the row number span overlap with a second page in the pair. Reads of pages are performed based on their row number span data. Only records of each first page of each pair of pages having row numbers that are within the updated row number span data are read.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: As provided herein, a list of locales of interest in a location may be sorted into one or more categories. A user performing a search for a locale of interest (e.g., a restaurant) may be identified. A local score may be assigned to the locale of interest based upon a number of local users (e.g., users residing in the location) that perform the search. A second user may be determined to be near the locale of interest. A category of interest may be determined for the second user (e.g., an interest in local non-tourist restaurants). Responsive to the category of interest corresponding to the category and the local score of the locale of interest exceeding an interest threshold, the second user may be provided with a recommendation to go to the locale of interest. The locale of interest may be a local favorite restaurant rather than a tourist trap.

Abstract: Disclose herein are applications and platforms for streamlined production of charts and reports from databases containing time series datasets and/or timestamped data. The applications described herein may employ dynamically retrieve data from data centers to quickly provide options to the user. The platform further allows configuration of the charts and/or reports by providing lists of metrics that may be available in the selected data, and lists of transforms that may be applied to the data. The application may employ dynamic user interfaces, which provide processing of the received time series datasets in a data agnostic manner. As a result, the systems and methods described herein may allow generating charts and reports using a streamlined workflow.

Abstract: An indication of a first natural language utterance identifying a user request is received. A natural language query is generated based on the first natural language utterance. The natural language query comprises (i) a plurality of categories, and (ii) a plurality of variables. An indication of a second natural language utterance identifying a modification to the user request is received. Whether to modify the natural language query or to generate a new natural language query based on the second natural language utterance is determine. Responsive to determining that the natural language query is to be modified based on the second natural language utterance, at least one of the plurality of variables or the plurality of categories of the natural language query is modified to correspond to the second natural language utterance. A response to the user request is provided based on the modified natural language query.

Abstract: Radix trees and other trees use memory inefficiently when storing key-value associations with ‘or’ conditions. Their function can be optimized by using multiple key field trees, each corresponding to a key field, which is typically a character (or group thereof) in a string input key. The tree for the final key field has nodes with the output values, and these are annotated to identify, for each output value, the valid key field values from prior key fields. To execute a lookup, each key field tree is traversed to find a matching key field value. The final key field tree is traversed to reach one or more output values; then the previously determined key field values are compared against the valid key field values to determine if there is a match for a particular output value. The matched and valid key field values can be expressed in encoded form.

Abstract: A memory stores a first log and a collection of queries. A processor accesses a second log that includes a first, second, third and fourth historical query, determines that the first and second historical queries belong to a first similarity group and the third and fourth historical queries belong to a second similarity group, and ranks the queries within groups based on static and dynamic features. The processor further determines the third historical query is frequently submitted and copies the highest ranked similar queries into the collection. The processor receives a first database query, stores it in both logs, determines it is not similar to queries stored in memory, further determines that it belongs to the first similarity group, copies the highest ranked similar queries to the first log, and returns a report containing the similar queries. The processor further receives and executes a second query selected from the report.

Abstract: Implementations of the present application provide a partition splitting method. Data files in a target source partition are divided into at least two data groups. A first data group from the at least two data groups is selected as a target splitting data group. A first splitting step is performed on the target splitting data group, including: splitting the target splitting data group into a plurality of data sub-groups based on a predetermined splitting rule, wherein each data sub-group of the plurality of data sub-groups corresponds to a new partition of at least two new partitions for the target source partition, and assigning each data sub-group to the new partition corresponding to the data sub-group. A second data group from the at least two data groups is selected as the target splitting data group, wherein the second data group is different from the first data group.

Abstract: System and method for processing time-related geospatial data from one or more data sources. For example, a system includes an application server; and a storage. The application server is configured to: receive data including temporal information and geospatial information for each data object of one or more data objects, send the data to a client device to display the data on a map, and generate one or more first multi-dimensional tiles based at least in part on the temporal information and the geospatial information. The one or more first multi-dimensional tiles correspond to a temporal dimension associated with a first temporal width. The application server is further configured to send the one or more first multi-dimensional tiles to store in the storage for retrieval by the client device.

Abstract: The disclosed system and method acquire and store performance measurements relating to performance of a component in an information technology (IT) environment and log data produced by the IT environment, in association with corresponding time stamps. The disclosed system and method correlate at least one of the performance measurements with at least one of the portions of log data.

Abstract: Cloning enterprise content management systems is described. A first remote procedure call is executed to a source database management system associated with a source enterprise content management system to retrieve a source object type from the source enterprise content management system. A second remote procedure call is executed to a target database management system associated with a target enterprise content management system to create a target object type in the target enterprise content management system, wherein the target object type is based on the source object type. Source metadata tables associated with the source object type are retrieved from the source enterprise content management system. The source metadata tables are stored as target metadata tables in the target enterprise content management system.

Abstract: A method for determining an intervention response category for provisioning workflows. The method determines provisioning features of a provisioning step. The method performs outlier detection to identify and remove outliers from non-intervention data to produce a non-intervention normal data set. The method performs iterative grouping on the non-intervention normal data set to determine significant variables in the provisioning features. The method performs response mapping of provisions using results of the iterative grouping including a significance of errors and a presence of errors in the non-intervention normal data and partial intervention data to categorize the provisions into a response category.