Abstract: A method of processing a query to a graph database using processors. The method comprises providing threads to be executed on processors, each the thread is associated with one of a plurality of unique thread identifiers, providing a graph database having a plurality of graph database nodes and a plurality of graph database edges, each the graph database edge represents a relationship between two of the plurality of graph database nodes, receiving a query tree that defines a tree comprising plurality of query nodes connected by a plurality of query tree edges, and searching at least part of the graph database for a match with the query tree, wherein the searching is executed by the processors, and wherein each processor searches one of a plurality of sub-graphs of the graph database, each the sub-graph is defined by one of the plurality of thread identifiers.

Abstract: A method of processing a query to a graph database using processors. The method comprises providing threads to be executed on processors, each the thread is associated with one of a plurality of unique thread identifiers, providing a graph database having a plurality of graph database nodes and a plurality of graph database edges, each the graph database edge represents a relationship between two of the plurality of graph database nodes, receiving a query tree that defines a tree comprising plurality of query nodes connected by a plurality of query tree edges, and searching at least part of the graph database for a match with the query tree, wherein the searching is executed by the processors, and wherein each processor searches one of a plurality of sub-graphs of the graph database, each the sub-graph is defined by one of the plurality of thread identifiers.

Abstract: A method of processing a query to a graph database using a plurality of processors. The method comprises providing a plurality of threads to be executed on a plurality of processors, each the thread is associated with one of a plurality of unique thread identifiers, providing a graph database having a plurality of graph database nodes and a plurality of graph database edges, each the graph database edge represents a relationship between two of the plurality of graph database nodes, receiving a query tree that defines a tree comprising plurality of query nodes connected by a plurality of query tree edges, and searching at least part of the graph database for a match with the query tree, wherein the searching is executed by the plurality of the processors, and wherein each the processor searches one of a plurality of sub-graphs of the graph database, each the sub-graph is defined by one of the plurality of thread identifiers.

Abstract: A system and method for searching a document for a query pattern. A plurality of streams may be stored each including a linear sequence of nodes. Each stream may be associated with nodes having a common label in a data tree of the document. A query pattern may be searched for in the streams by executing a plurality of threads. Each of two or more of the threads may be used to search different sub-streams of the plurality of streams. Each of the different sub-streams searched for by each thread in each stream may be uniquely correlated with one or more disjoint sub-trees of a partition of the tree into a plurality of sub-trees. The two or more of the plurality of threads may be executed in parallel. A result of the query pattern search may be generated using at least one of the threads.

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. The low number of page accesses allows the reclustering to be carried out concurrently with data access.

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: A method of processing a query to a graph database using a plurality of processors. The method comprises providing a plurality of threads to be executed on a plurality of processors, each the thread is associated with one of a plurality of unique thread identifiers, providing a graph database having a plurality of graph database nodes and a plurality of graph database edges, each the graph database edge represents a relationship between two of the plurality of graph database nodes, receiving a query tree that defines a tree comprising plurality of query nodes connected by a plurality of query tree edges, and searching at least part of the graph database for a match with the query tree, wherein the searching is executed by the plurality of the processors, and wherein each the processor searches one of a plurality of sub-graphs of the graph database, each the sub-graph is defined by one of the plurality of thread identifiers.

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. The low number of page accesses allows the reclustering to be carried out concurrently with data access.

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: A system and method for searching a document for a query pattern. A plurality of streams may be stored each including a linear sequence of nodes. Each stream may be associated with nodes having a common label in a data tree of the document. A query pattern may be searched for in the streams by executing a plurality of threads. Each of two or more of the threads may be used to search different sub-streams of the plurality of streams. Each of the different sub-streams searched for by each thread in each stream may be uniquely correlated with one or more disjoint sub-trees of a partition of the tree into a plurality of sub-trees. The two or more of the plurality of threads may be executed in parallel. A result of the query pattern search may be generated using at least one of the threads.

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: 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.