Abstract: A system and method of generating a playlist includes searching an event database having multiple events stored therein. One of the events is identified as corresponding to a user's interest data. A song database is searched. The song database includes at least one song corresponding to the identified event. A playlist corresponding to the identified event is generated. The playlist includes a list of at least one song corresponding to the identified event and a logical link to a recording of the at least one song. Access to the playlist can then be provided to the user.

Abstract: Embodiments of the present invention are directed to facilitating data model acceleration in association with an external data system. In accordance with aspects of the present disclosure, at a core engine, a search request associated with a data model is received. The data model generally designates one or more fields, from among a plurality of fields, that are of interest for subsequent searches. Thereafter, it is determined that an accelerated data model summary associated with the data model is stored at an external data system remote from the core engine that received the search request. The accelerated data model summary includes field values associated with the one or more fields designated in the data model. A search for the received search request is initiated using the accelerated data model summary at the external data. A set of search results relevant to the search request is obtained and provided to a user device for display to a user.

Abstract: In an aspect, provided is a method comprising receiving an expression involving one or more dimensions, determining one or more indexlets associated with the one or more dimensions, querying each of the one or more indexlets with the expression, receiving a result from each of the one or more indexlets, and aggregating the results.

Abstract: A system for responding to natural language medical queries is provided. The system includes a memory storing a computer program and a processor configured to execute the computer program. The computer program decomposes an input medical related user query into medical related sub-queries using pre-defined proxies, rephrases the sub-queries into yes-no queries answerable with a yes or a no, extracts feature values from the yes-no queries and a relational database storing clinical records, generates a feature vector from the extracted feature values, and applies the feature vector along with desired output labels to a supervised machine learning algorithm to generate a classifier configured to answer a new medical related user query.

Abstract: Cognitive compression with varying structural granularities in a NoSQL database by establishing a data training set for compressing and decompressing data stored within the NoSQL database. The data training set includes received user policy goals, compression parameters, and metered feedback associated with data usage and workload characteristics. A compression parameter model is dynamically implemented in real-time for the data selected according to the established data training set to compress and decompress the data at a given structural granularity.

Abstract: A data records service is configured to receive original data records and, in parallel, generate a transliterated version of the original data record into a phonetic based language. Individual fields of data records can be transliterated by identifying a primary language, generating language specific tokens for individual text portions, and transliterating the token. The records processing service can then execute matching models on both original data records and transliterated data records to detect matching data records.

Abstract: A centralized database identifier repository may identify databases using a unique identifier, or key tag, for each database. Each identified database may include data relating to one or more specific data elements. The repository may include a variety of data elements. Each data element may be associated with one or more database keys. The repository may be a repository of reference pointers. The repository may facilitate data viewing and data retrieval. A requestor may search for a data element using the centralized repository. The repository may retrieve data relating to a specific data element, from all databases identified by unique identifiers, that include data relating to the data element. The databases' unique identifiers may be encrypted tokens.

Abstract: A journal of operations persistently stores a collection of user and machine interactions with documents, concepts within documents, and relationships/mentions among such documents and concepts. A knowledge graph or other visual expression can be used to provide an interactive format for user interactions with this information, and to visually display the accumulated information in the journal of operations on user's device of choice. Such accumulations are often called aggregations or aggregates. Both human users and computer users such as automated recommendation engines, machine learning algorithms, and the like can interact with the journal of operations to facilitate computer-assisted discovery and organization of data around a topic of interest to the human user. The resulting journal of operations and aggregations of those operations such as a knowledge graph or other visual expression(s) also provides a useful medium for sharing knowledge with other users and collaborating on investigation of a topic.

Abstract: A method of disambiguating user intent in conversational interactions for information retrieval is disclosed. The method includes providing access to a set of content items with metadata describing the content items and providing access to structural knowledge showing semantic relationships and links among the content items. The method further includes providing a user preference signature, receiving a first input from the user that is intended by the user to identify at least one desired content item, and determining an ambiguity index of the first input. If the ambiguity index is high, the method determines a query input based on the first input and at least one of the structural knowledge, the user preference signature, a location of the user, and the time of the first input and selects a content item based on comparing the query input and the metadata associated with the content item.

Abstract: A method includes transmitting, from a service platform customer instance, first data associated with a document to a first user device. The method further includes transmitting, from the service platform customer instance, second data associated with the document to a second user device. The method further includes receiving, at the service platform customer instance, a request from the first user device a request to make a change to the document from the first user device. The method further includes transmitting, from the service platform customer instance to the second user device, a request for permission to make the change. The method further includes updating, at the service platform customer instance, the document based on the change in response to receiving permission to make the change from the second user device.

Abstract: A database service that receives and manages time series data into a set of generational data tables. The database service maintains subsets of the time series data in a plurality of partitions and a set of virtual keys defining the range of time series of data in each partition. Thereafter, responsive to a transactional range delete command, the database service identifies partitions having overlapping time series data and processes the delete command at each respective partition.

Abstract: Embodiments of the disclosure disclose a method and apparatus for generating information. A specific embodiment of the method comprises: acquiring a historical click log, the historical click log comprising a historical search term and a clicked historical search result corresponding to the historical search term; determining whether matching clicked historical search results exist in the historical click log; establishing a synonymous relationship between historical search terms corresponding to the matching clicked historical search results, in response to determining the matching clicked historical search results existing in the historical click log; and generating a relational word list based on the established synonymous relationship. The embodiment helps to enrich the content of the relational word list, and improve the coverage of the relational word list.

Abstract: In a computer-implemented method for proactive handling of an index update, a data point is received at an ingestion node of a time series data monitoring system. It is determined whether an update to a local index of the ingestion node is necessitated based on the data point and the local index. Provided the update to the local index is necessitated, an index entry corresponding to the data point in the local index is updated based on the data point. The index entry corresponding to the data point is marked with a volatile indicator, the volatile indicator indicating that receipt of an index update to a corresponding index entry at a durable index of the time series data monitoring system is unconfirmed. The index update to the durable index corresponding to the data point is initiated.

Abstract: An embodiment of a method for securing stored data includes assigning a first user security label to a first user. The method further includes adding an object compartment created by the first user to the first user security label assigned to the first user. The method further includes assigning the object compartment to an object created by the first user by creating the object compartment in an object security label. The method further includes enabling a second user to access to the object created by the first user by assigning the object compartment assigned to the object to a second user security label of a second user. The method further includes determining, by a processing device, whether to permit the second user to access to the object based at least in part on the object security label and the second user security label.

Abstract: Embodiments of the present disclosure disclose a method and apparatus for displaying map information and a storage medium, the method comprising: acquiring a map query request submitted by a user; creating an independent layer of a request object related to the map query request based on the map query request; and displaying the independent layer to the user on an electronic map display interface. The method and apparatus for displaying map information and the storage medium provided by the embodiments of the present disclosure enable the user to clearly identify a request object from an electronic map.

Abstract: An information processing device includes acquisition means for acquiring a plurality of tree structure data in which information groups are represented by tree structures and merge means for generating merged tree structure data merging the plurality of tree structure data. The merge means merges, for information satisfying a condition indicating that a certain distance from other information in the tree structure data is maintained, a subtree at a level below the information in the tree structure data, into the merged tree structure data, wherein the information satisfying the condition is included in a node selected from the plurality of tree structure data; and reorganizing for information satisfying a condition indicating that the distance between pieces of information is short, a merged subtree by merging subtrees below the information in the tree structure data into the information.

Abstract: In accordance with aspects of the disclosure, systems and methods are provided for normalizing data representing entities and relationships linking the entities including defining one or more graph rules describing searchable characteristics for the data representing the entities and relationships linking the entities, applying the one or more graph rules to the data representing the entities and the relationships linking the entities, identifying one or more matching instances between the one or more graph rules and the data representing the entities and the relationships linking the entities, and performing one or more actions to update the one or more matching instances between the one or more graph rules and the data representing the entities and the relationships linking the entities.

Abstract: Techniques for augmenting technical instruction sets with additional solutions from solution providers are described. A user query for technical instruction comprising a technical problem to solve is received and a current user state from data representing user knowledge and available physical resources is determined from the user. Additionally, a technical instruction set is identified and an augmented technical instruction set comprising additional technical instructions from a winner of a knowledge augmentation auction is generated and returned.

Abstract: A computer-implemented technique is described herein for performing an image-based search that allows a user to create a custom query image that expresses the user's search intent. The technique generates the query image based on one or more input images and/or one or more information items that describe at least one desired characteristic of the query image. The technique then submits the query image to a search engine, and, in response, receives a set of candidate images that match the query image. In one implementation, the technique constructs the query image using a decoder neural network that operates on a mixed latent variable vector. In one approach, the technique uses a generative adversarial network (GAN) to produce the decoder neural network.

Abstract: A method for optimizing hash table lookup speed during hash table resize on a computing device, the method including performing the following on the computing device: providing a first hash table having N slots for entries, designating the first hash table as an active hash table, allocating a second hash table, and performing the following after allocating the second hash table: when a hash table insertion of an entry is requested, performing insertion by inserting the entry to the first hash table and inserting the entry to the second hash table, and when a hash table lookup is requested, looking up the requested entry in the active hash table, one of the performing insertion and the performing deletion including also copying K entries, K being greater than or equal to 1, from the first hash table to the second hash table. Related apparatus and methods are also described.