公开(公告)号：US07406478B2

公开(公告)日：2008-07-29

申请号：US11202463

申请日：2005-08-11

申请人： Abhyudaya Agrawal ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Nipun Agarwal ,  Eric Sedlar

发明人： Abhyudaya Agrawal ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Nipun Agarwal ,  Eric Sedlar

IPC分类号： G06F17/00

CPC分类号： G06F17/30917 ,  Y10S707/99942 ,  Y10S707/99943

摘要： A database server registers an XML schema and determines a database representation for the XML schema and mapping information, determining what database types should be used to represent an XML schema and/or how instances of the XML schema are stored by a database system. The mapping information indicates the mapping between the constructs declared in the XML schema and the constructs included in the appropriate database representation. The XML schema may contain annotations that describe one or more properties of a database representation of an XML date-time type. Based on the annotations, the database determines an appropriate database representation and generates mapping information mapping the declaration of the XML date-time type of the XML schema to the constructs of the database representation.

摘要翻译： 数据库服务器注册XML模式并确定XML模式和映射信息的数据库表示，确定应使用什么数据库类型来表示XML模式和/或数据库系统如何存储XML模式的实例。 映射信息指示在XML模式中声明的结构与包含在适当的数据库表示中的构造之间的映射。 XML模式可能包含描述XML日期时间类型的数据库表示形式的一个或多个属性的注释。 基于注释，数据库确定适当的数据库表示，并生成映射信息，将XML模式的XML日期时间类型的声明映射到数据库表示的构造。

公开(公告)号：US07308474B2

公开(公告)日：2007-12-11

申请号：US10306130

申请日：2002-11-26

申请人： Sivasankaran Chandrasekar ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar

发明人： Sivasankaran Chandrasekar ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar

IPC分类号： G06F15/16

CPC分类号： G06F12/126 ,  G06F17/30917

摘要： Techniques for accessing data that resides in a document on a computer-readable medium by a device with device resources of limited resource amount include determining usage for each portion of the document that consumes the device resources of a plurality of portions of the document. Each portion may be accessed independently of a different portion of the document. Based on the usage, a particular portion of the document is selected to cease consuming the device resources. The device resources consumed by the particular portion are released. The techniques allow a document-processing device with limited resources to scale up to process a large document that would otherwise exceed the available resources. This capability is an advantage when first inserting a large XML document, which cannot be fully manifested in available memory, as multiple loadable units into a database or other persistent store.

摘要翻译： 用于通过具有有限资源量的设备资源的设备访问驻留在计算机可读介质上的文档中的数据的技术包括确定消耗文档的多个部分的设备资源的文档的每个部分的使用。 可以独立于文档的不同部分访问每个部分。 基于使用，选择文档的特定部分以停止消耗设备资源。 特定部分消耗的设备资源被释放。 这些技术允许具有有限资源的文档处理设备扩展以处理否则将超过可用资源的大文档。 当将多个可加载单元插入到数据库或其他持久存储中时，首次插入不能充分显示在可用内存中的大型XML文档时，此功能是一个优点。

公开(公告)号：US20070276792A1

公开(公告)日：2007-11-29

申请号：US11442106

申请日：2006-05-25

申请人： Asha Tarachandani ,  Sivasankaran Chandrasekar ,  Man-Hay Tam ,  Anh-Tuan Tran ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar

发明人： Asha Tarachandani ,  Sivasankaran Chandrasekar ,  Man-Hay Tam ,  Anh-Tuan Tran ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar

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

CPC分类号： G06F17/30011 ,  G06F17/2229 ,  G06F17/2247 ,  G06F17/30908

摘要： A mechanism is provided for detecting and disregarding application specific nodes contained in shared XML documents. The techniques described involve determining one or more application specific nodes within XML documents and performing path expression evaluations of the XML documents as if the nodes are not present. In one embodiment, a mechanism is provided by which a user may specify the criterion that determine which subset of node in XML documents are to be ignored from path expression evaluations and evaluating a query that specifies a path operation based on a path and ignoring said identified nodes when evaluating said path operation.

摘要翻译： 提供了一种用于检测和忽略包含在共享XML文档中的应用程序特定节点的机制。 所描述的技术涉及确定XML文档内的一个或多个应用特定节点，并且如同节点不存在一样执行XML文档的路径表达式评估。 在一个实施例中，提供了一种机制，用户可以通过该机制指定确定XML文档中的节点的哪个子集将被从路径表达式评估中忽略的标准，并且基于路径评估指定路径操作的查询，并忽略所述标识的 节点在评估所述路径操作时。

公开(公告)号：US20070130157A1

公开(公告)日：2007-06-07

申请号：US11294894

申请日：2005-12-05

申请人： Namit Jain ,  Nipun Agarwal ,  Ravi Murthy ,  Syam Pannala ,  Vikram Kapoor ,  Eric Sedlar

发明人： Namit Jain ,  Nipun Agarwal ,  Ravi Murthy ,  Syam Pannala ,  Vikram Kapoor ,  Eric Sedlar

IPC分类号： G06F17/30

CPC分类号： G06F17/30504 ,  G06F17/30115 ,  Y10S707/99931 ,  Y10S707/99943

摘要： A method and apparatus for performing file system operations involving a link is provided. A request to perform a file system operation involving a link is received from a client at a database server. The link may establish a relationship a source resource has to a target resource. The source resource and the target resource may be stored within a repository implemented by a storage medium, such as a database. The database server may perform the file system operation by storing, in the database, one or more link records that identifies the link between the first resource and the second resource. File system operations, such as a NFS file system operation, which involve links may be performed at a database management system.

摘要翻译： 提供一种用于执行涉及链接的文件系统操作的方法和装置。 从数据库服务器的客户端接收到执行涉及链接的文件系统操作的请求。 该链接可以建立源资源与目标资源的关系。 源资源和目标资源可以存储在由诸如数据库的存储介质实现的存储库中。 数据库服务器可以通过在数据库中存储标识第一资源和第二资源之间的链接的一个或多个链接记录来执行文件系统操作。 可以在数据库管理系统中执行涉及链接的诸如NFS文件系统操作的文件系统操作。

公开(公告)号：US20070118561A1

公开(公告)日：2007-05-24

申请号：US11284521

申请日：2005-11-21

申请人： Sam Idicula ,  Nipun Agarwal ,  Ravi Murthy ,  Eric Sedlar

发明人： Sam Idicula ,  Nipun Agarwal ,  Ravi Murthy ,  Eric Sedlar

IPC分类号： G06F17/00

CPC分类号： G06F17/30893 ,  G06F12/0246 ,  G06F12/0817 ,  G06F12/0833 ,  G06F17/30091 ,  G06F17/30595 ,  G06F2212/62 ,  G06F2212/622 ,  G06F2212/7204

摘要： A method and apparatus for processing path-based database operations is provided. According to one aspect, a path cache is maintained. For each hierarchical node that is traversed during a path-determining operation, it is determined whether a cache entry corresponding to that node is already contained in the path cache. If such a cache entry is already contained in the path cache, then the path indicated in that cache entry is used to complete the pathname for the node for which the operation is being performed. As a result, hierarchically higher nodes do not need to be traversed to complete the operation. Alternatively, if such a cache entry is not already contained in the path cache, then a cache entry for the node currently being traversed is generated and inserted into the path cache for use in subsequent path-determining operations.

摘要翻译： 提供了一种用于处理基于路径的数据库操作的方法和装置。 根据一个方面，维护路径高速缓存。 对于在路径确定操作期间遍历的每个分级节点，确定与该节点相对应的高速缓存条目是否已经包含在路径高速缓存中。 如果这样的缓存条目已经包含在路径缓存中，则使用该缓存条目中指示的路径来完成正在执行该操作的节点的路径名。 因此，不需要遍历层次更高的节点来完成操作。 或者，如果这样的高速缓存条目尚未包含在路径高速缓存中，则生成用于当前正在遍历的节点的高速缓存条目并将其插入到路径高速缓存中以用于随后的路径确定操作。

公开(公告)号：US20070016605A1

公开(公告)日：2007-01-18

申请号：US11184302

申请日：2005-07-18

申请人： Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

发明人： Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

IPC分类号： G06F7/00

CPC分类号： G06F17/2247

摘要： A “structural summary” of a collection of XML documents is generated. The structural summary is a skeleton tree that represents all parent-child relationships found in a XML document collection.

摘要翻译： 生成XML文档集合的“结构摘要”。 结构摘要是一个骨架树，表示在XML文档集合中找到的所有父子关系。

公开(公告)号：US07158981B2

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

申请号：US11315835

申请日：2005-12-21

申请人： Nipun Agarwal ,  Eric Sedlar ,  Ravi Murthy ,  Namit Jain

发明人： Nipun Agarwal ,  Eric Sedlar ,  Ravi Murthy ,  Namit Jain

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

CPC分类号： G06F17/30595 ,  G06F17/30917 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945

摘要： A hierarchy may be explicitly or implicitly reflected in existing data maintained external to hierarchy structures. Such hierarchies are referred to herein as a “pre-existing hierarchies”. Techniques are described herein for capturing a pre-existing hierarchy in hierarchy structures. After a pre-existing hierarchy has been captured, there exist two independent sets of data that reflect the hierarchy: the external hierarchy definition and the internal hierarchy definition. Changing either hierarchy definition changes the hierarchy. Therefore, to maintain a consistent reflection of the hierarchy, the internal hierarchy definition must be modified in response to changes made to the external hierarchy definition, and the external hierarchy definition must be modified in response to changes made to the internal hierarchy definition. Various techniques are described for maintaining consistency between the two hierarchy definitions.

摘要翻译： 层次结构可以在层次结构外部维护的现有数据中显式或隐式地反映出来。 这样的层次结构在本文中称为“预先存在的层级”。 这里描述了用于在层次结构中捕获预先存在的层次结构的技术。 在捕获了一个预先存在的层次结构之后，存在反映层次结构的两个独立的数据集：外部层次结构定义和内部层次结构定义。 更改层次结构定义会更改层次结构。 因此，为了保持层次结构的一致反映，必须根据对外部层次结构定义所做的更改来修改内部层次结构定义，并且必须根据对内部层次结构定义的更改来修改外部层次结构定义。 描述了用于维持两个层次结构定义之间的一致性的各种技术。

公开(公告)号：US20060117049A1

公开(公告)日：2006-06-01

申请号：US10999864

申请日：2004-11-29

申请人： Namit Jain ,  Fei Ge ,  Ravi Murthy ,  Subramanian Muralidhar ,  Nipun Agarwal ,  Eric Sedlar

发明人： Namit Jain ,  Fei Ge ,  Ravi Murthy ,  Subramanian Muralidhar ,  Nipun Agarwal ,  Eric Sedlar

IPC分类号： G06F17/00

CPC分类号： G06F17/30091 ,  G06F17/30233 ,  Y10S707/99931

摘要： A method and apparatus for processing path-based database operations is provided. According to one aspect, a “parent row ID” column is added to a directory links table. For each row in the table, the value of the “parent row ID” column indicates the row ID, in the table, of the node that is that row's node's parent in the file hierarchy. To determine whether a particular node is within a specified path of the file hierarchy, the particular node's pathname is derived by visiting child-to-parent links indicated in the table and prepending, to the front of a pathname being constructed for the particular node, node names indicated in the visited rows. Each parent node's row in the directory links table is located using the “parent row ID” column of the child node's row. The resulting pathname is compared with the specified path to determine whether the particular node exists therein.

公开(公告)号：US20050228818A1

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

申请号：US11083828

申请日：2005-03-18

申请人： Ravi Murthy ,  Eric Sedlar ,  Sivasankaran Chandrasekar ,  Ashish Thusoo ,  Nipun Agarwal ,  Sreedhar Mukkamalla

发明人： Ravi Murthy ,  Eric Sedlar ,  Sivasankaran Chandrasekar ,  Ashish Thusoo ,  Nipun Agarwal ,  Sreedhar Mukkamalla

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

CPC分类号： G06F17/30917 ,  G06F17/2205 ,  G06F17/2229 ,  G06F17/2247 ,  G06F17/30911 ,  Y10S707/99933 ,  Y10S707/99942

摘要： A method and system are provided for flexibly sectioning XML documents stored in a relational database system. The method includes obtaining a set of sectioning rules; receiving an XML document that is to be stored in the relational database system; and identifying a storage location for each node in the XML document based on the set of sectioning rules. The sectioning rules can also be used to determine which tables in the relational database should be queried when a query is received, and to determine which tables in the relational database should be updated when a command to update stored XML data is received.

摘要翻译： 提供了一种方法和系统，用于灵活地划分存储在关系数据库系统中的XML文档。 该方法包括获得一组分段规则; 接收要存储在关系数据库系统中的XML文档; 并基于一组分段规则识别XML文档中每个节点的存储位置。 分段规则还可用于确定在接收到查询时应查询关系数据库中的哪些表，并确定在接收到更新存储的XML数据的命令时，关系数据库中哪些表应更新。

公开(公告)号：US20050228768A1

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

申请号：US10944171

申请日：2004-09-16

申请人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

发明人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

IPC分类号： G06F9/44 ,  G06F17/21 ,  G06F17/30

CPC分类号： G06F17/30917 ,  G06F17/30911 ,  Y10S707/99934

摘要： An XPath expression is converted into a tree-based representation where each node represents an operation to be performed and the links between nodes in the tree represent the flow of data between operations. The conversion may involve creating a parse tree for the XPath expression, and then converting the parse tree into an operator tree. The operator tree is constructed in such a way that execution of the XPath expression begins at the leaf nodes of the operator tree, and the results are then passed up the tree. After each node is executed, the results are either (1) passed to a filter that filters the results with a predicate statement or (2) passed to another node to be operated upon. This occurs until no nodes remain to be executed.

摘要翻译： XPath表达式被转换为基于树的表示，其中每个节点表示要执行的操作，并且树中的节点之间的链接表示操作之间的数据流。 转换可能涉及为XPath表达式创建解析树，然后将解析树转换为运算符树。 运算符树的构造方式是在运算符树的叶节点处开始执行XPath表达式，然后将结果传递给树。 在执行每个节点后，结果将被传递给过滤器的过滤器，该过滤器使用谓词语句或（2）传递给另一个要运行的节点的结果。 直到没有节点保持执行才发生。