Abstract: A set of queries on a collection of data records is received. A set of subconditions required to support the set of queries is determined. An index table is maintained, wherein an entry in the index table indicates a subcondition status associated with a data record in the collection of data records. A specific query is received indicating a specified set of subcondition statuses. The specified set of subcondition statuses is matched against the index table. A result set is returned corresponding to matched rows in the index table, wherein the matched rows match the specified set of subcondition statuses.

Abstract: Techniques are described herein for reducing the number of redundant evaluations that occur when an expression is evaluated against an encoded column vector by caching results of expression evaluations. When executing a query that includes an expression that references columns for which dictionary-encoded column vectors exist, the database server performs a cost-based analysis to determine which expressions (or sub-expressions) would benefit from caching the expression's evaluation result. For each such expression, the database server performs the necessary computations and caches the results for each of the possible distinct input values. When evaluating an expression for a row with a particular set of input codes, a look-up is performed based on the input code combination to retrieve the pre-computed results of that evaluation from the cache.

Abstract: An objective of the present disclosure is to provide a method and apparatus for accessing time series data. The method according to the present disclosure comprises: acquiring time series query information; determining corresponding time offset information based on the time series query information, the time offset information including hour information, minute information, and offset information; finding a leaf node in a time tree corresponding to the time offset information based on the time offset information; and querying in the leaf node based on the offset information, to acquire corresponding time series data. Advantages of the present disclosure lie in possessing a lower complexity and improving query efficiency of the time series data. In addition, the memory is less occupied, and out-of-order writing is supported.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage devices, for data processing and storage. One of the methods includes receiving, by a storage system, a plurality of write requests for storing a respective plurality of blockchain data in the storage system. Each of the plurality of the blockchain data includes: a value of one or more of a block, a transaction, or a state of a blockchain network, and a key corresponding to the value. The storage system appends the plurality of the blockchain data to a data log file according to a chronological order of the plurality of the blockchain data, and refrains from sorting the plurality of the blockchain data in the data log file according to respective keys of values in the plurality of the blockchain data.

Abstract: Example embodiments relate to providing real-time monitoring and analysis of query execution. In example embodiments, a query plan is obtained for a database query that is scheduled for execution in a database. A query tree is then generated based on the query plan, where the query tree includes operator nodes that are associated corresponding operators in the query plan. At this stage, performance metrics are collected from the database during the execution of the database query. Next, the query tree is displayed with the performance metrics, where a related portion of the performance metrics are displayed in each of the operator nodes.

Abstract: Systems, methods, and computer-readable media are disclosed for associating and reconciling disparate key-value pairs corresponding to a target entity across multiple organizational entities using a distributed match. A shared output mapping may be generated that associates and reconciles common and/or conceptually aligned key-value pairs across the multiple organizational entities. The shared output mapping allows any given organizational entity to leverage information known to other organizational entities about a target entity. In this manner, the organizational entities participate in an information sharing ecosystem that enables each organizational entity to provide a user with a more optimally customized user experience based on the greater breadth of information available through the shared output mapping.

Abstract: Determining a sentiment associated with a navigation path includes determining a cumulative sentiment score indicative of sentiment of web-based content previously viewed by a user; and iteratively performing: a) analyzing a sentiment of a next web-based content navigated to by the user to determine a content sentiment score; b) determining whether the cumulative sentiment score is different than the content sentiment score; c) notifying the user when the cumulative sentiment score is different than the content sentiment score; and d) updating the cumulative sentiment score based on the content sentiment score.

Abstract: Example implementations described herein are directed to systems and methods for managing a relationship between real-time analysis processes and applications, where each of the applications are configured to utilize output from one or more of the corresponding real-time analysis processes. In an example implementation, resource adjustment is applied to the real-time analysis process based on a determined priority.

Abstract: Methods, systems, and computer program products for accessing a database element are described. A local schema comprising a table link is created and the table link is used to access a database table via a persistency interface.

Abstract: A technique for providing search results may include determining a first entity type, a second entity type, and a relationship type based on a compositional query. The technique may also include identifying nodes of a knowledge graph corresponding to entity references of the first entity type and entity references of the second entity type. The technique may also include determining from the knowledge graph an attribute value corresponding to the relationship type for each entity reference of the first entity type and for each entity reference of the second entity type. The technique may also include comparing the attribute value of each entity reference of the first entity type with the attribute value of each entity reference of the second entity type. The technique may also include determining one or more resultant entity references from the entity references of the first entity type based on the comparing.

Abstract: A method for distributed pod-editing may be performed by an enhanced pod editor, and may include the following steps: receiving a framework for a pod, wherein the framework identifies one or more content items already assigned to one or more slots in the pod by one or more pod editors; determining attributes of the content items already assigned to the pod in a native taxonomy of the enhanced pod editor; determining restrictions on the pod's slots based on the attributes of the content items already assigned to the pod and on the pod's editorial constraints; rejecting content items already assigned to the pod that violate the restrictions on the pod's slots (if any); identifying candidate content items that comply with the restrictions on the pod's unfilled slots (if any), and selecting candidate content items and assigning the selected content items to the pod's unfilled slots.

Abstract: A multi-tier storage system is provided with direct client access to an archive storage tier for input/output operations. An exemplary method comprises communicating over a network with (i) a cluster file system on a first storage tier, and (ii) a second archive storage tier comprising an object store; providing a client of the cluster file system with access to one or more files in the cluster file system on the first storage tier; and executing a translation shim to provide the client of the cluster file system with one or more of read and write access to one or more files on the second archive storage tier. The translation shim converts between the protocols of the cluster file system and the protocols of the second archive storage tier, to allow unmodified applications to optionally access the second archive storage tier using existing cluster file system protocols.

Abstract: The systems, methods, and devices of the present disclosure may provide, among other features, high-performance, interactive geographical and/or data object map capabilities in which large amounts of geographical, geospatial, and other types of data, geodata, objects, features, and/or metadata are efficiently presented to a user on a map interface. In various embodiments, an interactive geographical map display system may enable rapid and deep analysis of various objects, features, and/or metadata by the user by aggregating and clustering large sets of data into aggregate values and clusters. The user can select various clusters, via the user interface, to interact with the data, clusters, and map.

Abstract: A metadata catalog may store metadata about data sources. The metadata may define table, column, partition and/or data formats, as well as title information, textual descriptions, modification information, data schemas and access information, such as location and connection information. A metadata catalog service may provide a shared, persistent, central repository for the metadata. The metadata of the catalog may be published via multiple access mechanisms and programmatically obtained and processed by other programs via the metadata catalog service. Metadata consumers may utilize the metadata catalog service to perform various metadata tasks, such as metadata retrieval, creation, addition, modification and/or deletion. The metadata catalog service may be directly integrated into existing data analytic tools as a persistent and durable metadata store allowing users to utilize the broad set of data processing tools.

Abstract: A method of event based object ranking is described. An object query is computed based upon a user action. The results of the query are ranked based on one or more events associated with objects in the results to create ranked results. The ranked results are provided to the user in response to the query.

Abstract: Universal, automatic file conversion may be provided by a universal file conversion system or application. An input file may be received by the universal file conversion system. An input file type for the input file and a recipient of the input file may be determined. Programs available to the recipient for accessing a file may be determined. A target file type accessible to the recipient may be determined for converting the input file. A sequence of file conversions to convert the input file to the target file type may be determined. The input file may be converted to the target file type based on the sequence of file conversions. The converted file may be provided to the recipient. The recipient may return the converted file, and the converted file may be automatically converted back to the original input file type and provided to the original source of the input file.

Abstract: Example embodiments relates to method and systems to restore content of a volume at a given point in time.

Abstract: An information processing method includes storing information identifying an external service and information of an acquisition method for acquiring folder information from the external service; receiving, from a device, a request to acquire the folder information from the external service; identifying the acquisition method for acquiring the folder information from the external service, based on the stored information; acquiring the folder information from the external service, based on the identified acquisition method; and sending the acquired folder information to the device. When the identified acquisition method is a first acquisition method, folder information of a hierarchy of a specified folder and in a predetermined number of lower hierarchies is acquired from the external service. When the identified acquisition method is a second acquisition method, folder information of a hierarchy of a specified folder and in all lower hierarchies is acquired from the external service.

Abstract: Techniques are described herein for sharing a dictionary across multiple in-memory compression units (IMCUs). After a dictionary is used to encode a first column vector in a first IMCU, the same dictionary is used to encode a second column vector in a second IMCU. The entries in the dictionary are in sort order to facilitate binary searching when performing value-to-code look-ups. If, during the encoding of the second column vector, values are encountered for which the dictionary does not already have codes, then a “sort-order-boundary” is established after the last entry in the dictionary, and entries for the newly encountered values are added to the dictionary, after the sort-order-boundary. To facilitate value-to-code look-ups, the new entries are also sorted relative to each other, creating a second “sort order set”. A new version of the dictionary may be created when the number of sort order sets in the first version of the dictionary reaches a configurable threshold.

Abstract: Methods, systems, and computer program products for accessing a database element are described. A table link of a persistency interface is defined, the table link being a representation of a table of a persistency schema. A role for the persistency interface is defined, the role defining a type of access for a specified portion of the database element.