Abstract: Providing data form management may comprise receiving form definition data, transforming the form definition data into an internal data structure, and storing the internal data structure in a form definition data table. In addition, providing data form management may comprise creating a form input data table corresponding to the form definition data table and notifying a form datastore that caches the internal data structure stored in the form definition data table. Furthermore, receiving the form definition data may further comprise providing a data page including at least one form component being user arrangeable on the data page and providing the ability to move, add, or delete at least one form component on the data page. The form definition data may define one of the form component or the location of the form component on the data page.

Abstract: A computer is programmed to compress data of a database in response to database modification language (DML) statements generated by on-line transaction processing (OLTP) systems. In several embodiments, data that is initially added to a database block is left uncompressed until a predetermined condition is satisfied, which happens infrequently (relative to OLTP transactions on the block). When satisfied, the computer automatically compresses all uncompressed data in the block, which increases the amount of unused space in the block. New data is thereafter added uncompressed to the partially compressed block, until satisfaction of a predetermined condition whereby the partially compressed block is again compressed, i.e. re-compressed. Adding of new data to a partially compressed block and its compression are repeated unless another predetermined condition is met, in response to which the block is not further re-compressed, thereby to recognize a limit on the benefit from compression.

Abstract: A method for processing a write instruction for writing data to a database stored on a logical device includes obtaining first and second addresses that specify the location of the data in respective first and second address spaces. A third address corresponding to an expected location of the data record in the first address space is then calculated. On the basis of a comparison between the first address and the third address, a determination is made as to whether to execute the write instruction.

Abstract: Deduplication of data on disk devices based on a threshold number (THN) of sequential blocks is described herein, the threshold number being two or greater. Deduplication may be performed when a series of THN or more received blocks (THN series) match a sequence of THN or more stored blocks (THN sequence), whereby a sequence comprises blocks stored on the same track of a disk device. Deduplication may be performed using a block-comparison mechanism comprising metadata entries of stored blocks and a mapping mechanism containing mappings of deduplicated blocks to their matching blocks. The mapping mechanism may be used to perform later read requests received for the deduplicated blocks. The deduplication described herein may reduce the read latency as the number of seeks between tracks may be reduced. Also, when a seek to a different track is performed, the seek time cost is spread over THN or more blocks.

Abstract: A method and system for generating and linking keywords to objects in videos, and then providing an internet searchable web page is disclosed. The objects also may be associated with hyperlinks to further information, further objects, or further videos or web pages. First, objects within a video are selected. Then software for tracking the objects throughout a video is used to determine in which frames the object appears. Data corresponding all frames in which the object first appears and last appears is determined. Second, an object descriptor term or phrase is associated with the object. The object descriptor is then used to generate a set of keywords, which along with the object descriptor, are stored in memory in association with the object and video, preferably an XML file or other format. Then, the keywords or keyword phrases are converted to a search engine searchable computer language, e.g., HTML, CSS, and posted to a web page.

Abstract: A node device in an information communication system including plural node devices mutually communicable through a network and are divided into plural groups, the respective node devices having attribute information of the content data in the own node's charge among the content data corresponding to an own node's group among the content data acquirable by the information communication system, the node device including: an address information memory means for memorizing address information of representative node devices in the respective groups; a search request information sending means for sending search request information including search conditions for searching content catalog information to the representative node devices in the respective groups in accordance with the address information of the representative node device in the respective groups; and a search result information receiving means for receiving search result information including the content catalog information returned from the represe

Abstract: Image galleries are automatically located within documents, such as web pages. Documents that are determined to contain image galleries may be treated differently when storing the document for later retrieval by an image search engine. In one implementation, the image galleries are automatically located within a document by calculating position information indicating relative positions of images in the document. The document may be determined to contain an image gallery when the position information indicates that the images in the document are generally evenly distributed.

Abstract: The present invention relates to a method for performing integrated storage operations on an information store. The present invention comprises identifying a plurality disparate types of storage operations stored in a policy option table. A first storage operation is performed according to a first set of storage criteria stored in the policy option table and a second operation, disparate from the first storage operation, is performed according to a second set of storage criteria stored in the policy option table.

Abstract: In order to reproduce contents with a substantially high degree of efficiency, the present invention provides a content reproduction system in which, typically, a music providing server holds a reproduction list showing a music reproduction order in which pieces of streaming musical data are to be reproduced sequentially and sequentially provides the pieces of streaming musical data to a music reproduction terminal in accordance with the music reproduction order shown in the reproduction list held therein, whereas the music reproduction terminal sequentially reproduces the pieces of streaming musical data provided by the music providing server sequentially.

Abstract: A method and system for tracing components in computer applications is provided in which trace data from components can be logged in real time. A hierarchical control interface 209 is used in which leaf nodes 306-311 represent components 204 being traced. The hierarchical control interface 209 includes means for setting trace levels for components 204 being traced. A non-hierarchical trace system 210 is used for carrying out the trace processing and includes means 320 for storing trace level settings received from the hierarchical control interface 209. The trace system 210 also includes means 322 for receiving a call from a component 204 with trace data; means for checking the trace level settings 321 for the component 204; and means for storing or discarding the trace data accordingly.

Abstract: A shared file system may be updated by a non-native operating system writing information to a change file, while a native operating system is in a suspend or hibernation mode; after writing, the non-native operating system is placed in a suspend or hibernation mode and the native system activates and then retrieves the updated information from the change file and writes the updated information to a shared file system. The native operating system returns to a suspend or hibernate state before the non-native operating resumes operation. The updated information may be written as provided by the non-native operating system, or further updated by the native operating system before being written to the shared file system. The change file is created by the native operating system, and may be a reserved portion of the shared file system or may be a separate portion of non-volatile memory.

Abstract: The present invention addresses the problem of partitioning database relations across a plurality of hosts in a shared-nothing cluster while minimizing communication costs. A new partitioning approach for database relations—join-partitioning—is introduced that focuses on relations and their dependencies to a priori partition the plurality of relations to the plurality of hosts such that each host can locally compute a large class of queries over its partitioned data in isolation at query time, independent of other hosts in the cluster. Such an approach thus overcomes the primary bottleneck, i.e., the network, in deploying database systems over shared-nothing clusters by allowing them to seamlessly scale linearly to tens of thousands of hosts and manage tens or hundreds of terabytes of data.

Abstract: In one aspect, the present disclosure describes a process for maintaining file allocation tables (FATs) for a volume of storage medium. The process includes triggering, by a write operation, modification of data in an existing sector of a data file by writing of data to a new sector of the storage medium. The process also includes writing revised used/unused sector information into one FAT and setting a variable indicative of a number of FATs (NOF) to a first value. The process additionally includes copying the one FAT to another FAT and re-setting the variable to a second value.

Abstract: A method and apparatus for searching for a documents residing on a network comprises receiving a search request from a user. The search request comprises one or more search terms of an ontology. The ontology includes a plurality of terms. One or more of the plurality of terms includes a plurality of sub-category terms. One or more documents residing on the network is identified based on the one or more search terms and an ontology index. The ontology index comprises a plurality of relationships between the plurality of terms and sub-category terms of the ontology and a plurality of documents residing on the network. One or more search results that describe the one or more documents is presented to the user. The one or more documents contain the one or more search terms, or one of the plurality of sub-category terms of the one or more search terms.

Abstract: The present invention relates in general to a data object model for describing objects within systems. To allow unambiguous classification, the data model comprises a property definition including at least one property name, at least one property value and at least one process value for storing at least one process identifier identifying processes assigned to the property.

Abstract: A method for indexing a plurality of documents, that includes a plurality of duplicate documents, first identifies one or more duplicate groups of documents from among the plurality of documents. Then, one index of content for the duplicate group is created instead of indexing the content from every document within the duplicate group. However, in contrast to the content index, an index of metadata for each of the documents in the duplicate group is created. Thus the content of each duplicate group is indexed only once, while a search engine using such indexing techniques retains the capability to answer queries as if the duplicated content was indexed for each document of the group.

Abstract: Systems and methods for extracting information from structured documents are provided. The systems and methods relate to selecting a centroid document from a group of structured documents, selecting a subset of the group of structured documents in order to form a cluster of the subset of documents about the centroid document. The selecting the subset is preferably based on the relative similarity between each of the selected subset and the centroid document. Then, systems and methods according to the invention include marking a data element on the centroid document. The systems and elements also include identifying a data element on each of the subset of documents, the data element that corresponds to the marked data element on the centroid document. Finally, data may be extracted from the subset of documents based on the identifying step.

Abstract: A method for tracing components in computer applications includes setting, within a hierarchical control interface, a trace level for a component; storing, within a non-hierarchical trace system, the trace level; receiving, in the non-hierarchical trace system, a call with trace data from the component; checking, within the non-hierarchical trace system, the trace level of the component; and acting upon the trace data according to the trace level setting.

Abstract: The invention relates to a method for controlling the disposition of graphical elements, whose positioning is effected by a layout manager component, according to which the elements are listed in tuples according to a predetermined method. A Boolean condition is evaluated for every tuple and if said Boolean condition is met an associated command is carried out that comprises the control command for the layout manager component. The inventive method is preferably used in generator systems for generating applications that extract data bases, whereby for every line of the result table graphical objects are generated and said objects are disposed on the graphical surface by way of the indicated method.

Abstract: Systems that employs an adaptable front end for determining a file-type to associate with the output from a source application and for processing the output, as a function of the file type, to generate a display list that is representative of objects and shapes that represent components within the visual presentation of the data. The display list is then processed by a rendering engine, which may be located on an embedded device. The rendering engine processes the components contained within the display list to render an image of the source application's output that may be presented on the display of the device. As will be described below, the adaptable front end determines the file structure of the source being processed, thereby providing a device that may operate with a plurality of different file types, and source applications.