中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

37 records (took 0.018 seconds)

    Efficient traversals over hierarchical data and indexing semistructured data
    4.
    发明申请
    Efficient traversals over hierarchical data and indexing semistructured data 审中-公开
    对层次化数据进行高效遍历和索引半结构化数据

    公开(公告)号：US20080071733A1

    公开(公告)日：2008-03-20

    申请号：US11905585

    申请日：2007-10-02

    Applicant: Moshe Shadmon ,  Neal Sample

    Inventor： Moshe Shadmon ,  Neal Sample

    IPC: G06F17/30

    CPC classification number: G06F16/30 ,  G06F16/81 ,  Y10S707/99942 ,  Y10S707/99943

    Abstract: A method for encoding hierarchical data stored in an index, partitioned into blocks, over keys representing the data. For every key K representing a record R in the index, the key of the children records of record R are prefixed with K. The method includes traversing to a first R record represented in the index, traversing from the record R to the next sequential R such that the path in the index from the position representing R to the position representing the next sequential R does not include information relating to the children of R. Next, repeating the latter operation for 0 or more R records, and for any 0 or more particular R records, traversing from the particular R to its children. The index constitutes a balanced structure of blocks.

    Abstract translation: 一种用于编码存储在索引中的分层数据的方法，所述索引被划分成块，通过代表数据的键。 对于表示索引中的记录R的每个关键字K，记录R的子记录的密钥以K为前缀。该方法包括遍历索引中表示的第一个R记录，从记录R遍历到下一个顺序R 使得从表示R的位置到表示下一个顺序R的位置的索引中的路径不包括与R的子项有关的信息。接下来，对于0个或更多个R记录重复后一个操作，并且对于任何0个或更多个R记录 特定的R记录，从特定的R遍及其孩子。 该指数构成块的平衡结构。

    Efficient traversals over hierarchical data and indexing semistructured data
    8.
    发明授权
    Efficient traversals over hierarchical data and indexing semistructured data 有权
    对层次化数据进行高效遍历和索引半结构化数据

    公开(公告)号：US07287033B2

    公开(公告)日：2007-10-23

    申请号：US10379002

    申请日：2003-03-05

    Applicant: Moshe Shadmon ,  Neal Sample

    Inventor： Moshe Shadmon ,  Neal Sample

    IPC: G06F17/00

    CPC classification number: G06F17/30911 ,  G06F17/3061 ,  Y10S707/99942 ,  Y10S707/99943

    Abstract: A method for encoding hierarchical data stored in an index, partitioned into blocks, over keys representing the data. For every key K representing a record R in the index, the key of the children records of record R are prefixed with K. The method includes traversing to a first R record represented in the index, traversing from the record R to the next sequential R such that the path in the index from the position representing R to the position representing the next sequential R does not include information relating to the children of R. Next, repeating the latter operation for 0 or more R records, and for any 0 or more particular R records, traversing from the particular R to its children. The index constitutes a balanced structure of blocks.

    Abstract translation: 一种用于编码存储在索引中的分层数据的方法，所述索引被划分成块，通过代表数据的键。 对于表示索引中的记录R的每个关键字K，记录R的子记录的密钥以K为前缀。该方法包括遍历索引中表示的第一个R记录，从记录R遍历到下一个顺序R 使得从表示R的位置到表示下一个顺序R的位置的索引中的路径不包括与R的子项有关的信息。接下来，对于0个或更多个R记录重复后一个操作，并且对于任何0个或更多个R记录 特定的R记录，从特定的R遍及其孩子。 该指数构成块的平衡结构。

    Method and apparatus for ternary PATRICIA trie blocks
    9.
    发明授权
    Method and apparatus for ternary PATRICIA trie blocks 有权
    用于三元PATRICIA trie块的方法和装置

    公开(公告)号：US07299235B2

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

    申请号：US10899657

    申请日：2004-07-26

    Applicant: Neal Sample

    Inventor： Neal Sample

    IPC: G06F17/30

    CPC classification number: G06F17/30625 ,  Y10S707/99933 ,  Y10S707/99953

    Abstract: An architecture and method for efficient termination of variable length keys in a PATRICIA trie is disclosed. By adding a null-labeled link, it is possible to terminate such variable length PATRICIA trie nodes, allowing to overcome the need for complex termination solutions. Specifically, a ternary PATRICIA block is introduced.

    Abstract translation: 公开了一种用于有效终止PATRICIA trie中的可变长度密钥的体系结构和方法。 通过添加空标签链接，可以终止这种可变长度的PATRICIA特里节点，从而克服复杂终端解决方案的需要。 具体来说，引入了三元PATRICIA块。

    Control for enabling a user to preview display of selected content based on another user's authorization level
    10.
    发明申请
    Control for enabling a user to preview display of selected content based on another user's authorization level 有权
    用于使用户能够基于另一用户的授权级别来预览所选内容的显示的控制

    公开(公告)号：US20060184578A1

    公开(公告)日：2006-08-17

    申请号：US11314201

    申请日：2005-12-20

    Applicant: Michael La Rotonda ,  Neal Sample ,  Paul Brody ,  Ellen Perelman ,  Ericson DeJesus

    Inventor： Michael La Rotonda ,  Neal Sample ,  Paul Brody ,  Ellen Perelman ,  Ericson DeJesus

    IPC: G06F7/00

    CPC classification number: H04L67/306 ,  G06F21/6218 ,  G06F21/6227 ,  G06Q10/10 ,  G06Q50/01 ,  H04L51/32 ,  Y10S707/916 ,  Y10S707/959 ,  Y10S707/961 ,  Y10S707/99933 ,  Y10S707/99939 ,  Y10S707/99945

    Abstract: Enabling a first user to preview content as it would be seen by a second user, if the second user had a selected user relationship with the first user. The selected user relationship may comprise a relationship degree, a relationship category, a relationship rating, and/or other form of relationship. In one embodiment, a user interface enables the first user to assign user relationships to portions of content and to other users. The first user selects a user relationship, which is used to access those portions of content that are associated with the first user and assigned the selected user relationship. The corresponding portions of content are used to generate a preview display for the first user, illustrating the portions of content that would be accessible to other users assigned the same user relationship or assigned a closer user relationship. Preview may be generated by a server or a local client.

    Abstract translation: 如果第二用户具有与第一用户的选择的用户关系，则允许第一用户预览内容，如第二用户将看到的内容。 所选择的用户关系可以包括关系度，关系类别，关系评级和/或其他形式的关系。 在一个实施例中，用户界面使得第一用户能够将用户关系分配给内容的部分和其他用户。 第一用户选择用于访问与第一用户相关联并分配所选择的用户关系的内容的那些部分的用户关系。 内容的相应部分被用于为第一用户生成预览显示，示出了被分配了相同用户关系或分配了更密切的用户关系的其他用户可访问的内容部分。 预览可能由服务器或本地客户端生成。

Patent Agency Ranking