Abstract: Computerized systems for detecting and modifying routing of an electronic file are A provided for one or more databases. The systems receive and parse electronic files to detect one or more keys in the electronic files that are indicative of potential routing destinations associated with the one or more detected keys. A determination is then made of one or more corresponding and likely routing destinations for the electronic files, from a set of potential routing destinations, specifically based on the one or more keys and/or other user input reflective of a desired destination. The systems further identify one or more changes (based on historical data, user input, destination storage attributes, key attributes and/or other data), which are operable, when/if made to the electronic file, to trigger a different set of one or more corresponding routing destinations for the electronic file.

Abstract: Systems and methods for ranking a feed in a social network. The systems and methods include operations for displaying a feed includes identifying a group of users associated with a first user, identifying a plurality of content generated by one or more of the group of users, determining one or more actions that may result when each of the plurality of content is presented to the first user, ranking the content based on the one or more determined actions, and displaying the content to the first user according to the ranking.

Abstract: Exemplary systems, methods, and apparatuses implement a declarative and metadata driven blockchain platform using Distributed Ledger Technology (DLT) in conjunction with a cloud based computing environment. The exemplary system operates a blockchain interface to the blockchain; receives inputs declaring a new application, network participants for the new application, access rights to the new application, as well as entity types and field definitions for the new application. The system further generates a blockchain asset having encoded therein as the defined metadata for the new application, at least (i) the plurality of network participants declared, (ii) the plurality of entity types declared, and (iii) the one or more new field definitions declared for each of the plurality of entity types; and transacts the blockchain asset having onto the blockchain.

Abstract: Exemplary systems, methods, and apparatuses implement a declarative, metadata driven, cryptographically verifiable multi-network (multi-tenant) shared ledger in conjunction with a cloud based computing environment.

Abstract: Systems, methods, and apparatuses for implementing an SQL query and filter mechanism for blockchain stored data using Distributed Ledger Technology (DLT) in conjunction with a cloud based computing environment include operating a blockchain interface to the blockchain on behalf of a plurality of tenants of the host organization, in which each one of the plurality of tenants operate as a participating node with access to the blockchain. The system receives input for adding a plurality of authorized network participants to a declared application, updates a blockchain asset on the blockchain containing metadata for the declared application, deploys an executable install package to each of the plurality of authorized network participants for the declared application, retrieves the metadata for the declared application from the blockchain, and displays GUIs specific to the declared application which are auto generated by the executable install package based on the retrieved metadata.

Abstract: A method and a system process a stream of data in parallel across a plurality of nodes. The log processing system has a log module, a query language module, and a query processing module. The log module receives and organizes the stream of data into a sequential and nested data structure. The query language operator module defines operators that operate on the sequential and nested data structure. The query processing module processes in parallel across a plurality of nodes a query based on an operator on the stream of data.

Abstract: Configuration input for creating a new data privacy profile may be received via a graphical user interface. The configuration input may include account information specifying a plurality of web-accessible accounts. Profile data may be retrieved from the accounts by authenticating with the accounts and populating retrieved user profile data into a newly generated data privacy profile stored at a host organization. A unique SOLID compliant tag may be issued to the user, associated with the data privacy profile, and recorded on a public blockchain. One or more private portions of the data privacy profile may remain inaccessible to requestors.

Abstract: Systems, methods, and computer-readable media for providing entity relation extraction across sentences in a document using distant supervision are disclosed. A computing device can receive an input, such as a document comprising a plurality of sentences. The computing device can identify syntactic and/or semantic links between words in a sentence and/or between words in different sentences, and extract relationships between entities throughout the document. A knowledge base (e.g., a table, chart, database etc.) of entity relations based on the extracted relationships can be populated. An output of the populated knowledge base can be used by a classifier to identify additional relationships between entities in various documents. Machine learning can be applied to train the classifier to predict relations between entities. The classifier can be trained using known entity relations, syntactic links and/or semantic links.

Abstract: Systems and methods for very fast grouping of “similar” SQL queries according to user-supplied similarity criteria. The user-supplied similarity criteria include a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, the user can adjust the degree of similarity by supplying new similarity criteria. Accordingly, the system can display in real time or near real time, updated SQL groupings corresponding to the newly supplied similarity criteria using the originally computed similarity-characterizing data structure.

Abstract: A query segmentation system segments a search query into a query segment that identifies search results from items stored on a database. The query segmentation system receives a query string, and the query string comprises a plurality of tokens. A first token and a second token are identified from the plurality of tokens, and a first vector and a second vector associated with the first token and the second token respectively are determined. The query segmentation system determines whether to include the first and second tokens in a single query segment based on the first and second vectors. The single query segment is processed to identify the search results from the database.

Abstract: Planning granularities can be stored for data elements including a first granularity for a first data combination, the first data combination including a combination of multiple dimensions of data. A comparison metric can be calculated between planned data at the first granularity for the first data combination and actual data observed for the first data combination, wherein the observed data is stored at a different granularity than the planned data. Based on the calculated comparison, the planning granularity for the first data combination can be adjusted from the first granularity to a second granularity. A selection of a cross-section of data spanning multiple dimensions can be received, the selection including the first data combination, wherein a user interface is configured to display data for the first data element at the second granularity based on the adjusting.

Abstract: A system and method for tailoring container images stored in a container image registry to a specific microarchitecture that a host operating system is running on in a virtualized environment. A container image fetch request is sent to the container image registry. Microarchitecture identification instructions are received from the image registry in response to the container image fetch request. Results from the microarchitecture identification instructions are transmitted to the container image registry to identify the specific microarchitecture that the host operating system is running on in the virtualized environment, and a container within the virtualized environment is started using an optimal container image received from the container image registry, the optimal container image being tailored to the specific microarchitecture to leverage the functionalities and capabilities of the specific microarchitecture of the computing system.

Abstract: During a query compilation process, a query is received that is directed to a set of source tables, each source table from the set of source tables being organized into at least one micro-partition and the query including at least one pruning operation. During the query compilation process, a modification of the query is performed for adjusting the at least one pruning operation, the modification being based on a set of statistics collected for previous pruning operations on at least a portion of the set of source tables and a set of heuristics, the set of statistics indicating at least an amount of execution time for each previous query associated with each of the previous pruning operations. The query is compiled including the modification of the query. The compiled query is provided to an execution node of a database system for execution.

Abstract: A system is configured for automatic recognition of data store architecture and tracking dynamic changes and evolution in data store architecture. The system ef is a complementary system, which can be added onto an existing data store system using the existing interfaces or can be integrated with a data store system. The system comprises three main components that are configured to compose an approximation of the data store architecture. The first of these components is adapted to execute an analysis of the architecture of the data store; the second of the components is adapted to collect and compile statistics from said data store; and the third of the components is adapted to compose an approximation of the architecture of said data store.

Abstract: The electronic device includes a display, a memory, and a processor operatively coupled to the display and the memory. The processor is configured to identify a residual level of a storage space of the memory, in response to the residual level of the storage space of the memory being less than a predefined threshold value, control the display to display a file converting scheme list including a plurality of file converting schemes, select one file converting scheme among the plurality of file converting schemes, based on a received input, and perform file converting, based on the selected file converting scheme.

Abstract: An embodiment relates to a computer-implemented data processing system and method for storing a data set at a plurality of data centers. The data centers and hosts within the data centers may, for example, be organized according to a multi-tiered ring arrangement. A hashing arrangement may be used to implement the ring arrangement to select the data centers and hosts where the writing and reading of the data sets occurs. Version histories may also be written and read at the hosts and may be used to evaluate causal relationships between the data sets after the reading occurs.

Abstract: A device includes a memory that stores a prefetching model. A control module receives a content page including one or more links each associated with selectable content and collects data associated with the content page. The collected data includes at least one of first data indicative of respective relationships between each of the links and a viewport of the device and second data indicative of characteristics of the viewport. The control module further assigns, using the prefetching model, respective scores to each of the links based on the collected data, and selectively generates, based on the assigned scores, a request to prefetch the selectable content associated with at least one of the links.

Abstract: A method for file system reorganization in the presence of inline compression includes obtaining a virtual block pointer for an original compressed segment to be reorganized, the original compressed segment comprising compressed allocation units of data stored in a storage system, wherein the virtual block pointer comprises an extent list identifying the compressed allocation units in the original compressed segment and a pointer to where the original compressed segment is stored; copying only the referenced compressed allocation units in the original compressed segment to a new compressed segment in a substantially contiguous manner; updating the extent list to identify the referenced compressed allocation units in the new compressed segment, and the pointer to where the new compressed segment is stored; and freeing the original compressed segment.

Abstract: A data processing system may store a data set at a plurality of data centers. The data centers and hosts within the data centers may, for example, be organized according to a multi-tiered ring arrangement. A hashing arrangement may be used to implement the ring arrangement to select the data centers and hosts where the writing and reading of the data sets occurs. Version histories may also be written and read a the hosts and may be used to evaluate causal relationships between the data sets after the reading occurs.

Abstract: Methods and systems for implementing a custom query of a media universe database. A plurality of content items are generated based at least in part on a media universe database. The media universe database is configured to store a plurality of elements of media universe content related to a media universe. The content items are sent to a client. From the client is received input indicating a combination of the content items. The combination comprises a selection of two or more of the content items. The media universe database is queried for additional content relevant to the two or more of the content items in the combination. The additional content is sent to the client.