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

1. 发明授权

US07249141B2 Automated layout of relational databases 有权
标题翻译：关系数据库的自动布局
公开(公告)号：US07249141B2
公开(公告)日：2007-07-24
申请号：US10426235
申请日：2003-04-30
申请人： Sanjay Agrawal , Surajit Chaudhuri , Abhinandan Das , Vivek Narasayya
发明人： Sanjay Agrawal , Surajit Chaudhuri , Abhinandan Das , Vivek Narasayya
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30595 , Y10S707/99932 , Y10S707/99933 , Y10S707/99943
摘要： Layout in a database system is performed using workload information. Execution information for a workload is obtained. Cumulative access and co-access information for database objects is then assembled. A cost model is developed for quantitatively capturing the value of different layouts, and a search is performed for a recommended database layout. In one embodiment, a greedy search is performed which initially attempts provide a layout that minimizes co-location of objects on storage objects, and then attempts to improve that layout via a greedy search.
摘要翻译：使用工作负载信息执行数据库系统中的布局。获取工作负载的执行信息。然后组合数据库对象的累积访问和共存信息。开发了一种成本模型，用于定量捕获不同布局的值，并为推荐的数据库布局执行搜索。在一个实施例中，执行贪婪搜索，其最初尝试提供使存储对象上的对象的共同定位最小化的布局，然后尝试通过贪婪搜索来改进该布局。

2. 发明授权

US08577913B1 Generating midstring query refinements 有权
标题翻译：生成中间字符串查询优化
公开(公告)号：US08577913B1
公开(公告)日：2013-11-05
申请号：US13118196
申请日：2011-05-27
申请人： Othar Hansson , James Home , Anwis Das , Michael Levin , Abhinandan Das
发明人： Othar Hansson , James Home , Anwis Das , Michael Levin , Abhinandan Das
IPC分类号： G06F17/30 , G06F3/048
CPC分类号： G06F3/048 , G06F17/30 , G06F17/30651 , G06F17/30867
摘要： A system and method is provided for providing query suggestions, particularly midstring query completions for an original query being edited or hovered over. An original query is received from a client. One or more segments in the original query are identified including an anchor segment and zero or more remaining segments. The anchor segment is identified based on cursor placement within the original query. Then one or more sibling segments associated with the anchor segment are identified. The sibling segments are identified by the server system to be semantically distinct from anchor segment. Then one or more query refinement candidates are identified. A respective query refinement candidate includes a sibling segment in place of the anchor segment and includes the remaining segments, if any, of the original query. Then information including one or more of the query refinement candidates is sent to the client for presentation.
摘要翻译：提供了一种提供查询建议的系统和方法，特别是正在编辑或悬停的原始查询的中弦查询完成。从客户端收到原始查询。识别原始查询中的一个或多个段，其包括锚段和零个或多个剩余段。基于原始查询中的光标位置识别锚段。然后识别与锚段相关联的一个或多个兄弟段。兄弟节段由服务器系统识别为在语义上与锚段不同。然后识别一个或多个查询优化候选。相应的查询细化候选包括代替锚段的兄弟段，并且包括原始查询的剩余段（如果有的话）。然后将包括一个或多个查询优化候选的信息发送给客户端进行呈现。

3. 发明申请

US20060149744A1 Distributed set-expression cardinality estimation 有权
标题翻译：分布集表达式基数估计
公开(公告)号：US20060149744A1
公开(公告)日：2006-07-06
申请号：US11026499
申请日：2004-12-30
申请人： Abhinandan Das , Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
发明人： Abhinandan Das , Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi
IPC分类号： G06F17/30
CPC分类号： H04L67/2819 , H04L67/28 , H04L67/32
摘要： A method and system for answering set-expression cardinality queries while lowering data communication costs by utilizing a coordinator site to provide global knowledge of the distribution of certain frequently occurring stream elements to significantly reduce the transmission of element state information to the central site and, optionally, capturing the semantics of the input set expression in a Boolean logic formula and using models of the formula to determine whether an element state change at a remote site can affect the set expression result.
摘要翻译：一种用于在降低数据通信成本的同时降低数据通信成本的方法和系统，通过利用协调器站点来提供关于某些频繁发生的流元素的分布的全局知识，以显着地减少元件状态信息到中心站点的传输，，以布尔逻辑公式捕获输入集表达式的语义，并使用公式的模型来确定远程站点上的元素状态更改是否会影响集合表达式结果。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式