Abstract: Systems, methods, and computer readable devices embodying instructions are provided herein for reducing latencies and/or improving computational efficiency when traversing data stored in a relational graph by caching subgraphs and enabling the utilization thereof. More specifically, after a user performs a graph query, the resulting subgraphs of the graph query are cached in a reusable form. Subsequent graph queries are able to identify cached subgraphs based on the graph query. Further, the subsequent graph query is operable to integrate the cached subgraphs as part of the result of subsequent graph query, which may include a portion or the entire result of the subsequent graph query being composed from cached subgraphs, thereby improving the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graphs, and improving the functionality of the computing devices hosting the relational graphs and running the queries.

Abstract: A collaboration database service may allow users to create, edit, and share collaborative content on custom databases consistently across a variety of platforms and devices. For example, a collaboration database engine of the service may be configured to detect creation of a table through an application associated with the service, the table including one or more columns and rows that form a plurality of cells. The engine may also be configured to determine and optionally reduce a character count of data within each cell, map each cell to a bucket based on the character count of the data, and automatically select an optimal configuration of the table to be provided for display through the application based on the mapping. The optimal configuration may maximize an amount of the data presented within each cell of the table and enable consistent presentation of the table across a variety of platforms and devices.

Abstract: Methods and systems for converting a point cloud dataset into a hierarchical data structure for a lossless representation of an input file are provided herein. In various embodiments the method comprises recursing subtrees using a preordered traversal for a plurality of nodes, the preordered traversal being checking a parent node and then checking children nodes and stopping the recursing of the subtrees using the preordered traversal of the plurality of nodes when a node of the plurality of nodes is a below threshold node. The below threshold node being less than a configuration specified maximum number of data points, the below threshold node being a leaf of a tileset. Further comprising, aggregating the leaf of the tileset into a lossless representation of the collection of input files.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for performing tree matching are disclosed.

Abstract: An approach is described for representing search results via a three-dimensional matrix. An associated method may include receiving a search query, querying at least one database based upon the search query, and receiving results to the search query from the at least one database. The method further may include representing the results via a three-dimensional matrix graphically depicting a plurality of categories corresponding to the results. Each of the plurality of categories may be associated with the results via a respective tag in the at least one database. Upon detecting activity from an input device, the method further may include filtering the plurality of categories of the three-dimensional matrix, and prioritizing the results based upon the filtering. Representing the results via the three-dimensional matrix may include presenting the results in a list correlated to the three-dimensional matrix, and prioritizing the results based upon the filtering may include prioritizing the list.

Abstract: A method and associated system for selectively constructing a search result for a data requested by a search request specifying path information of a data node comprising the data. A template tree represents a hierarchy of the search result with expandable nodes which initially do not have actual data. A node of the template tree is dynamically expanded by a callback function to have a respective data for the node when the node is traversed for the first time during traversing the template tree according to the path information. The search result is created by expanding all nodes of the template tree that are specified in the path information. The data node in the search result is communicated to an entity that had originated the search request.

Abstract: A cognitive proximate recommendation method, system, and non-transitory computer readable medium, include identifying a requested item based on a user request, first extracting a requested feature and a requested value of the requested feature for the requested item, and returning a return item from a plurality of return items stored in the database by: second extracting a return feature corresponding to the requested feature for each of the plurality of return items, third extracting a return value of the return feature, and calculating a proximal distance between the return value for each of the plurality of return items and the requested value of the requested item.

Abstract: Traversing data stored in a relational graph by utilization of probabilistic characteristics associated with the graph nodes is disclosed. When a user submits a request with a graph query, an initial node associated with the graph query is identified. Further, the edge type associated the node is extracted from the graph query. When traversing the graph by following relevant edges from the initial node to new nodes, each new node is queried with the extracted edge type. If the query for the node is negative, then the edges for the particular node are not enumerated. However, if the query for the node is positive, then the edges for the particular node are enumerated for expanding the subgraph. This process continues until the subgraph is expanded to include all relevant nodes. Thus, the computational efficiency is improved by reducing the number of edges that must be traversed when performing graph queries.

Abstract: A collaboration database service may allow users to create, edit, and share collaborative content on custom databases consistently across a variety of platforms and devices. For example, a collaboration database engine of the service may be configured to detect creation of a table through an application associated with the service, the table including one or more columns and rows that form a plurality of cells. The engine may also be configured to determine and optionally reduce a character count of data within each cell, map each cell to a bucket based on the character count of the data, and automatically select an optimal configuration of the table to be provided for display through the application based on the mapping. The optimal configuration may maximize an amount of the data presented within each cell of the table and enable consistent presentation of the table across a variety of platforms and devices.

Abstract: Data presentation functionality associated with a collaboration database may be provided. A presentation of a table in conjunction with a collaboration database may be detected. At least one field in the table that includes people type data may also be detected. Initial letters associated with a person or an entity may be detected as input into the at least one field. A type of entry of the initial letters may be detected. A local data source may be searched to identify matching entries. Suggestions may then be displayed. If one of the suggestions is selected, additional information associated with the selected suggestion may be displayed on a contact card in a vicinity of the at least one field. An interactive functionality associated with the additional information through the contact card may be provided upon selection of the at least one field when the table is presented.

Abstract: In general, in one aspect, the invention relates to a method for servicing requests, the method includes receiving, from a client system, a first request comprising a query, determining a first user associated with the first request, modifying the query to obtain a first modified query, where the first modified query includes a first permission definition token associated with the first user, processing the modified query to obtain a first object from a content repository, and providing the first object to the client system.

Abstract: A relay server configured to relay service provision from a service provision server to a communication apparatus. The relay server is configured to perform receiving, in a case that a predetermined instruction is provided to the communication apparatus, a request for specific screen data from the communication apparatus, receiving, in a case that the request for the specific screen data is received, first folder relation information related to a first folder, which is a target folder of past data communication, from a database separately configured from the service provision server and the communication apparatus, generating the specific screen data by which a folder name of the first folder received by using the first folder relation information is preferentially displayed on the communication apparatus, and supplying the generated specific screen data to the communication apparatus.

Abstract: A mechanism for managing and archiving system and application log files is disclosed. A method of the invention includes accessing log files on shared storage that satisfy grouping requirements, combining the accessed log files that satisfy the grouping requirements into a single combined log file, compressing the single combined log file, and storing the single combined log file to an archival storage location.

Abstract: A method, computer-readable medium, and a computer system for processing data are disclosed. First data associated with a search may be accessed. Second data may be accessed from a database using the first data, where the second data may be associated with at least one sentiment of the first data. The second data may include at least one score, at least one classification, and at least one degree, some combination thereof, etc. Third data may be generated, based on the second data, for performing at least one operation associated with the search results. The at least one operation may include filtering the search results, ranking the search results, displaying an image associated with the at least one sentiment, some combination thereof, etc.

Abstract: Implementations generally relate to hashtags. In some implementations, a method includes providing one or more location-based contextual hashtags to a user by receiving, from a first user device associated with a first user, information indicative of a physical location of the first user device. The method further includes identifying, with one or more processors, a place of interest based on the information indicative of the physical location of the first user device. The method further includes determining a category associated with the place of interest. The method further includes retrieving one or more hashtags from one or more databases based on the place of interest or the category associated with the place of interest. The method further includes providing the one or more hashtags and information about the place of interest to the first user device.

Abstract: A method for backing up data is provided. The method includes deduplicating a first plurality of data units during a backup operation through application of a first deduplication service and a fingerprint database. The method includes logging a second plurality of data units in a journal, during the backup operation. The logging is in response to a failure of the first deduplication service and wherein at least one method operation is executed through a processor.

Abstract: In one embodiment, a method includes receiving a search query by one or more computing devices. A set of data objects to search are identified, and then an operation is executed. The operation involves stepping through the set of data objects with a step size of N, and at each step determining whether the object is responsive to the query. If the end of the set is reached before Y data objects are determined to be responsive, and X or more data objects are determined to be responsive, then an estimate of the number of responsive data objects in the set is provided. Otherwise, N is modified and the operation is re-executed.

Abstract: A method of accessing computer networks and data sources simultaneously is disclose. The method includes the steps of (a) selecting at least one of a target source to be accessed; and (b) running target parsing tool of said at least one of a target source if parsing is required. Also, there is disclosed a user interface for accessing multiple target sources simultaneously. The user interface includes a text entry field, a scroll-down menu for selecting one or more target sources, and an infobar for displaying information.

Abstract: A system and method for generating query refinement suggestions may include collecting refinement data for at least one received source query. The collected refinement data is then clustered to form at least one cluster. At least one potential refinement query suggestion is identified from the refinement data within the at least one cluster.

Abstract: A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.