Abstract: A method for indexing data in a storage engine includes: obtaining a target transaction, the target transaction indicating a process of indexing data; determining target data in a first storage engine according to the target transaction, the target data being comprised in at least one first index table; determining, according to the first index table, at least one second index table configured in a second storage engine, the second index table being obtained by adding row numbers based on the first index table, the row numbers indicating row data in the target data, and the second storage engine supporting execution of the target transaction; and determining, according to a data index condition in the first storage engine, index data from the second index table, the index data being comprised in the target data.

Abstract: Embodiments of the present disclosure may provide a data clean room allowing secure data analysis across multiple accounts, without the use of third parties. Each account may be associated with a different company or party. The data clean room may provide security functions to safeguard sensitive information. For example, the data clean room may restrict access to data in other accounts. The data clean room may also restrict which data may be used in the analysis and may restrict the output. The overlap data may be anonymized to prevent sensitive information from being revealed.

Abstract: Provided are methods and systems for searching event sequences. An example method includes receiving a request including a sequence of queries, the sequence of queries including a first query and a second query, the second query succeeding the first query in the sequence; executing the first query over a first dataset to determine a first event; executing the second query over a second dataset to determine a second event, the second event occurring after the first event; and generating, in response to the request, a further sequence including the first event and the second event. The method may include executing the first query over the first dataset to determine a third event and verifying that the third event has occurred after the second event.

Abstract: A method may include determining that a source variable receives a source value from a source function, determining that a source statement writes, using the source variable, the source value to a column in a table, and obtaining, for a first sink statement, a first set of influenced variables influenced by the source variable. The method may further include obtaining, for a second sink statement, a second set of influenced variables influenced by the first set of influenced variables, and adding nodes to a trace graph. The method may further include determining that the first sink statement reads the source value into a sink variable including an identifier of the column, generating a modified set of influenced variables by adding the sink variable to the set of influenced variables, and reporting a defect at the first sink statement, and a defect trace using the trace graph.

Abstract: Systems, apparatuses, and methods related to image based media type selection are described. Memory systems can include multiple types of memory media. Data can be written in a type of memory media based on one or more settings applied to the data. A setting can be determined based on input received by a logic within the memory system. In an example, a method can include receiving, at logic within a memory system that comprising a plurality of memory media types, data from an image sensor coupled to the logic of the memory system, receiving input from a host, identifying one or more attributes of the data, analyzing the received input to determine an setting, generating the setting based on the analyzed input, and writing the data to a first memory media type of the plurality of memory media types based on the generated setting.

Abstract: A program stored on non-transitory computer-readable storage medium executes a method of evaluating a graph over a query. Decomposition instructions decompose the query into a plurality of subqueries. Evaluation instructions evaluate a subquery of the plurality of subqueries and generate a substitution multiset representing a result of the evaluation of the subquery. Filtration instructions or expansion instructions may operate upon the generated substitution set before passing the substitution set to a next subquery to be evaluated. The filtration instructions identify one or more mappings in the substitution multiset that cannot be safely passed to the second subquery and delete the identified one or more mappings from the substitution multiset. The expansion instructions determine, in a case where the subquery is operated upon by a non-distributive query operator, an expansion of the substitution multiset based at least on adding one or more new substitutions to the substitution multiset.

Abstract: Techniques for executing operations associated with sub-sets of queries in a set of nested queries are disclosed. A graphical user interface displays individual sub-queries as separate visual representations. Based on detecting a selection, a system executes a selected query in the set of nested queries, without executing parent queries in the set of nested queries. Based on detecting another selection, the system exports a selected query without exporting parent queries of the selected query. The system copies the metadata describing the selected query and transfers the metadata to another set of nested queries. Based on detecting another selection, the system displays a results count for a selected query. The system displays a number representing the number of results returned by the selected query, without displaying the query results.

Abstract: In some examples, before saving a file, a device analyzes contents (e.g., text and images) of the file to create a bag of words. The device performs Latent Dirichlet Allocation of the bag of words to determine topics included in the file and orders the topics in descending order of frequency. The device generates a particular name of the file based on the ordered topics and automatically save (or suggest saving) the file with the particular name. The device determines, based on the ordered topics, a folder name of a folder in which to store the file. If an existing folder has the folder name, then the device saves the file in the existing folder. If not, then the device creates a new folder with the folder name and saves the file in the new folder.

Abstract: Systems and methods are described for determining a query execution time in a data intake and query system. The system parses a query to identify different portions of the query that are executed by different components of the data intake and query system. The system determines a query execution time for the different portions of the query based on the corresponding components. Based on the query execution time of the different portions for the query, the system determines a query execution time for the query.

Abstract: An approach to parallel access of data from a distributed filesystem provides parallel access to one or more named units (e.g., files) in the filesystem by creating multiple parallel data streams such that all the data of the desired units is partitioned over the multiple streams. In some examples, the multiple streams form multiple inputs to a parallel implementation of a computation system, such as a graph-based computation system, dataflow-based system, and/or a (e.g., relational) database system.

Abstract: When a query is received by a stateful data processing service, the service determines, for each table scan (and associated operations) of a query, whether to select the table scan for execution by a stateless data processing service. The selected table scans are sent to the stateless data processing service for execution, and results are received by the stateful data processing service. The stateful data processing service may also execute other table scans of the query locally, against a local data cache. If the data is not present in the local data cache, then the stateful data processing service will copy the table data into the local data cache before executing the table scan. A query result based on the remote and/or local table scans may then be returned to the client.

Abstract: A method, a system, and a computer program product for querying graph data. A graph workspace object is identified. One or more parameters for executing a declarative language query are identified. Using the identified parameters, the declarative language query is executed on the identified graph workspace object. Based on the executed declarative language query, one or more tables responsive to a request to access graph data stored in a relational database are processed.

Abstract: A first group processing attempt may be performed on a first record group in a stream of ordered data records. The first group processing attempt may fail, and the first record group may be split into at least a second record group and a third record group. A second group processing attempt may be performed on the second record group, and a third group processing attempt may be performed on the third record group. For the second, the third and following record groups, each record group that is not processed successfully may be split into two or more other record groups and additional group processing attempts may be performed on the two or more other record groups until the error-causing record is isolated as a single record. Processing of the error-causing record may be bypassed after it is isolated as a single record.

Abstract: Systems and methods for query generation based on merger of subqueries are described. For example, methods may include accessing a first join graph representing tables in a database, wherein the first join graph has vertices corresponding to respective tables in the database and directed edges corresponding to join relationships; receiving a first query specification that references data in two or more of the tables of the database to specify multiple subqueries in a set of subqueries; checking that two or more subqueries from the set of subqueries have the same join graph; checking that the two or more subqueries have the same set of grouping columns; responsive, at least in part, to the two or more subqueries having the same join graph and the same set of grouping columns, merging the two or more subqueries to obtain a consolidated query.

Abstract: A method to develop a computer program, including providing a visual environment for building a visual representation of the computer program, the visual representation including at least one functional graphic element representing a computer operator of the program and including at least one input for supplying the operator with an incoming datum, the visual representation also including a plurality of graphic stream elements each representing a respective datum intended to be processed by the operator, and at least one instantiating graphic element connected to an input of the functional graphic element and to each of the graphic stream elements, the method also including the implementation of the computer program, during which the computer operator is instantiated a number of times equal to the number of graphic stream elements, each instance of the operator having, as incoming data, a respective datum from the data represented by the graphic stream elements.

Abstract: Caching results of sub-queries to different locations in a data store may be performed. A database query may be received that causes different storage engines to perform sub-queries to different locations in a data store that stores data for a database. The results of the sub-queries may be stored in a cache. When another database query is received, sub-queries generated to perform the other database query that are the same as one or more of the previously performed sub-queries may obtain the results of the sub-queries from the cache instead of performing the sub-queries again.

Abstract: The present invention relates to a mobile terminal capable of voice recognition and a control method thereof. A mobile terminal, according to the present invention, comprises: a user input unit for receiving an input of a search word from a user; a control unit for calculating at least one search result corresponding to a time lapse on the basis of history information related to the search word; and a display unit for outputting the calculated at least one search result corresponding to a time lapse.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of a query in a structure comprising rows in a set of tables. Next, the system applies one or more operations to existing rows in the structure to generate additional rows in additional tables of the structure. The system also tracks inputs and outputs associated with the one or more operations in a set of relationships between rows of different tables in the structure. Finally, the system uses the rows and the set of relationships to generate a final result of the query and provides the final result in a response to the query.

Abstract: Examples for graph database query classification include receiving a graph query and determining if the graph query matches benchmark data. In the event that the graph query does not match benchmark data, the query may be parsed, a canonical internal representation of the query may be determined, the representation may be mapped to a rule, and the query may be classified based on the rule. In the event that the confidence score for the query classification does not exceed a threshold, the query may be sent to a synthetic graph or synopsis for simulation. In some examples, the simulation may include selecting computationally expensive graph operators in the query for simulation.

Abstract: Techniques are described for generating and re-using reachability graphs for efficient execution of queries. In an embodiment, a query is received for execution on a data graph. Such a query may include one or more expressions for edges in the data graph, which when executed select one or more paths in the data graph to generate results for the query. The system uses a repository to store reachability graphs and may determine whether a reachability graph for an expression of the query for the data graph is stored in a repository. Such a reachability graph is generated by applying the expression on the data graph to qualify or disqualify the edges in the data graph to be included as part of edges of the reachability graph. For example, an edge in a reachability graph exists between two vertices when at least one edge of the data graph has qualified between two vertices of the data graph that correspond to the two vertices of the reachability graph.

Abstract: Embodiments provide a method to collect aggregate information or usage data quickly and efficiently with minimal lag. Additionally, the system can use this aggregate information internally for improved load balancing, better data placement, optimization, and enhanced debugging. The system can quickly look at aggregate information across a huge amount of data and drill down cheaply because the aggregate information is generated using existing processes. Aggregated statistics storage and collection may be built on top of an LSM tree used to store a persistent index for a cloud storage system. The statistics may also represent the result of an operation (e.g., max, min, sum, average) on selected parameter(s) or attribute(s) of stored data. Aggregate statistics values may be efficiently maintained during index merge and garbage collection processes or any other index management. As delta LSM trees are merged into a base LSM tree, the aggregates are updated in delta fashion.

Abstract: Unique systems, methods, techniques and apparatuses for ranking and applying industrial analysis search results are disclosed. One exemplary embodiment is a computer implemented method comprising receiving a request to rank potential combinations of the data set and the plurality of data analysis tools; tagging the plurality of data analysis tools with one or more metadata tags selected from a plurality of metadata tags; tagging the data set with one or more metadata tags selected from the plurality of metadata tags; scoring a plurality of potential combinations of the data analysis tool and the plurality of data sets according to correspondence between the metadata tags tagged to the data analysis tool and the metadata tags tagged to each of the plurality of data sets; and outputting a user perceptible ranking of the plurality of potential combinations indicating the scoring.

Abstract: A system for query execution and planning with pipelining and shared states for query operators is provided. In some implementations, the system performs operations comprising identifying a plurality of operators for executing a query and generating an indication that a first operator and a second operator share information when the first operator and the second operator require the same data which is not present when the query is received. The operations can further include executing the first operator to generate at least a portion of the data, storing the data in a location based upon the indication, and providing, based upon the indication, the stored data for the second operator. Related systems, methods, and articles of manufacture are also described.

Abstract: Systems and methods for generating real-time, personalized recommendations are disclosed. In one embodiment, a method operates upon an electronic data collection organized as a network of vertices and edge connections between the vertices. The method provides the recommendations includes iteratively traversing across edges that satisfy search criteria to a new set of vertices and filtering each new set of vertices to satisfy the search criteria. At the conclusion of the traversing and filtering, a final set of vertices represents the recommended entities. In some embodiments, a control vector describes a sequence of relationships between a requester and the items to be recommended. The method can assign scores to candidate recommendations and select the recommendations having the highest scores. Advantageously, the method provides flexibility and rapid execution of recommendation queries without the need to precompute intermediate results.

Abstract: Techniques are described herein for computing columnar information during join enumeration in a database system. The computation occurs in two phases: the first phase involves a pre-computational phase that is only run once per query block to initialize and prepare a set of data structures. The second phase is an incremental approach that takes place for every query sub-plan. Upon completion of the second phase, the generated projected attributes of a query sub-plan are associated as columnar information associated with the query sub-plan, and used to compute the query execution cost. Subsequently, based on the computed query execution cost, the query sub-plan may be executed as part of the query execution plan.

Abstract: Techniques and systems for determining locations of devices using location data sources are provided. For example, a network device, method, and computer-program product may be provided. In one example, a method may include receiving, on a computing device, a request to locate a device, wherein the request includes an identifier of the device. The method may further include receiving a communication from the device, wherein the communication includes the identifier of the device, and obtaining a location of the device. The method may further include transmitting the location of the device and the identifier of the device to a server, wherein the server is configured to use the location of the device and the identifier of the device to send a response to the requestor of the request.

Abstract: In an example, a graph structure and flat data corresponding to the graph structure are obtained, the graph structure containing a plurality of nodes. Stop words are removed from one or more search terms to obtain modified search terms. For each of the modified search terms, the pieces of data from the flat data are searched to locate one or more matching pieces of data from the flat data, wherein a piece of data from the flat data matches if it contains at least one attribute with a value that is similar to the modified search term. This information is used to calculate fuzzy match scores for each matching piece of data from the flat data.

Abstract: A method includes receiving, via a processor, a query comprising pathway variables and at least one evaluation time and determining an anchor set based on at least one of the pathway variables. The method also includes translating the pathway variables into a pathway algebraic expression based on the anchor set and the at least one evaluation time, and executing the pathway algebraic expression on a graph database to return a pathway set.

Abstract: In one respect, there is provided a distributed database system that includes hosts configured to store and/or manage data, a first query processing engine comprising a master node and an executor node, and a second query processing engine. The master node can be implemented on programmable processors and configured to perform operations. The operations can include: offloading, to the second query processing engine, a creation of a first and a second table such that the first and the second table are partitioned by the second query processing engine; generating an execution plan for a query on data in the distributed database system, the execution plan including a distributed join operation that combines data from the first and second table; determining to push down, to the second query processing engine, the distributed join operation; and dispatching, to the executor node, a portion of the execution plan including the distributed join operation.

Abstract: Aspects of the present disclosure provide techniques for executing requests in an object schema-based application programming interface (API) based on union relationships between data objects. Embodiments include receiving an API query from a client application. The API query identifies a navigable path through a graph projection of the API and includes a plurality of nodes in the graph. One or more data objects to resolve in order to satisfy the API query are identified based on an object schema associated with each node in the query. For each respective data object of the one or more data objects, one or more services associated with properties of the respective data object are identified, and one or more subqueries are generated to the services to satisfy the properties of the respective data object. The subqueries are transmitted to the identified services for execution, and a result of the API query is returned.

Abstract: Information about physical places is gathered to develop quality scores for targeting advertisements to users of mobile devices sharing geographic location events with service providers. A scoring model incorporates selected attributes about places (e.g., created by a service provider vs. user-generated, category, keywords, census data providing population density by location, property values by area, popularity, special events, government vs. private area, whether place is associated with a brand, chain, or is independent) that have been gathered from multiple sources, verified, and normalized. Advertisements are targeted to users running mobile applications based on a location event shared with the service provider using the quality score for the place indicated in the location event in addition to other attributes of the place. In one embodiment, the system uses a machine learning algorithm to analyze conversion rates of targeted advertising to provide feedback to the scoring model.

Abstract: In one embodiment, one or more systems may receive input from a user identifying an interactive region of a physical environment. The one or more systems may determine a location of the interactive region relative to a depth sensor and monitor, at least in part by the depth sensor, the interactive region for a predetermined event. The one or more systems may detect, at least in part by the depth sensor, the predetermined event. In response to detecting the predetermined event, the one or more systems may initiate a predetermined action associated with the predetermined event.

Abstract: A graphics processor performs interleaved graphics processing wherein the interleaved graphics processing comprises performing one or more processing operations to generate one or more sub-regions of a first set of graphics data, and performing one or more further processing operations to generate one or more sub-regions of a second set of graphics data that are dependent on the one or more sub-regions of the first set of graphics data prior to performing one or more processing operations to generate one or more further sub-regions of the first set of graphics data.

Abstract: A method for providing database management system support to a source application configured to operate with a source database management system Is provided. The method comprises detecting database management system communications issued by the source application to the source database management system; and responsive to said database management systems communications, impersonating the source database management system to the source application.

Abstract: One or more processors initiate generation of an identifier based on the definitions of both a primary range and a secondary range. One or more processors obtain a unique sequence value from a unique sequence range of known maximum number of values. One or more processors calculate an offset value based on, at least in part, the primary range and the secondary range. One or more processors add the offset value to the unique sequence value to generate an identifier value.

Abstract: Disclosed is a system, method, and computer program product for relating a metadata tag to a television program identifier and associating a hashtag with metadata associated with the television program. A mapping server receives a request that includes a metadata tag (e.g., a hashtag) for a social object, such as a comment or a post to a social network. The mapping server generates a graph to determine a set of television program identifiers likely associated with the metadata tag. Furthermore, the mapping server compresses graph data over time to reduce the time needed to perform a query to the graph.

Abstract: In a multiprocessor data processing system having a distributed shared memory system, first and second nested memory transactions are executed, where the first memory transaction is a rewind-only transaction (ROT) and the second memory transaction is a non-ROT memory transaction. The first memory transaction has a transaction body including the second memory transaction and an additional plurality of transactional memory access instructions. In response to execution of the transactional memory access instructions, memory accesses are performed to the distributed shared memory system. Conflicts between memory accesses not within the first memory transaction and at least a load footprint of any of the transactional memory access instructions preceding the second memory transaction are not tracked.

Abstract: A digital repository 20 includes data items. A user can add additional functionality or program routines to data item by including as a data item a data processing identifier pointing to at least one data processing routine. Such routines are accessed by a client 22 by sending from a client to the digital repository 20 a request to access a data item, wherein the repository provides an interface description document 32 from the digital repository 20 to the client 22 as the response to the request. The client 22 can then transmit a data processing request from the client to a service 26 identified by the data processing identifier of the interface description document 32, the data processing request including the identifier from the interface description document.

Abstract: The invention provides for verifying correctness of a database system. A SQL instruction is received and access paths of the received SQL instruction are extended. The SQL instruction is executed by using the extended access paths, and the correctness of the database system is verified according to results of executing the SQL instruction. With the method and system of the invention, the object of verifying correctness of a database system by automatically extending access paths of SQL statement may be achieved, and the object of verifying correctness of a database system scientifically, effectively and purposefully based on ratio of error or defect present in database itself due to various data manipulation approaches (different values of access path elements) may also be achieved.

Abstract: A database back end system includes a monitoring server operable to poll a first database for a first query running on the first database and add the first query to a query list in a second database, and a reporting server operable to normalize the first query, analyze the second database to find a second query in the query list, wherein the second query is found based upon the normalized first query, and report the second query to a user, wherein the reporting is based upon the analyzing of the second database to find the second query.

Abstract: Disclosed is an improved approach for implementing an on-demand scheduler in a mobile device and the structures to support realtime on-demand schedulers. A lightweight word-based structure is disclosed for storing scheduling-related data on the mobile device. Using this lightweight word-based structure enables on-demand and real-time scheduling. This type of lightweight structure also permits scheduling activities to be performed in a disconnected mode, which can then be later synchronized with the server to confirm the booking In addition to appointment scheduling, this technique can also be implemented for scheduling of any type of resource.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying central entities. In one aspect, a method includes obtaining candidate entities for a first resource; filtering a first entity graph whose nodes represent different entities found in a plurality of resources to remove nodes that do not correspond to a candidate entity, wherein pairs of nodes in the filtered first entity graph that are connected by an edge correspond to pairs of candidate entities that are associated with the same resource; generating a second entity graph for the first resource from the filtered first entity graph, wherein the second entity graph does not include nodes from the filtered first entity graph that are not connected to other nodes in the filtered first graph; and identifying candidate entities that are represented by nodes in the second entity graph as being central entities for the first resource.

Abstract: A system, a method and a computer product are disclosed. The method includes using at least one domain ontology including a plurality of domain models connected through mappings to a plurality of data sources, the data sources storing data to be accessed by the query; receiving a query by a query formulation unit; evaluating at least one of a language for defining at least one of the domain models involved in the query, a language of mappings involved in the query and a language of the query and selecting a query answering mode in accordance with results of the evaluation and retrieving an answer meeting at least one query condition from the data sources.

Abstract: A method for encrypting a database includes the following step. Keywords in the database are encrypted to obtain encrypted search tags for the keywords. A table of reverse indices is generated for the encrypted search tags. A table of cross keyword indices is generated. A method for searching in an encrypted database includes the following steps. A search is formulated as a conjunct of two or more atomic search queries. One of the conjuncts is selected as a primary atomic search query. Search capabilities are generated for a secondary atomic search query using the primary atomic search query and the secondary atomic search query. Such methods mask query data and the actual composition of the database to reduce computation complexity and privacy leakage.

Abstract: Methods and systems are provided for processing social media data. The method includes receiving a request from a user for social media analytics of social media data; sending the social media data to a first analytics provider and a second analytics provider; receiving first analytics data from the first data analytics provider and second analytics data from the second analytics provider; storing the first analytics data and the second analytics data in a database; and presenting the first analytics data and the second analytics data to the user.

Abstract: A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, decomposing the input query into a plurality of different subqueries, and conducting a search in one or more data sources to identify at least one candidate answer to each of the subqueries. A ranking function is applied to each of the candidate answers to determine a ranking for each of these candidate answers; and for each of the subqueries, one of the candidate answers to the subquery is selected based on this ranking. A logical synthesis component is applied to synthesize a candidate answer for the input query from the selected the candidate answers to the subqueries. In one embodiment, the procedure applied by the logical synthesis component to synthesize the candidate answer for the input query is determined from the input query.

Abstract: Systems and methods offer a search system with third-party provided search applications that are triggered in response to specified queries and run at the search system. For example, a method may include determining that a query triggers a third party search application hosted at the search system, extracting a parameter from the query based on a query template, executing the third party search application with the parameter in a sandboxed manner at the search system to generate a third-party formatted answer for the query, and providing the third-party formatted answer as a search result for the query. The third party may provide the query template, parameter attributes, and the third party formatted answer. The third party search application may be stored at the search system and include the query template, a data store, the parameter attributes, and instructions for accessing the data store using the parameter.

Abstract: This invention relates to methods for storing and searching data. Embodiments of the invention make use of suffix trees to support binary pattern matching. Embodiments of the invention can be shown to have comparable search speeds to searches of known suffix trees, but are advantageous in that they have lower memory usage requirements which is important in large data environments.

Abstract: In interactive content search through comparisons, a search for a target object in a database is performed by finding the object most similar to the target from a small list of objects. A new object list is then presented based on the earlier selections. This process is repeated until the target is included in the list presented, at which point the search terminates. A solution to the interactive content search problem is provided under the scenario of heterogeneous demand, where target objects are selected from a non-uniform probability distribution. It has been assumed that objects are embedded in a doubling metric space which is fully observable to the search algorithm. Based on these assumptions, an efficient comparison-based search method is provided whose cost in terms of the number of queries can be bounded by the doubling constant of the embedding c, and the entropy of demand distribution, H.

Abstract: Systems and methods for identifying which video segment is being displayed on a screen of a television system. The video segment is identified by deriving data from the television signals, the derived data being indicative of the video segment being displayed on the screen. This feature can be used to extract a viewer's reaction (such as changing the channel) to a specific video segment (such as an advertisement) and reporting the extracted information as metrics. The systems and methods may further provide contextually targeted content to the television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed.