Abstract: In an image filing system in accordance with the present invention, image files containing images that should be displayed on a viewing monitor in a conference unit are selected from among retrieved image files using a mouse. A CPU determines how many image files are selected using the mouse and identifies management information contained in the selected image files. Under the control of the CPU, images in a work memory are temporarily stored in an image processor. The images in the image processor are displayed on a retrieval monitor. Management information contained in the selected image files and the number of selected image files are supplied from the CPU to a controller over a bus. Reduced images provided in the form of digital data and contained in the selected image files in the image processor are supplied to a D/A converter under the control of the controller. The D/A converter de-quantizes the digital data into analog data so as to display the reduced images on the viewing monitor.

Abstract: An information locator system providing for the expedient acquisition, validation and updating of information locators in a heterogenous network protocol environment. The locator system includes an information location discrimination engine coupleable to a network operating in the heterogeneous network protocol environment, a validation engine coupled to the information location discrimination engine to receive information locators and a database providing for the storage of information locators as discrete searchable resource locators. The validation engine is also connected to the data base for retrieving and storing resource locators. The validation engine provides for the autonomous interrogation of the heterogeneous network protocol environment to validate a predetermined information locator as a corresponding resource locator that is unique to the discrete searchable resource locators then stored by the database.

Abstract: Indexing and searching across multiple sorted arrays. In one embodiment, a method. First, for a plurality of arrays, each array having a plurality of elements indexable by a pointer for the array, finding a smallest element of a set of elements comprising the element of each array at the pointer for the array. Second, increasing the pointer for the array in which the smallest element was found. Third, repeating until a desired number of smallest elements is found.

Abstract: A method and device for displaying map data and related data and thereby permitting easy enlargement of the scope of the application of map-based data services, wherein additional drawing data for superposing on a map displayed on a screen, and setting data for specifying a map display, are sent and received between different application programs using inter-application exchange in a standard data format. Required map data and related data are displayed on the screen using a first application program having a function for converting received additional drawing data and setting data to the aforesaid data format and transmitting it by inter-application exchange, then using a second application program which displays a map on the display screen according to the setting data transmitted by the first application program and displays additional data on the screen map corresponding to the additional drawing data.

Abstract: The invention provides a mechanism for using statistics, in connection with various database query cost modeling techniques, to more accurately estimate the number of rows and UECs that will be produced by relational operators and predicates in database systems. The ability to accurately estimate the number of rows and UECs returned by a relational operator and/or a predicate is fundamental to computing the cost of a query execution plan. This, in turn, drives the optimizer's ability to select the query plan best suited for the desired performance goal. According to the present invention, histogram statistics are synthesized bottom up from the leaf nodes to the root node of a query tree.

Abstract: One or more searchable repositories of bookmark sets are stored in a computer system, each bookmark set can be downloaded to a client browser as a unit. Each bookmark set contains a set of Uniform Resource Locators (URLs) and is associated with related information such as a set of keywords, one or more topics and user specific information. The bookmark set is downloadable as a unit to a client browser. When a search query from a client containing a set of keywords is received, the stored bookmark sets are searched for one or more bookmark sets associated with at least one keyword matching a keyword from the search query. A list of bookmark sets which satisfy the query, i.e. are associated with matching keywords, are returned to the client browser. Responsive to a request for downloading a selected bookmark set, the selected bookmark is served to the client. The selected bookmark set is received and used by the client browser to access the set of URLs in the selected bookmark set.

Abstract: A menu authoring system is disclosed that uses an open hierarchical data structure to generate source code for hypertext list menus that constitute a content menu on a Web site. The authoring system allows developers to select how and when these menu files are generated and the optimum output file size. The authoring system can generate menu files at runtime or prior to a general release; it can also generate one or more list menus to the same hypertext file. This enables the Web developer to generate menu files that can be optimized for use in a client-server network, or used to track end-user navigation.

Abstract: A virtual bookshelf system provides a user a way to browse and locate information associated with a plurality of documents. The virtual bookshelf system contains classification information to classify the documents in a hierarchical structure that includes a plurality of hierarchical levels based on pre-defined categories. The virtual bookshelf system displays a portion of the hierarchical structure including a representation of the categories. A user of the virtual bookshelf system may browse through the categories in the hierarchical levels to learn the general topics of the available documents. The user is permitted to select a particular category, and in response, the virtual bookshelf system displays document information for documents classified in the category selected. When selected, peripheral themes or issues are displayed such that the themes relate to the main issues covered by the documents classified under the selected category.

Abstract: A technique for permitting a client in a client/server computing environment to query a plurality of databases for desired data utilizing a single query sent over a network one time. The single query need not be written in the syntax for the target database, but includes the names of the database and table within the database which contains the desired data. The query is sent from the client over the network via a specified socket, and is received by servers connected to the network which are listening to the specified socket. Each server includes code which determines if the desired data is present in a database which is associated therewith. If so, the server code generates an appropriate query for its associated database, retrieves the desired data from the database and forwards the data to the client over the network.

Abstract: An object-oriented interface is used to provide inheritance of object property information. A set of base object classes are created and stored in a persistent object state in non-volatile storage. A set of derived objects are then created using the base object classes and inherited base object property information. Derived object classes are saved in a persistent object state in non-volatile storage as a “delta” or difference between the derived object information and the inherited base object information. Saving only the derived class objects as a delta saves a significant amount of computer resources. When derived object is loaded, the base object class from which the derived object class inherited information is loaded first, then the derived object class delta is loaded. The two step loading process allows any changes made to the base object class to be automatically reflected in the derived object class by inheritance.

Abstract: A computer data signal embodied in a propagation medium is provided. The signal enables a variable number of data transfers and includes an initial connection source code segment and a data transfer source code segment. The initial connection source code segment establishes a connection between at least two devices via predetermined listening ports, with at least one predetermined listening port residing within each device. The initial connection source code segment also dynamically assigns a first data port within a first device, and transmits the address of the first data port to a remaining device via the predetermined listening ports. The data transfer source code segment is for each of the variable number of data transfer operations.

Abstract: A user of a system comprising a large set of information items, for example a multimedia database, is assisted by an agent in searching the set. The agent has a given affinity for the information items and selects a specific information item from the set in conformity with said affinity. On the basis of the interactions between the user and the system an image is formed of the affinity of the user for the information items. The agent utilizes this image, in addition to its own affinity, for the selection of a specific information item. A major application of the invention concerns a system in which the information items are presented as objects in a space and in which the agent guides the user through the space and proposes a specific object to the user.

Abstract: One or more searchable repositories of bookmark sets are stored in a computer system, each bookmark set can be downloaded to a client browser as a unit. Each bookmark set contains a set of Uniform Resource Locators (URLs) and is associated with the related information such as a set of key words, one or more topics and user specific information, the bookmark set is downloadable as a unit to the client browser. When a search query from a client containing a set of key words is received, the stored bookmark sets are searched for one or more bookmark sets associated with at least one keyword matching a keyword from the search query. A list of bookmark sets which satisfy the query, i.e. are associated with matching keywords, are returned to the client browser. Responsive to a request for downloading a selected bookmark set the selected bookmark is served to the client. The selected bookmark set is received and used by the client browser to access the set of URLs in the selected bookmark set.

Abstract: A method and system for altering content of a record in a database over Internet is provided. The method includes receiving a request generated over the Internet by a requester that requests records in the database. Searching the records for a requested record corresponding to the request and, upon finding the requested record, displaying the requested record content and an alter record indicator. The requester generating an alter record request over the Internet by selecting the alter record indicator and providing a verification address. If the alter record request contains the verification address, displaying a confirmation message to the requester. The confirmation message comprising a reply address and a reference code. The requester sending an alter record message containing the reference code to the reply address. After receipt of the alter record message at the reply address, determining whether the alter record message contains the reference code.

Abstract: A method, apparatus, and article of manufacture for using a relational database management system to support on-line analytical processing (OLAP) systems. A multi-dimensional database is defined using an outline that contains one or more dimensions, each dimension having a list of one or more members. A relational schema is defined based on the defined multi-dimensional database. A relational database is created based on the defined relational schema. The relational database is accessed using access mechanisms provided by the multi-dimensional database and the relational database.

Abstract: A full-text data base retrieving device retrieves a data base in accordance with a query. A full-text index has character location information representative of location of each of key character sequences of N characters that appear in the data base, where N is a positive integer. A query memory memorizes the query as a retrieval key character sequence. A separating section separates the retrieval key character sequence into a plurality of retrieval key character sequences of N characters to extract contexts as extracted contexts from the retrieval key character sequence in accordance with the retrieval key character sequences. A context classifying section classifies the extracted contexts into classified contexts having the classification numbers, respectively. An index retrieving section retrieves the full-text index in accordance with the sorts of the retrieval key character sequences and the classified contexts to read the character location information as a retrieval result out of the full-text index.

Abstract: In a computerized distributed mail system, a plurality of client computers are connected to each other via a network. Each client computer is configured to execute client mail application programs. A mail service system is also connected to the network. The system is for executing server mail programs on server computers. The mail service system includes an index server for storing mail messages in message files, and for storing a full-text index of the mail messages. In addition, the system includes means for accessing the mail messages by the plurality of client computers by searching the full-text index using queries.

Abstract: A apparatus, apparatus, and article of manufacture for a computer implemented inplace reorganization system. Data in a database is stored on a data storage device connected to a computer is reorganized. Large object data that needs to be reorganized within a table space is identified. One or more chunks in the table space are allocated to the identified large object data. In particular, a combination of full and partial chunks of space within the table space are allocated to contain the reorganized large object data. Then, the large object data is moved into the allocated chunks to reorganize the large object data inplace. Furthermore, the free space at the end of the table space may be reclaimed.

Abstract: In a DB retrieval method, a two-step retrieval including quantitative and qualitative retrievals is interactively performed so that, through the operation of image information (e.g. map information) having a correspondence to a DB having text information such as attribute information stored therein, attribute information corresponding to the map information is retrieved from the DB. The quantitative retrieval includes a DB information reading process for reading image information, attribute information and information relevant thereto, and a quantitative retrieval process for making a quantitative retrieval including the partial overlaying of another information for retrieval on the original image information (or map information) or a rough retrieval with the other information used as a retrieval key called information lens, and storing the result of retrieval into a work file.

Abstract: A system and method for propagating airline computerized reservation system TPF data to a relational database platform comprising a computerized reservation system transaction processing source computer in communication with an output data file, an input data structure, a functional server computer and a relational database management system target computer. The relational database management system target computer is in communication with the functional server computer and an output database. A data propagation selection means is resident within the transaction source computer and is in communication with the functional server computer and target relational database management system target computer. A function management means is resident within the functional server computer and is in communication with the transaction source computer and the relational database management system computer.