Abstract: A computer data storage management system includes a memory employing a hierarchical data structure comprising a plurality of nodes (root, branch and leaf), in particular a multi-dimensional information database. The branch nodes are index nodes and the leaf nodes are data nodes. The index nodes are arranged in an index tree structure. When extra information inserted into the memory results in index node overflow, the index node is split and, in certain specified circumstances, an index entry will become disposed at an index tree level higher than the hierarchical level to which it corresponds, i.e. is promoted. Whilst this makes the index tree unbalanced, it facilitates the addition of information to and the searching of such a database.
Type:
Grant
Filed:
May 20, 1996
Date of Patent:
December 23, 1997
Assignee:
European Computer-Industry Research Centre GmbH
Abstract: In a method for processing logic programs--especially in Prolog-like languages--using at least one processor, which allows parallelism--also retroactively--by an existing process, called "father", creating at optional OR-parallel nodes at least one process, called "son", standing in an OR-parallel relationship to the father, a deep-binding list, called "hash-window" is created only for the newly created son in which--while processing the split-off OR-parallel branch--it performs bindings to variables commonly accessible to it and its father, called "commonly accessible variables.
Type:
Grant
Filed:
July 2, 1987
Date of Patent:
June 5, 1990
Assignee:
European Computer-Industry Research Centre GmbH
Inventors:
Jean-Claude Syre, Harald Westphal, Max Hailperin