会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • IN-PLACE EVOLUTION OF XML SCHEMAS IN DATABASES
    • 数据库中XML方​​案的演进
    • WO2005022415A1
    • 2005-03-10
    • PCT/US2004/027464
    • 2004-08-23
    • ORACLE INTERNATIONAL CORPORATIONIDICULA, SamCHANDRASEKAR, SivasankaranAGARWAL, NipunMURTHY, Ravi
    • IDICULA, SamCHANDRASEKAR, SivasankaranAGARWAL, NipunMURTHY, Ravi
    • G06F17/30
    • G06F17/30297G06F17/30908
    • A method and system for the in-place evolution of XML schemas is disclosed. To automatically evolve an existing XML schema, a schema evolver receives both an existing XML schema and an XML document as input. The XML document indicates changes to be made to the existing XML schema. Based on the existing XML schema and the XML document, the schema evolver evolves the existing XML schema into a new XML schema that incorporates the changes indicated in the XML document. According to one aspect, the schema evolver generates one or more SQL statements based on the new XML schema. The SQL statements, when executed by a database server, cause the database server to evolve database structures that were based on the formerly existing XML schema so that the database structures conform to the new XML schema. This is accomplished "in place," without copying the data in the database structures.
    • 公开了一种用于XML模式的就地演化的方法和系统。 为了自动演进现有的XML模式,架构演进程序接收现有的XML模式和XML文档作为输入。 XML文档指示对现有XML模式进行的更改。 基于现有的XML架构和XML文档,架构演进者将现有的XML架构演变为新的XML架构,其中包含XML文档中指示的更改。 根据一个方面,模式演进者基于新的XML模式生成一个或多个SQL语句。 SQL语句在由数据库服务器执行时,会导致数据库服务器发展基于以前存在的XML模式的数据库结构,以便数据库结构符合新的XML模式。 这完成了“到位”,而不复制数据库结构中的数据。
    • 6. 发明申请
    • TUPLE ENCODING AWARE DIRECT MEMORY ACCESS ENGINE FOR SCRATCHPAD ENABLED MULTICORE PROCESSORS
    • TUPLE编码唤醒直接存储器访问引擎用于支持SCRATCHPAD的多核处理器
    • WO2017161275A1
    • 2017-09-21
    • PCT/US2017/022975
    • 2017-03-17
    • ORACLE INTERNATIONAL CORPORATION
    • BROWN, David A.JAIN, RishabhDULLER, MichaelIDICULA, SamSCHLANGER, ErikHAWKINS, David Joseph
    • G06F13/28
    • Tabular data is moved efficiently from a source memory to a destination memory. A first set of electronic circuits accesses a descriptor stored at a particular memory location. The descriptor indicates a width of a column and a number of rows of tabular data, and a tabular data manipulation operation, and indicates a source memory location storing the tabular data and a destination memory location for storing the tabular data manipulation result. The first set of electronic circuits determines control information indicating the tabular data manipulation operations to be performed and transmits the control information to a second set of electronic circuits. Based on the control information, the second set of electronic circuits retrieve the tabular data from the source memory location and applies the tabular data manipulation operation to generate the data manipulation result, and causes the data manipulation result to be stored at the destination memory location.
    • 表格数据从源存储器有效地移动到目标存储器。 第一组电子电路访问存储在特定存储位置的描述符。 描述符指示列的宽度和表格数据的行数以及表格数据操作操作,并且指示存储表格数据的源存储器位置和用于存储表格数据操作结果的目的地存储器位置。 第一组电子电路确定指示要执行的表格数据操作操作的控制信息,并将该控制信息传输到第二组电子电路。 基于控制信息,第二组电子电路从源存储器位置检索表格数据并应用表格数据操作操作以生成数据操纵结果,并且使数据操作结果存储在目的地存储器位置。

    • 10. 发明申请
    • OPTIMAL DATA REPRESENTATION AND AUXILIARY STRUCTURES FOR IN-MEMORY DATABASE QUERY PROCESSING
    • 用于内存数据库查询处理的最佳数据表示和辅助结构
    • WO2014043366A2
    • 2014-03-20
    • PCT/US2013/059486
    • 2013-09-12
    • ORACLE INTERNATIONAL CORPORATION
    • IDICULA, SamMOORE, KevinGOLD, BrianAGARWAL, NipunSEDLAR, Eric
    • G06F17/30
    • G06F17/30G06F17/30289G06F17/30312
    • A method for providing optimized data representation of relations for in-memory database query processing is disclosed. The method seeks to optimize the use of the available memory by encoding relations on which the in-memory database query processing is performed and by employing auxiliary structures to maintain performance. Relations are encoded based on data patterns in one or more attribute-columns of the relation and the encoding that is selected is suited to a particular type of data in the column. Members of a set of auxiliary structures are selected based on the benefit the structure can provide and the cost of the structure in terms of the amount of memory used. Encoding of the relations is performed in real-time while query processing occurs, using locks to eliminate conflicts between the query processing and encoding.
    • 公开了一种用于提供用于内存数据库查询处理的关系的优化数据表示的方法。 该方法寻求通过对执行内存数据库查询处理的关系进行编码并通过采用辅助结构来维持性能来优化对可用存储器的使用。 关系根据关系的一个或多个属性列中的数据模式进行编码,并且所选编码适合列中特定类型的数据。 一组辅助结构的成员是根据结构可以提供的好处和结构在所用内存数量方面的成本来选择的。 关系的编码在查询处理发生时实时执行,使用锁来消除查询处理和编码之间的冲突。