-
公开(公告)号：US20110047171A1
公开(公告)日：2011-02-24
申请号：US12545872
申请日：2009-08-24
IPC分类号： G06F17/30
CPC分类号： G06F17/3056 , G06F17/30427
摘要： Described is answering online web queries from a structured data store, such as a products database. An online web search query is modified into an evaluation expression for accessing a structured data store (e.g., a database, XML file, a flat table) to find search results. A query is matched to a pattern, which is used to generate the expression, as well as determine to which structured data store the query is routed. Tokens (e.g., words) in the query are processed against a dictionary of token classes (sets of tokens) and patterns (sets of token classes) to annotate the query to map the query to the matching pattern. A translation process generates the expression based on translation hints that correspond to the matching pattern. Also described is offline mining of query logs to generate the dictionaries.
摘要翻译： 描述的是回答来自结构化数据存储（如产品数据库）的在线Web查询。 在线网络搜索查询被修改为用于访问结构化数据存储（例如，数据库，XML文件，平面表）以查找搜索结果的评估表达式。 查询与一个模式相匹配，该模式用于生成表达式，以及确定查询路由到哪个结构化数据存储。 根据令牌类（令牌集）和模式（令牌类集合）的字典处理查询中的令牌（例如单词），以注释查询以将查询映射到匹配模式。 翻译过程基于与匹配模式对应的翻译提示生成表达式。 还描述了查询日志的离线挖掘以生成字典。
-
公开(公告)号：US08832133B2
公开(公告)日：2014-09-09
申请号：US12545872
申请日：2009-08-24
IPC分类号： G06F17/30
CPC分类号： G06F17/3056 , G06F17/30427
摘要： Described is answering online web queries from a structured data store, such as a products database. An online web search query is modified into an evaluation expression for accessing a structured data store (e.g., a database, XML file, a flat table) to find search results. A query is matched to a pattern, which is used to generate the expression, as well as determine to which structured data store the query is routed. Tokens (e.g., words) in the query are processed against a dictionary of token classes (sets of tokens) and patterns (sets of token classes) to annotate the query to map the query to the matching pattern. A translation process generates the expression based on translation hints that correspond to the matching pattern. Also described is offline mining of query logs to generate the dictionaries.
摘要翻译： 描述的是回答来自结构化数据存储（如产品数据库）的在线Web查询。 在线网络搜索查询被修改为用于访问结构化数据存储（例如，数据库，XML文件，平面表）以查找搜索结果的评估表达式。 查询与一个模式相匹配，该模式用于生成表达式，以及确定查询路由到哪个结构化数据存储。 根据令牌类（令牌集）和模式（令牌类集合）的字典处理查询中的令牌（例如，单词），以注释查询以将查询映射到匹配模式。 翻译过程基于与匹配模式对应的翻译提示生成表达式。 还描述了查询日志的离线挖掘以生成字典。
-
公开(公告)号：US20110307517A1
公开(公告)日：2011-12-15
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译： 结构化查询可以指定属性的属性值。 确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。 如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。 可以基于期望的运行时间来确定候选查询的数量。 可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。 确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。 可以输出匹配结果。
-
公开(公告)号：US08027957B2
公开(公告)日：2011-09-27
申请号：US12147211
申请日：2008-06-26
申请人： Stelios Paparizos , Christopher Walter Anderson , Wei Liu , Ajay Nair , Alexandros Ntoulas , Naga Srinivas Vemuri
发明人： Stelios Paparizos , Christopher Walter Anderson , Wei Liu , Ajay Nair , Alexandros Ntoulas , Naga Srinivas Vemuri
CPC分类号： G06F17/271 , G06F17/30675
摘要： Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars includes a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.
摘要翻译： 本文提供了压缩用于促进搜索查询的广泛的基于规则的语法。 基于规则的语法包括每个包含令牌类序列的规则列表。 每个令牌类是令牌的逻辑分组，每个令牌是一串字符。 语法被解析以识别规则和令牌类。 识别不重要的令牌类，并将不重要的令牌类的集合合并到生成的合并令牌类。 通过将合并的令牌类替换为用于生成合并的令牌类的相应的不重要令牌类的语法来生成压缩语法。
-
公开(公告)号：US20100306214A1
公开(公告)日：2010-12-02
申请号：US12473286
申请日：2009-05-28
IPC分类号： G06F17/30
CPC分类号： G06F16/951 , G06F16/3334
摘要： Described is using modifiers in online search queries for queries that map to a database table. A modifier (e.g., an adjective or a preposition) specifies the intended meaning of a target, in which the target maps to a column in that table. The modifier thus corresponds to one or more functions that determine which rows of data in the column match the query, e.g., “cameras under $400” maps to a camera (or product) table, and “under” is the modifier that represents a function (less than) that is used to evaluate a “price” target/data column. Also described are different classes of modifiers, and generating the dictionaries for a domain (corresponding to a table) via query log mining.
摘要翻译： 描述的是在映射到数据库表的查询中使用在线搜索查询中的修饰符。 修饰符（例如，形容词或介词）指定目标的意图，其中目标映射到该表中的列。 因此，修改器对应于确定列中数据行与查询匹配的一个或多个功能，例如，“相机（$ 400以下的摄像机）”映射到相机（或产品）表，“下”是表示功能的修饰符 （小于）用于评估“价格”目标/数据列。 还描述了不同类别的修饰符，并通过查询日志挖掘生成域（对应于表）的字典。
-
公开(公告)号：US09158813B2
公开(公告)日：2015-10-13
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译： 结构化查询可以指定属性的属性值。 确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。 如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。 可以基于期望的运行时间来确定候选查询的数量。 可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。 确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。 可以输出匹配结果。
-
公开(公告)号：US08447736B2
公开(公告)日：2013-05-21
申请号：US13221227
申请日：2011-08-30
申请人： Stelios Paparizos , Christopher Walter Anderson , Wei Liu , Ajay Nair , Alexandros Ntoulas , Naga Srinivas Vemuri
发明人： Stelios Paparizos , Christopher Walter Anderson , Wei Liu , Ajay Nair , Alexandros Ntoulas , Naga Srinivas Vemuri
CPC分类号： G06F17/271 , G06F17/30675
摘要： Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars include a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.
摘要翻译： 本文提供了压缩用于促进搜索查询的广泛的基于规则的语法。 基于规则的语法包括每个包含令牌类序列的规则列表。 每个令牌类是令牌的逻辑分组，每个令牌是一串字符。 语法被解析以识别规则和令牌类。 识别不重要的令牌类，并将不重要的令牌类的集合合并到生成的合并令牌类。 通过将合并的令牌类替换为用于生成合并的令牌类的相应的不重要令牌类的语法来生成压缩语法。
-
公开(公告)号：US20100241647A1
公开(公告)日：2010-09-23
申请号：US12408726
申请日：2009-03-23
IPC分类号： G06F17/30
CPC分类号： G06F16/24575
摘要： Described is a search-related technology in which context information regarding a user's prior search actions is used in making query recommendations for a current user action, such as a query or click. To determine whether each set or subset of context information is relevant to the user action, data obtained from a query log is evaluated. More particularly, a query transition (query-query) graph and a query click (query-URL) graph are extracted from the query log; vectors are computed for the current action and each context/sub-context and evaluated against vectors in the graphs to determine current action-to-context similarity. Also described is using similar context to provide the query recommendations, using parameters to control the similarity strictness, and/or whether more recent context information is more relevant than less recent context information, and using context information to distinguish between user sessions.
摘要翻译： 描述了一种搜索相关技术，其中关于用户的先前搜索动作的上下文信息被用于为诸如查询或点击的当前用户动作提供查询建议。 为了确定上下文信息的每个集合或子集是否与用户操作相关，评估从查询日志获得的数据。 更具体地，从查询日志中提取查询转换（查询查询）图和查询点击（查询 - URL）图; 针对当前动作和每个上下文/子上下文计算向量，并针对图中的向量进行评估，以确定当前的动作到上下文相似性。 还描述了使用类似的上下文来提供查询建议，使用参数来控制相似性严格性，和/或更新的上下文信息是否比较近的上下文信息更相关，并且使用上下文信息来区分用户会话。
-
公开(公告)号：US09098859B2
公开(公告)日：2015-08-04
申请号：US13095504
申请日：2011-04-27
申请人： Mohammed Moinuddin , Joseph Futty , Matthew Graham Dyor , Dan E. Walther , Sreenivas Gollapudi , Stelios Paparizos , John C. Shafer
发明人： Mohammed Moinuddin , Joseph Futty , Matthew Graham Dyor , Dan E. Walther , Sreenivas Gollapudi , Stelios Paparizos , John C. Shafer
CPC分类号： G06Q30/02
摘要： An achievement system tracks users' offline activities and awards achievements to users for participation in particular offline activities. The achievements that are awarded for particular activities and/or to particular users may be sponsored by merchants, who may compensate an achievement system provider for the opportunity to sponsor the achievements. To award users achievements, the users' offline activities are tracked. When a user participates in an offline activity for which achievements are available, the user is awarded an achievement. The achievement may be stored in an achievement profile for the user. In some embodiments, achievements earned by users may be converted into other benefits and alternative awards.
摘要翻译： 成就系统跟踪用户的离线活动，并向用户颁发成绩以参与特定的离线活动。 为特定活动和/或特定用户授予的成就可能由商家赞助，商家可能会补偿成就系统提供商以获得成就的机会。 为了奖励用户成就，将跟踪用户的离线活动。 当用户参与可用成就的离线活动时，用户将获得成就。 成就可以存储在用户的成就简档中。 在一些实施例中，用户获得的成就可以被转换成其他利益和替代奖励。
-
公开(公告)号：US08732171B2
公开(公告)日：2014-05-20
申请号：US12695758
申请日：2010-01-28
申请人： Stelios Paparizos , Chris Anderson , Janine Crumb , James Gemmell , Ajay Nair , Gennadii Tertychnyi , An Yan
发明人： Stelios Paparizos , Chris Anderson , Janine Crumb , James Gemmell , Ajay Nair , Gennadii Tertychnyi , An Yan
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/3064
摘要： Methods and computer-readable media are provided for determining suggested queries. A user enters a search website, and the user is identified based on a user identification. Suggested queries are determined based on a group associated with the user. This association is created by extracting queries from data logs, categorizing the queries into groups based on their respective subject matter, associating the user with one or more groups, and determining suggested queries for each group. The suggested queries are communicated for display.
摘要翻译： 提供了方法和计算机可读介质来确定建议的查询。 用户输入搜索网站，并且基于用户标识识别用户。 建议的查询是基于与用户相关联的组确定的。 该关联是通过从数据记录中提取查询来创建的，根据各自的主题将查询分组成组，将用户与一个或多个组相关联，并确定每个组的建议查询。 传达建议的查询以供显示。
-
-
-
-
-
-
-
-
-
搜索结果
30 条记录 (耗时 0.019 秒)