Abstract: A method includes querying a discovery registry associated with a data abstraction model of a database to discover one or more web services that are resolvable based on a particular logical field selected via a database query interface. The data abstraction model includes a plurality of logical fields that each correspond to a particular data structure of the database. A web service input of a discovered web service is associated with a first logical field of the data abstraction model via the discovery registry, and a web service output of the discovered web service is associated with a second logical field of the data abstraction model via the discovery registry. A modified database query interface includes a text entry element to receive a text search term and a first selectable input associated with the first discovered web service.

Abstract: Computer methods, apparatus and articles of manufacture therefor, are disclosed for developing a complex-query pattern that is transformed into a region-matching transducer. A corpus-level transducer and the region matching transducer are combined. The combined transducer is applied to a corpus to identify strings therein that satisfy patterns defined in the corpus-level transducer, including the complex-query pattern, with each identified pattern being recorded in a corpus index. The corpus and the corpus index are made available for receiving a query with the query tag for querying the corpus and applying the query using the corpus index to identify locations in the corpus that satisfy the query.

Abstract: A system and method for digital image generation, delivery, and management is provided. The automated image generation, delivery, and management system and method serves processed images over a network. A requesting application provides a URL in addition to field values. The image delivery system retrieves and serves an image based on the requested URL. A sized image and a default image are saved in a database for rapid retrieval. If the system can generate an image sized to the request, it does so. Otherwise, the system visits the URL to obtain a snapshot of the rendered webpage. If no webpage is available with the URL as provided, the URL is truncated until a displayable webpage is rendered.

Abstract: In one embodiment, a method for correlating log entries in a log file to the line numbers of formatted-string output functions in source code, where the formatted-string output functions contain instructions to generate the log entries in the log file. The method includes locating the formatted-string output functions in the source code, where each formatted-string output function contains a format string. Each format string is processed to generate a corresponding regular expression to match log entries outputted by the corresponding formatted-string output function. Each regular expression is associated with the line number of the corresponding formatted-string output function. The resultant list of regular expressions and corresponding line numbers is processed with the log file, where log entries in the log file are modified to indicate the line numbers associated with matching regular expressions.

Abstract: In a document processing system and a document processing method, the document processing method includes the steps of: obtaining a document and dividing the document into a plurality of terms and giving a syntactic index to each of the terms; dividing the document into a plurality of sentences; selecting a key syntactic index from the syntactic indexes, and transforming each of the sentences into a preliminary key terms sequence which includes a preliminary key term corresponding to the key syntactic indexes according to the key syntactic indexes; selectively expanding the preliminary key term of a representative sentence of the document into an advanced key term; and determining at least one core candidate sentence among the sentences to generate a core abstract of the document according to the preliminary key terms and the advanced key term.

Abstract: Methods, systems, and apparatus, including computer program products, in which a cross-language search can be performed. A search query is received in a first language. A translated search query of the search query is obtained and evaluated to determine whether it is a candidate for cross-language searching. Upon identifying a candidate, a search can be performed using the translated search query to generate search results relevant to the translated search query.

Abstract: A system, method, and apparatus for information retrieval are provided. Embodiments of the present invention may generate data structures that may be used to process user queries. According to embodiments of the present invention, a processor component configured to perform the operations of an indexing module and a storage module, the indexing module configured to generate a term list and a term-file matrix from information stored on the storage module, the indexing module further configured to generate an adjacency matrix from the one or more files, wherein the adjacency matrix represents a relationship of the one or more terms in each of the one or more files; and the indexing module further configured to generate a probability matrix using the adjacency matrix and a one-step or two-step random walk.

Abstract: An implementation wherein RFID data is shared across independent organizations has been addressed. RFID data is usually spread across different parties, e.g. enterprises in a supply chain and thus, efficient query processing across all parties is required. Traceability is emerging as one of the key applications of RFID technology. A generic data model is introduced for querying RFID data across a network of independently operated data sources. The model can be used to facilitate traceability query processing and give a set of representative traceability queries. A newly designed process-and-forward approach is implemented for executing traceability queries.

Abstract: A method for user-specific display of syndication feed entries uses a taxonomy, a user-specific foreground corpus of bookmarks, and a background corpus of feed entries. User-specific book-marks are received. Each bookmark provides a natural-language description characterizing a bookmark resource. The natural-language descriptions are classified to determine one or more bookmark topics for each bookmark. The topics are maintained in the taxonomy. The bookmark topics are each associated with accumulators in the user-specific foreground corpus. Each book-mark is accumulated to the accumulators corresponding to each of its topics. Feed syndication entries are received and similarly classified according to associated natural-language descriptions. Entry topics are associated with accumulators in the background corpus. A user-specific weight is determined for each entry by aggregating the accumulators corresponding to the entry topics for the foreground and background corpora.

Abstract: Online information is retrieved for a user. An original query submitted by the user is received which includes a plurality of query terms the user associates with particular online information the user is interested in. The original query is then analyzed using data from an online knowledge repository and a historical query log of a search engine to determine central concepts of the original query. A revised query results from this analysis which includes one or more of the central concepts. The revised query is then submitted to the search engine. Search results for the revised query are then provided to the user.

Abstract: The approaches described herein provide an efficient way to process certain kinds of queries that retrieve XML data stored in an object-relational database. A technique determines whether a query comprises a plurality of iteration expressions that exhibit a particular relationship to one another, and if so, re-writes the query and produces an optimized query execution plan. The query execution plan specifies an XPath-based row source with caching enabled. A very small cache structure is used, and reference locators are stored in the cache that point into binary-encoded data rather than copying XMLType data into the cache. Row data may be cached on the first use of the path-based row source and re-used in subsequent requests for rows. Once there is a subsequent request for rows from the optimized path-based row source, the cache may be reorganized to efficiently produce the rows of the row source.

Abstract: A Sales-Chip Associator process permits a creator of a Sales-Chip to share the Sales-Chip with a receiving party. The process utilizes a Sales-Chip Database and a Sales-Chip Subscriber Database to facilitate chip sharing. A handler is used in the Associator process and determines if an association exists between the Sales-Chip and the receiving party. The handler also facilitates recalling an association after being established by the receiving party.

Abstract: Methods and computer-readable media are provided for displaying a target search result and relevant information on a search results page in response to a user-inputted query on a search page. The target search result and relevant information are identified in a database as having been previously determined to be most relevant to the query, and may be based on past user behavior, for example. The relevant information may include functional tools that include input boxes allowing for the user to interact with a webpage associated with the target search result via the search results page. Once the target search result and relevant information have been determined, the search results page is displayed.

Abstract: Some embodiments relate to a method of performing a search for content on the Internet, in which a user may speak a search query and speech recognition may be performed on the spoken query to generate a text search query to be provided to a plurality of search engines. This enables a user to speak the search query rather than having to type it, and also allows the user to provide the search query only once, rather than having to provide it separately to multiple different search engines.

Abstract: A method is provided for transforming entity and relation data using a proxy engine. A proxy data engine can intercept a virtual query directed to a data provider application on a data repository device. The proxy data engine can transform the virtual query into a native query capable of being processed by the data provider application. The virtual query can include a virtual entity-relation object not included in the native query. The proxy data engine can transform a native result into a virtual result including the virtual entity-relation object. The native result can be a response to the native query and the native result can be received by the data provider application.

Abstract: In particular embodiments, a method includes receiving a query for particular sensor data among multiple sensor data from multiple sensors. The plurality of sensor data has been indexed according to a multi-dimensional array. One or more first ones of the dimensions include time, and one or more second ones of the dimensions include one or more pre-determined sensor-data attributes. The method includes translating the query to correspond to the indexing of the plurality of sensor data. The translated query includes one or more values for one or more of the dimensions of the multi-dimensional array. The method includes communicating the translated query to search among the plurality of sensor data according to its indexing to identify the particular sensor data.

Abstract: There is provided a computer-implemented method of modifying a query executing in a database management system. The method comprises sending a no-wait message for the query to a control broker. The method also comprises receiving a reply to the no-wait message from the control broker. The reply to the no-wait message specifies a modification to the query. Additionally, the method comprises performing the modification.

Abstract: The present disclosure includes a system and method for identifying negative keywords associated with advertisements. In some implementations, a method for advertising includes identifying one or more keywords associated with an advertisement. The keywords used to embed the advertisement in Web pages such as those including search results. By scoring keywords to identify those keywords that are not relevant to the web page content, one or more negative keywords can be identified in order to limit the embedding of non-relevant advertisements in web page content.

Abstract: In one embodiment, a method is illustrated including receiving a search query, parsing the search query to identify first and second search terms, determining a relationship between the first and second search terms based on their respective domain assignments, conducting a search based on the respective domain assignments, and displaying a result of the search based on the respective domain assignments, and the relationship between the first and second search terms, as at least one rephrasing of the search query.

Abstract: A method and system for expanding attribute profiles are presented in which primary attributes from one or more attribute profiles are used to derive secondary attributes which are added to the respective attribute profiles to generate expanded attribute profiles. The expanded attribute profiles are generated to increase the strength of association of a query attribute with one or more attribute profiles associated with query-attribute-positive individuals.

Abstract: Systems and methods for multilingual searching allow search terms to be entered in a first language and searched in another language. A selection of a language may be associated with a search term or phrase in a search query, allowing terms from different languages to be searched at the same time.

Abstract: Methods of generating a transactions prediction model using a computer for optimizing a number of transactions associated with a database system include capturing a database workload, where the database workload includes a number of statements corresponding with the transactions over a specified period of time, where each of the statements includes a variable parameter; then generating a generalized statements from the statements by replacing the variable parameter with a constant value; then generating other generalized statements, where if two or more of the number of the generalized statements are the same grouping the generalized statements to correspond with the other generalized statements; and then creating transaction classes, where each of the transaction classes includes at least one generalized statements.

Abstract: A method includes: collecting message sequences including a series of messages issued in response to one processing request; classifying the collected message sequences into groups of the message sequences whose simplified message sequences generated by excluding words other than reserved words from a database message that is a message including a SQL sentence are identical, wherein the database message is included in the series of messages; generating, for each group, a normalized expression including the reserved words in the database message as fixed character strings and arbitrary character strings replaced with portions other than the fixed character strings in the database message, for the database message included in the message sequence belonging to the group; and generating a rule for converting the database message considered to be identical with the normalized expression into a series of fixed character strings included in the normalized expression.

Abstract: The invention provides a method and system for transforming a search query before it is sent to a search engine. The search query, written in a language potentially not mastered correctly by its writer, can comprise typos corresponding to the alphabetic representation of a sound in the writer native language. The search query is first interpreted so as to identify a sequence of phonemes corresponding to its pronunciation by the writer in its native language. The sequence of phonemes is then analyzed so as to determine the corresponding words.

Abstract: A system described herein includes a receiver component that receives a query that pertains to a raw time-series signal. A query executor component selectively executes the query over at least one of multiple available compressed representations of the raw time-series signal, wherein the query pertains to at least one of one of determining a trend pertaining to the raw time-series signal, generating a histogram pertaining to the raw time-series signal, or determining a correlation pertaining to the raw time-series signal.

Abstract: A representative parameterized query in a second database query language is generated from a parameterized query in first database query language. By randomly generating a query in the first database query language, translating this query into the second database query language, and then identifying locations of relevant parameters in the translated query, parameter placeholders can then be substituted at the identified locations to provide a parameterized query in the second database query language. A representative parameterized query in the second database query language can be selected by randomly generating multiple parameterized queries and applying statistical methods including Monte Carlo methods.

Abstract: A filter range based search control to request a range of data from one or more directory servers. A directory server receives a search request from a client application comprising a search filter control defining a set of requested data, a sort control defining a sorting order of the set of requested data, and a range filter control defining a range of entries in the requested data. Data entries matching a search value defined in the search filter control and sorted according to sort attributes defined in the sort control are obtained from a set of directories associated with the directory server to form a sorted list of matching entries. A subset of data entries in the sorted list that match a range value defined in the range filter control are collected, and a response comprising the collected subset of data entries is then sent to the client application.

Abstract: A distributed caching system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: Techniques for using arbitrary sets of objects to constrain objects in database systems. The constraint set of objects is associated with the constrained object in the database system and the database system will perform an operation which adds an object to the constrained object only if the object being added belongs to the constraint set. In a preferred embodiment, the techniques are employed to obtain constraint sets of terms from ontologies which are then used to constrain columns containing those terms. An implementation of the techniques makes a materialized view out of the objects in the constraint set and uses the materialized view to define a referential integrity constraint on the constrained column.

Abstract: Embodiments of the invention are generally related to data processing, and more specifically to retrieving data from a database. An abstract query may include query conditions and a first logical field comprising conditions for determining whether a second logical field will have a predefined value in the future. Upon execution, the abstract query may return results that satisfy the conditions for determining whether the second logical field will have the predefined value.

Abstract: Techniques for optimizing queries are provided. In one technique, a query optimizer determines that two tables involved in equi-joins with one other table return unique rows. The query optimizer further determines that the rows returned by one of the tables is a subset of the rows returned by the other table. The query optimizer then determines that one of the two tables involved in the equi-joins can be eliminated. In another technique, a query optimizer determines that group-by placement may be used on a query that specifies a table. The query optimizer further determines that a view that (1) replaces the table and (2) results from the group-by placement is a subset of an existing view. The query optimizer further determines that each view is unique. The query optimizer selects an execution plan that does not join any tables or views with the resulting view or with the specified table.

Abstract: An apparatus for converting geographical geometrical content of a geographical database to map tiles may include a processor and a memory storing executable computer code that cause the apparatus to at least perform operations including modifying a geographical database based in part on adding items of data arranged in fields based on analyzing values corresponding to geometry information. The geometry information is associated with records of the geographical database. The computer program code may further cause the apparatus to determine a set of tiles at a predetermined zoom level including geographical information of respective records and may update the records to include data associated with minimum and maximum x and y values of the tiles. The computer program code may further cause the apparatus to determine minimum and maximum x and y values that define a rectangular block(s) of map tiles. Corresponding computer program products and methods are also provided.

Abstract: A method of searching music using speech recognition in a mobile device, the method including: recognizing a speech signal uttered by a user as a phoneme sequence; and searching music information by performing partial symbol matching between the recognized phoneme sequence and a standard pronunciation sequence.

Abstract: Techniques are described for logically comparing strategies. In one aspect the strategies can be compared by receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes, the second strategy graphically represented by a second set of linked nodes, each set of linked nodes linking a root node to at least one action node; identifying a subset of linked nodes from at least one of the first set of linked nodes and the second set of linked nodes based on an equivalence of a first subset of the first set of linked nodes to a second subset of the second set of linked nodes; and, providing a visual depiction of the identified subset of the linked nodes to a user, the visual depiction corresponding to the equivalence of the first subset to the second subset.

Abstract: A system to automatically generate query language in software is described. The system receives a request for data that is persistently stored in a database. The system selects a predefined query template from a number of query templates based on the request. The system utilizes the query template to receive content from at least one different source, the first source being a prototype data object. The system generates a query statement based on the query template that includes the content. Finally the system queries the database using the query statement to retrieve the requested data.

Abstract: The present invention relates to an aspect-level news browsing service system and method for mitigating effects of media bias, which group news articles having different aspects on the same event on the basis of aspects, and simultaneously provide grouped news articles to users. The aspect-level news browsing service system may include a user terminal for accessing a news service server over an Internet and receiving aspect-level news article information from the news service server. A news provision server may transmit news article information to the news service server over the Internet. The news service server may extract aspects from the received news article information, classify the news article information based on the extracted aspects, and may transmit the aspect-level news article information to the user terminal depending on the aspects to enable the news article information to be displayed. The Internet may be configured to connect the user terminal to the news service server.

Abstract: Technologies and concepts are described herein for authoring a database query through the modification of a view of the data to be returned by the query. A user interface is provided for authoring a database query through the modification of a view of the data to be returned by the query that includes a view showing the results of a database query. A user interface is also provided for modifying the view to define the results of the query. As the view is modified, a query definition is generated which, when executed against the database, will return the results of the database query shown in the view. When the desired results are shown in the view, the query definition can be saved and run against the database to perform the database query.

Abstract: A searching device includes a history storing unit storing a search target obtained by a search and a search date in a storage unit; a relevancy storing unit storing in the storage unit a previous searching keyword including a plurality of date-related words as well as the search target and an attribute of the search target in association with one another; a change unit changing the previous searching keyword, based on the search date stored in the storage unit and a date output from a clock unit; a reception unit receiving a previous searching keyword and the search target or attribute that are entered by voice; and an extraction unit extracting a search target corresponding to the previous searching keyword and the search target or attribute received by the reception unit, by referring to the previous searching keyword that is obtained after changing, the search target and the attribute.

Abstract: Computer systems, methods, and media improving the relevance of the search results presented to a user for queries having an implicit local intent are provided. Utilizing the systems and methods described herein locally-biased queries are identified, despite such queries being void of any location-specific terms. A location of a computing device associated with the user is determined and localized web search results associated with the data item pair comprising the input query and the user's determined location are generated and presented to the user.

Abstract: A select query or a data referencing a calculation scenario is received by a database server from a remote application server. The specified calculation scenario is one of a plurality of calculation scenarios and it defines a data flow model that includes one or more calculation nodes. Each calculation node defines one or more operations to execute on the database server. Thereafter, the database server instantiates the specified calculation scenario and executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set. This data set is then provided by the database server to the application server. Related apparatus, systems, techniques and articles are also described.

Abstract: In one general aspect, the application discloses a data visualization method in which at least two retrieved data tables are associated based on a selection of at least one common field. A visualization is displayed for data from a first of the tables and input for query devices is received to filter data for a second of the tables. The displayed visualization for the first table can then be updated in response to the received query device input for the second table based on the created association.

Abstract: A method and system for searching numerical terms are provided. The method includes processing a numerical term to a stem, the stem being in the form of a number, and a distance measurement of the numerical term to the stem, wherein a numerical term is a string of characters identified as a number by a numeric parser, and indexing the numerical term in a search index by the stem for search retrieval. The method includes receiving a query and processing the query to divide it into terms, including a numerical term. The numerical terms of the query are also processed to a stem and a distance measurement and document results are retrieved for the stem from an index.

Abstract: A symbolic query exploration (QEX) module automatically produces output information that can be used to evaluate a database. The QEX module operates by converting an input query into a formula for processing by a satisfiability module theories (SMT) solver module. The SMT solver module generates a model that satisfies the formula. The model yields table information that is used to populate the database and, optionally, parameter information that is used to instantiate the query. A query evaluation module then submits the instantiated query to the populated database and evaluates whether an evaluation result produced thereby agrees with pre-specified condition information. The QEX module can preprocess the formula using either (or both) an eager expansion approach (in which the formula is expanded in an upfront manner) or a lazy expansion approach (in which axioms are identified for later possible expansion by the SMT solver module).

Abstract: One embodiment of the present invention includes a method for automatically enabling a search system or application to quickly and accurately count hits corresponding to a search expression. For example, a search expression is received or retrieved that may include redundant and/or overlapping search expression components. Each narrow search expression component is removed from the search expression if joined by an “OR” operator to a broader or equivalent search expression component. Additionally, each broad search expression component is removed from the search expression if joined by an “AND” operator to a narrower or equivalent search expression component. By modifying the received search expression in this fashion, a performance gain is typically achieved for calculating the hit count while maintaining its accuracy.

Abstract: A method for identifying multi-media assets from a multi-media collection, and the method implemented at least in part by a data processing system and comprising the steps of: receiving a search query, the search query, or a derivative thereof, including a possessive phrase, wherein the possessive phrase includes a possessor and a possession category; identifying a denoted object referred to by the possessive phrase using a predefined relationship database that establishes social relationships between objects; identifying one or more additional possessors of the denoted object using the predefined relationship database; generating one or more additional possessive phrases for the denoted objects relating the identified additional possessors to the denoted object; and identifying one or more multi-media assets from the multi-media collection containing the denoted object responsive to the one or more additional possessive phrases.

Abstract: The user-defined inference rule is created using a knowledge base search language that is basically provided in a knowledge base management system. Accordingly, the user-defined inference rule is a knowledge base search statement and is processed using a function of searching a knowledge base as a base function of the knowledge base management system. The user-defined inference rule is applied by including a knowledge base search process and a search result in the knowledge base, when the knowledge base is changed. The user-defined inference rule is managed by a user-defined inference rule manager. The user-defined inference rule manager monitors a change in the knowledge base to determine when the user-defined inference rule is applied, executes the user-defined inference rule to obtain the execution result, and includes the execution result in the knowledge base.

Abstract: This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. In one preferred embodiment, the method begins by receiving a subject query, and then forming an execution plan corresponding to the subject query. The execution plan will typically have a sequence of component snippets or pieces and corresponding processes for implementing the pieces. For at least one piece in the plan, the process then (a) generates source code using different code generation techniques as a function of expected runtime processing machine types; and then (b) compiles the generated source code to form machine executable code for implementing the subject query. As a result, the query executed directly as machine executable code thereby avoiding runtime interpretation of the pieces in the execution plan.

Abstract: A method and system are provided for navigation of a data structure. The method includes receiving an input path expression (104) for a query of a data structure (101) to locate one or more elements (110) in the data structure (101) at runtime. The input path expression (104) includes one or more path steps. The method includes accessing a schema (103) of the data structure (101) and obtaining information relating to the one or more elements (110). The path expression (104) is modified to specify an index in one or more of the path steps to limit the number of occurrences of an element located in a path step. In one embodiment, modifying the path expression (104) also expands any wildcard characters and specifies one or more full paths of the elements (110), wherein if there are two or more full paths they are combined by a union operator, and the modified path expression is used to query (111) the data structure (101) at runtime.

Abstract: Embodiments are directed towards providing related keywords determined to be relevant to a search term using life-streaming data to identify the related keywords. Relevancy is determined by performing the related keyword analysis when life-stream services have been updated. Related keywords may be identified for a given search term using a combination of an aggregated life-stream analysis, a user profile based analysis, and/or a community based life-stream analysis. Each of these mechanisms identify a subset of updated life-streams or profiles to be analyzed to identify keywords that co-occur within each life-steam along with the given search term. The resulting co-occurring keywords may then be ordered based on a frequency of occurrence for the subset of life-streams. A weighted combination of the identified related keywords may be used to display related keywords to a user for use in modifying a search query.

Abstract: A query generator for generating a query that returns a result set comprising data retrieved from a database and data returned by an analytic function that operates on at least a portion of the retrieved data is disclosed.