公开(公告)号：US20140297651A1

公开(公告)日：2014-10-02

申请号：US14199095

申请日：2014-03-06

Applicant: Moshe SHADMON

Inventor： Moshe SHADMON

IPC: G06F17/30

CPC classification number: G06F16/2228

Abstract: In a Database Management System (DBMS), an index is used to organize the data such that the data can be efficiently retrieved to satisfy queries. The index may be organized in blocks which are stored in memory or on disk of a computer system. To satisfy a DBMS request, such as an update or query of data, multiple index blocks may need to be retrieved and processed. The claimed subject matter reduces the number of index blocks that needs to be retrieved and processed to satisfy the DBMS requests.

Abstract translation: 在数据库管理系统（DBMS）中，使用索引来组织数据，以便可以有效地检索数据以满足查询。 索引可以以存储在计算机系统的存储器或磁盘中的块来组织。 为了满足数据库管理系统请求，例如更新或查询数据，可能需要检索和处理多个索引块。 所要求保护的主题减少了需要检索和处理以满足DBMS请求的索引块的数量。

公开(公告)号：US20120047186A1

公开(公告)日：2012-02-23

申请号：US13267489

申请日：2011-10-06

Applicant: Moshe SHADMON ,  Neal Sample ,  Brian Cooper ,  Michael J. Franklin

Inventor： Moshe SHADMON ,  Neal Sample ,  Brian Cooper ,  Michael J. Franklin

IPC: G06F17/30

CPC classification number: G06F16/81 ,  G06F16/835 ,  Y10S707/955 ,  Y10S707/956 ,  Y10S707/99942

Abstract: A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way that facilitates efficient search and browsing.

Abstract translation: 一种用于编码XML树数据的方法，其包括将半结构化数据编码成任意长度的字符串的步骤，其维持关于XML数据的非结构化信息和结构化信息，并且能够按照以下方式索引编码的XML数据： 促进有效的搜索和浏览。

公开(公告)号：US20020120598A1

公开(公告)日：2002-08-29

申请号：US09791579

申请日：2001-02-26

Applicant: ORI SOFTWARE DEVELOPMENT LTD.

Inventor： Moshe Shadmon ,  Neal Sample ,  Brian Cooper ,  Michael J. Franklin

IPC: G06F007/00

CPC classification number: G06F17/30911 ,  G06F17/30929 ,  Y10S707/955 ,  Y10S707/956 ,  Y10S707/99942

Abstract: A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way facilitates efficient search and browsing.

Abstract translation: 一种用于编码XML树数据的方法，其包括以保持关于XML数据的非结构和结构信息的方式将半结构化数据编码成任意长度的字符串的步骤，并且能够以某种方式对编码的XML数据进行索引 高效的搜索和浏览。

公开(公告)号：US20120310881A1

公开(公告)日：2012-12-06

申请号：US13468717

申请日：2012-05-10

Applicant: Moshe SHADMON

Inventor： Moshe SHADMON

IPC: G06F17/30

CPC classification number: G06F17/30578 ,  G06F17/30362

Abstract: In a cluster where multiple database nodes are synchronized by a distributed lock manager, a process that includes one or more messages that are sent from one or more nodes to a distributed lock manager, wherein one or more of said messages are asynchronous lock taken messages.

Abstract translation: 在由分布式锁管理器同步多个数据库节点的集群中，包括从一个或多个节点发送到分布式锁管理器的一个或多个消息的过程，其中一个或多个所述消息是异步锁定消息。

公开(公告)号：US20030204515A1

公开(公告)日：2003-10-30

申请号：US10379002

申请日：2003-03-05

Applicant: ORI SOFTWARE DEVELOPMENT LTD.

Inventor： Moshe Shadmon ,  Neal Sample

IPC: G06F017/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遍及其孩子。 该指数构成块的平衡结构。