Patent application number | Description | Published |
20130185304 | RULE-DRIVEN RUNTIME CUSTOMIZATION OF KEYWORD SEARCH ENGINES - Described herein are methods, systems, apparatuses and products for rule-driven runtime customization of keyword search engines. An aspect provides a method for rule-driven customization of keyword searches, including: receiving by a computer an input keyword query; determining from the input keyword query and a dataset to be queried at least one rule selected from the group consisting of: a re-write rule; a category ranking rule, and a category grouping rule; and applying the at least one rule to generate search results based on domain knowledge of the dataset. Other embodiments are disclosed. | 07-18-2013 |
20130185330 | RULE-DRIVEN RUNTIME CUSTOMIZATION OF KEYWORD SEARCH ENGINES - Described herein are methods, systems, apparatuses and products for rule-driven runtime customization of keyword search engines. An aspect provides a method for rule-driven customization of keyword searches, including: receiving by a computer an input keyword query; determining from the input keyword query and a dataset to be queried at least one rule selected from the group consisting of: a re-write rule; a category ranking rule, and a category grouping rule; and applying the at least one rule to generate search results based on domain knowledge of the dataset. Other embodiments are disclosed. | 07-18-2013 |
20130262350 | LEARNING REWRITE RULES FOR SEARCH DATABASE SYSTEMS USING QUERY LOGS - Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log. | 10-03-2013 |
20130262351 | LEARNING REWRITE RULES FOR SEARCH DATABASE SYSTEMS USING QUERY LOGS - Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log. | 10-03-2013 |
20140019434 | HIGH-EFFICIENCY SELECTION OF RUNTIME RULES FOR PROGRAMMABLE SEARCH - A method and associated systems for the efficient selection of runtime rules for programmable search engines, in which a processor of a computer system translates a set of programmable search-engine runtime rules into a set of fielded documents and then partitions the fielded documents into optimized clusters that are each in turn converted into an inverted index. When a user submits a query, the search engine converts the query into a set of fielded queries and uses the set of inverted indices and the set of fielded queries to identify a candidate subset of the runtime rules. The search engine matches this candidate subset against the input query to select a final set of applicable runtime rules. | 01-16-2014 |
20140096043 | ACTION PERFORMED INDICATORS FOR MENU ITEMS - In various embodiments, one or more visual elements are introduced with menu item that indicate that action on this item has already been performed at least once. In various aspects, a distinctive icon can be placed with a menu item to indicate that a search field has been previously added to a search form, that a column has been added to a report, or that existing data or queries under construction have been modified by the action on an indicated item. | 04-03-2014 |
20140258265 | PERSISTING AND RETRIEVING ARBITRARY SLICES OF NESTED STRUCTURES USING A COLUMN-ORIENTED DATA STORE - Methods and arrangements for storing and retrieving nested structures. A nested structure is obtained. There are created slices containing arbitrary sub-structures of the nested structure. The content of slices is stored in one or more columns of a column-oriented data store. At least one access plan for accessing slices in the data store is developed, to be used when a projection query is received. The access plan is executed to construct a nested structure that answers the projection query. Other variants and embodiments are broadly contemplated herein. | 09-11-2014 |
20140297262 | ACCELERATED REGULAR EXPRESSION EVALUATION USING POSITIONAL INFORMATION - Methods and arrangements for evaluating a regular expression. Text strings are received. A regular expression is also received, the regular expression comprising a pattern for specifying and recognizing at least one text string from among the received text strings. There is generated, with respect to the received text strings, a data structure containing grams with positional information. The data structure is employed to evaluate the regular expression via identifying a subset of the text strings comprising at least one match for the given regular expression. Other variants and embodiments are broadly contemplated herein. | 10-02-2014 |
20150039217 | COMPUTING A SIMILARITY MEASURE OVER MOVING OBJECT TRAJECTORIES - Methods and arrangements for measuring similarity with respect to moving object trajectories. First and second moving object trajectories are input, each trajectory being defined by at least two spatial dimensions and a temporal dimension. At least one segment is defined with respect to each trajectory, each segment being defined between two defining points. At least one segment from the first trajectory is matched with at least one segment from the second trajectory. A spatial distance and temporal distance are each computed between the at least one segment from the first trajectory and the at least one segment from the second trajectory. The spatial distance and temporal distance are combined to provide a measure of a spatio-temporal distance between the at least one segment from the first trajectory and the at least one segment from the second trajectory. Other variants and embodiments are broadly contemplated herein. | 02-05-2015 |