Abstract: One example method includes creating a source FS Merkle tree having a structure that matches a topology of a source FS, and a target FS Merkle tree having a structure that matches a topology of a target FS, receiving a change to the source FS, implementing the change in the source FS, updating the source FS Merkle tree to reflect the change, replicating the change to the target FS so that, with respect to the change, the target FS is synchronized with the source FS, updating the target FS Merkle tree to reflect the change to the target FS, and comparing the source FS Merkle tree to the target FS Merkle tree.

Abstract: A method is provided that includes establishing, by an application server, a remote access session with a client device, and creating, by a file system agent running on the application server, a metadata-only virtual file system associated with the remote access session, wherein the virtual file system only comprises file metadata associated with a plurality of files residing in a local file system of the client device. The method further includes responsive to receiving, by the virtual file system, a request to access content of a file referenced by the virtual file system, redirecting the request to a file system driver implementing at least a sub-tree of the local file system of the client device.

Abstract: One example method includes creating a source FS Merkle tree having a structure that matches a topology of a source FS, and a target FS Merkle tree having a structure that matches a topology of a target FS, receiving a change to the source FS, implementing the change in the source FS, updating the source FS Merkle tree to reflect the change, replicating the change to the target FS so that, with respect to the change, the target FS is synchronized with the source FS, updating the target FS Merkle tree to reflect the change to the target FS, and comparing the source FS Merkle tree to the target FS Merkle tree.

Abstract: A computer system stores a database model of an object based on a plurality of updates to the object. Each update indicates a bound status of the update, a transaction date of the update, an effective date of the update, and a value of an attribute in the update. The computer system forms a view model of the object based on the database model of the object by reconstructing values of the attributes of the object from the plurality of updates with immutable bound statuses.

Abstract: A system, that when operated, creates an index for a database arrangement, wherein the system includes a support server and an indexing server communicably coupled to the database arrangement, wherein the support server: receives a document, metadata pertaining to the document, and a document identifier associated with the document; extracts keywords from the document and store the keywords in a meta-document; stores the document identifier corresponding to the metadata in the database arrangement; and provides, to the indexing server, the meta-document and the document identifier; and wherein the indexing server: receives the meta-document and the document identifier from the support server; extracts keywords from the meta-document; and creates the index, wherein the index includes document identifier listed corresponding to the extracted keywords.

Abstract: The source code of a smart contract defines a schema with a map name, a key-tuple, and a value-tuple. The key-tuple can be populated with a value associated with a native field name that is associated with the principal that created a transaction.

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: A system and method for accelerating relational functions between tables. The method includes: determining a plurality of first index values for a plurality of first unique keys in a first column of a first table; determining a plurality of second index values for a plurality of second unique keys in a second column of a second table; generating a hashed third table based on the first column of the first table and the plurality of first index values; generating a hashed fourth table based on the second column of the first table and the plurality of first index values; and generating a fifth table by performing a JOIN operation between the third table and the fourth table based on at least one third column, wherein each of third column includes a plurality of third unique keys that are common between the third table and the fourth table.

Abstract: An apparatus and method of performing a time-based operation on a row in a database table includes receiving a function to be applied to a particular row in a table within the database management system. The method may also include, in response to receiving the function, adding a new column to the table. A new cell in the new column includes a timer indicating a time that the processing device will call the function, and the new cell references the function. The method may also include, upon expiration of the timer, determining that the database management system is available for execution of the function, and executing the function on the particular row in the table.

Abstract: Various embodiments are generally directed to techniques for crowdsourcing metadata, such as to create, maintain, utilize, and/or communicate metadata in a datastore. Some embodiments are particularly directed to collecting, managing, and/or distributing metadata via a user interface application (UIA), or an extension thereof. Many embodiments may facilitate collaborative creation of a repository for metadata, such as notes, characteristics, and/or statistics corresponding to data viewed with the user interface application. For example, the comments regarding websites may be collected from a first user via a first instantiation of the web browser extension and distributed to a second user via a second instantiation of the web browser extension. In several embodiments, the metadata may be collected and managed with instantiations of the web browser extension (herein after “WBE instants”) and a data manager may create, maintain, utilize, and/or communicate metadata in a datastore.

Abstract: A system and a method for parsing a user query. The system includes a database arrangement operable to store an ontology; and a processing module communicably coupled to the database arrangement. The processing module operable to receive the user query; refine the user query to obtain a search query using an algorithm; generate a plurality of strings for the obtained search query; sort the plurality of strings in a decreasing order of length of the plurality of strings; assign a part-of-speech tag to each of the query segments of the plurality of strings based on the ontology; identify at least one of the query segments as at least one output class or at least one input class based on the assigned part-of-speech tags; and establish semantic associations between the query segments based on the ontology to obtain the parsed user query.

Abstract: A system for processing database data includes an interface and a processor. The interface is configured to receive a query for the database data comprising a date range and a data selection criterion. The processor is configured to determine a set of fields of the database data corresponding to a most recent date of the date range; determine a subset of the set of fields of the database data specified by the data selection criterion; determine a set of transformations, where each transformation of the set of transformations corresponds to a field of the subset and a sub-range of the date range; transform the database data to determine transformed database data using the set of transformations; and select data from the transformed database data using the data selection criterion to determine a query response.

Abstract: The subject matter of this specification generally relates to preventing the distribution of forbidden network content. In one aspect, a system includes a front-end server that receives content for distribution over a data communication network. The back-end server identifies, in the query log, a set of received queries for which a given forbidden term was used to identify a search result in response to the received query even though the given forbidden term was not included in queries included in the set of received queries. The back-end server classifies, as variants of the given forbidden term, a term from one or more queries in the set of received queries that caused a search engine to use the given forbidden term to identify one or more search results in response to the one or more queries and prevents distribution of content that includes a variant.

Abstract: A method, a system, and a computer program product for querying graph data. A graph workspace object is identified. One or more parameters for executing a declarative language query are identified. Using the identified parameters, the declarative language query is executed on the identified graph workspace object. Based on the executed declarative language query, one or more tables responsive to a request to access graph data stored in a relational database are processed.

Abstract: A system that provides recommendations of documents to a user, the system including a server arrangement, and a database arrangement that stores documents, wherein the server arrangement: receives identification details of the user, obtains prior work associated with the user, determines a user classification of the user based on: the identification details of the user, the prior work associated with the user, and an activity data of the user, determines a document classification for the documents based on a metainformation pertaining to the documents, determines a relevance factor for the documents with respect to the user based on the document classification of the documents, the user classification of the user, and activity data relating to the documents of a plurality of users with similar user classification as the user, and provides recommendations of documents to the user based on relevance factors of the documents.

Abstract: An apparatus includes processing circuitry and a memory storing instructions that, when executed by the processing circuitry, cause the apparatus to identify a plurality of components and a data flow that interconnects the plurality of components. The instructions cause the apparatus to determine a lineage of a record generated by the plurality of components based on the data flow. The lineage indicates the data flow from a first component to a second component of the plurality of components to generate the record. The instructions cause the apparatus to present, to a user, a visual depiction of the lineage of the record. The visual depiction indicates the data flow of a query through at least the first component and the second component of the plurality of the components to generate the record.

Abstract: A computer-implemented method, system and computer program product for visualizing sparse multi-dimensional data. A multi-dimensional dataset (“dataset”) is converted into a three-dimensional architecture and the remaining dimensions, if any, are arranged into one or more planes. The sparse numeric data of the dataset is converted into multiple planes based on partitioning the three-dimensional architecture by the most sparse dimension and aligning the remaining two-dimensions as two-dimensional planes. Colors or shades of colors are assigned to these planes based on the density quantum of the data present in the planes. Furthermore, planes of the dataset are constructed using the assigned colors or shades of color and the defined opacity values of the planes. The constructed planes are mapped to the dataset in the form of a cube(s) and possibly two-dimensional planes, where the darkest color and the least translucent section(s) of the dataset are positioned in the center of the cube(s).

Abstract: The described technology is generally directed towards validating content selection graphs for use in an in-memory content selection graph data store. When a content selection graph data is generated, the graph nodes can correspond to prebuilt response data. The response data for any of the nodes can be verified against rules based on the type of a node, for example, as well as based on client-specific information for types of clients. The overall validation process can validate the content selection graph for subsequent use, can result in errors or warnings being logged (which may or may not render the graph unusable, e.g., depending on severity), or can fail the content selection graph. If validated, the content selection graph can be used to rapidly return response data when content from the graph is requested.

Abstract: A predictive cache system learns data access patterns to build a graph of related data items. A main cache hosted by a cache server is accessed by a cache client having a local cache. A request to the cache server for one of the related data items generates a response including some or all of the related data items, which are stored in the local cache and can be served locally for subsequent requests. Predictive cache behavior coexists with legacy non-predictive cache operation. Load on the cache server and aggregate latency are considerably reduced. Graphs can be specific to a particular context. Locally cached content can be distributed and reused by other cache clients. The predictive cache system is suitable for large-scale web applications. Variations are described.

Abstract: The present disclosure relates to a method for processing data of a database system, the database system being configured to connect to a centralized cache shared with other database systems. The method includes determining a unique identifier of the content of a table of the database system using a common identification method of the database systems. A database command may be generated for processing data of the table. The command references the identifier. It may be determined if the cache comprises results of a same command with the same identifier. The command may be processed at the database system or the results of the command may be retrieved from the cache depending on whether the cache comprises the results.