利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

370 条记录 (耗时 0.034 秒)

    Data structure supporting contingency table generation
    2.
    发明授权
    Data structure supporting contingency table generation 有权

    公开(公告)号：US09940343B2

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

    申请号：US14571682

    申请日：2014-12-16

    申请人： SAS Institute Inc.

    发明人： Yongqiao Xiao ,  Taiyeong Lee ,  Jared Langford Dean ,  Ruiwen Zhang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30327 ,  G06F17/30289 ,  G06F17/30339 ,  G06F17/30345 ,  G06F17/30507 ,  G06F17/30587

    摘要： A method of converting data to tree data is provided. A first node memory structure that includes a first value indicator, a first counter value, and a first observation indicator is initialized for a first variable. The first value indicator is initialized with a first value of the first variable selected from first observation data, and the first observation indicator is initialized with a first indicator that indicates the first observation data. The first value of the first variable is compared to a second value of the first variable. The first counter value included in the first node memory structure is incremented when the first value of the first variable matches the second value of the first variable. Corresponding values of second observation data are compared to the identified values from first observation data when the first value of the first variable matches the second value of the first variable. A next observation is read from the data when the identified values match the corresponding values. The tree data is output after a last observation of the data is processed.

    Systems and methods for adding users to a networked computer system
    3.
    发明授权
    Systems and methods for adding users to a networked computer system 有权

    公开(公告)号：US09900223B2

    公开(公告)日：2018-02-20

    申请号：US15428068

    申请日：2017-02-08

    申请人： Facebook, Inc.

    发明人： Alon Michael Shalita ,  Arun Dattaram Sharma

    IPC分类号： G06F17/30 ,  H04L12/24 ,  H04L29/08

    CPC分类号： H04L41/12 ,  G06F17/30587 ,  G06F17/30958 ,  H04L67/306

    摘要： Systems and methods are provided for adding new nodes to a computer networked system. The systems and methods may identify a first set of nodes in a networked computer system. The first set of nodes may be included in a first hash computation that clusters the first set of nodes into communities. An application shard space including a first space and a second space may be generated. The first set of nodes may be mapped to application shards in the first space based on the first hash computation. The application shards in the first space may be assigned to a first set of machines of the networked computer system. The second space may be maintained for mappings of nodes not included in the first hash computation to application shards in the second space.

    Optimizing ABAP development as a service
    4.
    发明授权
    Optimizing ABAP development as a service 有权

    公开(公告)号：US09898279B2

    公开(公告)日：2018-02-20

    申请号：US15087677

    申请日：2016-03-31

    申请人： SAP SE

    发明人： Peter Eberlein ,  Volker Driesen

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

    CPC分类号： G06F8/70 ,  G06F8/30 ,  G06F8/31 ,  G06F8/33 ,  G06F8/36 ,  G06F8/71 ,  G06F17/30289 ,  G06F17/30292 ,  G06F17/30587

    摘要： A development account is provisioned, the provisioning including a request for a backing service. The backing service includes: generating a developer schema in a database, generating a table link in the developer schema to shared tables required for the new development environment, generating a delta table, and generating a union view with a defined instead-of-trigger used to write, update, or delete from the delta table upon a write, update, or delete operation on the union view. A runtime application server is obtained and a repository is configured in a version control system. The runtime application server is configured to connect to the generated developer schema of the provisioned development account, and an identifier is provided to the provisioned development account.

    Visualization of access permission status
    5.
    发明授权
    Visualization of access permission status 有权

    公开(公告)号：US09894071B2

    公开(公告)日：2018-02-13

    申请号：US14510479

    申请日：2014-10-09

    申请人： Varonis Systems Inc.

    发明人： Yakov Faitelson ,  Ohad Korkus ,  Ophir Kretzer

    IPC分类号： G06F17/30 ,  H04L29/06 ,  G06F21/62

    CPC分类号： H04L63/10 ,  G06F17/30126 ,  G06F17/30587 ,  G06F21/6218

    摘要： Queries regarding access permissions of users and rights to directories in a complex enterprise are executed in near real-time, using lookups to tables that form a condensed database maintained for each file server. User information is condensed by arranging users in user groups having common data access rights. Directory permissions storage is condensed by showing only distinctive permissions to a directory in a table entry, and referencing inherited permissions of parent directories. The tables indicate recursive and ancestral relationships among the user groups and directories. They are developed and updated in advance of any queries. A consolidated view of the query results is presented on a single display screen. Using the tables results can be obtained without exhaustive searches of large file system tables.

    ATOMIC UPDATING OF GRAPH DATABASE INDEX STRUCTURES
    8.
    发明申请
    ATOMIC UPDATING OF GRAPH DATABASE INDEX STRUCTURES 审中-公开

    公开(公告)号：US20170255709A1

    公开(公告)日：2017-09-07

    申请号：US15058032

    申请日：2016-03-01

    申请人： LinkedIn Corporation

    发明人： SungJu Cho ,  Jiahong Zhu ,  Yinyi Wang ,  Roman A. Averbukh ,  Scott M. Meyer ,  Shyam Shankar ,  Qingpeng Niu ,  Karan R. Parikh

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30949 ,  G06F17/3033 ,  G06F17/30336 ,  G06F17/30587 ,  G06F17/30958

    摘要： The disclosed embodiments provide a system for updating an index structure of a graph database storing a graph. During operation, the system includes, in the index structure, a first compressed edge store containing a first compact representation of edges in the graph at a first virtual time and a first series of updates to the edges after the first virtual time. At a second virtual time, the system creates a second compact representation of the edges from the first compact representation and the first series of updates. The system then appends, to the second compact representation, a second series of updates to the edges after the second virtual time to produce a second compressed edge store. Finally, the system updates the index structure by atomically replacing, in the index structure, a reference to the first compressed edge store with a reference to the second compressed edge store.