专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5826258A Method and apparatus for structuring the querying and interpretation of semistructured information 失效
标题翻译：用于构造半结构化信息查询和解释的方法和装置
公开(公告)号：US5826258A
公开(公告)日：1998-10-20
申请号：US724943
申请日：1996-10-02
申请人： Ashish Gupta , Venky Harinariyan , Dallan Quass , Anand Rajaraman
发明人： Ashish Gupta , Venky Harinariyan , Dallan Quass , Anand Rajaraman
IPC分类号： G06F13/00 , G06F17/30
CPC分类号： G06F17/30917 , Y10S707/99934 , Y10S707/99945
摘要： A method is provided for determining how semistructured information is organized in disparate semistructured resources by providing a wrapper to extract information and to provide structured information (e.g., tuples of an SQL database) to a mapper coupled to a standard relational database engine. In a specific embodiment, a querying agent is provided on top of the mapper. Further according to the invention, structured high-level user queries are processed across the disparate semistructured resources using a plurality of wrappers each dedicated to a particular resource.
摘要翻译：提供了一种用于通过提供包装器来提取信息并将结构化信息（例如，SQL数据库的元组）提供给耦合到标准关系数据库引擎的映射器来确定如何在不同的半结构化资源中组织半结构化信息的方法。在具体实施例中，在映射器的顶部提供查询代理。此外，根据本发明，使用多个专用于特定资源的包装器，跨越不同的半结构资源来处理结构化的高级用户查询。

2. 发明授权

US06199079B1 Method and system for automatically filling forms in an integrated network based transaction environment 失效
标题翻译：在基于集成网络的交易环境中自动填写表单的方法和系统
公开(公告)号：US06199079B1
公开(公告)日：2001-03-06
申请号：US09066523
申请日：1998-03-20
申请人： Ashish Gupta , Anand Rajaraman
发明人： Ashish Gupta , Anand Rajaraman
IPC分类号： G06F1721
CPC分类号： G06Q30/06 , G06F17/2247 , G06F17/243 , G06F17/27 , Y10S707/99936
摘要： A method of automatically filling in on-line forms presented by web pages in an internet transactional environment by determining based upon selectable criteria a form identifier corresponding to a particular on-line form, and thereupon, for each form so identified, identifying one or many corresponding match patterns with which a page containing a target on-line form is parsed to obtain a plurality of attributes, and thereupon, for each attribute obtained in the parsing step, indexing into a database to obtain and then appropriately transform user information which may be used to fill in the target form.
摘要翻译：一种通过基于可选择的标准来确定对应于特定在线形式的形式标识符，并且因此识别出的每个形式来识别一个或多个网页的方式，自动地在因特网事务环境中填写由网页呈现的在线表单的方法解析包含目标在线表单的页面以获得多个属性的对应匹配模式，然后对于在解析步骤中获得的每个属性，索引到数据库中以获得然后适当地转换可能为用于填写目标表单。

3. 发明授权

US06539378B2 Method for creating an information closure model 有权
标题翻译：创建信息关闭模型的方法
公开(公告)号：US06539378B2
公开(公告)日：2003-03-25
申请号：US10000235
申请日：2001-11-30
申请人： Ashish Gupta , Peter Norvig , Anand Rajaraman
发明人： Ashish Gupta , Peter Norvig , Anand Rajaraman
IPC分类号： G06F1730
CPC分类号： G06F17/30917 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99943
摘要： According to the invention, a method is provided for forming an information closure of a plurality of rows in a listing stack built by a wrapper program for accessing semistructured information. This method includes removing a first row from the listing stack and computing a cross product of the fields in the first row. A step of adding this cross product to a list of accepted rows can also be part of the method. For each remaining row in the listing stack, the method includes a step of computing a selective cross product according to a plurality of steps. In one step, a result is initialized to empty. Then, for each row in the list of accepted rows, a step of determining for a first new row from the accepted row, extended with the non-empty fields of the remaining row is performed. The method can also include a step of determining a second new row from the remaining row, extended with the non-empty fields in the accepted row. Thereupon, a step of adding the two new rows to the result can be performed. Repeating the determining steps and the adding step for all rows in the list of accepted rows, and removing from the result any identical rows can provide an information closure.
摘要翻译：根据本发明，提供了一种用于形成由用于访问半结构化信息的包装程序构建的列表堆栈中的多行的信息关闭的方法。该方法包括从列表堆栈中移除第一行并计算第一行中的字段的交叉乘积。将此交叉产品添加到已接受行列表的步骤也可以作为该方法的一部分。对于列表堆栈中的每个剩余行，该方法包括根据多个步骤计算选择性交叉积的步骤。一步，结果初始化为空。然后，对于所接受行列表中的每一行，执行用从其余行的非空字段扩展的接受行中的第一新行的步骤。该方法还可以包括从剩余行中确定第二个新行的步骤，该行与被接受行中的非空字段一起扩展。因此，可以执行向结果添加两个新行的步骤。对接受行列表中的所有行重复确定步骤和添加步骤，并从结果中删除任何相同的行可以提供信息关闭。

4. 发明授权

US06571243B2 Method and apparatus for creating extractors, field information objects and inheritance hierarchies in a framework for retrieving semistructured information 有权
公开(公告)号：US06571243B2
公开(公告)日：2003-05-27
申请号：US10000743
申请日：2001-11-30
申请人： Ashish Gupta , Peter Norvig , Anand Rajaraman
发明人： Ashish Gupta , Peter Norvig , Anand Rajaraman
IPC分类号： G06F1730
CPC分类号： G06F17/30917 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99943
摘要： According to the invention, a system and method for extracting information from a semistructured information source. The system includes a listing stack for holding extracted information. A means for matching at least one extractor to the semistructured information to return a list of potential matches is also included. The system can also include a means for iterating through the list of potential matches and a means for retrieving information from a particular match in the list of potential matches. A means for adding a particular match into the listing stack can also be part of the system.

5. 发明授权

US5963949A Method for data gathering around forms and search barriers 失效
标题翻译：围绕形式和搜索障碍的数据收集方法
公开(公告)号：US5963949A
公开(公告)日：1999-10-05
申请号：US995868
申请日：1997-12-22
申请人： Ashish Gupta , Peter Norvig , Anand Rajaraman
发明人： Ashish Gupta , Peter Norvig , Anand Rajaraman
IPC分类号： G06F17/24 , G06F17/30
CPC分类号： G06F17/243 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943
摘要： According to the invention, methods for gathering data around forms having one or more fields, enabling a wrapper program to extract semistructured information by determining combinations of values for fields associated with particular forms; submitting the particular forms repeatedly for all combinations of interest and providing the results returned for further processing. In select embodiments, the combinations of values for fields is a Cartesian product of the possible values for the fields. Values to be submitted in the form fields may be specified by using a programming language such as Site Description Language (SDL) or Java.
摘要翻译：根据本发明，用于在具有一个或多个字段的表单上收集数据的方法，使得包装程序能够通过确定与特定形式相关联的字段的值的组合来提取半结构化信息; 为所有感兴趣的组合重复提交特定表格，并提供返回的结果进行进一步处理。在选择的实施例中，字段的值的组合是字段的可能值的笛卡尔乘积。可以通过使用诸如站点描述语言（SDL）或Java的编程语言来指定在表单域中提交的值。

6. 发明授权

US09535810B1 Layout optimization 有权
标题翻译：布局优化
公开(公告)号：US09535810B1
公开(公告)日：2017-01-03
申请号：US12150316
申请日：2008-04-24
申请人： Mehul Shah , Abhishek Gattani , Anand Rajaraman , Sri Subramaniam
发明人： Mehul Shah , Abhishek Gattani , Anand Rajaraman , Sri Subramaniam
IPC分类号： G06F17/00 , G06F11/30
CPC分类号： G06F11/30 , G06F17/30 , G06F17/3053 , G06F17/30976
摘要： Delivering a page including a plurality of modules is disclosed. A plurality of candidate modules are selected. A corresponding module score for each of the modules in the plurality of candidate modules is evaluated. A plurality of modules is selected from the plurality of candidate modules to be displayed on a page. The position of each module on the page is based at least in part on that module's module score.
摘要翻译：公开了提供包括多个模块的页面。选择多个候选模块。评估多个候选模块中的每个模块的相应模块分数。从多个候选模块中选择多个模块以在页面上显示。每个模块在页面上的位置至少部分地基于该模块的模块分数。

7. 发明授权

US09286387B1 Double iterative flavored rank 有权
标题翻译：双重迭代风味级别
公开(公告)号：US09286387B1
公开(公告)日：2016-03-15
申请号：US11165623
申请日：2005-06-22
申请人： Anand Rajaraman
发明人： Anand Rajaraman
IPC分类号： G06F7/00 , G06F17/30 , G06Q30/02
CPC分类号： G06F17/30864 , G06F17/30321 , G06F17/30598 , G06F17/3071 , G06F17/30867 , G06Q30/02 , H04L12/66
摘要： Determining the relevance of a web node is disclosed. A seed score value of a first type is assigned to a seed set of nodes. A score value of a second type is derived for the web node based on a mapping of a reachability relationship between one or more seed nodes and the web node. A score value of the first type is derived for the web node based on a mapping of a reachability relationship between the web node and one or more evaluation nodes having derived weight values of the second type.
摘要翻译：公开了确定网络节点的相关性。将第一类型的种子得分值分配给节点的种子集合。基于一个或多个种子节点和网络节点之间的可达性关系的映射，针对web节点导出第二类型的得分值。基于web节点与具有第二类型的导出权重值的一个或多个评估节点之间的可达性关系的映射，为web节点导出第一类型的得分值。

8. 发明授权

US08954972B2 Systems and methods for event stream processing 有权
公开(公告)号：US08954972B2
公开(公告)日：2015-02-10
申请号：US13553651
申请日：2012-07-19
申请人： Wang Chee Lam , Lu Liu , Taraka Subrahmanya Prasad Siripurapu , Anand Rajaraman , Zoheb Vacheri , AnHai Doan
发明人： Wang Chee Lam , Lu Liu , Taraka Subrahmanya Prasad Siripurapu , Anand Rajaraman , Zoheb Vacheri , AnHai Doan
IPC分类号： G06F9/46 , G06F9/48
CPC分类号： G06F9/4843 , G06F9/4881 , G06F9/542
摘要： Disclosed are systems and methods for processing events in an event stream using a map-update application. The events may be embodied as a key-attribute pair. An event is processed by one or more instances implementing either a map or an update function. A map function receives an input event from the event stream and publishes one or more events to the event stream. An update function receives an event and updates a corresponding slate and publishes zero or more events. Systems and methods are also disclosed herein for implementing a map-update application in a multithreaded architecture and for handling overloading of a particular thread or node. Systems and methods for providing access to slates updated according to update operations are also disclosed.

9. 发明授权

US08706720B1 Mitigating topic diffusion 有权
标题翻译：缓解主题扩散
公开(公告)号：US08706720B1
公开(公告)日：2014-04-22
申请号：US11327294
申请日：2006-01-06
申请人： Anand Rajaraman
发明人： Anand Rajaraman
IPC分类号： G06F7/00
CPC分类号： G06F17/30864 , G06F17/30321 , G06F17/30598 , G06F17/3071 , G06F17/30867 , G06Q30/02 , H04L12/66
摘要： Determining the relevance of a web node is disclosed. A seed score value of a first type is assigned to a seed set of nodes. A score value of a second type is derived for the web node based on a mapping of a reachability relationship between one or more seed nodes and the web node. A score value of the first type is derived for the web node based on a mapping of a reachability relationship between the web node and one or more evaluation nodes having derived weight values of the second type. Topic diffusion is mitigated.
摘要翻译：公开了确定网络节点的相关性。将第一类型的种子得分值分配给节点的种子集合。基于一个或多个种子节点和网络节点之间的可达性关系的映射，针对web节点导出第二类型的得分值。基于web节点与具有第二类型的导出权重值的一个或多个评估节点之间的可达性关系的映射，为web节点导出第一类型的得分值。主题扩散得到缓解。

10. 发明授权

US08626775B1 Topic relevance 有权
标题翻译：主题相关性
公开(公告)号：US08626775B1
公开(公告)日：2014-01-07
申请号：US11332844
申请日：2006-01-13
申请人： Venky Harinarayan , Anand Rajaraman
发明人： Venky Harinarayan , Anand Rajaraman
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： Determining the relevance of a destination page to a topic is disclosed. A plurality of paths that include arrivals at a destination page are determined. A plurality of paths that include arrivals at the destination page are determined. A proportion of the paths that include arrivals at the destination page that also include a preceding arrival at a distinguished page are determined. The relevance of the destination page based at least in part on the proportion is determined.
摘要翻译：公开了确定目的地页面与主题的相关性。确定包括到达目的地页面的多个路径。确定包括到达目的地页面的多个路径。确定包括目的地页面中的到达的路径的一部分，其也包括先前到达识别页面。确定至少部分基于比例的目的地页面的相关性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式