Abstract: Facilitating exclusive local locks on a distributed file system is provided herein. An embodiment relates to a node device of a cluster of node devices. The node device can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations can comprise determining at least one resource is to be removed from a cache of the node device. The operations also can comprise implementing an exclusive local lock over a defined lock. The defined lock can indicate interest in the at least one resource by other node devices of the cluster of node devices other than the node device. Further, the operations can comprise removing the at least one resource from the cache. The other node devices are not notified of the removing.

Abstract: A bottom-up hierarchical computer network architecture is provided. The architecture may include a central server. The architecture may also include a plurality of edge nodes that may be coupled to the central server. At least a first one of the edge nodes may be configured to process a transaction, compile data associated with the transaction, and store the data as a master dataset in the first edge node. The architecture may also include a data administration module. The data administration module may be configured to compare the master dataset in the first edge node to transactional data in the central server. When the transactional data in the central server is inconsistent with the master dataset in the first edge node, the data administration module may be configured to update the transactional data in the central server to be consistent with the master dataset in the first edge node.

Abstract: A device searches a file being recorded that includes lines sorted in accordance with keys included in the lines to find a line that matches a pattern. When the device receives a pattern, it initializes upper and lower limits of a search range and calculates a middle position between the limits. It acquires, from the file, a middle line that starts at or before the middle position and ends after it. If the key included in the middle line matches the pattern, it outputs the middle line and re-sets the upper or lower limit based on whether the key included in the middle line is greater or less than the pattern and, if there is a distance greater than a length of a newline between the limits, repeats the procedure starting from the middle position. Otherwise, it outputs a result to the effect that no matching line has been found.

Abstract: A determination is made that a database system is resource bound resulting in a resource bound condition. Signals for the resources being bound in the database system are identified. Events associated with the signals are extracted. Events are correlated temporally to identify a time interval for which an arrival rate meter (ARM) is helpful. Database system segments are selected that effect key performance indicators associated with the identified time interval. Parameters for the selected database system segments to be deferred by the database system are estimated. The estimated parameters are incorporated into an arrival rate meter (ARM). The ARM is put into effect.

Abstract: Presented herein are methods of replicating versioned and hierarchical data structures, as well as data structures representing complex transactions. Due to interdependencies between data entities and a lack of guaranteed message ordering, simple replication methods employed for simple data types cannot be used. Operations on data structures exhibit dependencies between the messages making up the operations. This strategy can be extended to various types of complex transactions by considering certain messages to depend on other messages or on the existence of other entries at the data store. Regardless of origin, these dependencies can be enforced by suspending the processing of messages with unsatisfied dependencies until all of its dependencies have been met. Alternately, transactions can be committed immediately, creating entities that include versioned identifiers for each of their dependencies. These entities can then be garbage collected of the parent objects are not subsequently created.

Abstract: Example distributed storage systems, delete managers, and methods provide for managing dependent delete operations among data stores. Dependent data operation entries and corresponding dependency sets may be identified in an operations log. Dependent data operations may be identified in each shard and data operation entries. A delete process for the data objects in the dependency set may be delayed until the delete process for the dependent data object completes.

Abstract: Disclosed herein are embodiments of systems and methods for selecting partitions for reclustering based on distribution of overlapping partitions. In an example, a database platform makes a determination to at least partially recluster a database table that includes data stored across a plurality of partitions. The database platform responsively selects a subset of the partitions. The selecting of the subset includes identifying a point on a domain of a clustering key that corresponds to a local maximum of overlapping partitions, and also includes selecting the subset from among a group of overlapping partitions. The group includes at least one partition that overlaps the identified point on the domain of the clustering key. Each partition in the selected subset is above a reduction goal of overlapping partitions. The database platform at least partially reclusters the selected subset based on the clustering key.

Abstract: A computer system updates a knowledge graph. A model corresponding to a set of documents is received, wherein the model comprises a plurality of entities, a plurality of entity associations, and a plurality of confidence scores corresponding to the plurality of entity associations. A relevance value is calculated for each entity of the plurality of entities that are present in the set of documents and for each entity of the plurality of entities that are present in a new document. One or more entity associations that are supported by specific portions of the new document are identified. The confidence scores for each of the identified one or more entity associations are updated based on a level of support in the new document. Embodiments of the present invention further include a method and program product for updating a knowledge graph in substantially the same manner described above.

Abstract: A system, method and computer program product for archiving image, audio, and text data with metadata encapsulation in a client-server storage library is described. The server receives and holds the images, audio, or text to be archived in an image, audio or text logical partition which includes a directory of the images, audio, or text. The information is encapsulated in a metadata wrapper and stored in the library as a closed image, audio, or text file along with a closed copy of the directory. The closed image, audio, or text directory is also stored in the client. The images may be encapsulated in MXF, DICOM, Tape Archive (TAR) or GZIP formats. The storage library may have magnetic tapes, magnetic disks or optical disks as storage media.

Abstract: Modifying a recipe for food based on a geographic origin of produce in the recipe is disclosed. A recipe is identified by a data processing system for a food dish, produce procured for the recipe from source(s), and determines a geographic origin where the produce was grown and an estimated transport time of the produce from the geographic origin to the source(s). A data processing system analyzes the recipe against ingredient(s) available to the user and aspect(s) of the produce, resulting in analysis result(s), modifies the recipe, resulting in a modified recipe based on the geographic origin, the transport time (may be estimated) and the analysis result(s), and makes available to the user the modified recipe.

Abstract: A search engine optimizer, which works independently and in parallel with a browser and search engine supercomputer to gather, analyze, and distill input information interactively. The optimizer reorganizes the input, and providing an optimized version as an output. The optimized version of the input (e.g. output) is sent to the search engine, which responds to the end user with search results. The optimizer recognizes each request as a pattern and stores the pattern in an advanced Glyph format. This permits the optimizer to identify a left and ride side check mate combination required to achieve certitude.

Abstract: An information providing device, an information providing method, and a program capable of assisting in creating user's inspiration and improving efficiency in creating inspiration are provided. The information providing device is an information providing device displaying first data extracted from a first data group and second data extracted from a second data group in combination, and includes: a first memory unit storing a data group classified under a genre as the first data group; and a second memory unit storing a data group related to the genre of the first data group as the second data group.

Abstract: Disclosed herein are systems and methods for incremental reclustering of database tables based on local maxima of partition overlap. In an embodiment, a database platform makes a determination, based on one or more incremental-reclustering criteria, to incrementally recluster a database table, which has a clustering key and which is stored across a plurality of partitions. In response to making the determination, the database platform selects a subset of the partitions, and at least incrementally reclusters the selected subset. The selecting of the subset includes identifying a local maximum of a quantity of overlapping partitions in the plurality of partitions with respect to a domain of the clustering key of the table, where the overlapping partitions overlap with respect to the clustering key.

Abstract: Techniques for data migration from a local computing device to a storage associated with a storage provider are provided. Prior to initiating data migration from a local computing device to the storage, analysis of files and/or data for migration is performed to determine if a migration exclusion criterion exists in relation to files and/or data for migration. Migration may be allowed for the files and/or data in the absence of a determination that the migration exclusion criterion applies to the files and/data for migration to the storage.

Abstract: In one embodiment, a method includes receiving a sharing request to share content generated during a current dialog session from a client system associated with a first user, identifying one or more content objects associated with the sharing request based on a natural-language understanding module, wherein the one or more content objects were previously generated during the current dialog session, determining one or more second users the sharing request is directed to based on a user profile associated with first user, and sending instructions for accessing one or more of the identified content objects to one or more client systems associated with the one or more second users.

Abstract: The subject technology determines whether a table is sufficiently clustered. The subject technology in response to determining the table is not sufficiently clustered, selects one or more micro-partitions of the table to be reclustered. The subject technology constructs a data structure for the table. The subject technology extracts minimum and maximum endpoints for each micro-partition in the data structure. The subject technology sorts each of one or more peaks in the data structure based on height. The subject technology sorts overlapping micro-partitions based on width. The subject technology selects based on which micro-partitions are within the tallest peaks of the one or more peaks and further based on which of the overlapping micro-partitions have the widest widths.

Abstract: Some embodiments provide a non-transitory machine-readable medium stores a program. The program receives a query for data that includes a join operation. The program further generates a plurality of candidate query execution plans based on the query, each candidate query execution plan comprising a set of reduction operations. The program also determines a plurality of execution costs associated with the plurality of sets of reduction operations in the plurality of candidate query execution plans. The program further selects a query execution plan from the plurality of candidate query execution plans based on the plurality of execution costs. The program also executes the query execution plan to generate a set of query results for the query.

Abstract: A spatial indexing system receives a set of walkthrough videos of an environment taken over a period of time and receives an image search query that includes an image of an object. The spatial indexing system searches the set of walkthrough videos for instances of the object. The spatial indexing system presents search results in a user interface, displaying in a first portion a 2D map associated with one walkthrough video with marked locations of instances of the object and a second portion with a histogram of instances of the object over time in the set of walkthrough videos.

Abstract: Processing a query for a database includes: receiving a portion of a query from a client device in a server implemented by at least one processor, the portion of the query comprising an incomplete component; determining that the incomplete component is one of multiple predefined types with the server; providing the incomplete component to an auto-complete function specific to the determined type of the incomplete component; receiving in the server a suggestion for completing the query from the auto-complete function, the suggestion being specific to the type of the incomplete component; and providing the suggestion from the server to the client device.

Abstract: A computer system includes a processor configured to predict a level of commonality between a first website and a second website. The computer system is further configured to automatically apply cached search data input at the first website to the second website based at least in part on the level of commonality. A display unit displays the second website along with the cached search data.