利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

71 条记录 (耗时 0.05 秒)

    VARIABLE DURATION WINDOWS ON CONTINUOUS DATA STREAMS
    3.
    发明申请
    VARIABLE DURATION WINDOWS ON CONTINUOUS DATA STREAMS 审中-公开

    公开(公告)号：US20190165990A1

    公开(公告)日：2019-05-30

    申请号：US16265610

    申请日：2019-02-01

    申请人： Oracle International Corporation

    发明人： Sandeep Bishnoi ,  Anand Srinivasan

    IPC分类号： H04L12/24

    摘要： Improved techniques are provided for processing streams of data. The duration of the time that an event is eligible for remaining in a time-based window can be variable for different events received via the same event stream. In certain embodiments, the duration of time that an input event spends in a time-based window is a function of one or more values of one or more attributes of the event. Since different events can have different one or more attribute values, the different events can spend different amounts of time in the time-based window for that event stream. The amount of time that an event spends in a time-based window can be controlled via the one or more attributes of the event.

    Configurable data windows for archived relations
    4.
    发明授权
    Configurable data windows for archived relations 有权

    公开(公告)号：US10025825B2

    公开(公告)日：2018-07-17

    申请号：US14973377

    申请日：2015-12-17

    申请人： Oracle International Corporation

    发明人： Unmesh Anil Deshmukh ,  Anand Srinivasan ,  Sandeep Bishnoi

    IPC分类号： G06F17/30

    摘要： Techniques for managing configurable data windows for streams and/or archived relations are provided. In some examples, a query that identifies at least a data stream or an archived relation may be identified. Additionally, a configurable window size may be identified. In some instances, the query may be initialized with at least a portion of the historical data based at least in part on the window size. Further, the query may be evaluated based at least in part on the data stream and the portion of the historical data.

    Generation of archiver queries for continuous queries over archived relations
    6.
    发明授权
    Generation of archiver queries for continuous queries over archived relations 有权

    公开(公告)号：US09953059B2

    公开(公告)日：2018-04-24

    申请号：US14036659

    申请日：2013-09-25

    申请人： Oracle International Corporation

    发明人： Unmesh Anil Deshmukh ,  Anand Srinivasan ,  Vikram Shukla

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30516 ,  G06F17/30463 ,  G06F17/30466

    摘要： A method may include receiving a continuous query identified by an archived relation associated with an application. The method may also include generating a physical query plan. Additionally, the method may include constructing a structured query language (SQL) equivalent expression corresponding to an attribute utilized by the operator and/or constructing an output SQL expression for the identified operator based at least in part on the SQL equivalent expression. Additionally, the method may include constructing the archiver query for the identified operator based at least in part on the output SQL expression. Further, the method may include executing the archiver query to obtain a result set of data records related to the application and/or generating a snapshot output of one or more data values related to the application based at least in part on the result set of data records.

    Sharing data structures between processes by semi-invasive hybrid approach
    9.
    发明授权
    Sharing data structures between processes by semi-invasive hybrid approach 有权

    公开(公告)号：US09594692B2

    公开(公告)日：2017-03-14

    申请号：US14823328

    申请日：2015-08-11

    申请人： Oracle International Corporation

    发明人： Uladzislau Sharanhovich ,  Anand Srinivasan ,  Dmitry Golovashkin ,  Vaishnavi Sashikanth

    IPC分类号： G06F12/10 ,  G06F9/54 ,  G06F17/30

    摘要： Techniques herein are for sharing data structures between processes. A method involves obtaining a current memory segment that begins at a current base address within a current address space. The current memory segment comprises a directed object graph and a base pointer. The graph comprises object pointers and objects. For each particular object, determine whether a different memory segment contains an equivalent object that is equivalent to the particular object. If the equivalent object exists, for each object pointer having the particular object as its target object, replace the memory address of the object pointer with a memory address of the equivalent object that does not reside in the current memory segment. Otherwise, for each object pointer having the particular object as its target object, increment the memory address of the object pointer by an amount that is a difference between the current base address and the original base address.