Class / Patent application number | Description | Number of patent applications / Date published |
707774000 | Nested queries | 42 |
20100049771 | METHOD FOR PROVIDING CONTENTS REFERENCING INFORMATION FOR PERSONAL DATA BROADCASTING SERVICE AND RECEIVING APPARATUS AND PROCESSING METHOD - There is a provided a method for providing contents referencing information (CRI) for personal data broadcasting service, including the steps of: searching a program identifier (PID) having a CRI section, and searching a container having a specific identifier; extracting container data from the searched container; searching a CRI structure which indicates a contents referencing information identifier (CRID) list from the extracted container data; searching and extracting CRID data based on a CRID data container which represents an identifier of the container having the CRID data in the CRID list of the searched CRI structure; and searching and extracting result data for the extracted CRID from a result locator. | 02-25-2010 |
20100169370 | Kstore event manager using triggers for K - The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. A KStore event manager monitors events and polls for KStore state. When triggered by user-defined conditions or receiving notification that a specified event has occurred, a specified response can be executed. An event/condition/response is defined through a KStore event wizard. When a triggering condition is detected or a notification of an event is received, a user-defined action or sequence of actions is performed automatically, without further user interaction. | 07-01-2010 |
20100169371 | Types of nodes in a kstore - The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. Nodes in a KStore are typically comprised of at least four fields, including a pointer to an asCase node, a pointer to an asResult node, a pointer to an asCaseList and a pointer to an asResultList. Because either an asCaseList or an asResultList but not both will exist in any particular node, two new node types are created, one node comprising a node with an asCase pointer, an asResult pointer and asCaseList pointer but not including a pointer to an asResultList and one node with a pointer to an asCase node, and asResult node and an asResultList but not including a pointer to an asCaseList. Alternatively, a single node structure may exist with a pointer to a list in one field and an indicator stored in another field that indicates directly or indirectly whether the list pointed to is an asCaseList or an asResultList. | 07-01-2010 |
20100169372 | Adding and subtracting kstores - The KStore is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. One KStore can be added to an existing KStore to create an updated KStore by traversing the trees of the KStores and incrementing the count fields to reflect the added counts of analogous nodes. New KStore structure is added as needed. A KStore can be subtracted from an existing KStore to create an updated KStore by traversing trees KStores and decrementing the count fields in the updated KStore to reflect the subtracted counts of analogous nodes. KStore structure is removed as needed. Portions of a KStore can be added or subtracted from another KStore by isolating the paths to be used for updating. Instead of incrementing or decrementing counts, a dataset of individual records can be recreated from the KStore. | 07-01-2010 |
20100169373 | Updating values of elemental root nodes in kstore - The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. Values of elemental root nodes within a KStore can be changed without requiring the KStore to be rebuilt. The elemental root node whose value is to be altered is identified, and the new value is inserted directly into the node or in the area identified by the pointer to the node value within the node. Values can include those needed to recognize user data and/or values for elemental root nodes used internally within the KStore structure. Values of the elemental root nodes can be updated after the instantiation of the KStore and the population of the KStore. | 07-01-2010 |
20100318566 | BEHAVIOR HISTORY RETRIEVAL APPARATUS AND BEHAVIOR HISTORY RETRIEVAL METHOD - A meta classification section assigns the degree of accuracy capable of identifying an individual to person feature information containing a face, color, shape, etc., and person passage information and stores the metadata of the person feature information and the person passage information for each degree of accuracy, a discrete retrieval section retrieves the person to be retrieved in the high accuracy metadata stored by the meta classification section, a dependence determination section determines a person having a dependence on the person to be retrieved using a plurality of retrieval results hit in the discrete retrieval and the high accuracy metadata, a query generation section regenerates a retrieval key from the identifier of the person having a dependence and the identifier of the person to be retrieved, and a discrete candidate-to-candidate retrieval section retrieves the person corresponding to the regenerated retrieval key in the low accuracy metadata. | 12-16-2010 |
20100332538 | HARDWARE ACCELERATED TRANSACTIONAL MEMORY SYSTEM WITH OPEN NESTED TRANSACTIONS - Hardware assisted transactional memory system with open nested transactions. Some embodiments described herein implement a system whereby hardware acceleration of transactions can be accomplished by implementing open nested transaction in hardware which respect software locks such that a top level transaction can be implemented in software, and thus not be limited by hardware constraints typical when using hardware transactional memory systems. | 12-30-2010 |
20110093500 | Query Optimization - A new database design is implemented in which everything in the database is modeled with primitives, including the links and nodes for a graph tuple store. A query syntax provides a nested tree of constraints with a single global schema. Various optimization techniques for queries and replication techniques are also 10 described. | 04-21-2011 |
20110153662 | MANAGING QUERIES - Managing queries performed on one or more data sources includes: storing at least a first query in a storage medium; selecting the first query for processing; instructing a query engine to process the first query on a first portion of data in the one or more data sources for a first query interval; receiving result data from the query engine based on processing the first query on the first portion of data; saving a state of the first query in the storage medium after the first query interval; instructing the query engine to process a second query during a second query interval after the first query interval; and instructing the query engine to process the first query on a second portion of data in the one or more data sources during a third query interval after the second query interval. | 06-23-2011 |
20110184981 | Personalize Search Results for Search Queries with General Implicit Local Intent - One particular embodiment accesses a first set of search queries comprising one or more first search queries; extracts one or more features based on the first set of search queries, trains a search-query classifier using the features; accesses a second search query provided by a user; determines whether the second search query has implicit and general local intent using the search-query classifier; if the second search query has implicit and general local intent, then determines a location associated with the user; and identifies a search result in response to the second search query based at least in part on the location associated with the user; and presents the search result to the user. | 07-28-2011 |
20110213802 | PARALLEL DATA STREAM PROCESSING SYSTEM - A method and a system process a stream of data in parallel across a plurality of nodes. The log processing system has a log module, a query language module, and a query processing module. The log module receives and organizes the stream of data into a sequential and nested data structure. The query language operator module defines operators that operate on the sequential and nested data structure. The query processing module processes in parallel across a plurality of nodes a query based on an operator on the stream of data. | 09-01-2011 |
20110307516 | APPARATUS AND METHOD FOR SEARCHING FOR CONTENT IN A PORTABLE TERMINAL - An apparatus and a method in a portable terminal allow searching for content and provide a function which re-searches and classifies the searched content based on a time line. A 4D data search unit outputs a time setting menu for changing a time line after searching for content corresponding to a keyword, and re-searches for the searched content based on the changed time line that corresponds to a rotation of the time setting menu. | 12-15-2011 |
20120143912 | EXTENDING LEGACY DATABASE ENGINES WITH OBJECT-BASED FUNCTIONALITY - Legacy database engines may be extended through the use of callback extension handlers on the client. For example, regular expression matching and arbitrary user-functions may be implemented in a legacy database engine without replacing the engine. A pattern string may be provided to the legacy database engine by a client with a pattern matching prefix. When the legacy database engine encounters the prefix, the database engine executes a callback to the client with a value from the database for pattern matching. The client performs the pattern matching through, for example, regular expressions, and returns a match status to the database engine. The process may be repeated for several rows of a table in the database and a dataset compiled by the database engine and returned to the client. | 06-07-2012 |
20120185507 | PROVIDING QUERY COMPLETIONS BASED ON DATA TUPLES - Data, such as product data or airline flight data, is represented using structured data tuples, tables, or as data with related metadata and tags, and stored by a search engine. Partial queries are received by the search engine from a user and are used to generate a dialog between the search engine and the user. The dialog may include suggested query completions for the partial queries that correspond to a schema associated with the data tuples. The suggested query completions may be determined using attribute combinations of attributes and attribute values, or metadata and tags associated with the data tuples, including known synonyms and misspellings. The user may interact with the query completions in the dialog, and the search engine may revise the dialog and the query completions according to the interactions. A user may query data tuples without knowing the schema used by the underlying data structures. | 07-19-2012 |
20120197938 | SEARCH REQUEST CONTROL APPARATUS AND SEARCH REQUEST CONTROL METHOD - A search request control apparatus includes a processor to execute a process. The process includes splitting a search request set, which contains a plurality of search requests acquired in a predetermined period, into subsets in accordance with a degree of overlap of data searched by each of the search requests, calculating an average response of the search requests contained in the search request set in accordance with a processing order of the subsets that are obtained through the splitting, and processing collectively in accordance with the processing order, search requests contained in a plurality of subsets having a minimum average response calculated. | 08-02-2012 |
20120233212 | METHODS AND SYSTEMS FOR PROCESSING SOCIAL MEDIA DATA - 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. | 09-13-2012 |
20120296938 | Query and Matching for Content Recognition - Various embodiments enable audio data, such as music data, to be captured, by a device, from a background environment and processed to formulate a query that can then be transmitted to a content recognition service. In one or more embodiments, multiple queries are transmitted to the content recognition service. In at least some embodiments, subsequent queries can progressively incorporate previous queries plus additional data that is captured. In one or more embodiments, responsive to receiving the query, the content recognition service can employ a multi-stage matching technique to identify content items responding to the query. This matching technique can be employed as queries are progressively received. | 11-22-2012 |
20130054644 | INFORMATION PROCESSING METHOD AND PROGRAM FOR REGISTERING SPECIAL DAY AND INFORMATION PROCESSING APPARATUS - An information processing apparatus has a storage section in which an expression pattern table and a special day data table are registered, a plurality of expression patterns being stored in the expression pattern table, the expression pattern expressing a periodical special day using a first character variable expressing a name of the special day and a second character variable expressing a day, a plurality of generic names of the special day being stored in the special day data table, a communication section for transmitting and receiving document data, an analysis section for performing a morpheme analysis and a syntax analysis to the document data transmitted or received by the communication section, and a search section for performing a first search and a second search to the document data based on analysis results of the analysis section. | 02-28-2013 |
20130117310 | SYSTEMS AND METHODS FOR GENERATING AND DISPLAYING HIERARCHICAL SEARCH RESULTS - Embodiments include a computer-implemented method that includes receiving a search query, processing the search query to identify a set of search results, determining that the set of search results includes a parent search result corresponding to a parent entity, in response to determining that the set of search results includes a parent search result, identifying a set of child search results including one or more child search results that correspond to entities that are children of the parent entity, and providing a hierarchical search results list for display. The hierarchical search results list including a first listing of search results corresponding to the set of search results, and a second listing of search results corresponding to the set of child search results. The second listing to be displayed in hierarchical relation to a search result corresponding to the parent search result. | 05-09-2013 |
20130173662 | DEPENDENCY BASED PRIORITIZATION OF SUB-QUERIES AND PLACEHOLDER RESOLUTION - A search tool determines a plurality of sub-queries from a query submitted to the search tool. For each of the plurality of sub-queries, the search tool determines dependencies among the plurality of sub-queries using dependency information. The dependency information indicates dependencies among the plurality of sub-queries based on structure of a plurality of data sources and/or structures of a plurality of data views provided by the search tool. Placeholders for expected results of at least a subset of the plurality of sub-queries that are dependent sub-queries are created. The placeholders are registered with a distribution service using the placeholder identifiers. For each of the subset of the plurality of sub-queries, a modified sub-query that indicates the identifier for the placeholder that corresponds to the sub-query is generated. The modified sub-queries are submitted to the plurality of data sources in accordance with the dependencies. | 07-04-2013 |
20130198233 | INTEGRATED REPOSITORY OF STRUCTURED AND UNSTRUCTURED DATA - Methods, program products, and systems implementing integrated repository of structured and unstructured data are disclosed. An integrated environment is provided for accessing, structured data (e.g., data of a relational database) and unstructured data (e.g., data stored in a text or binary file), including creating, managing, modifying, and searching the structured data and unstructured data. The integrated environment can include an integrated user interface, a set of commands and application programming interface (API), and storage for a relational database and a document repository. The integrated environment can include a database abstraction layer that allows database operations on both the structured data and the unstructured data. | 08-01-2013 |
20130204896 | PARALLEL PROCESSING OF CONTINUOUS QUERIES ON DATA STREAMS - A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added. | 08-08-2013 |
20130212128 | METHODS AND APPARATUS FOR QUERYING A RELATIONAL DATA STORE USING SCHEMA-LESS QUERIES - The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data. | 08-15-2013 |
20130246462 | AUTONOMIC CACHING FOR IN MEMORY DATA GRID QUERY PROCESSING - A method, system and computer program product for autonomic caching in an IMDG has been provided. A method for autonomic caching in an IMDG includes receiving from a client of the IMDG a request for a primary query in the IMDG. The method also includes associating the primary query with a previously requested sub-query related to the primary query. Finally, the method includes directing the sub-query concurrently with a directing of the primary query without waiting to receive a request for the sub-query from the client. In this way, the method can proactively predict a receipt of the request for a sub-query following a request for a primary query prior the actual receipt of the request for the sub-query. | 09-19-2013 |
20130282759 | METHOD AND SYSTEM FOR PROCESSING SEARCH QUERIES - A method, a system, and a computer program product for processing search queries are disclosed. A first query pertaining to a primary theme is received. One or more secondary queries are then generated. Each of the one or more secondary queries is associated with a corresponding plausible secondary theme. The first query and the one or more secondary queries are then submitted to a search engine. | 10-24-2013 |
20130332486 | SYSTEM AND METHOD FOR SIMPLIFYING DATA ACCESS BETWEEN TIERS IN A MULTI-TIER SYSTEM - A system and method for simplifying data access between tiers in a multi-tier system is disclosed. In an embodiment, a method is provided for receiving a request for service from a browser at a generic data access object (GDAO) layer; generating, by use of a data processor, a single, shared, generic data transfer object (GDTO) at the GDAO layer; calling through to a database tier, the database tier providing database metadata; and using the database metadata to include result data in the GDTO and return the GDTO in response to the request. | 12-12-2013 |
20130346445 | AUGMENTING QUERIES WHEN SEARCHING A SEMANTIC DATABASE - A method and system for identifying results of a query that includes a type predicate is provided. A search system maintains a collection of facts that includes a triple for each fact and a type table that maps entities of the facts to their corresponding type. The search system uses the type table to speed up the process of identifying the search results when the query includes a non-type query triple and a type query triple. A type query triple is a triple that has a type predicate, rather than a non-type predicate. To execute a query that contains a non-type query triple and a type query triple, the search system identifies the triples of the collection that match the non-type query triple. The search system then uses the type table to determine which of the identified triples match the type query triple for inclusion in the search results. | 12-26-2013 |
20130346446 | PARALLEL PROCESSING OF CONTINUOUS QUERIES ON DATA STREAMS - A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added. | 12-26-2013 |
20140095540 | MECHANISM TO CHAIN CONTINUOUS QUERIES - Techniques for implementing mechanisms for chaining continuous queries are provided. In some examples, results of a first continuous query may be stored in a data object. For example, the first continuous query may be configured to process business event data and store the results in the data object. Additionally, a second continuous query may then be processed based at least in part on the results stored in the data object. | 04-03-2014 |
20140095541 | MANAGING RISK WITH CONTINUOUS QUERIES - Techniques for managing risks with continuous queries are provided. In some examples, a selection of a data object enabled to provide a real-time stream of business event data may be received. The selection may be received by a user associated with the business event data. Additionally, a continuous query language query may be generated. The query may be configured to monitor the real-time stream of business event data for a first metric. In some examples, the a risk indicator associated with a second metric that affects the first metric may be identified. Output events of a pre-existing continuous query language query may be listened to. Further, a real-time visualization of the first metric and/or the second metric may be provided. | 04-03-2014 |
20140101200 | Metric Gathering and Reporting System for Identifying Database Performance and Throughput Problems - 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. | 04-10-2014 |
20140108453 | METHOD FOR ADAPTIVE CONVERSATION STATE MANAGEMENT WITH FILTERING OPERATORS APPLIED DYNAMICALLY AS PART OF A CONVERSATIONAL INTERFACE - A system and method of processing a search request is provided. Identification of a desired content item is based on comparing a topic of the search request to previous user input. The method includes providing access to a set of content items with metadata that describes the corresponding content items and providing information about previous searches. The method further includes receiving a present input from the user and determining a relatedness measure between the information about the previous searches and an element of the present input. If the relatedness measure is high, the method also includes selecting a subset of content items based on comparing the present input and information about the previous searches with the metadata that describes the subset of content items. Otherwise, the method includes selecting a subset of content items based on comparing the present input with the metadata that describes the subset of content items. | 04-17-2014 |
20140172914 | GRAPH QUERY PROCESSING USING PLURALITY OF ENGINES - Graph queries are processed using a plurality of independent query execution engines. A graph query submitted to a graph database which is modeled by an attributed graph is received. The graph query is decomposed into a plurality of query components. For each of the query components, a one of the query execution engines that is available to process the query component is identified, a sub-query representing the query component is generated, the sub-query is sent to the identified query execution engine for processing, and results for the sub-query are received from the identified query execution engine. The results received are then combined to generate a response to the graph query. | 06-19-2014 |
20140280338 | DISTRIBUTED NETWORK ANALYTICS - In an embodiment, a method comprises receiving, at an analytics engine, from a separate analytics application, an analytics query for data that is potentially available in data streams of networked computing devices; sending, to a distributed network analytics controller, sub-queries based on the analytics query; determining distributed network analytics agents capable of executing each of the sub-queries; sending instructions to the agents to initiate the sub-queries for the data at specified locations; initiating execution of the sub-queries on data streams that are locally available at one of the networked computing devices at which the agents are running; forming summarized data streams and zero or more raw data streams at the networked computing devices having the analytics agents; sending the summarized data streams and the zero or more raw data streams to the analytics engine; wherein the method is performed by computing device(s). | 09-18-2014 |
20140304302 | COMPUTER SYSTEM AND METHODS FOR PERFORMING DATA-DRIVEN COORDINATION - A computer system and computer implemented method that obtains coordinated results from at least two queries by utilizing context data of each query. Specifically, the computer system and computer implemented method facilitates enhanced querying functionality by matching entangled queries to achieve coordinated results. | 10-09-2014 |
20140310312 | IDENTIFYING CONTEXTUAL RESULTS WITHIN ASSOCIATIVE MEMORIES - A system including an associative memory and an input device configured to receive a first query or comparison request. The associative memory is configured to: responsive to receiving the first query or comparison request, locate an entity value having an attribute value matching a term of the first query or comparison request; responsive to locating the entity value, return a first list of results including the entity value; add, as a required search term, at least one of first results from the first list to a second query or comparison request, the second query or comparison request further including all terms of the first query or comparison request; perform the second query or comparison request and, as a result, return a second list of resource references; use the second list to retrieve source data; combine the entity value with the source data to form a combination; and return the combination. | 10-16-2014 |
20140372480 | INTERACTIVE CONTENT SEARCH USING COMPARISONS - 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. More precisely, the present principles show that the average search costs scales C | 12-18-2014 |
20150026212 | THIRD PARTY SEARCH APPLICATIONS FOR A SEARCH SYSTEM - 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. | 01-22-2015 |
20160110415 | USING QUESTION ANSWERING (QA) SYSTEMS TO IDENTIFY ANSWERS AND EVIDENCE OF DIFFERENT MEDIUM TYPES - First, a computer may receive an input query of a first medium type. The input query may then be analyzed. Based on the analysis, the input query may be categorized as being associated with at least a second medium type. A first-medium-type search of a set of corpora may then be performed. Based on the results of the first-medium-type search, a candidate answer of the first medium type may be generated. In response to the categorizing, a second-medium-type search of the set of corpora may also be performed. | 04-21-2016 |
20160117412 | RECURSIVE EXTRACTION AND NARRATION OF NESTED TABLES - Machine logic (for example, software) that performs the following steps: (i) providing a parent table including a set of nested table(s) so that the parent table has N levels of nestedness, with N being an integer greater than one; and (ii) extracting a first nested table at the Nth level of nestedness where N is an integer equal to or greater than one, with a value of one representing the root table, and with greater values representing tables nested within the root table; and (iii) replacing the first nested table with equivalent narration text. Software is agnostic with respect to parent tables having different structural patterns, different file formats, and/or different cell layouts. | 04-28-2016 |
20160162538 | PLATFORM FOR CONSULTING SOLUTION - Receiving a first model associated with a user, a generic model of a generic domain, and a specific domain having an associated domain-specific corpus. A first set of query terms based on elements of the first model, and a second set of query terms based on elements of the generic model, are determined. A third set of query terms is generated based on the first and second sets of query terms. The domain specific corpus is queried using the third set of query terms, and a domain specific model is generated based on results of the querying. | 06-09-2016 |
20180025058 | TECHNIQUE FOR PROCESSING QUERY IN DATABASE MANAGEMENT SYSTEM | 01-25-2018 |