Abstract: A system and method is provided for partitioning a global index into multiple index datasets to house indexes and their index values. The index datasets may be stored in initialized physical index areas that are distinct from a standard physical index area.

Abstract: In a database system, names and namespace of XML nodes are computed from path ids. The path ids are constructed from tokens, each of which represents a particular name or namespace-name pair.

Abstract: A system for providing answers to questions presented in the form of electronic signals representing natural language words conveyed to said system by way of a network connected to a computer. The system includes a plurality of search indexes relating to a field of knowledge, each in a specific natural language. A store house of natural words is associated with each one of the search indexes, in which a list of natural words is maintained in an order reflecting the usage frequency of said words in that list. In addition, a language storehouse of natural words common to each of the search indexes associated each with a specific natural language. The search index includes a list of score ordered keywords, indexed answer items each associated with an internal list of references (ILOR) pointing to it, and a list of ordered numerical references associated with each of the ordered keywords. Each such reference represents quantitatively an association between the keyword and an indexed answer item.

Abstract: A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table.

Abstract: A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table.

Abstract: A search server system having one or more processors and memory receives a first search query from a client and, in response, generates a first set of search results corresponding to the first search query by searching in a first set of one or more index portions and generates a query cursor indicating a location in the first set of index portions. The server sends the first set of search results and the query cursor to the client. Subsequently the server receives, from the client, a second search query including the query cursor. The first search query is different from the second search query and/or different index portions are used to perform the second search query. In response to the second search query the server generates a second set of search results identified using the query cursor and sends the second set of search results to the client.

Abstract: Optimizing data in a data store. A request including a number of optimization parameters is received, where the optimization parameters specify characteristics of media content to be optimized. Responsive to the request, the media content (e.g., audio content, video content and images) may be encoded to reduce a storage size of the media content. Such a determination may be made based on one or more attributes of the media content, as well as the optimization parameters included in the request.

Abstract: A method and system is presented which provides a TDM framework for managing self-describing measurement data. The TDM framework provides applications with a central platform for accessing measurement data across an entire enterprise system. By means of individual plug-ins, which may be specific to a given data file format, meta-data for each data store in the enterprise may be indexed in a unified manner. The unified indexing, in turn, provides the ability to browse and query the indexed measurement data without requiring the opening or reading from a source data file.

Abstract: An information searching method to be implemented in a computer includes accepting a first character string from characters or a character string in a reading or inspecting document that is displayed on a display unit, acquiring a second character string from index information for searching the reading or inspecting document, based on identification information of the reading or inspecting document, and executing a search based on the first character string and the second character string.

Abstract: According to an embodiment of the present invention, a computer implemented method and system for processing a query may include receiving a query from a user device; categorizing the query to identify one or more content sources; formatting the query according to one or more content source specifics for the one or more content sources; transmitting the formatted query for the one or more content sources to the one or more content sources; merging results in response to the formatted query from the one or more content sources based at least in part on one or more factors; and formatting the results for delivering to the user device.

Abstract: Comprehensive methods and systems are described for creating, managing, searching, personalizing, and monetizing a knowledge system defined over a corpus of digital content. Systems and methods are described in which a user can initiate in-depth searches of subject matter and can browse, navigate, pinpoint, and select relevant contexts, concepts, and documents to gain knowledge. Systems and methods are described in which knowledge can be personalized through tagged, personalized context, and personalized context can be shared within social and professional networks, securely and confidentially and with the desired access control. Systems and methods are described in which products and services can be advertised in context and advertising can be selected through a bidding process. Systems and methods are described by which a user can navigate contexts and concepts to obtain relevant information, products and services.

Abstract: Provides is an apparatus for question answering based on answer trustworthiness including: an answer indexer that indexes documents of which document trustworthiness satisfying a threshold value among documents included in a document collection and stores it in a knowledge Bases; an answer candidate extractor that extracts answer candidate documents for a user's question from the knowledge Bases; an answer source trustworthiness measurement unit; an answer extraction strategy trustworthiness measurement unit; and a trustworthiness integrator that generates an answer candidate trustworthiness list by ranking the answer candidate documents on the basis of the document trustworthiness, the source trustworthiness, and the extraction strategy trustworthiness of the answer candidate documents.

Abstract: A database server provides a partitioned table with a corresponding locally partitioned index. When a request is made to load data into the table by an application, a table partition, along with a corresponding index partition, is created for the application. The corresponding index partition in marked as asynchronously maintained, allowing other index partitions to be used by the query optimizer in formulating query plans for other table partitions. Once the loading of data is complete, a synchronization operation is called with the result of conforming the data in the asynchronously maintained index partition with its corresponding table in which the data was loaded. Once the data in the corresponding table partition and the data in the asynchronously maintained index partition are synchronized, the asynchronously maintained index partition is marked as synchronously maintained.

Abstract: A search server system having one or more processors and memory receives, from a client, a current search query including a query cursor corresponding to a prior search query. The query cursor corresponds to a location in a first set of index portions used to perform the prior search query. In response to the current search query, the server decomposes the query cursor into a plurality of components and generates a translated query cursor corresponding to the received search query using one or more of the components. The server subsequently identifies a location in a second set of index portions to start performing the current search query based the translated query cursor. The server generates a set of search results corresponding to the current search query by searching in the second set of index portions starting at the identified location and sends search results to the client.

Abstract: A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table.

Abstract: In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, mod

Abstract: Methods for accessing impact analysis repositories and transaction-refinement index for each of the impact analysis repositories. According to the obtained transaction-refinement index, associating the combined repository with information from the most transaction refined impact analysis repository. Associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to insert or delete a table record for tables that do not contain any impacted transaction in the more transaction refined impact analysis repository. And associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to update a table record for table columns that do not contain any impacted transaction in the more transaction refined impact analysis repository.

Abstract: A method of operating a navigation system to provide a route guidance message for traveling a route is performed by a navigation system. A preferred name of a feature visible from a road segment is obtained in a native language from a geographic database associated with the navigation system. The parts-of-speech of the preferred name are identified and converted into a target language text providing the preferred name in a target language. A guidance message includes the target language text in the target language.

Abstract: An automatic keyword analysis for content illumination and document fragmentation for internet search queries. Initially, the invention obtains keywords from a document. The taxonomy then expands the obtained words from the document. The keywords are further refined using keyword demand data. The keyword demand data includes words where too few or too many searches would hamper the user's search. After refinement, the keyword final set is placed onto the appropriate web page. Consequently, internet search engines “hit” the web page because the automatic keyword analysis added optimal and efficient keywords.

Abstract: The invention concerns a method for generating at least one index (10) over XML documents (30) in an XML database (40); the method comprising the steps of: a. executing at least one indexing function (20) defined in the XQuery language; each indexing function (20) accepting an XML document (30) as input and returning at least one computed result; and b. storing each of the at least one computed results from the at least one indexing function (20) as a key (11) of the corresponding index (10) and a reference to the input XML document (30) as a value (12) of the index (10).

Abstract: An information system having a computer readable medium including a flexible data structure is provided. The data structure allows information entered into the data structure to be embellished or qualified. The flexible data structure increases the ability of the data structure to record exceptional information pertinent to specific circumstances. The flexible data structure also enables database access software to respond to user queries in a more effective and informative manner.

Abstract: A procedural pattern in a received query execution plan can be matched to a stored pattern for which an equivalent declarative operator has been pre-defined. The query execution plan can describe a query for accessing data. A hybrid execution plan can be generated by replacing the procedural pattern with the equivalent declarative operator. A hybrid execution plan processing cost can be assigned to execution of the hybrid execution plan and a query execution plan processing cost can be assigned to execution of the query execution plan. The assigning can include evaluating a cost model for the hybrid execution plan and the query execution plan. The query can be executed using the hybrid execution plan if the hybrid execution plan processing cost is less than the query execution plan processing cost or the query execution plan if the hybrid execution plan processing cost is greater than the query execution plan processing cost. Related systems, methods, and articles of manufacture are disclosed.

Abstract: Architecture that performs incremental computing for web searches by employing methods at least for storing the results of repeat queries on unchanged webpages and for computing results for the repeated queries. The architecture includes one or more algorithms for pre-computing query results on index servers, for only selectively choosing index servers whose result for a query change for a query computation process, and for re-using the unchanged web pages stored in the cache and computing results upon changed index and unchanged index separately.

Abstract: A reader device and method for operating a reader device include content indexing features designed to make the use of a reader device more satisfying. A plurality of indexes is stored on a reader device. One of the indexes stored in the reader device is also stored at a remote site. Several indexes stored at the remote site may be substantially similar to one or more of the indexes stored on a reader device. The indexes stored at the remote site may be used to update one or more indexes stored on a reader device. In one implementation, the reader device is an electronic book (“eBook”) reader device.

Abstract: According to an embodiment of the present invention, a computer implemented method and system for processing a query may include receiving a query from a user device; categorizing the query to identify one or more content sources; formatting the query according to one or more content source specifics for the one or more content sources; transmitting the formatted query for the one or more content sources to the one or more content sources; merging results in response to the formatted query from the one or more content sources based at least in part on one or more factors; and formatting the results for delivering to the user device.

Abstract: Provided are a system and article of manufacture for searching documents for ranges of numeric values. A number of posting lists is generated, wherein each posting list is associated with a range of consecutive values within the set of values and includes document identifiers for documents including at least one value within the range of consecutive values associated with the posting list, and wherein each document identifier is associated with one value in the set of values included in the document identified by the document identifier. The generated posting lists are stored. A query on a query range of values within the set of values is received and a determination is made of a minimum number of posting lists associated with consecutive values that together include the query range of values. The determined posting lists are merged.

Abstract: In embodiments disclosed, information on a click stream associated with a user and meta tags commonly used by search engines can be used to profile a user. The click stream may comprise network addresses and timestamps and may be the only source of user information used for the profile. The meta tags may contain metadata that correspond to the network addresses in the click stream, including network address categorization for these network addresses. The profile obtained for the user may be an existing profile that represents a person or a theoretical individual having attributes similar to or most closely match the user. Based at least in part on the profile, information regarding an item may be provided to the user or the item may be offered to the user. In some embodiments, the information may be filtered before being displayed to the user.

Abstract: The present invention provides a system, method and apparatus for electronically searching for an item by receiving a search request comprising a requested category and one or more requested attributes of the item and storing the search request in a search index based on the requested category and the requested attribute(s). The search index includes one or more categories and each category is defined by a taxonomy of attributes. The search index is then searched for any previously stored search requests that match the requested category and the requested attribute(s), a result of the search is determined and a search response that includes the result of the search is sent.

Abstract: A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.

Abstract: An approach is provided for reducing decision diagram related communication traffic and cost by encoding decision diagrams. A hash identifier application constructs a reduced ordered binary decision diagram from a resource description framework graph, computes a hash identifier corresponding to the decision diagram, and stores the hash identifier with the decision diagram.

Abstract: Techniques and systems are provided for capturing relationships between items in “bonds”, and using the bonds to facilitate searches against the items. It is described how bonds that reflect relationships between searchable items are stored. The degree of separation between any two given searchable items is based on the minimum number of bonds that have to be traversed to arrive at one of the two searchable items when starting at the other of the two searchable items. The bonds are used to respond to a search request, performing a search relative to a designated searchable item. For example, the search mechanism may search only those searchable items that are within a particular degree of separation of the designated searchable item. As another example, the search mechanism may determine the order in which searchable items are compared against search criteria of the search request based on the degree of separation of the searchable items from the designated searchable item.

Abstract: Methods, apparatuses and systems directed to a distributed data repository system including a plurality of symmetric data repository nodes. In certain embodiments of the present invention, the distributed data repository system is message-centric operative to store message payloads transmitted from client nodes. In certain embodiments, the distributed data repository system is BLOB-centric, maintaining binary data objects and indexes of attribute values that map to the binary data objects. Of course, the present invention can be utilized to store a great variety of digital data contained in message payloads. According to certain embodiments of the present invention, the attribute indexes are fully replicated across all data repository nodes, while the message payloads (e.g., data objects or other content) are exchanged across data repository nodes as needed to fulfill client queries.

Abstract: A method of transforming relational queries of a database into on a data processing system includes receiving a series of relational queries, transforming first parts of the queries into a continuous query embodied as a streaming application, sending parameters in second parts of the queries in the series to the streaming application as a data stream, and executing the continuous query based on the received data stream to generate query results for the series of relational queries. Each query in the series includes a first part and a second part. The first parts are a pattern common to all the queries in the series and the second parts each have one or more parameters that are not common to all of the queries in the series.

Abstract: Disclose is an improved approach for caching lexical values for RDF data. A compact, efficient resource ID to value mapping is stored in memory, where the cache is stored in memory such that the overhead of accessing and updating it is minimized. The advantage of this approach is improved query performance, since the database is performing less work with the in-memory RDF resource caching. In addition, throughput and performance of the database are also improved.

Abstract: There is disclosed a method, device, and software for presenting search results in a response to an end-user query. Search results are combined from results from a plurality of indexes, each of the search results having an associated key field. Index entries of each of the plurality of indexes are queried using an index-specific search algorithm to obtain a set of matching search results for each index, each matching search result having a quality of match specific to its index. A relative priority is determined for each of the plurality of indexes and the matching search results from the plurality of indexes are combined into a merged list of ordered search results based on the determined priority. A search result from a lower priority index is discarded in favor of any matching search result from a higher priority index.

Abstract: Methods and apparatus for searching Semantic Web structured resources and presenting the search results to a user can increase the likelihood that the search can produce meaningful results. An index database can be constructed by parsing literal values from statements from the resources to obtain component words of the literal values, with the index relating the component words to the statements from which they were parsed. A search engine can obtain component words from the database that match search terms in a query prepared by the user and can obtain the related statements for the matching words. A servlet or other application using the search engine and database can obtain predicates, instances, types of said instances, and full literal values of said instances for the related statements. The search results can be presented to the user as a summary of the predicates, instances, types, and full literal values.

Abstract: Methods, systems, and apparatus, including computer program products, for generating search query suggestions directed to a particular website. In one aspect, a method includes receiving a first set of suggestion data defining custom suggestions for a first website. The first set of suggestion data includes one or more first n grams and one or more second n grams that each represent a selectable alternative to a first n gram. The method also includes generating a suggestion resource and providing a search query suggestion tool to the first website, the suggestion tool being configured to generate a search query input field for webpages on the first website, receive a query input entered in the search query input field, and request that one or more query suggestions be provided as selectable alternatives to the search query input.

Abstract: Purchase phrases can be analyzed to infer user interests. A purchase phrase can include one or more user-defined textual words that a user employs to purchase items in an expedited manner. Many users' purchase phrases may include words that reflect the users' interests, such as “golf” or “rose.” Users with similar purchase phrases may therefore be interested in purchasing similar items. A recommendation system can therefore find items purchased with similar phrases to a target user's purchase phrase and then recommend these items to the target user.

Abstract: The present invention relates to an interactive media guidance application that provides improved searching functionality for media information, such as media program listings, media programming information, celebrity information, and other related media information. Search objects may be defined in the entertainment context and applied to media information to enable efficient searching. Different types of media information may be categorized to enable proper organization of search results. A search object query may be performed based on a user entered search expression and the results may be a vertical slice through the organized categories of media information. User submitted tags may also be applied to the media information and used to search the media information. Atomic searching may be enabled for more generic search expressions, whereby an atomic search object is associated with a personalized atomic search algorithm comprised of individual searches.

Abstract: Optimizing the execution of a query in a multi-database system includes identifying a region within a table, the table being referenced in the query. The region is stored on data-storage devices on first and second system databases in the multi-database system. A first access plan for the query is developed, the first access plan comprising accessing the version of the region stored on the first system database. A second access plan for the query is developed, the second access plan comprising accessing the version of the region stored on the second system database. A selection is made between the first access plan and the second access plan to execute the query. The query is executed using the selected access plan to produce a result.

Abstract: In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, mod

Abstract: A method and system for accurately estimating a result size of a Group-By operation in a relational database. The estimate utilizes the probability of union of the columns involved in the operation, as well as the relative cardinality of each column with respect to the other columns in the operation. In addition, the estimate incorporates the use of table filters when indicated such that table filters are applied prior to determining the size of the tables in the operation, as well as including equivalent columns into the list of columns that are a part of the Group-By operation. Accordingly, the estimate of the result size of the operation includes influencing factors that provide an accurate estimation of system memory requirements.

Abstract: A query that identifies an input data source is received. The input data source is partitioned into a plurality of partitions. Each of the partitions includes a set of data elements with an associated set of indices for indicating an ordering of the data elements. A query type for a query operator in the received query is identified. It is determined whether a reordering of data elements will be performed based on the identified query type. The data elements in at least one of the partitions are reordered when it is determined based on the identified query type that reordering will be performed.

Abstract: In one embodiment, a method includes concurrently executing a set of multiple queries, through a processor, to improve a resource usage within a data warehouse system. The method also includes permitting a group of users of the data warehouse system to simultaneously run a set of queries. In addition, the method includes applying a high-concurrency query operator to continuously optimize a large number of concurrent queries for a set of highly concurrent dynamic workloads.

Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.

Abstract: Provided are a method, system, and article of manufacture for searching documents for ranges of numeric values. Document identifiers for documents are accessed, wherein the documents include at least one value that is a member of a set of values. A number of posting lists are generated. Each posting list is associated with a range of consecutive values within the set of values and includes document identifiers for documents including at least one value within the range of consecutive values associated with the posting list, and wherein each document identifier is associated with one value in the set of values included in the document identified by the document identifier. The generated posting lists are stored, wherein the posting lists are used to process a query on a range of values within the set of values.

Abstract: Indexing data items into an index. A method includes identifying a parameter pattern for a data item stored in a data store record of a data store. The data store record has a data store location identifier. The method further includes identifying a hash of the parameter pattern. The data store location identifier is correlated to at least a portion of the hash in the index. The index includes index entries where each index entry includes at least a portion of a hash and one or more references to data store records by reference to data store location identifiers.

Abstract: The present invention provides a method and apparatus for generating index as well as a search method and a search apparatus. Index entry comprises at least a search item identifier corresponding to a search item, one or a plurality of index items generated from one or plural pieces of search information, and an accumulator for the search information. The accumulator is generated by accumulating the search information, or accumulating ciphertext of information containing the search information, or accumulating data mapped from information containing the search information. At the time of searching, the index items and the accumulator are provided to a searcher. The searcher extracts search information from the index items and checks whether the extracted search information is complete by using the accumulator. In one embodiment, the accumulator is incorporated in an encrypted inverted index.

Abstract: A search server system having one or more processors and memory receives, from a client, a current search query including a query cursor corresponding to a prior search query. The query cursor corresponds to a location in a first set of index portions used to perform the prior search query. In response to the current search query, the server decomposes the query cursor into a plurality of components and generates a translated query cursor corresponding to the received search query using one or more of the components. The server subsequently identifies a location in a second set of index portions to start performing the current search query based the translated query cursor. The server generates a set of search results corresponding to the current search query by searching in the second set of index portions starting at the identified location and sends search results to the client.

Abstract: A database system may perform a streaming evaluation of an XPath expression by utilizing an XPath evaluation component in tandem with an XML event-streaming component. For a more optimal filtered streaming evaluation, the XML event-streaming component may provide an interface whereby the evaluation component sends certain criteria to the event-streaming component when requesting an XML event. The criteria may be based on a next unmatched step in the XPath expression. In response to the request for an XML event, the event-streaming component may only return events that match the criteria. The evaluation component may be, for example, a compiled state machine for the XPath expression. The criteria may be pre-compiled for each possible state in the state machine. The event-streaming component may also utilize the criteria along with schema information to skip parsing of certain segments of XML data.