会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Efficiently registering a relational schema
    • 有效地注册关系模式
    • US08583652B2
    • 2013-11-12
    • US12956264
    • 2010-11-30
    • Beda HammerschmidtZhen Hua LiuThomas BabyKongyi Zhou
    • Beda HammerschmidtZhen Hua LiuThomas BabyKongyi Zhou
    • G06F17/30
    • G06F17/30312G06F17/30595
    • A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities. A request to store data for the entities may be executed by creating relational database structures to store the data.
    • 提供了一种用于有效地注册关系模式的方法,设备和非暂时计算机可读存储介质。 在共同编译和数据指南方法中,选择了来自模式描述的实体的子集用于物理注册,并且来自模式描述的其他实体没有物理注册。 在共同编译方法中,第一模式描述引用第二模式描述,并且该子集包括来自第一模式描述使用的第二模式描述的一组实体。 在数据指南方法中,子集包括由一组结构化文档使用的实体。 在现收现付方式中,模式注册包括逻辑注册实体,而不创建与实体相对应的关系数据库结构。 数据库服务器可以执行引用逻辑注册实体的数据库命令。 可以通过创建关系数据库结构来存储数据来执行用于存储实体的数据的请求。
    • 6. 发明申请
    • Using Node Identifiers In Materialized XML Views And Indexes To Directly Navigate To And Within XML Fragments
    • 在物化XML视图和索引中使用节点标识符直接导航到XML片段中
    • US20110179085A1
    • 2011-07-21
    • US12690820
    • 2010-01-20
    • Beda HammerschmidtThomas BabyZhen Hua LiuSiddharth Patel
    • Beda HammerschmidtThomas BabyZhen Hua LiuSiddharth Patel
    • G06F17/30
    • G06F17/30935G06F17/30911
    • A method and apparatus is provided for efficiently searching and navigating XML data stored in a relational database. When storing a collection of XML documents, certain scalar elements may be shredded and stored in a relational table, whereas unstructured data may be stored as a CLOB or BLOB column. The approach includes identifying a reference address to within an XML tree index entry and storing the address in an xmltable index. The tree index entry allows for navigation in all axes. A path-based expression may be evaluated in the context of the reference address of the LOB. The result of the evaluation identifies another XML tree index entry containing a LOB locator used to retrieve the content from the document. The tree index, node index, and secondary function indexes are used together to enhance the performance of querying the XML data.
    • 提供了一种用于有效地搜索和导航存储在关系数据库中的XML数据的方法和装置。 当存储XML文档的集合时,某些标量元素可以被切割并存储在关系表中,而非结构化数据可以被存储为CLOB或BLOB列。 该方法包括在XML树索引条目中标识参考地址并将该地址存储在xmltable索引中。 树索引条目允许在所有轴上导航。 可以在LOB的参考地址的上下文中评估基于路径的表达式。 评估结果标识另一个XML树索引条目,其中包含用于从文档中检索内容的LOB定位器。 树索引,节点索引和辅助功能索引一起用于增强查询XML数据的性能。
    • 8. 发明申请
    • LOADING AN INDEX WITH MINIMAL EFFECT ON AVAILABILITY OF APPLICATIONS USING THE CORRESPONDING TABLE
    • 使用相应表加载对应用可用性的最小影响的索引
    • US20100235348A1
    • 2010-09-16
    • US12401397
    • 2009-03-10
    • Thomas BabyAli Maleki TabarSivasankaran Chandrasekar
    • Thomas BabyAli Maleki TabarSivasankaran Chandrasekar
    • G06F17/30
    • G06F17/30911
    • A database server provides a partitioned table with a corresponding locally partitioned index. When a request is made to load data into the table by an application, a table partition, along with a corresponding index partition, is created for the application. The corresponding index partition in marked as asynchronously maintained, allowing other index partitions to be used by the query optimizer in formulating query plans for other table partitions. Once the loading of data is complete, a synchronization operation is called with the result of conforming the data in the asynchronously maintained index partition with its corresponding table in which the data was loaded. Once the data in the corresponding table partition and the data in the asynchronously maintained index partition are synchronized, the asynchronously maintained index partition is marked as synchronously maintained.
    • 数据库服务器提供具有相应的本地分区索引的分区表。 当应用程序将数据加载到表中时,会为应用程序创建表分区以及相应的索引分区。 相应的索引分区被标记为异步维护,允许查询优化器使用其他索引分区来为其他表分区制定查询计划。 一旦数据加载完成,就会调用同步操作,使异步维护的索引分区中的数据与其中加载数据的对应表相符。 一旦相应表分区中的数据和异步维护的索引分区中的数据同步,则异步维护的索引分区被标记为同步维护。
    • 9. 发明授权
    • Management of complex XML schemas in a database system
    • 在数据库系统中管理复杂的XML模式
    • US07761479B2
    • 2010-07-20
    • US11519720
    • 2006-09-11
    • Abhyudaya AgrawalThomas BabyRavi MurthyNipun Agarwal
    • Abhyudaya AgrawalThomas BabyRavi MurthyNipun Agarwal
    • G06F7/00G06F17/00
    • G06F17/30917Y10S707/954
    • Techniques manage the presence of repeated constructs within a complex type at the time of schema registration. At registration, techniques detect repeated elements in the XML schema and analyze whether the repeated elements are from the same complex type. If so, techniques perform additional analysis to determine a minimal common ancestor. Within the context of a minimal common ancestor, techniques determine the maximum number of times an element may occur in the schema. In a choice content model, the largest maximum occurrence value is selected. In other content models, the maximum occurrence value is determined by adding together the occurrence values for the repeated elements. Then, when an object relational table is generated for the XML schema, the maximum number of times that an element appears in the schema is this value. Techniques retain the advantages of object relational storage, even after a schema evolution.
    • 技术在模式注册时管理复杂类型中重复构造的存在。 在注册时,技术会检测XML模式中的重复元素,并分析重复的元素是否来自相同的复杂类型。 如果是这样,技术将进行额外的分析,以确定一个最小的共同祖先。 在最小共同祖先的上下文中,技术确定元素在模式中可能发生的最大次数。 在选择内容模型中,选择最大的最大出现值。 在其他内容模型中,通过将重复元素的出现值相加来确定最大出现值。 然后,当为XML模式生成对象关系表时,元素在模式中出现的最大次数是此值。 技术保留对象关系存储的优点,即使在模式演进之后。