Abstract: In one embodiment, the present invention is directed to a system with multiple computing hosts each having a hypervisor to provide a virtual environment for the host and one or more containers each including a database instance and at least one database. These databases, and the database instance can be provided as a service to a user of a multi-tenant environment.

Abstract: The present teaching generally relates to identifying data bucket overlap with online experiments. In a non-limiting embodiment, first data representing a first set of identifiers associated with a first data bucket of a first online experiment may be obtained. Second data representing a second set of identifiers associated with a second data bucket of the first online experiment may be obtained. Based on the first data and the second data, a first number of identifiers that are associated with the first data bucket and the second data bucket may be determined. In response to determining that the first number exceeds a threshold, a data flag indicating that results associated with the first online experiment are inconsistent may be generated.

Abstract: Implementations of the disclosure provide for unmarshaling objects from a back-end server graph database as they would be available in local memory at a client device. An apparatus is provided that comprises a memory and a processing device to inspect a graph model associated with an object comprising a plurality of node data structures. The graph model defines one or more services provided by each node of the object. Using a graph database, graph data elements are identified for at least one node data structure of the object in view of the inspected graph model. Metadata that describes the object associated with the inspected graph mode is generated. Thereupon, the metadata is provided to reconstruct using the graph data elements the one or more services associated with the object at a client device.

Abstract: In an example embodiment, a method comprises determining an ordered set of key entries; determining a first key entry for a first object in the ordered set of key entries; determining an object storage operation represented by a key of the first key entry; determining the object storage operation represented by the key of the first key entry to comprise a delete operation; and responsive to determining the object storage operation represented by the key of the first key entry to comprise the delete operation, skipping over subsequent key entries associated with the first object in the ordered set of key entries.

Abstract: A method, system and computer program product for managing a file system includes a plurality of allocation areas of loaded allocation trees to serve a request per file system drive for a transaction group. The system also includes a module configured to move a loaded allocation tree to an unloading tree in the event the loaded allocation tree will not satisfy the request. The system additionally includes a module configured to select and place in a loading tree queue a most eligible unloaded tree based on a weight of each unloaded tree. The system further includes a module to asynchronously process the loading tree queue and an unloading tree queue threads parallel to a storage pool allocator sync process. Allocation areas are attached in a circular ring of loaded allocation trees. Space map trees are converted into fixed size areas for constant latency loading logs and creating index trees.

Abstract: Systems and methods for data ingestion are disclosed. According to one embodiment, in an information processing device comprising at least one computer processor, a method for data ingestion may include: (1) comparing current metadata for data in a data source to a prior metadata for data the data source to identify a change in a data structure or a new data structure for stored data stored in a target platform; (2) determining that the data structure for the data has changed; (3) changing the data structure or creating a new data structure on the target platform to confirm to the data structure; (4) dynamically conforming the data in the data source to the new data structure; and (5) dynamically extracting and loading the data from the data source to the target platform.

Abstract: The present disclosure relates to example table connection methods, devices, and systems. In one example method, data that is sent by a coordinator node and that is in a first target column in a first data table is stored by a data node in a local memory. The data node receives a table connection request. When first data in the first target column is the same as second data in a second target column, the data node connects data in a row in which the first data is located to data in a row in which the second data is located. The data node sends a connection result to the coordinator node.

Abstract: Novel key ticketing technology includes an example method in which a first request associated with a first object storage operation is received. The first request includes a first timestamp associated with the first object storage operation and a first object identifier identifying a first object associated with the first object storage operation. The method calculates a first inverse timestamp based on the first timestamp, and generates a first object key corresponding to the first object storage operation. The first object key includes at least the first object identifier and the first inverse timestamp. The method further inserts a first entry including the first object key into a key data store at a position relative to other object key entries based on the first object identifier and the first inverse timestamp included in the first object key.

Abstract: Disclosed are a system and a method for managing log data. The system includes: a log collector part that detects a change in a log file and reads a log message, which includes newly inputted log data information; a first preprocessing command generator part that receives the log message via the log collector part, decides whether or not to input the log message to a DBMS or whether or not to change a content of the log message, and generates a command to preprocess the log message according to the decision; a log analyzer part that preprocesses the log message according to the command generated at the first preprocessing command generator part, performs parsing on the preprocessed log message, and generates column data by separating the parsed log message into columns; and a log transmitter part that provides the column data of the log analyzer part to the DBMS.

Abstract: A method for enforcing constraints on a database table. The method includes: storing the database table on an analytical engine of a data processing system. An index is created on the database table on a transactional engine of the data processing system, wherein the database table stored on the analytical engine is scanned for creating the index. A data manipulation statement associated with a set of constraints on the database table is provided. The transactional engine enforces the set of constraints based on the index. In response to the set of constraints being successfully enforced: executing the data manipulation statement on the database table in the analytical engine, and updating the index in the transactional engine accordingly to the data manipulation statement.

Abstract: An information processing apparatus includes a first association unit that associates a deployment table and a relations diagram with each other, a second association unit that associates an axis item, which is an item included in an axis of the deployment table, and an item in the relations diagram with each other, a third association unit that associates cause-and-effect information indicating a cause-and-effect relationship between two axis items of adjacent axes of the deployment table and an arrow connecting items to each other in the relations diagram with each other, and a display unit that displays, using at least one of the first to third association units, a relations diagram associated with a deployment table that is a correction target.

Abstract: A system and method of storing and analyzing information is disclosed. The system includes a compiler layer to convert user queries to data parallel executable code. The system further includes a library of multithreaded algorithms, processes, and data structures. The system also includes a multithreaded runtime library for implementing compiled code at runtime. The executable code is dynamically loaded on computing elements and contains calls to the library of multithreaded algorithms, processes, and data structures and the multithreaded runtime library.

Abstract: A method and a system for data aggregation for human beings is a single point for collection, aggregation, visualization, and selective distribution of quantitative and qualitative data. The quantitative and qualitative data pertains to various domains which include sports, education, music, healthcare, animal data and the like. The system provides development tools and assessment tools for each human being. The system also includes facilitating the plurality of human beings and a plurality of respective stake-holders to enter qualitative and quantitative information on a web-based platform, collecting the qualitative and quantitative information, analyzing the qualitative and quantitative information, aggregating and visualizing the qualitative and quantitative information, and selectively distributing the qualitative and quantitative information to the plurality of human beings and the plurality of stake-holders.

Abstract: Disclosed is a method for a hub module to perform flow-based processing, which includes: receiving a flow including at least one task; a stored procedure generation allowance step for allowing a DBMS module to generate a stored procedure based on the flow when the received flow is not a previously processed flow, wherein the stored procedure includes at least one of a flow query, meta information, and exception handling information, and the meta information includes execution time of the flow query, execution results, and user information; and a stored procedure call allowance step for allowing the DBMS module to call the stored procedure corresponding to a previously processed flow when the received flow is the previously processed flow.

Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for receiving a query from an application, determining that the query has been received before, and in response, retrieving statistics for the query from a metadata table, providing a query execution plan (QEP) associated with the query, the QEP including a plurality of operators executed to provide a query result, one or more operators of the plurality of operators requiring input from computer-readable memory, fragmenting at least one operator of the plurality of operators into multiple fragment operators to provide a fragmented QEP (fQEP), the multiple operators being executed to each provide a portion of a result of the at least one operator, and storing the fQEP in computer-readable memory.

Abstract: The present disclosure relates to a data search system capable of providing increased speed in searching large-volume time series data in a DBMS. A data search system according to an embodiment of the invention may be implemented by a computing terminal as a system for searching data. The system may include: a query optimizer that checks whether or not a parallel scan is possible for a search target data table and generates a query execution plan; a parallel scan manager module that conducts a parallel scan on the table; and a query executer that executes the query execution plan generated by the query optimizer and, if a parallel scan is possible for the table, calls the parallel scan manager module, where the parallel scan manager module determines whether or not to execute a parallel scan by comparing the number of records forming the table with a preset value.

Abstract: Systems and methods perform a bounded scan on multi-column keys of a database system which stores data in a storage device. The systems and methods may include creating an index on one or more columns of a table of a database stored in the storage device. A first query for data in the indexed table may be received by the database system, where the query includes a scan range operation. The database system may translate the first query that includes the scan range operation into a plurality of sub-queries having respective scan ranges. A second query may be formed by combining the sub-queries with an operation. The systems and methods may process the second query and output a result of the second query.

Abstract: A method of data mining based on microarray data and a document database, comprising: receiving microarray data; generating a search of a microarray data database for information interpreting the microarray data; analyzing the microarray data based on the first search, to determine sequences of interest; receiving a topical; generating a second search of a document database for documents corresponding to the sequences of interest and a conjunction of the sequences of interest and the annotation; performing at least one quantitative comparative analysis between a first quantity of citations of the document database for documents corresponding to the sequences of interest versus a second quantity of citations for documents corresponding to a conjunction of the sequences of interest and the annotation; and ranking the sequences of interest based on the comparative quantitative analysis.

Abstract: Among other things, a value of a data item is calculated. The data item has possible values that correspond to degrees of a user-related condition. The calculation is based on information about the user-related condition for a user. A metaphorical element is presented to the user that metaphorically represents a degree of the user-related condition corresponding to the value of the data item. The metaphorical element belongs to a set of metaphorical elements that are related and metaphorically represent different respective degrees of the user-related condition, a new value of the data item is calculated in response to a change in the user-related condition. In response to the new value, a different one of the metaphorical elements is presented to the user. The change from one to another of the metaphorical elements metaphorically represents the change in the user-related condition.

Abstract: Systems and methods for receiving information associated with posts to a social network are described. Posts may be associated with a location. Symbols, portions or posts, or multiple symbols may be shown on a client device in an area of a map indicating a location associated with a post. Posts may be represented by symbols, which may include shapes, and such shapes may include emojis. An amount of symbols, posts, or portions of posts displayed on a client device may be determined at least in part by an area of a map displayed on a client device.

Abstract: An embodiment of the present invention migrates data between source and target systems. Retrieved source data is mapped to corresponding data elements of a data design for a computer implemented scenario on a target system. One or more of the data elements of the data design are stored on the target system in a format different than a format of the retrieved data. Filters and transformations are generated based on the mapping and data design, and the retrieved data are converted to the format of the target system. One or more from a group of the mapping, filters, and transformations is adjusted in response to detecting at least one from a group of modifications to the data design and non-conforming data received from the one or more source systems. The converted data is stored for the corresponding data elements on the target system for use by the computer implemented scenario.

Abstract: In a computer-implemented method of presenting a temporal topology graph of a computing environment at a graphical user interface, a temporal topology graph of a computing environment including a plurality of managed components is accessed at a service provider, wherein the temporal topology graph includes managed component relationship data for the plurality of managed components over an available time range, wherein the service provider is remote to the computing environment. A selected time of the available time range for displaying a visualization of the temporal topology graph is determined. A visualization of the temporal topology graph of the computing environment is displayed at the selected time in a graphical user interface, wherein the visualization includes a topology of the plurality of managed components and parent/child relationships interconnecting the plurality of managed components at the selected time.

Abstract: A computing system operates according to a method including: identifying a target set stored within a set of devices, wherein the target set includes data items that are designated to be copied to a different set of devices at a later time; determining a data preservation setting for each data item, wherein the data preservation setting represents a storage duration for the data; and generating a copy schedule based on the data preservation setting, wherein the copy schedule represents a timing for copying the each data item to the different set of devices.

Abstract: Provided is a method of storing data in a key-value reliability system including N storage devices that are grouped into a reliability group as a single logical unit and that are managed by a virtual device management layer, N being an integer, the method including determining whether the data meets a threshold corresponding to a reliability mechanism for storing the data, selecting the reliability mechanism when the threshold is met, and storing the data according to the selected reliability mechanism.

Abstract: A method, system and computer program product for providing consolidated access to data of a plurality of source databases. Tables of each of the source databases are replicated to a shared accelerator. The source DBMSs are configured to dispatch queries to the accelerator for accelerating query execution. The accelerator is configured such that the replicated tables can only be accessed by the source DBMS having provided said tables for executing a dispatched query. A user can select one of the source DBMSs to act as a consolidated DBMS—C-DBMS. The C-DBMS provides the consolidated access. The user is enabled to select tables managed by another one of the DBMSs. In response to receiving the selection of the tables, the accelerator is re-configuring such that the C-DBMS is granted access also to the copies of the selected tables in the accelerator.

Abstract: A database replication method and apparatus for a distributed system are provided and relate to the database field. The method includes: receiving by a coordination server, a timestamp of a multi-partition transaction newly added to a first partition of a secondary cluster; determining, by the coordination server, a target timestamp for the first partition based on the received timestamp of the newly added multi-partition transaction and a stored multi-partition transaction timestamp of each partition of the secondary cluster; and sending, by the coordination server, the target timestamp to the first partition, so that the first partition executes a replication log in the first partition based on the target timestamp. In this way, the corresponding partition can execute, without waiting, a multi-partition transaction that is present in all the partitions but has not been executed, thereby avoiding data inconsistency and increasing replication efficiency.

Abstract: The present disclosure is directed toward systems and methods for providing a self-maintaining automated chat response generator. In particular, the systems and methods described herein analyze a corpus of digital content to identify content topics and generate a language model for categorizing a chat question. Additionally, the systems and methods described herein analyze a chat question to assign the chat question to a content topic based on keywords identified within the chat question. The systems and methods also generate a response to provide to the chat question.

Abstract: The described implementations relate to processing of electronic data. One implementation is manifest as a technique that can include obtaining a relational query that references one or more data items and associating progress intervals with the data items. The technique can also include converting the relational query into a corresponding streaming query, and providing the streaming query and the data items with the progress intervals to a stream engine that produces incremental results of the query. For example, the progress intervals can be based on row numbers of a relational database table. The progress intervals can be used to define event lifetimes of streaming events that are provided as inputs to the stream engine.

Abstract: A method includes receiving a natural language query at an information system, the natural language query indicating an intent and at least a first factor and a second factor. The method also includes retrieving a set of candidate information from the information system based on the natural language query, the set of candidate information having a type determined by the intent. The method additionally includes selecting a knowledge display template from a set of knowledge display templates using the intent, the first factor and the second factor. The method further includes rendering, using the knowledge display template, a first knowledge graph comprising the set of candidate information, the first knowledge graph indicating a relationship between the set of candidate information based the first factor and the second factor.

Abstract: Methods for non-linguistic content analysis of a selected body of data are provided. In one aspect, a method includes identifying a delimiter token, parsing a reference base into reference units based on the delimiter token, calculating and storing a frequency of each occurrence of each reference unit of the reference base and a total number of occurrences of all reference units of the reference base, parsing the selected body of data into data units, calculating and storing a score for each data unit of the selected body of data, and providing a ranked list of concepts associate with the selected body of data. Systems and machine-readable media are also provided.

Abstract: The subject matter of this disclosure relates to a software platform that ingests data from a variety of data sources, processes the data, and makes the data available for search. In addition, a data portal is described through which users can quickly find information and improve metadata to take advantage of the enterprise's data assets. Various aspects of disclosed software platforms include technologies for obtaining metadata without touching underlying data assets, technologies for using table or database lineage as a factor in determining document relevance, processes for receiving data pushed from data sources, and processes for exposing what a user needs to do to access particular data assets.

Abstract: A method for determining a longest common subsequence in a plurality of text strings. The method comprises: separately converting a plurality of text strings into word sequences (S100); classifying the word sequences (S400); and performing longest common subsequence computation on every class (S500). The time needed by LCS computation can be saved by classifying text strings.

Abstract: Devices and methods for classification of low relevance records in a database are disclosed. A method includes: in response to a request to delete a selected database record, generating a vector representation of the selected record, deleting the selected record in the database, and storing the vector representation of the deleted selected record; in response to the storing the vector representation of the deleted selected record, determining a cluster from which the vector representation has a shortest determined distance, among a plurality of clusters into which a plurality of vector representations of deleted records is partitioned; determining a distance between a record in the database and a nearest cluster among the plurality of clusters into which the plurality of vector representations of deleted records is partitioned; and in response to the record being within a predetermined distance of the nearest cluster, determining that the record is a deletion candidate record.

Abstract: Example implementations are directed to methods and systems for individualized multimedia navigation and control including receiving metadata for a piece of digital content, where the metadata comprises a primary image and text that is used to describes the digital content; analyzing the primary image to detect one or more objects; selecting one or more secondary images corresponding to each detected object; and generating a data structure for the digital content comprising the one or more secondary images, where the digital content is described by a preferred secondary image.

Abstract: Methods, systems, and computer-readable storage media for predicting a type of an event in a computer-implemented system, implementations including receiving event data including a set of features representative of an event, determining a probability for at least one feature in the set of features from a data structure that stores a plurality of feature-probability pairs, the data structure representative of a type of event, providing a joint probability based on the probability of the at least one feature, the joint probability indicating a likelihood that the event is of the type of event, comparing the joint probability to a threshold to provide a comparison, and selectively executing one or more actions based on the comparison.

Abstract: Digital image data including discrete photographic images of a variety of different subjects, times, and so forth, are collected and analyzed to identify specific features in the photographs. In an embodiment of the invention, distinctive markers are distributed to aid in the identification of particular subject matter. Facial recognition may also be employed. The digital image data is maintained in a database and quarried in response to search requests. The search requests include criteria specifying any feature category or other identifying information, such as date, time, and location that each photograph was taken, associated with each photograph. Candidate images are provided for review by requesters, who may select desired images for purchase or downloading.

Abstract: Systems and methods for automating the retrieval of partitionable search results from a database and reducing the latency of delivering the partitionable search results are disclosed. A query for searching a database is constructed. Multiple processing tasks are assigned and executed to retrieve partitioned search results from a database in parallel. Each partition of search results is returned to the user as response messages. Response messages may be continuously received until all search results responsive to the query have been retrieved from the database. When multiple processing tasks are used to retrieve and deliver partitioned search results in parallel, server, internet and client resources are optimized, and the throughput of search results and metadata are increased, and the process of narrowing or filtering search results is an interactive and informed process for the user.

Abstract: In one embodiment, a method includes receiving a search query, searching a reverse index to identify one or more objects having one or more tokens that match the search query, and accessing a forward index that has several records that each correspond to an object posted to an online social network. Each record may comprise a first field of tokens, and one or more second fields corresponding to metadata associated with each of the tokens. The method may further include scoring each identified object based on its respective record. The score for each identified object may be calculated based on the metadata associated with each of the tokens. The method may also include sending, to the client system in response to the received search query, instructions for presenting one or more search results corresponding to the identified objects having a score greater than a threshold score.

Abstract: In one embodiment, the present invention is a mobile application that asks a user to verify his user phone number, requests the user to activate his user account, requests the user to add information about himself, requests the user to add information about his interests, requests the user to adjust his privacy settings, allows the user to discover other users, allows the user to view the profiles of other users, allows the user to view other users on a map, allows the user to contact other users, allows the user to view messages sent by other users, and allows the user to chat with individual users.

Abstract: Systems, methods, and non-transitory computer readable media can receive a request to generate a hovercard associated with a page of a social networking system for a user. One or more of textual content items associated with the page, multimedia content items associated with the page, or actions associated with the page can be ranked for the user, based on one or more machine learning models. The hovercard associated with the page can be dynamically generated for the user for display, based on the ranked textual content items, multimedia content items, or actions.

Abstract: Disclosed herein is method and system for providing context based adaptive response to user interactions. A primary context of the user interactions is determined based on intents and associated named entities extracted from the user interactions. Further, secondary context of the user interactions is determined by detecting enquiry intent in user responses for queries provided for the primary context of the user interactions. Information related to primary and the secondary contexts are stored as Key Context Information (KCI) and is dynamically updated during the user interactions. Finally, context based adaptive responses are generated based on the updated KCI upon determining non-enquiry intent in subsequent user responses. The method of present disclosure maintains track of the user interactions and automatically detects changes in the context of the user interactions.

Abstract: A personalization system includes a user events module configured to receive a plurality of user events, each user event of the plurality of user events including one or more of a transactional event and a behavioral event associated with the online user, and a personalization cluster including a plurality of personalization servers, each personalization server of the plurality of personalization servers configured to receive a personalization request from a requesting system, the personalization request including a plurality of intermediate results identified by the requesting system, each intermediate result representing a possible outcome that may be presented by the requesting system to the online user, compute a score for each intermediate result of the plurality of immediate results based at least in part on the plurality of user events, thereby generating a plurality of scores, and return the plurality of scores to the requesting system.

Abstract: Embodiments of the present disclosure disclose a method, an apparatus, a server, and a storage medium for recalling for a search. The method for recalling for a search includes: acquiring a search term inputted by a user; calculating a semantic vector of the search term using a pre-trained neural network model; and recalling, according to a pre-established index, target documents related to the semantic vector of the search term from candidate documents, the index being established based on the semantic vectors of the candidate documents, and the semantic vectors of the candidate documents being calculated using the pre-trained neural network model. The embodiments of the present disclosure may solve a problem in the existing method for recalling that the recalling accuracy is affected by failing to generalize semantics, to improve the accuracy of recalling for a search.

Abstract: Merit-based anonymous content distribution. A computing device receives from a first client computing device associated with a first user, a request for a post of a plurality of posts. The computing device randomly selects a first post of the plurality of posts. The first post is provided to the first client computing device for presentation to the first user. A designation that ranks the first post is received from the first client computing device. It is subsequently determined to distribute the first post or inhibit distribution of the first post based in part on the designation.

Abstract: An adaptive link is generated for delivering a device platform-specific and personalized digital pass. When the adaptive link is activated by an end user, a network request is sent from an end-user device to a digital pass management system. The network request may include header information that identifies the device platform of the end-user device. The digital pass management system extracts query string parameters included in the adaptive link. Based on the parameters, a personalized data set in a specific data format such as JSON is generated. A template that is compatible to the device platform is selected. A digital pass that is compatible with the device platform is generated and delivered based on the requirements of the end-user device. In some cases, the adaptive link may include location information such as latitude and longitude coordinates. The digital pass generated may also be location specific.

Abstract: A system and method for customizing information presented to a user based on user preferences and/or interests. The system receives user preferences and/or interests and builds a user profile for the user based on those preferences and/or interests. The system receives a request from a website or application to access the user's profile. In response to this request, the system provides the website or application with access to the user's profile and generates one or more customized content items based on the user's profile, which may be embedded into, overlaid on the website or graphical user interface of the application. The system also allows the user to personalize their profile to generate customized content items on websites and applications that the user visits or uses.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a log entry instance for creating a definition for a log entry type. The program further generates a markup associated with the log entry instance. The program also generates a document based on the markup associated with the log entry instance. The program further retrieves a set of reference documents. Each reference document is associated with a particular type of event. The program also generates a ranked list of types of events based on the document and the set of reference documents.

Abstract: The disclosure discloses a search method and apparatus based on artificial intelligence. An embodiment of the method includes: receiving search information entered by a user; determining a candidate to-be-pushed message set based on the search information; predicting a probability of being clicked for a candidate to-be-pushed message in the candidate to-be-pushed message set using a pre-trained scoring model based on the search information and the candidate to-be-pushed message set, the scoring model being obtained by training based on a pre-stored first search information set, a to-be-pushed message set corresponding to a piece of first search information in the first search information set, and a preset priority of a to-be-pushed message in the to-be-pushed message set; and selecting a preset number of the candidate to-be-pushed messages to form a message sequence in descending order of the probability of being clicked, and pushing the message sequence to a terminal of the user.

Abstract: Methods, systems, apparatus, including computer programs encoded on computer storage medium, for generating rendering data. The method includes actions of receiving a stream of real-time data, analyzing the stream of real-time data to detect a set of one or more attributes associated with a real-time event, identifying, based on the one or more attributes, one or more data records representing an event-outcome pair, wherein an outcome in the event-outcome pair includes data identifying a content item, obtaining historical data associated with the content item, and generating rendering data including data for rendering a first layer representing real-time data specifying a current value of the content item as an overlay to a second layer representing the obtained historical data associated with the content item, with each of the rendered layers being juxtaposed to one or more specified portions of the graphical user interface.

Abstract: Techniques are described for component design based on sensor data. Sensor data is collected by sensors in, or proximal to, a system under diagnosis (e.g., a vehicle), the sensor data describing use of one or more components of the system by one or more individuals. The sensor data from various instances of the component may be aggregated and analyzed to determine update(s) to the design of the component. For example, the aggregate sensor data may be analyzed to identify portions of the component frequently associated with movements by users (e.g., fidgeting, adjustments). The identified portion(s) can be presented graphically in a design view used to specify design modification(s) for the component. In some implementations, the aggregate sensor data is provided as input to a model that is trained, using machine learning, to output design modification(s) for the component based on the input aggregate sensor data.