公开(公告)号：US5819255A

公开(公告)日：1998-10-06

申请号：US773695

申请日：1996-12-27

申请人： Pedro Celis ,  Jay Vaishnav ,  Hansjorg Zeller

发明人： Pedro Celis ,  Jay Vaishnav ,  Hansjorg Zeller

IPC分类号： G06F17/30

CPC分类号： G06F17/30463 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936

摘要： A system and method for optimizing a database query with improved performance enhancements is herein disclosed. The database query consists of one or more logical expressions. Through the repeated application of one or more rules, the logical expressions are transformed into physical expressions and in some cases, execution plans that implement the database query. Each expression has associated with it a set of group attributes that specifies its characteristic inputs and outputs and a cost that estimates the computational expense for executing the expression. The group attributes are used to categorize similar expressions into groups that are stored in a search data structure. They are also used to track duplicate expressions. The cost associated with an expression is used to guide the search process to consider those expressions that will produce low cost plans. The cost is estimated in accordance with a six-fold criteria with each criterion weighted to account for the context of the expression and the application's particular computing environment. The query optimizer is rule-based including transformation and implementation rules that are used to perform transformations on the logical expressions in a subproblem in order to produce a plan. A OnceGuidance guidance method is used to select a set of rules in certain cases that prevent the regeneration of an existing expression.

摘要翻译： 本文公开了一种用于优化具有改进的性能增强的数据库查询的系统和方法。 数据库查询由一个或多个逻辑表达式组成。 通过重复应用一个或多个规则，逻辑表达式被转换为物理表达式，在某些情况下，实现数据库查询的执行计划。 每个表达式与它相关联一组指定其特征输入和输出的组属性以及估计执行表达式的计算费用的成本。 组属性用于将类似表达式分组到存储在搜索数据结构中的组。 它们也用于跟踪重复表达式。 与表达式相关联的成本用于指导搜索过程来考虑将生成低成本计划的表达式。 成本按照六标准进行估算，每个标准的加权是为了说明表达式和应用程序的特定计算环境的上下文。 查询优化器是基于规则的，包括用于对子问题中的逻辑表达式执行转换以生成计划的转换和实现规则。 在一些阻止再现现有表达式的情况下，使用OnceGuidance指导方法来选择一组规则。

公开(公告)号：US5822747A

公开(公告)日：1998-10-13

申请号：US702106

申请日：1996-08-23

申请人： Goetz Graefe ,  Pedro Celis ,  Jay Vaishnav ,  Hansjorg Zeller

发明人： Goetz Graefe ,  Pedro Celis ,  Jay Vaishnav ,  Hansjorg Zeller

IPC分类号： G06F17/30

CPC分类号： G06F17/30463 ,  Y10S707/99932 ,  Y10S707/99934

摘要： A system and method for optimizing a database query is herein disclosed. The system consists of a search engine and a database implementor that determines an optimal plan for executing a SQL query. The SQL query is represented as a query tree consisting of a number of nested expressions. The search engine generates a number of plans from which an optimal plan is selected. Plans are generated through the application of a set of rules consisting of implementation and transformation rules. Implementation rules are used to obtain plans. Transformation rules are used to determine equivalent expressions. A plan for the query tree entails finding plans for each expression within the tree where each plan is generated in accordance with a prescribed set of rules. The database implementor selects the set of rules such that more promising plans are generated rather than generating all possible plans. In a preferred embodiment of the invention, multiple passes are made by the search engine in order to determine the optimal plan. In a first pass, implementation rules are used in order to generate a first plan having a cost that is used as a threshold when generating for additional plans. In each subsequent pass, a set of implementation and transformation rules is used to generate one or more plans whose cost does not exceed the threshold. An optimal plan is selected from the generated plans as the one having the lowest cost.

摘要翻译： 本文公开了一种用于优化数据库查询的系统和方法。 该系统由搜索引擎和数据库实现者组成，它确定执行SQL查询的最佳方案。 SQL查询表示为由许多嵌套表达式组成的查询树。 搜索引擎生成一些计划，从中选择最佳计划。 通过应用一组由实现和转换规则组成的规则来生成计划。 实施规则用于获取计划。 转换规则用于确定等效表达式。 查询树的计划需要根据规定的一组规则来查找树中每个表达式的每个表达式的计划。 数据库实现者选择一组规则，以便生成更有希望的计划，而不是生成所有可能的计划。 在本发明的优选实施例中，搜索引擎进行多次通过以确定最佳方案。 在第一遍中，使用实施规则来生成具有成本的第一计划，该成本用于为附加计划生成时用作阈值。 在每个后续的过程中，使用一组实现和转换规则来生成成本不超过阈值的一个或多个计划。 从生成的计划中选择最佳计划作为成本最低的计划。

公开(公告)号：US6021405A

公开(公告)日：2000-02-01

申请号：US763407

申请日：1996-12-11

申请人： Pedro Celis ,  Diana Shak ,  Jay Vaishnav ,  Hansjorg Zeller

发明人： Pedro Celis ,  Diana Shak ,  Jay Vaishnav ,  Hansjorg Zeller

IPC分类号： G06F17/30

CPC分类号： G06F17/30463 ,  Y10S707/99932

摘要： A system and method for optimizing a database query with improved performance enhancements is herein disclosed. The database query consists of one or more logical expressions. Through the repeated application of one or more rules, the logical expressions are transformed into execution plans. The query optimizer partitions the database query into one or more subproblems with each subproblem consisting of one or more logical expressions. A plan is obtained for each subproblem with the plan for the database query including the plans for each subproblem. The query optimizer is cost-based and uses rules including transformation and implementation rules that are used to perform transformations on the logical expressions in a subproblem in order to produce a plan. The rules are classified into context-free and context-sensitive in order to avoid generating duplicate expressions. Context-free rules are applied once for each logical expression and context-sensitive rules are applied once for each logical expression for a particular optimization goal. In a preferred embodiment, the query optimizer performs several optimization passes over the database query in order to obtain an optimal plan. For each pass, if no optimal plan exists for the requested optimization goal, existing plans having the same optimization goal are utilized with each input reoptimized for a more cost effective plan.

摘要翻译： 本文公开了一种用于优化具有改进的性能增强的数据库查询的系统和方法。 数据库查询由一个或多个逻辑表达式组成。 通过重复应用一个或多个规则，将逻辑表达式转换为执行计划。 查询优化器将数据库查询分成一个或多个子问题，每个子问题由一个或多个逻辑表达式组成。 为每个子问题获得一个包含数据库查询计划的计划，包括每个子问题的计划。 查询优化器是基于成本的，并使用规则，包括转换和实现规则，用于对子问题中的逻辑表达式执行转换，以便生成计划。 规则分为无上下文和上下文相关，以避免生成重复表达式。 对每个逻辑表达式应用一次无上下文的规则，并为特定优化目标的每个逻辑表达式应用上下文相关规则一次。 在优选实施例中，查询优化器对数据库查询执行若干优化遍历，以便获得最佳计划。 对于每个通行证，如果对于所请求的优化目标没有最优计划，则使用具有相同优化目标的现有计划，每个输入被重新优化以获得更具成本效益的计划。

公开(公告)号：US5724570A

公开(公告)日：1998-03-03

申请号：US480963

申请日：1995-06-07

申请人： Hansjorg Zeller ,  Pedro Celis

发明人： Hansjorg Zeller ,  Pedro Celis

IPC分类号： G06F17/30

CPC分类号： G06F17/30451 ,  Y10S707/99933 ,  Y10S707/99934

摘要： A method for subquery elimination for a relational model database based on the SQL language running a database management system (DBMS) under the TANDEM NONSTOP (tm) operating kernel. A series of seven transformation rules are applied to eliminate nested queries in the SQL language. The method and teachings of the present invention generalizes to all types of nested subqueries in SQL, allowing for more efficient computations, allocation and maintenance of system resources.

摘要翻译： 基于在TANDEM NONSTOP（tm）操作内核下运行数据库管理系统（DBMS）的SQL语言的关系模型数据库的子查询消除方法。 应用一系列七个转换规则来消除SQL语言中的嵌套查询。 本发明的方法和教导泛化到SQL中的所有类型的嵌套子查询，允许更有效的计算，分配和维护系统资源。

公开(公告)号：US5717911A

公开(公告)日：1998-02-10

申请号：US377287

申请日：1995-01-23

申请人： Louise M. Madrid ,  Richard A. Meier ,  Franco Putzolu ,  Sunil Sharma ,  Thomas J. O'Shea ,  James H. Troisi ,  Hansjorg Zeller ,  Gary M. Gilbert ,  Donald S. Maier ,  Elizabeth G. Davis ,  Pedro Celis

发明人： Louise M. Madrid ,  Richard A. Meier ,  Franco Putzolu ,  Sunil Sharma ,  Thomas J. O'Shea ,  James H. Troisi ,  Hansjorg Zeller ,  Gary M. Gilbert ,  Donald S. Maier ,  Elizabeth G. Davis ,  Pedro Celis

IPC分类号： G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30433 ,  Y10S707/99932 ,  Y10S707/99942

摘要： An SQL program executor and an SOL compiler both include options for avoiding recompilations of execution plans whenever the runtime object and the compile time object referenced by an execution plan meet predefined schema similarity criteria. Thus, recompilation is sometimes avoided even though the compile time object has been altered or the run time object is not the same object as the compile time object. To enable late binding, schema information is stored in each execution plan for each object to be accessed by the execution plan. The stored schema information is a subset of the full object schema, and includes information about all the aspects of the objects to be accessed which must remain unchanged in order for the execution plan to be operable. While executing a compiled program, the SQL executor avoids recompilations of execution plans whenever the runtime object and the compile time object referenced by an execution plan meet predefined schema similarity criteria. When a recompilation of an SQL program is required, only the execution plans which do not meet the schema similarity criteria are recompiled if the compiled program has been assigned appropriate runtime parameters. The late binding features of the SQL executor also enable a compiled program to access objects distinct from the objects referenced by the program at compile time. Similarly, the SQL compiler includes the ability to recompile only those execution plans which do not meet the schema similarity criteria and thus are inoperable.

摘要翻译： SQL程序执行器和SOL编译器都包括用于在运行时对象和执行计划引用的编译时对象满足预定义的模式相似性标准时避免重新编译执行计划的选项。 因此，即使编译时间对象已被更改或运行时间对象与编译时间对象不是相同的对象，有时也可避免重新编译。 为了启用后期绑定，模式信息存储在执行计划要访问的每个对象的每个执行计划中。 存储的模式信息是完整对象模式的一个子集，并且包括关于要访问的对象的所有方面的信息，这些信息必须保持不变，以便执行计划可操作。 在执行编译程序时，只要执行计划引用的运行时对象和编译时对象都符合预定义的模式相似性标准，SQL执行程序就会避免重新编译执行计划。 当需要重新编译SQL程序时，如果已编译的程序已分配适当的运行时参数，则仅重新编译不符合模式相似性标准的执行计划。 SQL执行程序的后期绑定功能还使得编译的程序能够在编译时访问与程序引用的对象不同的对象。 类似地，SQL编译器包括仅重新编译那些不符合模式相似性标准因而无法操作的执行计划的能力。

公开(公告)号：US07428546B2

公开(公告)日：2008-09-23

申请号：US10646580

申请日：2003-08-21

申请人： Anil K. Nori ,  Sameet Agarwal ,  J. Patrick Thompson ,  Pedro Celis ,  David G. Campbell ,  F. Soner Terek

发明人： Anil K. Nori ,  Sameet Agarwal ,  J. Patrick Thompson ,  Pedro Celis ,  David G. Campbell ,  F. Soner Terek

IPC分类号： G06F17/30

CPC分类号： G06F17/30595 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944

摘要： Various embodiments of the present invention are directed to a data store comprising Items, Elements, and Relationships. An Item is a unit of data storable in a data store and further comprises said Element and said Relationship. An Element is an instance of a type comprising one or more fields. A Relationship is a link between at least two Items. The data store further comprising a Core Schema to define a set of Core Items by which a hardware/software interface system understands and directly processes said set of Core Items in a predetermined and predictable way. The Core Items are derived (directly or indirectly) from a common single Base Item which, in turn, is a foundational Item in a Base Schema.

摘要翻译： 本发明的各种实施例涉及包括项目，元素和关系的数据存储。 项目是可存储在数据存储中的数据的单元，并且还包括所述元素和所述关系。 元素是包含一个或多个字段的类型的实例。 关系是至少两个项目之间的链接。 数据存储器还包括核心模式，以定义一组核心项目，硬件/软件接口系统通过该核心模块系统以预定和可预测的方式理解并直接处理所述一组核心项目。 核心项目是从一个普通的单个基础项目派生（直接或间接的），而该基础项目又是基本模式中的基础项目。

公开(公告)号：US20050050054A1

公开(公告)日：2005-03-03

申请号：US10646646

申请日：2003-08-21

申请人： Quentin Clark ,  Anil Nori ,  Pedro Celis ,  Peter Spiro ,  David Campbell

发明人： Quentin Clark ,  Anil Nori ,  Pedro Celis ,  Peter Spiro ,  David Campbell

IPC分类号： G06F17/30 ,  H04L29/06 ,  H04L29/08 ,  G06F17/00

CPC分类号： G06F17/30575 ,  G06F17/30174 ,  G06F17/30194 ,  G06F17/30557 ,  H04L29/06 ,  H04L67/1095 ,  H04L67/30 ,  H04L69/08 ,  H04L69/329 ,  Y10S707/99933 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99952

摘要： Various embodiments of the present invention are directed to a storage platform comprising a database engine, a data store, an application programming interface. The data store is implemented on the database engine for storing data therein, and the data store implements a data model that supports the organization, searching, sharing, synchronization, and security of data stored in the data store. Specific types of data are described in schemas. The application programming interface enables application programs to access services and capabilities of the storage platform and to access the data described in the schemas. The storage platform supports interoperability with existing file systems, enables users and systems to synchronize data stored in different instances of the data store, and provides the ability for application programs to be notified about and to track changes made to the data in the data store.

摘要翻译： 本发明的各种实施例涉及包括数据库引擎，数据存储，应用编程接口的存储平台。 数据存储在数据库引擎上实现，用于在其中存储数据，并且数据存储实现支持数据存储中存储的数据的组织，搜索，共享，同步和安全性的数据模型。 具体的数据类型在模式中描述。 应用程序编程接口使应用程序能够访问存储平台的服务和功能，并访问模式中描述的数据。 存储平台支持与现有文件系统的互操作性，使用户和系统能够同步存储在数据存储区不同实例中的数据，并提供应用程序通知的能力，并跟踪对数据存储中的数据所做的更改。

公开(公告)号：US20120072652A1

公开(公告)日：2012-03-22

申请号：US13305670

申请日：2011-11-28

申请人： Pedro Celis ,  Dexter Paul Bradshaw ,  Sadashivan Krishnamurthy ,  Georgiy I. Reynya ,  Chengliang Zhang ,  Hanumantha Rao Kodavalla

发明人： Pedro Celis ,  Dexter Paul Bradshaw ,  Sadashivan Krishnamurthy ,  Georgiy I. Reynya ,  Chengliang Zhang ,  Hanumantha Rao Kodavalla

IPC分类号： G06F12/00

CPC分类号： G06F12/121 ,  G06F8/4442 ,  G06F12/08 ,  G06F12/0866 ,  G06F12/0893 ,  G06F12/0897 ,  G06F12/12

摘要： A buffer manager that manages blocks of memory amongst multiple levels of buffer pools. For instance, there may be a first level buffer pool for blocks in first level memory, and a second level buffer pool for blocks in second level memory. The first level buffer pool evicts blocks to the second level buffer pool if the blocks are not used above a first threshold level. The second level buffer pool evicts blocks to a yet lower level if they have not used above a second threshold level. The first level memory may be dynamic random access memory, whereas the second level memory may be storage class memory, such as a solid state disk. By using such a storage class memory, the working block set of the buffer manager may be increased without resorting to lower efficiency random block access from yet lower level memory such as disk.

摘要翻译： 缓冲管理器，用于管理多级缓冲池中的内存块。 例如，可能存在第一级存储器中的块的第一级缓冲池，以及用于第二级存储器中的块的第二级缓冲池。 如果不在第一阈值级别以上使用块，则第一级缓冲池将块移动到第二级缓冲池。 如果第二级缓冲池没有使用高于第二阈值级别，那么第二级缓冲池将块移动到较低级别。 第一级存储器可以是动态随机存取存储器，而第二级存储器可以是诸如固态盘的存储类存储器。 通过使用这样的存储类存储器，可以增加缓冲器管理器的工作块集，而不需要从低级存储器（例如盘）获得较低效率的随机数据块访问。

公开(公告)号：US07349913B2

公开(公告)日：2008-03-25

申请号：US10646646

申请日：2003-08-21

申请人： Quentin J. Clark ,  Anil K. Nori ,  Pedro Celis ,  Peter M. Spiro ,  David G. Campbell

发明人： Quentin J. Clark ,  Anil K. Nori ,  Pedro Celis ,  Peter M. Spiro ,  David G. Campbell

IPC分类号： G06F17/30

CPC分类号： G06F17/30575 ,  G06F17/30174 ,  G06F17/30194 ,  G06F17/30557 ,  H04L29/06 ,  H04L67/1095 ,  H04L67/30 ,  H04L69/08 ,  H04L69/329 ,  Y10S707/99933 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99952

摘要： Various embodiments of the present invention are directed to a storage platform comprising a database engine, a data store, an application programming interface. The data store is implemented on the database engine for storing data therein, and the data store implements a data model that supports the organization, searching, sharing, synchronization, and security of data stored in the data store. Specific types of data are described in schemas. The application programming interface enables application programs to access services and capabilities of the storage platform and to access the data described in the schemas. The storage platform supports interoperability with existing file systems, enables users and systems to synchronize data stored in different instances of the data store, and provides the ability for application programs to be notified about and to track changes made to the data in the data store.

摘要翻译： 本发明的各种实施例涉及包括数据库引擎，数据存储，应用编程接口的存储平台。 数据存储在数据库引擎上实现，用于在其中存储数据，并且数据存储实现支持数据存储中存储的数据的组织，搜索，共享，同步和安全性的数据模型。 具体的数据类型在模式中描述。 应用程序编程接口使应用程序能够访问存储平台的服务和功能，并访问模式中描述的数据。 存储平台支持与现有文件系统的互操作性，使用户和系统能够同步存储在数据存储区不同实例中的数据，并提供应用程序通知的能力，并跟踪对数据存储中的数据所做的更改。

公开(公告)号：US20050055354A1

公开(公告)日：2005-03-10

申请号：US10647058

申请日：2003-08-21

申请人： J. Thompson ,  Kim Cameron ,  Walter Smith ,  Darren Shakib ,  Nathaniel Ballou ,  Pedro Celis

发明人： J. Thompson ,  Kim Cameron ,  Walter Smith ,  Darren Shakib ,  Nathaniel Ballou ,  Pedro Celis

IPC分类号： G06F7/00 ,  G06F17/30 ,  G06F21/00

CPC分类号： G06F21/604 ,  G06F16/10 ,  G06F16/284 ,  G06F16/289

摘要： Various embodiments of the present invention are directed to a computer system comprising a plurality of Items, Item Folders, and a hardware/software interface system. The Items constitute discrete storable units of information that can be manipulated by a hardware/software interface system. The Item Folders, which are Items themselves, constitute an organizational structure for Items. Each Item belongs to at least one Item Folder, and Items may belong to more than one Item Folder. However, an Item is not necessarily owned by any particular Item Folder, such that the deletion of said Item Folder does not automatically result in the deletion of said Item. Instead, an Item might be automatically deleted only when it no longer belongs to any Item Folder or, alternately, and Item may be automatically deleted when it is a member of only one Item Folder and that Item Folder is deleted.

摘要翻译： 本发明的各种实施例涉及包括多个项目，项目文件夹和硬件/软件接口系统的计算机系统。 这些项目构成可由硬件/软件界面系统操纵的离散可存储的信息单元。 项目文件夹本身是项目的组织结构。 每个项目属于至少一个项目文件夹，项目可能属于多个项目文件夹。 然而，项目不一定由任何特定的项目文件夹所有，使得删除所述项目文件夹不会自动导致删除所述项目。 相反，只有当项目不再属于任何项目文件夹时，项目可能会被自动删除，否则当项目文件夹只有一个项目文件夹的成员并且删除项目文件夹时，项目可能会被自动删除。