Abstract: An improved system and method for building a large index is provided. The system and method may be used by many applications to build a large index, including a search engine for crawling the World Wide Web. An indexing engine with an index merger may build an index of content by using a staged pipeline for merging sub-indexes. The index merger may concurrently merge sub-indexes created at multiple stages during indexing of content by using threads from a merging thread pool. When all the content has been indexed, the system may proceed to perform a final merge of all available sub-indexes to form a master index. The system and method may build a large index of any type of content including documents, images, audio streams, video streams and other types of content.

Abstract: An apparatus to be controlled has a storage and information relating to the free storage space of the storage. A control apparatus for recording information in the storage of the apparatus to be controlled by controlling the apparatus to be controlled acquires the information relating to the free storage space of the storage.

Abstract: A client-server system may include a primary state of session data. Application servers may include client states of the session data and may access the primary state. The session data may include attributes. The distributed store may provide locked access to the primary state to processes executing within the application servers. While one process has locked access, other processes are not allowed to access the primary state. In one embodiment, the distributed store provides locked access to portions of the primary state to threads executing within a process with locked access. While a portion of the primary state is locked for a thread, other threads cannot access the portion. In one embodiment, the distributed store may request the process to release the locked access. The process may release the locked access in response to the request. In one embodiment, the process may release the locked access when no longer needed.

Abstract: A searching system for searching contents that were broadcast, the searching system having an inputting unit, a searching unit, and a terminal unit is disclosed, wherein the inputting unit comprises a first storing means for storing information representing at least time at which contents were broadcast corresponding to a predetermined operation, and a first communicating means for transmitting the information representing time stored in the storing means to an external unit, wherein the searching unit comprises a second storing means for correlatively storing information representing contents and broadcast time thereof, and a searching means for searching information representing the contents stored in the second storing means corresponding to the information representing time, and wherein the terminal unit comprises a second communicating means for receiving the information representing time transmitted from the inputting unit through the first communicating means, a third communicating means for transmitti

Abstract: A searching system for searching contents that were broadcast, the searching system having an inputting unit, a searching unit, and a terminal unit is disclosed, wherein the inputting unit comprises a first storing means for storing information representing at least time at which contents were broadcast corresponding to a predetermined operation, and a first communicating means for transmitting the information representing time stored in the storing means to an external unit, wherein the searching unit comprises a second storing means for correlatively storing information representing contents and broadcast time thereof, and a searching means for searching information representing the contents stored in the second storing means corresponding to the information representing time, and wherein the terminal unit comprises a second communicating means for receiving the information representing time transmitted from the inputting unit through the first communicating means, a third communicating means for transmitti

Abstract: The present invention is generally directed to a method, article of manufacture, and system for generating and executing queries with high level parameter markers having one or more associated query conditions. In contrast to conventional parameter markers that are limited to association with simple values of a query condition, high level parameter markers may be associated with a set of entire query conditions.

Abstract: In an apparatus for retrieving documents, each document and a query character string are divided into a plurality of index keys. A retrieval condition analyzing part analyses a retrieval condition including the index keys divided from the query character string and generates a retrieval condition tree synthesized by at least one operator that retrieves an intermediate retrieval result including the document information from said index table. A retrieval condition evaluating part evaluates each intermediate retrieval result obtained by the retrieval condition tree and determining a final retrieval result.

Abstract: A system and method for scheduling database operations to one or more databases in a parallel-processing database system are described herein. After a query server generates a dynamic-link library (DLL) or other executable representative of one or more database operations to a database, the query server notifies a scheduling services module of the generation of the DLL and submits the DLL to a query agent. The query agent notifies the scheduling services module of its receipt of the DLL. Based on any of a variety of considerations, the scheduling services module schedules a time of execution for the DLL by one or more processing matrices that store the database. At the scheduled time, the scheduling services module directs the query agent to submit the DLL to the indicated processing matrices. The scheduling services module also can be adapted to monitor the execution of previously submitted DLLs by one or more processing matrices and adjust the scheduled times of execution for subsequent DLLs accordingly.

Abstract: A system for searching a network for network based content related to a search query, such as multimedia and streaming media, includes an adapter for formatting the search query, a first database containing previous search results and a second database for storing currently returnable metadata, a search processor, and at least one search engine kernel comprising a search engine inherent database. The search engine coordinates searching of the first database and the second database, and and provides the formatted search query to the search engine kernel. The search processor also provides and receives search results to and from the first database and the second database, and provides search results to the adapter. The system stores a predetermined amount of previous search results in the first database, such that search results for a current search are retrieved from the database, avoiding a search through search engine kernel, comprising searchable metadata.

Abstract: A method and system is provided for detecting occurrences of semantic temporal events based on observations extracted from input data and event models. The input data is fed into the system from some data source. Based on specified event to be detected, multiple-layer models corresponding to the event are retrieved. The models are used to determine the types of temporal observations to be extracted from the input data. The extracted temporal observations are then used, in combination with the multiple-layer models of the event, to detect the occurrences of the event.

Abstract: There are provided a heap memory management method that not only improves processing performance of an application program but also reduces a program development cost and a computer system using the same method. A live object copy process in minor collection of generational garbage collection is implemented through a calculate process of object live ratio, a compare process of object live ratio, and a live object copy process. The calculate process of object live ratio calculates a ratio of a size of a memory allocated to live objects of new objects to a size of a memory allocated to a new object during minor collection. The compare process of object live ratio compares a calculated object live ratio with a predetermined threshold. The live object copy process copies a live object directly to an old-generation heap instead of a new-generation heap when the object live ratio exceeds the threshold as a result of comparison.

Abstract: An Internet server matches experts offering consulting services in the biological sciences or the like with potential customers of such consulting services. The server presents each expert with a Web interface through which the expert inputs his or her qualifications and times of availability. The qualifications are organized in a two-tier hierarchy of broad subject areas and sub-areas within each area. The times of availability are organized in terms of starting time of availability and duration of availability from that starting time. The server also presents each customer with a Web interface through which the customer inputs the qualification and times of availability sought. The qualifications and times are organized in the same fashion as for the expert. The customer can input multiple service requests, each with different qualifications and times of availability. The server uses the input data to match experts with customers. At first, the experts and the customers are anonymous to one another.

Abstract: Method and apparatus is disclosed for constructing, and updating, a searchable database from very large data collections including diverse types of data thus enabling the data to be cataloged, data mined, indexed, parsed, cross-referenced and published for rapid location and free text retrieval of data elements from terabytes of information or millions of elements. The method and apparatus enables full text searches with the aid of an Internet browser using very complex search criteria without special skills. The full text searches are performed on a searchable database developed from the data collections in a large data storage system and wherein data type elements are identified, hyperlinked when possible, and stored in a retrievable format. In addition to the searchable database, a database is constructed that shows graphically the relationships between a current module being viewed and any other modules the current module may reference or be referenced by.

Abstract: One embodiment of the present invention includes means determining a concept representation for a set of text documents based on partial order analysis and modifying this representation if it is determined to be unidentifiable. Furthermore, the embodiment includes means for labeling the representation, mapping documents to it to provide a corresponding document representation, generating a number of document signatures each of a different type, and performing several data processing applications each with a different one of the document signatures of differing types.

Abstract: The invention provides a solution to client-server data handling tasks, such as, transport and data manipulation, by keeping the middleware ignorant of the specific semantics of the data and makes it instead a “dumb” or “blind” transport conduit between the client and the data base. Conversely, the invention provides the client with a mechanism to manipulate the database data without the middleware understanding the type or structure of the data that is being acted upon. This flows easily with the functioning of the client and the database, which is, to move the data back and forth from one to the other, with the client accepting the data from the user and displaying the database data to the user.

Abstract: Indexing documents is accomplished by generating an inverted index for a collection of one or more documents. The inverted index includes an inverted list for an index term appearing in one or more of the documents in the collection, and one or more postings. A posting includes a document identifier identifying a document in the collection of documents, a position identifier identifying a position of the index term in the document; and proximity information specifying whether the index term is positioned in a predefined proximal relationship between the index term and another a second index term in the document.

Abstract: A method and a device for managing a computer network, especially a technique for ensuring the security of a network. A computer network system in which computers are connected to each other through transmission lines, each computer stores the data which constitutes a moving type software exclusively used for security and transmitted together with a message when the computer transmits the message to another computer of the system, and executes the moving type software by using the stored data upon receiving a message from another computer.

Abstract: A TEFP-FEC system provides an efficient technique for storing, updating, locating, and retrieving data. In particular, data may be stored in a persistent, user-defined, shareable in-memory database table. Once this in-memory database table is created and loaded with data, data may be located in the table. When a search request specifying a number of results to be retrieved from a desired starting point is received, the data is located in an in-memory database table. Then, the specified number of results from a desired starting point are returned. The data is retrieved from the in-memory database table by retrieving stored descriptors corresponding to search terms in the search request. The stored descriptors are mapped to location information in a header area of an in-memory database table. Using the location information data is retrieved either from a data area of an in-memory database table or from a relational data store.

Abstract: To provide a device searching client which can extract, for example, dynamic search conditions which are peculiar to a printing matter (print job), search a device, and correctly print, in a printer as a device searching client, a CRT has search condition input means for allowing the user to input not only static data but also dynamic data as search conditions.

Abstract: Changed information is provided to multiple masters of a multi-master environment. In order to facilitate the providing of the changed information to the various masters, at least one replication data structure is used. This data structure is managed in such a way that conflicts are avoided in updating the data structure, and thus, in communicating the changed information to the masters.