公开(公告)号：US07469249B2

公开(公告)日：2008-12-23

申请号：US10795534

申请日：2004-03-08

Applicant: George Andrei Mihaila ,  Sriram Padmanabhan ,  Oded Shmueli

Inventor： George Andrei Mihaila ,  Sriram Padmanabhan ,  Oded Shmueli

IPC: G06F17/00

CPC classification number: G06F17/30932 ,  Y10S707/99931 ,  Y10S707/99943 ,  Y10S707/99945 ,  Y10S707/99953

Abstract: Techniques are provided for automatically rewriting a relational-to-hierarchical mapping into one or more modified mappings. In this way, clients that prefer or require different portions of the mapping-defined data are supported. For example, in one aspect of the invention, a technique for modifying a relational-to-hierarchical mapping in accordance with at least one user query includes the following steps/operations. At least one query associated with a query language that supports a hierarchical data structure is obtained. Further, at least one relational-to-hierarchical mapping for use in translating data associated with a relational data structure into data associated with the hierarchical data structure is obtained. Then, the at least one relational-to-hierarchical mapping is modified based on the at least one query such that data specifically relevant to the at least one query may be generated in accordance with the modified relational-to-hierarchical mapping.

Abstract translation: 提供了用于将关系到分层映射自动重写成一个或多个修改的映射的技术。 以这种方式，支持偏好或需要映射定义数据的不同部分的客户端。 例如，在本发明的一个方面，根据至少一个用户查询修改关系到分层映射的技术包括以下步骤/操作。 获得与支持分层数据结构的查询语言相关联的至少一个查询。 此外，获得用于将与关系数据结构相关联的数据转换成与分层数据结构相关联的数据的至少一个关系到分层映射。 然后，基于至少一个查询来修改至少一个关系到分层映射，使得可以根据修改的关系到分层映射生成与至少一个查询特别相关的数据。

公开(公告)号：US08930407B2

公开(公告)日：2015-01-06

申请号：US13000022

申请日：2009-06-18

Applicant: Oded Shmueli ,  Lila Shnaiderman

Inventor： Oded Shmueli ,  Lila Shnaiderman

IPC: G06F17/30

CPC classification number: G06F17/30923 ,  G06F17/30911 ,  G06F17/30961

Abstract: In a data storage and retrieval system wherein data is stored and retrieved in pages, said data comprising connected nodes arranged such that each page stores only complete nodes, said connected nodes being connected via a plurality of overlapping tree structures, a method of minimizing page retrieval in the face of changing relationships between nodes comprising: selecting at least two of said overlapping tree structures; incrementally adjusting a page node structure dynamically based on real time workload, separately according to each selected tree structure, to form modified partitions for each tree structure, each modified partition being so as to minimize page faults; for each modified partition calculating a modification gain to indicate which partition has provided a greater minimization of page faults; and selecting the tree structure and modified partition corresponding to the best modification gain.

Abstract translation: 在其中以页面存储和检索数据的数据存储和检索系统中，所述数据包括被布置为使得每个页面仅存储完整节点的连接节点，所述连接的节点通过多个重叠的树结构连接，一种使页面检索最小化的方法 面对改变节点之间的关系，包括：选择所述重叠树结构中的至少两个; 根据每个选择的树结构，分别根据实时工作量动态地调整页面节点结构，以形成每个树结构的修改的分区，每个修改的分区是最小化页面错误; 对于每个修改的分区计算修改增益以指示哪个分区提供了更大的页面错误的最小化; 并选择对应于最佳修改增益的树结构和修改分区。

公开(公告)号：US08880505B2

公开(公告)日：2014-11-04

申请号：US13920110

申请日：2013-06-18

Applicant: Oded Shmueli ,  Royi Ronen

Inventor： Oded Shmueli ,  Royi Ronen

IPC: G06F17/30

CPC classification number: G06F17/30466 ,  G06F17/30498 ,  G06F17/30545

Abstract: A method and apparatus for resolving conjunctive queries, comprising relational predicates and external predicates, such as XML predicates. The method and apparatus obtain results from a relational engine or from an external engine, and then use the obtained results as input for the other engine, so as to optimize the activity of the other engine. The process may repeat further times, with the results obtained by the other engine being input to the first engine. The method and apparatus further disclose handling value, being isomorphic hierarchical subtrees.

Abstract translation: 一种用于解决连接查询的方法和装置，包括关系谓词和外部谓词，如XML谓词。 该方法和装置从关系引擎或外部引擎获得结果，然后使用获得的结果作为另一引擎的输入，以便优化其他引擎的活动。 该过程可以重复进一步的时间，其他发动机获得的结果被输入到第一发动机。 该方法和装置进一步公开处理值，即同构分层子树。

公开(公告)号：US08711866B2

公开(公告)日：2014-04-29

申请号：US13118503

申请日：2011-05-30

Applicant: Oded Shmueli ,  Benny Yehezkel

Inventor： Oded Shmueli ,  Benny Yehezkel

IPC: H04L12/16 ,  H04L12/28 ,  H04H20/71

CPC classification number: H04L65/1069 ,  H04L29/06027 ,  H04L65/60 ,  H04L67/04 ,  H04L67/303 ,  H04M3/42263 ,  H04M3/543 ,  H04M2201/60 ,  H04M2203/1091 ,  H04M2203/2066 ,  H04M2203/2094 ,  H04M2242/30

Abstract: Rerouting apparatus for rerouting data including multimedia data. The apparatus is for association with electronic equipment and allows for routing the data to a device regarded as the most convenient for playing the media. The apparatus comprises an announcer device for indicating to surrounding equipment that associated equipment is available for rerouting, thereby to enable receipt of rerouted communications therefrom, and a scout device for scanning surroundings of the associated equipment to find out about compatible equipment in the vicinity, thereby to reroute communications thereto. The apparatus may be attached to any device having data processing capability, to enable rerouting of data and communications therebetween.

Abstract translation: 用于重新路由数据的重新路由设备，包括多媒体数据。 该设备用于与电子设备相关联并且允许将数据路由到被认为是最方便播放媒体的设备。 该装置包括用于向周围设备指示相关联的设备可用于重新路由的播音器设备，从而能够从其接收重新路由的通信，以及用于扫描相关设备的周围环境的侦察设备，以找出附近的兼容设备，从而 重新路由通信。 该装置可以附接到具有数据处理能力的任何设备，以使得能够重新路由它们之间的数据和通信。

公开(公告)号：US08683388B2

公开(公告)日：2014-03-25

申请号：US12216607

申请日：2008-07-08

Applicant: Gershon Elber ,  Orit Shaked ,  Oded Shmueli

Inventor： Gershon Elber ,  Orit Shaked ,  Oded Shmueli

IPC: G06F3/048

CPC classification number: A63F13/52 ,  A63F13/00 ,  A63F13/25 ,  A63F13/35 ,  G06F3/04815 ,  G06T17/00 ,  G06T19/20 ,  G06T2219/2004 ,  G06T2219/2021

Abstract: A method for restricting the number of consequential interactions to further virtual objects having a relationship with a first virtual object, resulting from an interaction with said first virtual object. The method comprises: defining a maximum number of consequential interactions, counting consequential interactions, and stopping further interaction when the maximum number of consequential interactions is reached.

Abstract translation: 一种用于将后续交互次数限制为与由所述第一虚拟对象的交互而产生的与第一虚拟对象有关系的另外的虚拟对象的数量的方法。 该方法包括：定义最终数量的后果性交互，计算相应的交互，并在达到最终间接交互次数时停止进一步交互。

公开(公告)号：US20110208737A1

公开(公告)日：2011-08-25

申请号：US12989664

申请日：2009-05-19

Applicant: Oded Shmueli ,  Lila Shnaiderman

Inventor： Oded Shmueli ,  Lila Shnaiderman

IPC: G06F17/30

CPC classification number: G06F17/30598 ,  G06F17/30923 ,  G06F17/30961

Abstract: In a data storage and retrieval system wherein data arranged in nodes is stored and retrieved in pages, each page comprising a cluster of nodes, a method comprising: monitoring ongoing data retrieval to find retrieval patterns of nodes which are retrieved together and to identify changes in said retrieval patterns over time; and periodically reclustering the data nodes among said pages dynamically during usage of the data to reflect said changes, so that nodes more often retrieved together are migrated to cluster together and nodes more often required separately are migrated to cluster separately, thereby to keep small an overall number of page accesses of said data storage and retrieval system during data retrieval despite dynamic changes in patterns of data retrieval.

Abstract translation: 在数据存储和检索系统中，其中布置在节点中的数据被存储和检索在页面中，每个页面包括一簇节点，一种方法包括：监视正在进行的数据检索，以查找一起检索的节点的检索模式， 表示检索模式随时间推移; 并且在使用数据期间动态地重新聚集所述页面中的数据节点以反映所述改变，使得更经常一起检索的节点被迁移到群集，并且更多地需要分开的节点被分别迁移到集群，从而保持小的整体 数据检索期间所述数据存储和检索系统的页面访问数量，尽管数据检索模式的动态变化。

公开(公告)号：US20100205171A1

公开(公告)日：2010-08-12

申请号：US12679907

申请日：2008-09-28

Applicant: Oded Shmueli ,  Royi Ronen

Inventor： Oded Shmueli ,  Royi Ronen

IPC: G06F17/30

CPC classification number: G06F17/30545

Abstract: A method and apparatus for resolving conjunctive queries, comprising relational predicates and external predicates, such as XML predicates. The method and apparatus obtain results from a relational engine or from an external engine, and then use the obtained results as input for the other engine, so as to optimize the activity of the other engine. The process may repeat further times, with the results obtained by the other engine being input to the first engine. The method and apparatus further disclose handling value, being isomorphic hierarchical subtrees.

Abstract translation: 一种用于解决连接查询的方法和装置，包括关系谓词和外部谓词，如XML谓词。 该方法和装置从关系引擎或外部引擎获得结果，然后使用获得的结果作为另一引擎的输入，以便优化其他引擎的活动。 该过程可以重复进一步的时间，其他发动机获得的结果被输入到第一发动机。 该方法和装置进一步公开处理值，即同构分层子树。

公开(公告)号：US07512615B2

公开(公告)日：2009-03-31

申请号：US10703250

申请日：2003-11-07

Applicant: Rajesh Bordawekar ,  Sriram K. Padmanabhan ,  Oded Shmueli

Inventor： Rajesh Bordawekar ,  Sriram K. Padmanabhan ,  Oded Shmueli

IPC: G06F7/00 ,  G06F17/00

CPC classification number: G06F17/30923 ,  Y10S707/99942

Abstract: A method and system for clustering of XML documents is disclosed. The method operates under specified memory-use constraints. The system implements the method and scans an XML document, assigns edge-weights according to the application workload, and maps clusters of XML nodes to disk pages, all in a single parser-controlled pass over the XML data. Application workload information is used to generate XML clustering solutions that lead to substantial reduction in page faults for the workload under consideration. Several approaches for representing workload information are disclosed. For example, the workload may list the XPath operators invoked during the application along with their invocation frequencies. The application workload can be further refined by incorporating additional features such as query importance or query compilation costs. XML access patterns could be also modeled using stochastic approaches.

Abstract translation: 公开了一种用于XML文档聚类的方法和系统。 该方法在指定的内存使用限制下运行。 系统实现该方法并扫描XML文档，根据应用程序工作负载分配边缘权重，并将XML节点的集群映射到磁盘页面，所有这些都在XML数据的单个解析器控制的传递中。 应用程序工作负载信息用于生成XML集群解决方案，从而大大减少了所考虑的工作负载的页面错误。 公开了用于表示工作负载信息的几种方法。 例如，工作负载可能会列出应用程序中调用的XPath运算符及其调用频率。 可以通过结合附加功能（如查询重要性或查询编译成本）来进一步改进应用程序工作负载。 XML访问模式也可以使用随机方法建模。

公开(公告)号：US20090063952A1

公开(公告)日：2009-03-05

申请号：US12056233

申请日：2008-03-26

Applicant: Mukund Raghavachari ,  Oded Shmueli

Inventor： Mukund Raghavachari ,  Oded Shmueli

IPC: G06F17/00

CPC classification number: G06F17/2725 ,  G06F17/2247

Abstract: An improved system for determining compliance between a source document structure in accordance with a source schema and a target schema includes: data storage; and a processor for executing software code. The software code causes the processor to: create a source schema description and a target schema description; receive the source document which includes an ordered tree structure with labeled elements and including a subtree; identify all corresponding element types in the source and target schemas for grouping the corresponding element types into element type pairs; classify each element type pair; and confirm compliance of the source document.

Abstract translation: 用于确定根据源模式和目标模式的源文档结构的合规性的改进的系统包括：数据存储; 以及用于执行软件代码的处理器。 软件代码使处理器：创建源模式描述和目标模式描述; 接收源文档，其中包含带有标记元素并包括子树的有序树结构; 识别源和目标模式中的所有相应元素类型，以将相应的元素类型分组为元素类型对; 对每个元素类型对进行分类; 并确认源文档的符合性。

公开(公告)号：US20080270947A1

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

申请号：US12216607

申请日：2008-07-08

Applicant: Gershon Elber ,  Orit Shaked ,  Oded Shmueli

Inventor： Gershon Elber ,  Orit Shaked ,  Oded Shmueli

IPC: G06F3/048

CPC classification number: A63F13/52 ,  A63F13/00 ,  A63F13/25 ,  A63F13/35 ,  G06F3/04815 ,  G06T17/00 ,  G06T19/20 ,  G06T2219/2004 ,  G06T2219/2021

Abstract: A method for restricting the number of consequential interactions to further virtual objects having a relationship with a first virtual object, resulting from an interaction with said first virtual object. The method comprises: defining a maximum number of consequential interactions, counting consequential interactions, and stopping further interaction when the maximum number of consequential interactions is reached.

Abstract translation: 一种用于将后续交互次数限制为与由所述第一虚拟对象的交互而产生的与第一虚拟对象有关系的另外的虚拟对象的数量的方法。 该方法包括：定义最终数量的后果性交互，计算相应的交互，并在达到最终间接交互次数时停止进一步交互。