Abstract: A method and apparatus for interfacing with a stateless NFS (Network File System) server. A pseudo-open state is created for a file when a request from a network client for accessing the file is received in a network server. The term pseudo-open data relates to a set of data that is kept in a network server. The pseudo-open describes the state of a file being currently accessed via an NFS server in the network server. The pseudo-open data differs from normal file state data in that it can be created or recreated at will, thus preserving the stateless functionality of the NFS server. Thus, if a request is received at any time and there is no pseudo-open state established for the file, the pseudo-open state will be established or reestablished at that time. If, on the other hand, a request is received for which a pseudo-open state already exists, the overhead of creating the pseudo-open state is avoided, and the existing data is used. The pseudo-open state is stored in a file-system data structure called VNODE.

Abstract: A method is described for operating a data processing system having a plurality of processors to sort a set of data records each having an associated key for governing the sort process. The method comprises determining a range for the key values by sampling the key values. The range is divided into a plurality of quantiles, one for each processor, each quantile having a respective index. At each processor, a plurality of buckets are defined, each bucket corresponding to a respective one of a plurality M.sub.p of subintervals in the quantile, each subinterval having a respective index. The index of the quantile in which the key value lies and the index of the subinterval in which the key value lies are determined directly from the key values using fast operations. Each key is distributed to the processor corresponding to the quantile in which the key value lies.

Abstract: A computer system for managing a plurality of data types. Particularly, this invention relates to a computer system for capturing instruction data, including audio, image, charts, CAD, text, numeric and background data, from an instructor and/or searched data, including text, numeric, database, diagnostic, CAD, audio and image data, for use in teaching and learning about, as well as analyzing, different subject matter.

Abstract: A method for updating detecting and loading CD volume indexes from a multiple-CD set to a cumulative volume table contained in a computer memory. The method employs an volume index file on each intermediate CD of the set along with a dual index file feature on the last CD of the set. The second index file on the last CD is a cumulative file of all the index files contained on all the CDs of the set. The cumulative index file on the last CD is compared to the cumulative volume table to generate a list of missing volumes which have not already been loaded into computer memory. The method permits determining whether a given CD is a single CD or a CD that is one of a multiple-CD set by detecting the presence of a second volume index file on the CD.

Abstract: A method, system and computer program for picking up and simultaneously executing common processings among a plurality of retrieval processings present in a series of queries so as to retrieve data from a database. The invention also provides a method, system and computer program for performing a query compiling. The invention performs a common scanning processing of data in the database while performing a judging operation according to retrieval conditions included in the retrieval processings of a query. Data judged to satisfy the retrieval conditions are set in output buffers and are transferred to the next processing nodes. Query-compiling is performed by detecting common processings from a query execution tree and transforming the common processings into a common scanning processing.

Abstract: Information retrieval methods and apparatus which involve: 1) the generation of estimates regarding the probability that items included in search results are already known to the user and 2) the use of such knowledge probability estimates to influence the ranking of search results, are described. By discounting the ranking, or adjusting ranking values generated by a known search engine as a function of the knowledge probability estimates, the present invention reduces or eliminates the risk of locating known information near the top of a list of search results. This is advantageous since known information is generally of little interest to a user. In various embodiments the popularity of an item is used to estimate the probability that the item is already known to a user.

Abstract: A method of processing bit vectors or raw bit strings wherein the bit vectors or raw bit strings are input to a binary tree structure of processing elements. Each processing element performs a boolean "OR" operation on a pair of inputs to produce an output stream of compressed bit string fragments. Processing takes place according to dataflow principles, wherein the processing element is activated when data is available at its inputs. The output compressed bit string fragments are buffered in a FIFO before being input to another processing element at a lower level of the binary tree. A resultant bit vector or raw bit string is output from the processing element representing the root node of the binary tree. The resultant bit vector or raw bit string is a representation of the result of the boolean "OR" of all inputs.

Abstract: A computer-based uniform data interface (UDI) system for accessing in a uniform manner data from a data source with an arbitrary organization. The UDI system provides a UDI application programming interface (API) with functions for creating and accessing data organized into containers that contain one or more folders. Each folder optionally contains sub-folders and scalars. The UDI system also provides a UDI registry for registering types of containers and folders supported by a data source, for enumerating the types of containers and folders supported by the data source, and for instantiating container and folder objects corresponding to the data of the data source.

Abstract: A method and apparatus for pre-processing and packaging class files. Embodiments remove duplicate information elements from a set of class files to reduce the size of individual class files and to prevent redundant resolution of the information elements. Memory allocation requirements are determined in advance for the set of classes as a whole to reduce the complexity of memory allocation when the set of classes are loaded. The class files are stored in a single package for efficient storage, transfer and processing as a unit. In an embodiment, a pre-processor examines each class file in a set of class files to locate duplicate information in the form of redundant constants contained in a constant pool. The duplicate constant is placed in a separate shared table, and all occurrences of the constant are removed from the respective constant pools of the individual class files.

Abstract: A method, apparatus, and article of manufacture for an intelligent compiler. A query is executed in a computer to retrieve data from a relational database stored on a data storage device. One or more scripting language statements are compiled to generate an internal representation. Then, the execution of the scripting language statements is optimized using the generated internal representation.

Abstract: In a database system that stores database objects in partitioned mode using bins to represent storage locations at which individual records of an object are stored, after they have been partitioned into logical buckets, a cascaded round-robin mapping method assigns buckets to bins evenly, while minimizing the movement of buckets when new bins are added and while minimizing memory overhead requirements. The method includes entering a do loop for an index counter variable j=m to 0 by -1, wherein "m" is the number of times new bins have been added since the last database reorganization. A variable y is set equal to x modulo n.sub.j, wherein n.sub.j is the number of bins after the j.sup.th database expansion. If y.gtoreq.n.sub.j-1, y is established to be the bin identification. Buckets are moved to populate new bins based on modulo n+k, wherein k is the number of bins added in the current expansion.

Abstract: A method and system for mapping between relational schema and object schema, wherein the relational schema includes a table having a tiebreaker column. In accordance with the present invention, an object-oriented application program may instantiate a persistent dependent object with one of two or more specific instances that is selected in response to the value of a data element in a tiebreaker column. Alternatively, an object-oriented application program may instantiate a persistent entity object in accordance with one of two or more entity classes that is selected in response to the value of a data element in a tiebreaker column.

Abstract: A method and computer program product for classifying network communication packets being processed in a network stack. The computer program product is a centralized packet classifier that receives classification requests from drivers or other clients according to a defined interface. This reduces the cost for producing a driver since less code is required initially at development time as well as a corresponding reduction in maintenance costs. The present invention groups drivers or other clients that utilize a certain body of classification information into classification families. Further, reference patterns used to make classifications are stored in separate databases depending on whether they are specific or general.

Abstract: The invention provides in a first aspect a novel synchronous motor in which the rotor comprises a substantially solid multi-pole magnet axially displaced from the coil which, itself, is of substantially the same diametrical size. With this arrangement a very powerful motor can be provided for a relatively small size and is suitable for use in powering ornaments such as Christmas tree ornaments direct from a socket of a fairy light string or decorative lights. In a second aspect of the invention, reciprocation means are provided suitable for use with the synchronous motor of the first aspect which can automatically raise and lower ornaments and similar novelty items. In a third aspect of the invention reciprocation means is provided which may be used either with the synchronous motor of the invention or with a conventional D.C. motor to provide for winding and sudden unwinding of a cord and hence an ornament or a novelty item attached thereto.

Abstract: A method and apparatus for parallelizing operations that change a database is provided. A coordinator process receives a statement that requires data to be written into the database. In response to the statement, the coordinator process assigns granules of work to multiple processes. Each of the multiple processes executes the granule of work by writing to the database a distinct portion of the set of data that is to be added to the database. The various portions of data are then merged to update the set of data to be added to the database.

Abstract: A method for executing an iterative search for a desired record (111) in an ordered list of records (102) residing on a relatively slow background memory (214) includes a number of steps for copying the keys at relevant positions (112,114,116) into a relatively fast foreground memory (206). The method according to the invention retains a selection (230) among those keys in the foreground memory (206) for speeding-up the searching of a next desired record.

Abstract: A Client/Server Database system is described which includes a Database Server providing methods for executing system-created internal command statements (e.g., SQL statements), such as those which ordinarily are submitted to the server by various Clients. The Database Server is modified so that it can be its own "user," thus removing the fundamental schism which had existed in prior systems. The system is allowed to issue SQL commands to itself and, thus, can do anything that either the system or the user can do. The methodology is particularly useful for carrying out upgrades. The system can now set flags that are not accessible to users. Unlike a standalone "utility" approach, however, authentication is assured. Here, the system is assured that a known user--itself--has issued the command. As a result, it is no longer necessary to expose "dangerous" system functions to users.

Abstract: Disclosed is an improvement to the stability of D.C. motor brushes mounted in brush boxes with wings is improved by angling the wings toward the commutator such that the brush spring contacts the brush at one or more points intermediate the ends of the brush. Improved cooling is provided by utilizing an end plate with apertures and a brush plate which in combination with the commutator, provides a brush plate aperture for cooling air flow. In a preferred embodiment, speed variations of the motor can be achieved by selectively disconnecting one or more brushes in a four brush embodiment reducing the torque and rotating speed of the motor. In a preferred embodiment, the use of a diode to interconnect same polarity brushes permits a speed change to be accomplished by selectively connecting one or the other end of the diode.

Abstract: A communication-efficient change log historian allows workstations having images of a shared memory to remain correlated to the shared memory. The system comprises one or more workstations connected to a microprocessor-based device which includes a memory device. The memory device includes the shared memory, and also stores a memory change list and a memory change index. The memory change list forms a list of changes which have been made to the information stored in the shared memory area, and the change index is indicative of the location of the most recent entry to the memory change list. The workstations maintain an image of the shared memory area, and store workstation change indexes which are indicative of the most recent entry to the memory change list which has also been implemented to respective images of the shared memory area in the workstations.

Abstract: In one aspect, the disclosed technique detects common leading byte patterns in the integers so that these patterns need only be stored once in the encoded byte stream. Those integers that share a common leading byte pattern are stored in truncated form, without their common leading bytes. These truncated integers may themselves be further examined to determine if any of them share additional common leading bytes beyond those already detected. Thus, the technique lends itself naturally to description using the language of trees. Integers with a common leading byte pattern are stored as child nodes, their parent being the node containing the common byte pattern. Child nodes consist only of those bytes remaining after the initial byte pattern has been extracted; the greater the number of children, the greater are the efficiency gains. All the children of a given tree or subtree are similarly examined for common leading byte patterns, ignoring those bytes that are already accounted for in their ancestor nodes.