Abstract: An event processing system for processing events in an event stream is disclosed. The system can execute instructions to receive a micro-batch stream of input events, process the input events using the CQL engine to generate a set of output events, generate, using a snapshot management algorithm implemented by the CQL engine, a snapshot of a current state of a system based at least in part on the set of output events related to the application, generate a first directory structure to access snapshot information associated with the snapshot of the current state of the system, generate a second directory structure to generate a list of snapshots associated with the current state of the system, and determine based at least in part on the snapshot management algorithm, a process to get, add, or clean the list of snapshots associated with the current state of the system.

Abstract: A system and method for identifying whether data skew is causing delays in a map phase and/or a reduce phase of a query of a distributed database. The system and method identify the values of various metrics relating to a database query. These metrics include map phase and reduce phase durations and various related metrics. The system and method gather statistics of multiple queries to determine correlation levels between the metrics and the map phase and reduce phase durations. Based on the statistics, the system and method determine whether one or both of the map and reduce phases for a query/response are taking longer than expected. If the durations are longer than expected, the system identifies the delay as caused by data skew and informs the originator of the query.

Abstract: Mechanisms and methods for pushing data to a plurality of devices of a plurality of organizations are provided. Queries are handled in bulk for a group of users of an organization or the entire organization, and limited results are sent to a middle tier server between the database system and the user devices. These mechanisms and methods for pushing data to a plurality of devices enable an efficient and transparent transfer of data to user devices. This efficient and transparent transfer of data can enable mobile devices of many organizations to seamlessly have the data that is required to perform business.

Abstract: One method includes receiving aggregated free-form query information comprising a first section and a second section for requesting data pertaining to a computing system and converting the first section and the second section of the aggregated free-form query information into an original query portion and a contingency query portion for accessing at least one data set. The method further includes accessing, using the original query portion, the at least one data set to obtain result information pertaining to an initial element included in the computing system. The method also includes accessing, using the contingency query portion and the result information returned in response to the original query portion, the at least one data set to obtain information for at least one descendant element or ancestor element related to the initial element included in the result information.

Abstract: A system includes a relational database management system component and a column-oriented data processing component. The relational database system component stores database information in a row format. The column-oriented data processing component stores the database information in a column format. In response to a database update request, the relational database management system component updates the database information stored in the row format; the relational database management system component notifies the column-oriented data processing component of the database update request; and the column-oriented data processing component updates the database information stored in said column format. In response to a query request, the column-oriented data processing component generates a query response based on the database information stored in said column format. In this manner, the system is able to generate up-to-date reports without the need for extraction, translation and loading procedures.

Abstract: The invention relates to a method, computer program product and computer system for providing attribute value information for a data extent having a set of data entries.

Abstract: A method for spooling data for use in joining a small table with a large table in a relational database system. The method analyzes a join condition for combining records from the small and large tables, selects qualified rows from the large table, and writes the qualified rows to a spool file. The spool file includes a first partition containing hash values of all bind terms for the join condition; a second partition including a join column with a best selective bind term; and at least one additional partition including additional join columns used in bind terms. The partitions are grouped together within a container row in the spool file, and multiple container rows are written together within a super-container row in the spool file.

Abstract: A memory stores a first and second cache. A processor stores a first query in a transaction log. The processor selects information from the transaction log, uses it to determine that a user will likely access a first portion of the database at a future date, and copies that portion into the first cache prior to the date. The processor further copies a second, frequently accessed portion of the database into the second cache. The processor additionally determines that a portion of data is in both caches and deletes it from the second cache. The processor receives a second query from the user, determines that it is directed at data in the first cache and accesses that cache. The processor also determines that the second query is not directed at data in the first cache but is directed at data in the second cache, and accesses that cache.

Abstract: A data-centric reduction method, system, and computer program product include configuring a similarity threshold and a correlation threshold for an entire data set from at least two back-end nodes, reducing the entire data set to a reduced data set from the at least two back-end nodes sent to a front-end node by removing data based on the similarity threshold and the correlation threshold, and after the front-end receives the reduced data set, reconstructing the entire data set from the reduced data set using the similarity threshold and correlation threshold.

Abstract: Systems and methods for visualizing and manipulating graph databases in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a graph database manipulation device includes a processor and a memory configured to store a graph database manipulation application, wherein the graph database manipulation application configures the processor to obtain a graph database including a set of nodes and a set of edges, determine a source node within the set of nodes, locate a set of related nodes based on the source node and the set of edges, recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, generate a representation of the set of related nodes from the perspective of the source node, and recursively update the generated representation of the set of sub-related nodes from the perspective of the source node and the related nodes.

Abstract: A stream of tuples to be processed by a plurality of processing elements operating on one or more computer processors are received. A first stream operator that is configured to perform a first operation on the received stream of tuples is identified by monitoring one or more stream operators in an operator graph. The first stream operator is determined to be a target operator. A field-programmable-gate-array (FPGA) card is determined to be configurable to perform the first operation. The FPGA card is determined to be available to perform the first operation. The FPGA card is added to the operator graph.

Abstract: An information processing device identifies a search query of a target user to whom an electronic coupon is to be issued and the corresponding search time, and adds the elapsed time between the search time and the current time to an expected interval between the current time and viewing by the target user, to calculate an expected viewing duration. The information processing device then identifies, as estimated viewed items, items associated with an estimated viewing duration of less than or equal to or of less than the calculated expected viewing duration, among items included in estimated viewing duration information corresponding to the identified search query. Based on items included in the target user's history information and on the identified estimated viewed items, the information processing device generates an electronic coupon to be provided to the target user.

Abstract: Implementations provide an enhanced search result to improve the user search experience. For example, the result may include insightful information relevant to the search query that was not specifically requested but that the user may find interesting, such as relationships shared between the two entities related to the query, a relationship between the two entities that does not commonly occur with another relationship shared by the entities, or strong secondary connections for an entity related to the query. In some implementations, insightful connections may also be unique facts for a particular entity. Unique facts may represent a superlative attribute of an entity such as, for example, the tallest actor, the oldest president, the most expensive stock, etc. Such shared relationships, rare relationships, and/or unique facts may be provided as part of the search results presented to the query requestor and may provide insight to the requestor about the entity.

Abstract: Approaches are described for ranking multiple products or other items, such as products obtained in response to a search request submitted to a server. The ranking system determines a ranking score for the products based on both data available online and item data that must be computed offline due to longer computation time or unavailability of data. The ranking score can be used to rank the products and determine which products are the most relevant to the user. A hybrid boosting method is used to first train an online ranking function to produce an online ranking score for the item. In the second phase, an offline ranking function is trained to produce a second ranking score for the item. The online rank score is combined with the offline rank score at query time to produce a combined rank for the items in the search results.

Abstract: A processing device identifies a set of content items to be included in a feed displayed to a user of a social network platform in a user interface of the social network platform, wherein the set of content items are hosted by a content sharing platform. For each content item from the set of content items, the processing device identifies one or more bucketing tokens provided by the content sharing platform, wherein each bucketing token comprises a unique identifier that identifies a plurality of content items as being associated with a group of users of the content sharing platform that have similar interests.

Abstract: Embodiments include methods, systems and computer program products for reducing feature space in analysis of medical data. Aspects include receiving patient temporal traces. Aspects also include conducting sequential pattern mining on the patient temporal traces to produce sequential features. Aspects also include clustering the sequential features with a similarity metric. Aspects also include analyzing the clustered features to predict a healthcare outcome.

Abstract: Methods and systems quantize and compress time series data generated by a resource of a distributed computing system. The time series data is partitioned according to a set of quantiles. Quantized time series data is generated from the time series data and the quantiles. The quantized time series data is compressed by deleting sequential duplicate quantized data points from the quantized time series data to obtain compress time series data. Quantization and compression are performed for different combinations of quantiles. The user may choose to minimize information loss of information due to quantization while selecting a lower bound for the compression rate. Alternatively, the user may choose to maximize the compression rate while placing an upper limit on the loss of information due to quantization. The compressed time series data that satisfies the user selected optimization conditions may be used to replace the original time series data in the data-storage device.

Abstract: An approach is described of query processing via a lambda application including a batch processing layer and a speed processing layer. The approach may improve speed and efficiency with respect to computation of query results associated with the batch processing layer. A method pertaining to such approach may include receiving a query including an initial timeframe and computing partial query results within the initial timeframe. The partial query results within the initial timeframe may include a result for data associated with the speed processing layer and results for a first set of data segments associated with the batch processing layer. The method further may include combining the partial query results within the initial timeframe into a final query result. The method further may include computing partial query results outside of the initial timeframe including results for a second set of data segments associated with the batch processing layer.

Abstract: Described are methods and systems to identify missing connections, facilitate establishing new connections by identifying an intermediary, and present the intermediaries and missing connections as an ordered set based on the connection criterion. According to various embodiments, the system receives a selection of a connection criterion from a first member and identifies a set of contact members. The system determines one or more contact members from the set of contact members and identifies a set of introduction members connected to the one or more contact members. The system determines one or more connected introduction members associated with the contact members. The system generates a contact order score for each contact member and causes presentation of the one or more contact members and the one or more connected introduction members based on the contact order scores.

Abstract: The embodiments described herein relate to a method and system for social awareness which may be based on social networks for knowledge exchange. More specifically, the embodiments may refer to specific social networks with social elements in the user interface based on knowledge exchange, social theory of group memberships within an enterprise or organization context. In addition, the disclosed group memberships may be predicated upon many different types of relationships. Furthermore, the social network (through a program interface) may provide to users the required specific project resources (project team members), which may be need to develop a better project performance according to the experience and knowledge of the new members. The required project team members may match with the attributes and criteria established during the project planning.

Abstract: In various embodiments, a natural language (NL) application implements functionality that enables users to more effectively access various data storage systems based on NL requests. As described, the operations of the NL application are guided by, at least in part, on one or more templates and/or machine-learning models. Advantageously, the templates and/or machine-learning models provide a flexible framework that may be readily tailored to reduce the amount of time and user effort associated with processing NL requests and to increase the overall accuracy of NL application implementations.

Abstract: Structured exploration of available data provides insight allowing early detection/analysis of emerging issues. An in-memory database engine applies specialized information sources and filter criteria to an original data set to successively produce various exploration levels. Evidence relating to a particular exploration level (e.g., resulting data subset, metadata indicating chains of information sources/filter criteria) are stored at the user's instruction within an evidence package of the in-memory database. Information sources may be licensed from third parties, and may be present in the in-memory database. To improve computer performance, embodiments may delete results of previous exploration levels outside of the evidence package. Evidence from the evidence package may be displayed to afford insight into relationships between data subsets and an emerging issue. One structured exploration references a source of geographic information (e.g.

Abstract: The present disclosure relates to querying log messages stored at log endpoints (e.g., log cores) using query strings that reference virtual fields, and generating log field views presenting aggregate information for groups of log messages that are grouped based on criteria defined in the query string.

Abstract: Dynamic generation of data catalogs may be implemented for accessing data sets in different storage locations. Data sets may be accessed in order to extract portions of data. Structure recognition techniques may be applied to the extracted data in order to determine structural information for the data sets. The structural information may then be stored as part of a data catalog for the data sets. Requests to access the data catalog from different clients may be received and the requested structural data supplied so that the clients may access different data sets utilizing the supplied structural data. Data catalogs may be updated as changes to data sets are made.

Abstract: Techniques for controlling reactivation of service functions are described. Implementations, for example, enable various ways of controlling and storing service objects that provide service functions.

Abstract: Disclosed herein is a method of converting signal values for a first expression including accessing, from the at least one of the physical memory devices, signal values for a first expression in the first view; transforming the signal values for the first expression in the first view to signal values for the first expression in the second view and storing, in the memory, the signal values corresponding to the first expression in the second view, wherein the signal values before and after the transformation correspond to content in the database. The signal values for the first expression in the first view include at least one of a symbol value, a numerical value, or an alphabetic value; and the signal values for the first expression in the second view include at least one of the following expression types: a hierarchical edge or node labeled tree.

Abstract: According to one aspect, a distributed database system is configured to manage write operations received from database clients and execute the write operations at primary nodes. The system then replicates received operations across a plurality of secondary nodes. Write operation can include safe write requests such that the database guaranties the operation against data loss once acknowledged. In some embodiments, the system incorporates an enhanced arbiter role the enables the arbiter to participate in cluster-wide commitment of data. In other embodiments, the enhanced arbiter role enables secondary nodes to evaluate arbiter operations logs when determining election criteria for new primary nodes.

Abstract: A massively parallel database management system includes an index store and a payload store including a set of storage systems of different temperatures. Both the stores each include a list of clusters. Each cluster includes a set of nodes with storage devices forming a group of segments. Nodes and clusters are connected over high speed links. The list of clusters within the payload store includes clusters of different temperatures. The payload store transitions data of a segment group from a higher temperature to a segment group in a lower temperature cluster in parallel. A node moves data of a segment in the higher temperature cluster to a corresponding node's segment in the lower temperature cluster. Once the data is written in the destination segment in the lower temperature cluster, the source segment is freed to store other data. The temperatures include blazing, hot, warm and cold.

Abstract: The present disclosure teaches solutions for patching content in database systems. In one example, a deployment package for an upgrade of a database system to a new system is received, and the content is deployed to a shared container. Shared objects are identified that are completely stored in the shared container, and partially-shared objects are identified where those objects have a shared portion in the shared container and a tenant portion in one or more tenant containers. First shared content is determined for the shared objects, while second shared content is determined for partially-shared objects. The first and second shared content is then deployed to the shared container. Local content is determined for the partially-shared objects and is deployed to each tenant container. Local content is then identified for local objects and is also deployed to each respective tenant container. Accordingly, both shared and tenant content is deployed.

Abstract: Techniques are described for dynamically synchronizing applications executed on a client device with backend systems. An example method includes identifying a triggering event associated with a request to perform a synchronization of a client application, where the request is associated with a request for a partial synchronization of the client application. A set of information defining a request context associated with the request is obtained. A set of potential partial synchronization scenarios are identified, where each of the potential partial synchronization scenarios associated with a predefined synchronization context. The request context is compared to the predefined synchronization contexts of the set of potential partial synchronization scenarios to identify a particular partial synchronization scenario corresponding to the request context.

Abstract: Systems, methods, and software are disclosed that provide enhanced replication for message services. In one implementation, updates to a replication source are replicated to replication targets. The replication is monitored to identify an individual health of the replication for each of the replication targets. A composite health of the replication is determined based on the individual health of the replication for each of the replication targets. The updates to the replication source are then controlled based on the composite health of the replication.

Abstract: Various aspects provide for implementation of a cloud service for running, monitoring, and maintaining cloud distributed database deployments and in particular examples, provides cloud based services to run, monitor and maintain deployments of the known MongoDB database. Various embodiments provide services, interfaces, and manage provisioning of dedicated servers for the distributed database instances (e.g., MongoDB instances). Further aspects, including providing a database as a cloud service that eliminates the design challenges associated with many distributed database implementations, while allowing the client's input on configuration choices in building the database. In some implementations, clients can simply identity a number of database nodes, capability of the nodes, and within minutes have a fully functioning, scalable, replicated, and secure distributed database in the cloud.

Abstract: The disclosed embodiments provide a system that manages synchronization between a profile store and a source of truth that is used to update the profile store. During operation, the system obtains a request to compare a first set of attributes from a profile for an entity in the profile store with a source of truth. During a period for delaying processing of the request, the system reduces a load on the source of truth by ignoring additional requests to compare the profile with the source of truth. After the period has passed, the system obtains a first set of attributes from the profile and a second set of attributes for the entity from the source of truth. The system then compares the first and second sets of attributes to detect and correct mismatches between the first and second sets of attributes.

Abstract: A system and method for seamless access to remotely manage documents using synchronization of locally stored documents are provided. In some embodiments, a content management server stores documents in a cache on the user's computer. Documents can thus be accessed and edited using the document in the local file system of the user and synchronized with the content management server asynchronously to access the documents on the local files system. Advantageously, the teachings of embodiments as described can be used in conjunction with content management systems for providing faster access to documents in conjunction with editing and for enabling offline work on such documents.

Abstract: Systems, devices, media, and methods are presented to identify a set of attributes, generate attribute clusters, and select data sets corresponding to relative values of the attributes within an attribute cluster. The systems and methods receive a first identifier associated with a first member profile of a first member, identifying a set of second members with second member profiles associated with the first member profile, generating a cluster for the first member profile and one or more of the second member profiles. The systems and methods generate a cluster representation with a set of cluster attributes, identify a plurality of data sets associated with a set of core attributes of the cluster attributes, and cause display of an identification of at least one data set.

Abstract: A system includes reception of a first query at a first host, determination, at the first host, that the first query is associated with a first table, the first table including geographically-restricted data and a partitioning column storing identifiers of geographic restrictions, determination, at the first host and based on the partitioning column of the first table and on the first query, a first partition of the first table and a storage location of the first partition, and execution of the first query at the first host in conjunction with the storage location of the first partition.

Abstract: Specified streets or intersections that are within a specified distance of a specified city can be found by a search, even when they are not actually in that city. For computational efficiency, some addresses are included in search results even when they exceed the specified distance from the specified city by a small amount (“false positives”). The search method guarantees that no instance of the street name within the specified distance of the specified city is erroneously missed (“false negatives”).

Abstract: The technology described herein optimally allocates the limited computer storage on the end user device to point of interest data most likely to be used by a map application. The offline point of interest data can include first-tier, second-tier, and third-tier data about different points. The offline data can be selected based on overall usage among all people and also specially tailored for individual users interests.

Abstract: A computerized search method includes receiving first input designating a first location of a first analytic. The method includes, in response to a scheduling event, obtaining a first document from the first location, identifying a first predefined label within the first document, obtaining first and second data associated with the first predefined label, storing the first datum into a value index as a current value of the first analytic, and storing the second datum into a text index as a textual description of the first analytic. The method includes presenting a search interface and, in response to receiving a search query from a user: identifying a set of result analytics relevant to the search query based on the text index and presenting, for each of the result analytics, a textual description of the analytic from the text index and a most recent value of the analytic from the value index.

Abstract: A system that generates natural language content. The system generates and maintains a dialogue state representation having a process view, query view, and data view. The three-view dialogue state representation is continuously updated during discourse between an agent and a user, and rules can be automatically generated based on the discourse. Upon a content generation event, an object description can be generated based on the dialogue state representation. A string is then determined from the object description, using a hybrid approach of the automatically generated rules and other rules learned from annotation and other user input. The string is translated to text or speech and output by the agent. The present system also incorporates learning techniques, for example when ranking output and processing annotation templates.

Abstract: Systems, methods, and devices for performing interactive question answering using data source credibility and conversation entropy are disclosed. A speech-controlled device captures audio including a spoken question, and sends audio data corresponding thereto to a server(s). The server(s) performs speech processing on the audio data, and determines various stored data that can be used to determine an answer to the question. The server(s) determines which stored data to use based on the credibility of the source from which the stored data was received. The server(s) may also determine a number of user interactions needed to obtain data in order to fully answer the question and may select a question for a dialog soliciting further data based on the number of user interactions.

Abstract: A user may apply for an account on an account registration page. The account issuer may receive a phone number of a mobile device used to apply for the account. The account issuer may transmit the phone number to a carrier integration server which may obtain user information from the wireless carrier for the mobile device. The account issuer may autofill fields on the account registration page with the user information. The user may upload a photograph of the user and an identification card. The account issuer may perform facial recognition to verify the identity of the user.

Abstract: Implementations are directed to providing an electronic document, and include receiving text content including a plurality of segments, the text content being received from data sources, determining a set of topics to be included in the electronic document, for each topic in the set of topics, providing a set of contextual words associated with a respective topic, contextual words being determined from a lexical database, each contextual word having a respective frequency, determining a score for each segment and topic pair, the score indicating a relevance of a respective topic to a respective segment, each score being determined based on respective contextual words of the respective topic and frequencies of the respective contextual words, for each topic, providing, by the one or more processors, a summary including at least one segment based on respective score, and providing, to a user device, the electronic document including one or more summaries.

Abstract: According to one embodiment, a document analysis apparatus is an apparatus comprising first document storage circuit for storing first documents that include words, belong to respective categories constituting a hierarchical structure, and only comprise opinion documents for a desirable object, and a second document storage circuit for storing second documents that include words, belong or do not belong to the categories constituting the hierarchical structure and comprise opinion documents for the desirable object and documents other than the opinion documents, and the apparatus is configured to classify, into one of the categories constituting the hierarchical structure, the second documents that do not belong to the respective categories among the second documents stored in the second document storage circuit.

Abstract: A method and system for computer-processing quotations in digital text to determine an author associated therewith is disclosed. The method comprises receiving a plurality of digital texts. The plurality of digital texts are parsed to extract one or more quotations. At least one candidate authors are identified for each of the digital text. A quotation similarity value for a given quotation with respect to each of the remaining one or more quotations is assigned. A quotation cluster is generated, which comprises one or more similar quotations and a set of candidate authors. The set of candidate authors is analyzed to identify a given candidate author meeting a condition. The candidate author meeting the condition is stored as the author of the one or more similar quotations.

Abstract: A generative adversarial networks-based or GAN-based method for learning cross-domain relations is disclosed. A provided architecture includes two coupled GANs: a first GAN learning a translation of images from domain A to domain B, and a second GAN learning a translation of images from domain B to domain A. A loop formed by the first GAN and the second GAN causes sample images to be reconstructed into an original domain after being translated into a target domain. Therefore, loss functions representing reconstruction losses of the images may be used to train generative models.

Abstract: System, apparatuses, and methods can provide customized exercise sessions and customized videos corresponding to the exercise session. Audio clips can be dynamically selected to make custom audio content for an exercise session. The audio clips and metadata can be obtained, where the audio clips correspond to categories. The exercise session can include one or more components. A destination timeline for a component can include one or more first segments that require audio, and one or more second segments that can optionally have audio. Audio clips can be selected for the various segments, where a segment can be designated for a particular category of audio clips. Identification information for the selected audio clips can be saved and used to generate the custom audio content.

Abstract: Example systems and methods represent audio using a sequence of two-dimensional (2D) Fourier transforms (2DFTs), and such a sequence may be used by a specially configured machine to perform audio identification, such as for cover song identification. Such systems and methods are robust to timbral changes, time skews, and pitch skews. In particular, a special data structure provides a time-series representation of audio, and this time-series representation is robust to key changes, timbral changes, and small local tempo deviations. Accordingly, the systems and methods described herein analyze cross-similarity between these time-series representations. In some example embodiments, such systems and methods extract features from an audio fingerprint and calculate a distance measure that is robust and invariant to changes in musical structure.

Abstract: A method of searching for videos includes receiving, by a computer device, a search query from a user computer device. The method also includes determining, by the computer device, a set of videos that satisfy the search query. The method further includes determining, by the computer device, a subset of related videos from the set using metadata to determine a relationship based on date, time, and location. The method additionally includes generating, by the computer device, a consolidated video from the subset of related videos by merging a first portion of a first one of the subset of related videos with a second portion of a second one of the subset of related videos.

Abstract: The present application discloses various video retrieval methods and apparatuses. One of the video retrieval methods comprises: determining a semantic concept group sequence according to video query information, the semantic concept group sequence comprising: at least two semantic concept groups and sequential information between different semantic concept groups therein, and each semantic concept group in the at least two semantic concept groups comprising at least one simple semantic concept; and retrieving videos at least according to the semantic concept group sequence. The technical solution provided in the present application can better meet actual application demands of complicated query of videos.