Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Manipulating data structure (e.g., compression, compaction, compilation)

Subclass of:

707 - Data processing: database and file management or data structures

707100000 - DATABASE SCHEMA OR DATA STRUCTURE

Patent class list (only not empty are listed)

Deeper subclasses:

Entries
DocumentTitleDate
20090210437SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR SAVING AND RESTORING A COMPRESSION/DECOMPRESSION STATE - A system, method, and computer program product are provided for saving and restoring a compression-decompression state. In operation, data is processed, the processing including compressing or decompressing the data. Additionally, a state of the processing is saved. Further, the state of the processing is restored.08-20-2009
20090193045COMPRESSION METHOD FOR A DATA TRANSFER THAT IS INDEPENDENT OF COMPUTER ARCHITECTURE AND/OR DECOMPRESSION METHOD FOR A DATA RECORD - A compression method for a data transfer that is independent of computer architecture and/or a decompression method for a data record that contains structural indicators and variable values are provided. The method includes the following steps: provision of a string automaton, which represents the structuring rules of the data record in a unit that compresses the original data record; input of the data record into the string automaton; generation of a second, shorter data record by the string automaton, the record containing the variable values of the first data record and control symbols that are specific to the string automaton equipment, the symbols representing a switch from an automaton condition to a sequence condition; and transmission of the second data record to a similar string automaton, which interprets the control symbols, whereby a copy of the original data record with an identical data structure is generated.07-30-2009
20090193044WEB GRAPH COMPRESSION THROUGH SCALABLE PATTERN MINING - A method and a processing device are provided for compressing a web graph including multiple nodes and links between the multiple nodes. Nodes of the web graph may be clustered into groups including no more than a predetermined number of nodes. A list of links of the clustered nodes may be created and sorted based on a frequency of occurrence of each of the links. A prefix tree may be created based on the sorted list of links. The prefix tree may be walked to find candidate virtual nodes. The candidate virtual nodes may be analyzed according to a selection criteria and a virtual node may be selected. The prefix tree may be adjusted to account for the selection of the virtual node and the virtual node may be added to the web graph.07-30-2009
20090193043METHOD AND SYSTEM FOR TRANSFORMING DATABASE AND COMPRESSIBLE DATABASE STRUCTURE - A database transforming method suitable for transforming a first database of a host into a second database of a mobile electronic device is provided, wherein the first database has a plurality of original fields. First, a plurality of main fields and a composite field are created in the second database. The main fields are respectively corresponding to at least one of the original fields. The main fields and the composite field are used for displaying data in the original fields. Data displayed in the composite field is separated by separators. Next, data in each field of the first database is written into the corresponding main field or the composite field of the second database. In addition, a compressible database structure and a database transforming system are also provided in the present invention.07-30-2009
20090193041METHOD FOR AUTOMATED DESIGN OF ROW COMPRESSION ON TABLES IN A RELATIONAL DATABASE - A workload specification is obtained for the database. Based on the workload specification, candidate ones of the tables are identified and ranked. Compression impact is evaluated for the candidate ones of the tables. A design for the database is developed, specifying at least one of: (i) which of the tables should be compressed, and (ii) which of the tables should not be compressed.07-30-2009
20090193040System and method for storing a program using partial compression - A method is set forth for compressing a file of size C for storage in a memory space of size F, where C>F, comprising compressing successive portions of the file until C≦F, creating a header to the file including an offset value indicating a location separating compressed and uncompressed portions of the file, and appending the header to the file. A further method is set forth for executing a file comprising reading the header to determine the predetermined compression algorithm and the offset, copying the uncompressed portions from the memory to a RAM, decompressing the compressed portions starting at the offset, storing the decompressed portions of the load into RAM in sequence after the uncompressed portions, and executing the file from the RAM.07-30-2009
20090037446Lightweight Directory Access Protocol (LDAP) Schema Definition Using Extensible Markup Language (XML) - A computer receives a schema that lacks information required by a directory access protocol (e.g. LDAP) and automatically generates information that conforms to the directory access protocol and supplies the generated information as output in a new schema. Such automatic schema transformation allows a human who is creating the schema, to enable usage of the directory access protocol to interface with a directory implementing the schema, without knowing the directory access protocol. The computer of some embodiments receives the schema being input, in a predetermined human-readable language (e.g. XML). Hence, an XML developer who lacks knowledge of LDAP can use traditional XML tools to prepare an LDAP-incompatible schema, for use in implementing a directory (e.g. address book) that is accessed by an LDAP client (e.g. cell phone) via an LDAP server. The new schema can be output in any form (e.g. text/binary) and in any language.02-05-2009
20080281847METHOD OF PROCESSING PROTEIN PEPTIDE DATA AND SYSTEM - The invention provides a method of processing protein peptide data obtained from healthy or pathological samples for analysis, comprising the steps of: providing a list of peptide sequences and associated auxiliary information representing an input data set; compiling from the input data set a new peptide sequence list by removing peptide sequence redundancy in the peptide sequence list, said new peptide sequence list representing a peptide data set; and grouping together members of the peptide data set originating from the same protein thus generating a protein data set.11-13-2008
20090204626SYSTEMS AND METHODS FOR INFORMATION COMPRESSION - Systems and methods for information compression. In a first method embodiment, a computer implemented method for compressing information includes finding a closest match entry of a dictionary to a data block, the dictionary stored in computer usable media. A logical exclusive OR combination of the closest match entry and the data block is performed to form a spatial difference vector identifying locations wherein the data block differs from the closest match entry. An information difference vector comprising differences between the data block and the closest match entry is formed. A compressed data block comprising the spatial difference vector, the information difference vector and a reference to the closest match entry is produced. The compressed data block is characterized as being smaller than the data block.08-13-2009
20090164494Embedding metadata with displayable content and applications thereof - The present invention relates to embedding metadata with user interface messages. One method embodiment includes: encoding the metadata into a sequence of non-displayable characters; combining the displayable data and the sequence of non-displayable characters; and sending the combined displayable data and sequence of non-displayable characters to a client for display. In examples, the displayable characters may be displayable Unicode characters, and the non-displayable characters may be non-displayable Unicode characters, such as the left-to-right mark (0x200E) and the right-to-left mark (0x200F).06-25-2009
20100042640Migration Apparatus Which Convert SAM/VSAM Files of Mainframe System into SAM/VSAM Files of Open System and Method for Thereof - Provided are a migration apparatus and method for converting a sequential access method (SAM)/virtual storage access method (VSAM) file of a mainframe system into an appropriate SAM/VSAM file for an open system. The migration apparatus includes: an information obtaining module for obtaining various file information on a SAM file of the mainframe system; a data obtaining module for obtaining actual data of the SAM file of the mainframe system composed of Extended Binary Coded Decimal Interchange Code (EBCDIC) in binary format; a code conversion module for converting the obtained actual data composed of EBCDIC into American Standard Code for Information Interchange (ASCII) code; a file combination module for combining the obtained file information on the SAM file with the actual data corresponding to the file information and converted into ASCII code; and a file registration module for registering the file information of the combined SAM file in the open system. The migration apparatus and method efficiently reuse a conventionally used SAM/VSAM file during a rehosting process of converting a mainframe system into an open system.02-18-2010
20100042639CONFIGURATION FILE FRAMEWORK TO SUPPORT HIGH AVAILABILITY SCHEMA BASED UPON ASYNCHRONOUS CHECKPOINTING - In various exemplary embodiments, a method and related system for configuration file management in a network element comprise one or more of the following: upon initialization of the network element, reading a first configuration file that is in a character-encoded format; for each application process, translating the first configuration file into a plurality of non-character-encoded configuration files; configuring each application process based on the respective plurality of non-character-encoded configuration files; modifying, in real-time, at least one of the non-character-encoded configuration files; and merging each of the non-character-encoded configuration files into a second configuration file that is in a character-encoded format.02-18-2010
20090157719Mechanism for Converting After Image Data to a Delta Level Change - A mechanism is provided for converting after image data into a delta level change. An after image business graph is first transformed into a generic after image business graph. Another transformation is performed transforming the generic after image business graph into a second after image business graph, using delta information from another enterprise information system is used to create a delta business graph. A final transformation is performed to convert the delta business graph into a generic delta business graph.06-18-2009
20090157717CONTACT AGGREGATOR - An integrated web-based communications service provides a content aggregator to simplify the task of managing personal, friends, family, and business contacts via a process of aggregation and consolidation into a central point. The content aggregator imports contacts from existing databases, harvests additional contact information, and maintain the contact information.06-18-2009
20090157716APPARATUS AND METHOD FOR ACQUIRING DATA FROM MEMORY OF TERMINAL - The present invention relates to an apparatus and method for acquiring data stored in a memory of a terminal. Binary data is converted to a new case file and the case file is stored. When meaningful data is extracted, a copy of the case file is generated and the integrity of the copied case file is checked. Then, meaningful data is extracted. A report is generated to correspond to the analyzed meaningful data and is output to a printer and a monitor. Therefore, according to the present invention, all of the data stored in the memory of the terminal are acquired and are converted into the case file in a new format, thereby generating legitimate evidence material for a legal investigation in respect to a legal aspect to be used by investigators.06-18-2009
20090157715MANAGING LARGE COLLECTION OF INTERLINKED XML DOCUMENTS - An approach is provided to partition inter-linked documents into partitions of a database system. In some embodiments, a plurality of documents may be assigned to two or more partitions in the database system, thereby forming a number of inter-partition links between a first partition and a second partition. Here both the first partition and the second partition are in the two or more partitions. First documents may be assigned to the first partition while second documents are assigned to the second partition. Both the first documents and the second documents are in the plurality of documents. It is then determined whether moving one or more of the first documents in the first partition to the second partition reduces the number of inter-partition links between the first partition and the second partition. If that is the case, the one or more of the first documents are moved to the second partition.06-18-2009
20090157714SYSTEM AND METHOD FOR ANALYZING AND CATEGORIZING TEXT - A system and method are provided for analyzing elements of text for comparative purposes. Text is provided to the system in an electronic format readable by the system. The system divides the text data into scenes, which may then be compared against a range of various values across a database of scenes from different texts. Data from one text can be used to identify other texts with similar styles, or identify texts with different styles, and to rank those differences on a spectrum. The system may use data from one text to identify other texts that a user may like, and present information about the text to the user in various forms.06-18-2009
20090157713SYSTEMS AND METHODS FOR COLLECTING DATA FROM NETWORK ELEMENTS - Systems and methods for performing data collection in networks are disclosed. A disclosed network element includes a data store, at least one of a management information block or a register, a self-initiating data collector to collect information associated with the network element from at least one of the management information block or the register and to store the retrieved information in the data store, and a data retriever to send at least some of the information from the data store in response to a request.06-18-2009
20090157712Dynamic Compression of Systems Management Data - A method, system, and medium for compressing systems management information in a historical data store. Dynamically determining the appropriate compression algorithm to apply based on the type of data being compressed and stored. As further input is received for any particular measurement, the appropriate compression algorithm will be automatically selected from the set of available compression algorithms or be defined by a user configuration parameter. The amount of historical data stored with the minimal amount of data loss is optimized by the system dynamically changing the compression algorithm used for the given input data over a particular time span. The system engineer is therefore presented with the pertinent information for monitoring, administrating and diagnosing system activities.06-18-2009
20090157711Method and System for Managing Volumes Within a Compilation of Content - A web-based system, method and program product are provided for adding content to a content object stored (e.g., a custom compilation or prepublished work) in a data repository as a group of hierarchically related content entities. Each noncontainer content object is preferably stored as a separate entity in the data repository. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities and containers. As the user selects desired objects for inclusion in a content object, the system arranges the objects hierarchically, e.g., into volumes, chapters and sections according to the order specified by the user. The system then creates a file object (e.g., a CBO) defining the content object that contains a list or outline of the container and noncontainer entities selected, their identifiers, order and structure. This file object is stored separately in the data repository. An aspect of the invention is the calculation of the compilation's cost by estimating the amount of content it contains and determining a content cost based upon the content estimate. Optionally, a cost is assigned to each content entity in the data repository and these actual costs are summed as part of the cost estimation procedure.06-18-2009
20080270435Method for Handling Tree-Type Data Structure, Information Processing Device, and Program - It is possible to express a tree-type data structure so as to effectively trace the relationship between data in the tree-type data structure (for example, parent-child, ancestor, descendant, brothers, generations). In the tree-type data structure, for each of non root nodes which are the nodes excluding the root node, their parent nodes are correlated so that the parent-child relationship between the nodes is expressed by using “child->parent” relationship. Accordingly, by specifying a child node, it is possible to promptly specify the only one parent node corresponding to the child node.10-30-2008
20090043792Partial Compression of a Database Table Based on Historical Information - A database partial compression mechanism compresses only part of a database table based on historical information regarding how the database table has been accessed in the past. The function of the database partial compression mechanism may also be governed by a user-specified partial compression policy. When the historical information indicates a portion of a table is not frequently used, the portion of the table is compressed without compressing other portions of the table. The result is a table that is uncompressed for portions that are accessed often and compressed for portions that are accessed less often.02-12-2009
20090125536IMPLEMENTING EVENT PROCESSORS - Novel techniques for implementing applications, such as event processors (“EPs”), designed in CQL are provided. Event processors, created as a network of CQL operators, can be implemented in SQL. Implementing an event processor in SQL allows the leveraging of significant industry knowledge and experience in research and development of SQL engines. A user can interact with an EP-generator application to design an event processor in CQL. The EP-generator application can implement the event processor by translating the CQL into SQL statements. Event-processing systems can execute the SQL implementation of the event processor in a first computing environment, such as an SQL database. In this manner, systems described herein can execute event processors defined as a network of CQL operators with high performance and scalability.05-14-2009
20090125538VIDEO ENCODING AND DECODING USING PARALLEL PROCESSORS - A method is disclosed for the decoding and encoding of a block-based video bit-stream such as MPEG2, H.264-AVC, VC1, or VP6 using a system containing one or more high speed sequential processors, a homogenous array of software configurable general purpose parallel processors, and a high speed memory system to transfer data between processors or processor sets. This disclosure includes a method for load balancing between the two sets of processors.05-14-2009
20090125537DETECTION OF UTF-16 ENCODING IN STREAMING XML DATA WITHOUT A BYTE-ORDER MARK AND RELATED PRINTERS, SYSTEMS, METHODS, AND COMPUTER PROGRAM PRODUCTS - Provided are printers and other electronic devices, systems, methods, and computer program products that automatically detect and determine UTF-16 encoding schemes and endiannesss thereof in an incoming XML data steam for XML declarations without a UTF-16 byte-order mark (BOM) or encoding declaration. This allows for the automatic and unambiguous accurate detection of UTF-16 encoded XML data within a mixed encoding environment, such as from multiple sources using more than one encoding scheme, even when XML data does not start with a BOM or encoding declaration.05-14-2009
20090119322SYSTEM AND METHOD FOR MANAGING CONTENT - A system for managing media files having different format characteristics includes a transcoder, a content store, and a plurality of clients. The content store is capable of storing a media file in a first format. The clients are each associated with one or more media file formats and capable of playing media files to users. The transcoder is capable of receiving a request identifying a media file from a first client and, in response to receiving the request, retrieving the media file from the content store in a first format. The transcoder is also operable of modifying the media file from the first format to a second format associated with the first client and, while modifying the media file from the first format to the second format, transmitting a modified portion of the media file to the first client.05-07-2009
20090119320METHOD AND SYSTEM FOR ENCODING DATA - A method and system for encoding the output data created by a simulator is provided. The method and system may generate smaller output data files or output databases than those created by known techniques. The method and system may also allow for accessing and manipulating the compressed data. The method and system may also significantly increase the speed for manipulating the output data utilizing various calculations.05-07-2009
20090043796METHOD AND SYSTEM FOR COMPRESSING A TREE - A method and system for compressing a tree with a plurality of nodes that each may be associated with a node identifier and a parent node identifier. The method may comprise for each node in the tree determining whether the current node is to be deleted, if the current node is to be deleted updating a list of deleted nodes such that the node identifier of the current node may be stored; a parameter representing a number of nodes currently having been deleted from the tree may be stored, such that the parameter is associated with the node identifier of the current node, and updating the node identifier and the parent node identifier of the current node as a function of the list of deleted nodes. Each node in the tree is visited only once.02-12-2009
20090043794System and method for mediating transactions of digital documents - A system and method for mediating a transaction of a digital document by converting a transaction into an internal representation according to predefined rules and according to processing definitions associated with the source of the transaction, validating and possibly altering the transaction in its internal representation according to predefined rules and according to processing definitions associated with the destination of the transaction, converting said internal representation into an external representation according to predefined rules and according to rules specific to a destination of said transaction and communicating the external representation to a destination.02-12-2009
20090112903ONTOLOGY DATA IMPORT/EXPORT METHOD AND APPARATUS - The present invention provides a flexible ontology data import/export method and apparatus. The ontology data import apparatus comprises: an ontology data format analyzer for analyzing a format of input ontology data, and performing format determination by utilizing an ontology format database which stores formats of those successfully imported ontologies if it is a private unknown format; and an unknown format data importer for separating and importing the data into an ontology database which stores ontologies, in accordance with a result of the format determination by the ontology data format analyzer. Further, the ontology data export apparatus comprises a keyword-based and query-language-combined ontology exporter and an ontology data export format analyzer, and the keyword-based and query-language-combined ontology exporter outputs a query result returned from the ontology database in accordance with the export format returned from the ontology data export format analyzer.04-30-2009
20090327321DOCUMENT TEMPLATES FOR SCHEMA-BASED DATA TRANSFER INTO AND OUT OF A DATA-BASED APPLICATION - Systems and methods are described for using templates associated with a document application to facilitate schema-based data transfers into and out of a database associated with a database application. Such templates may be made available to a user so that the user can easily export various data entities out of the database for display, editing, or report generation as well as to import new or edited data entities into the database. The templates may include fixed or user-customizable reports that are populated with data entities exported from the database and/or that present data and graphics derived from such data entities. The templates may also be created during an initial data transfer between a first document and the database and then saved for use in performing subsequent data transfers between other documents and the database.12-31-2009
20090327322INFORMATION WORKER CREATING COMPONENT APPLICATION WITHOUT WRITING CODE TO CREATE THE APPLICATIONS - A data processing system for data exchange across application boundaries is provided. The system includes a canvas memory in which to open multiple applications. A transform component generates data structures across the canvas memory in at least one application form and automatically transforms the data structures to at least one other application form to mitigate application boundaries between disparate applications.12-31-2009
20090307251Method for reducing redundancy between two or more datasets - A method for reducing redundancy between two or more datasets of potentially very large size. The method improves upon current technology by oversubscribing the data structure that represents a digest of data blocks and using positional information about matching data so that very large datasets can be analyzed and the redundancies removed by, having found a match on digest, expands the match in both directions in order to detect and eliminate large runs of data by replace duplicate runs with references to common data. The method is particularly useful for capturing the states of images of a hard disk. The method permits several files to have their redundancy removed and the files to later be reconstituted. The method is appropriate for use on a WORM device. The method can also make use of L2 cache to improve performance.12-10-2009
20090307250METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - A method and system for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Transforming the logical data object comprises creating in the storage device a transformed logical data object comprising a header and one or more allocated accommodation sections with predefined size; transforming one or more sequentially obtained chunks of obtained data corresponding to the transforming logical data object thus giving rise to the transformed data chunks; and sequentially accommodating the processed data chunks into said accommodation sections in accordance with an order said chunks received, wherein said accommodation sections serve as atomic elements of transformation/de-transformation operations during input/output transactions on the logical data object. The processing may comprise two or more data transformation techniques coordinated in time, concurrently executing autonomous sets of instructions, and provided in a manner facilitating preserving the sequence of processing and accommodating the processed data chunks.12-10-2009
20090307249METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - A method and system for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Transforming the logical data object comprises creating in the storage device a transformed logical data object comprising a header and one or more allocated accommodation sections with predefined size; processing one or more sequentially obtained chunks corresponding to the transforming logical data object thus giving rise to the processed data chunks, wherein at least one of said processed data chunks comprises transformed data resulting from said processing; sequentially accommodating the processed data chunks into said accommodation sections in accordance with an order the chunks received, and generating at least one index section constituting a part of the transformed logical data object, said index section comprising one or more entries containing indicators to physical storage location of respective accommodation sections and, with respect to each processed data chunk, one or more records related to said chunk, wherein said records indicate offset and length of data in the logical data object to be read from the respective processed data chunk, and are associated with a time stamp indicating time of creating said record. The method further facilitates reading a data range from the transformed logical object in response to a read request specifying desired point in time to be read.12-10-2009
20090307245Uninterrupted Data Access During the Migration of Data Between Physical File Systems - A Migration Thin Virtual File System (“MTVLS”) conducts file migration using a thin virtual layer that is size selectable and provides an uninterruptible migration path from the old file system to the new file system without an increase in the time to receive data. The MTVLS selects a file from the source file system, opens a corresponding file in the target system, mounts the thin virtual layer over the source file and the target file, and migrates that data from the source file to the target file.12-10-2009
20090307244ENCODING AND DECODING OF XML DOCUMENT USING STATISTICAL TREE REPRESENTING XSD DEFINING XML DOCUMENT - A statistical tree representing an extensible Markup Language (XML) Schema document (XSD) is generated. The statistical tree captures information defined by the XSD by representing elements, attributes, and enumerations of the XSD as branches, nodes, and leaves of the statistical tree. The statistical tree has bits corresponding to nodes of the statistical tree. An XML document defined by the XSD is adaptively encoded, or compressed, as a number of bits based on the statistical tree that has been generated. The number of bits encoding the XML document are decoded, or decompressed, to yield the XML document also based on the statistical tree that has been generated.12-10-2009
20090112904Apparatus and Method for Categorical Filtering of Data - A computer readable storage medium includes executable instructions to retrieve a dataset from a data source. The dataset includes a first set of categories. A data structure with nodes connected by edges is built to represent the dataset. A first set of merit values is calculated for the first set of categories. Each merit value is a measure of how efficient a category is in filtering data. The first set of categories is ordered based on a criterion. The first set of categories is then returned.04-30-2009
20090106282System and method for interformat data conversion - A method including loading an input data, the input data in a first data format and having a plurality of input data objects, and loading a plurality of factor definitions. The method also includes determining at least one output object to be created from a subset of the plurality of input data objects, according to the factor definitions. The method also includes applying at least one factor scope, corresponding to the factor definitions, for at least one input object that does not reference another object. The method also includes, for each factor definition, applying a mapping of the subset of the plurality of input data objects to the output object. The method also includes creating an output data, in a second data format and corresponding to the input data, according to the output data objects, and storing the output data. There is also a corresponding data processing system and computer program product.04-23-2009
20090106280Semantic-Based Lossy Compression - Systems and methods for providing reduced object data to devices. Context can be received from a device. The context can be used to determine what portion of an object is used by an application executed on the device. The object can be reduced prior to communicating the data to the device, thereby conserving resources associated with the device.04-23-2009
20090094263ENHANCED UTILIZATION OF NETWORK BANDWIDTH FOR TRANSMISSION OF STRUCTURED DATA - Systems and methods are described that improve the efficiency of byte caching mechanisms when transmitting or receiving structured data. Some of these techniques may normalize the structured data before transmission over the network. Other techniques may use templates or semantic differences.04-09-2009
20090292718PAGING HIERARCHICAL DATA - Architecture that provides the ability to intelligently page (slice) hierarchical datasets through viewing operations of a hierarchical view. This further provides the capability to make additions to/deletions from the hierarchy view and manage the parent/child relationship of view records without ever sending the entire recordset to the client or receiving the entire recordset back to the server, thereby optimizing operation performance on the hierarchical datasets.11-26-2009
20090282066METHOD AND SYSTEM FOR DEVELOPING DATA INTEGRATION APPLICATIONS WITH REUSABLE SEMANTIC IDENTIFIERS TO REPRESENT APPLICATION DATA SOURCES AND VARIABLES - A method and system for developing data integration applications with reusable semantic identifiers to represent application data sources and variables. Methods include receiving a set of physical data identifiers that identify physical data fields, associating semantic names with these fields, and executing rules expressed in terms of these semantic names.11-12-2009
20090271425FORMATTED INTELLECTUAL PROPERTY DATA EXCHANGE OVER A NETWORK - A system, method and article of formatted information and data exchange that extends and replaces certain protocols for intellectual property data exchange using extensible markup language (XML) over a network is disclosed. Information and data is converted and transmitted between various applications and databases using flexible XDS schema fields designed specifically for a more efficient transfer of intellectual property-related data and information.10-29-2009
20090271424DATABASE SYSTEMS AND METHODS FOR LINKING RECORDS AND ENTITY REPRESENTATIONS WITH SUFFICIENTLY HIGH CONFIDENCE - Disclosed are a system for, and method of, determining whether records correspond to the same individual. The system and method provide such a determination with a known minimum level of confidence. That is, the system and method provide an indication that records correspond to the same individual along with an associated confidence level. The system and method may be used to link records in a database that correspond to the same individuals, creating entity representations in the database.10-29-2009
20090271423HLA to XML Conversion - A method includes establishing a connection and subscribing to at least one channel of a High Level Architecture (HLA) federation and an Enterprise Service Bus (ESB). The method further includes receiving a text file defining the format of an HLA message; a first extensible Markup Language (XML) document conforming to a first schema that defines data within a first message type; and a second XML document conforming to a second schema that defines data within a second message type. The method further includes receiving a first HLA message over the at least one HLA channel, extracting at least one piece of data from the first HLA message, generating a first XML message, and publishing the first XML message over the at least one ESB channel. The method also includes receiving a second XML message over the at least one ESB channel, extracting at least one piece of data from the second XML message, generating a second HLA message conforming to the text file, and publishing the second HLA message over the at least one HLA channel.10-29-2009
20090271422Object Size Modifications Based on Avatar Distance - A computer implemented method, apparatus, and computer program product for modifying objects. In one embodiment, tracking data is obtained which identifies a location of a set of avatars in relation to a range of the object. The range of the object includes a viewable field. In response to determining that the object requires modification, a size of the object is compared with a set of size constraints to form a comparison. Thereafter, the size of the object is modified based on the comparison to form a set of size modifications.10-29-2009
20090271421SYSTEM AND METHOD FOR MAINTAINING AND UTILIZING BERNOULLI SAMPLES OVER EVOLVING MULTISETS - One embodiment of the present invention provides a method for incrementally maintaining a Bernoulli sample S with sampling rate q over a multiset R in the presence of update, delete, and insert transactions. The method includes processing items inserted into R using Bernoulli sampling and augmenting S with tracking counters during this processing. Items deleted from R are processed by using the tracking counters and by removing newly deleted items from S using a calculated probability while maintaining a degree of uniformity in S.10-29-2009
20090271420DATA CLUSTERING SYSTEM, DATA CLUSTERING METHOD, AND DATA CLUSTERING PROGRAM - An object of the present invention is to perform data clustering while preventing the processing speed from decreasing while maintaining accuracy. A block division section 10-29-2009
20090030922Method and Apparatus for Constructing Efficient Slepian-Wolf Codes With Mismatched Decoding - Disclosed is a method for constructing Slepian-Wolf codes, wherein the designed Slepian-Wolf codes are robust to mismatched decoding. The disclosed method for constructing Slepian-Wolf codes includes the steps of: choosing representative probability distributions from a set of possible probability distributions; choosing a probability distribution as a decoding metric; converting the chosen decoding metric to a cyclic-symmetric channel; computing the initial message value given the cyclic-symmetric channel; computing a set of probability distributions of the initial message given the initial message values and the representative probability distributions; optimizing the degree distribution given the set of probability distributions of the initial message; optimizing the decoding metric.01-29-2009
20080270443LIST UPDATE EMPLOYING NEUTRAL SORT KEYS - A system for updating a list. A first list associated with a first platform includes a first plurality and a second plurality of keys. A second list associated with a second platform includes a third plurality of keys. The first and second platforms sort a first subset of characters differently. The second plurality and third plurality of keys are formed from a second subset of n characters sorted identically on the first and second platforms. An initial key in the first plurality of keys is converted to a neutral key to be included in the second plurality of keys by converting a character in the initial key to a number represented in a number system having a base b where n≧b. After the first list is updated, the lists are sorted and compared, and the second list is updated.10-30-2008
20090234870ORDERING COMPRESSION AND DEDUPLICATION OF DATA - Data that is to be deduplicated and compressed is received. The data is compressed then deduplicated to generate first compressed then deduplicated data. The data is deduplicated then compressed to generate first deduplicated then compressed data. The first compressed then deduplicated data is stored if the first compressed then deduplicated data is smaller in size than the first deduplicated then compressed data. The first deduplicated then compressed data is stored if the first deduplicated then compressed data is smaller in size than the first compressed then deduplicated data.09-17-2009
20090240717METHOD AND APPARATUS FOR VERIFYING ARCHIVED DATA INTEGRITY IN INTEGRATED STORAGE SYSTEMS - A system and method for detecting alteration or corruption of data archived in integrated storage system including an archive storage coupled to external storage devices. Before a data object is sent-from the archive storage to the external devices, the archive storage generates data integrity information for each object. The data integrity information may be a hash value that is recorded in memory of the archive storage or a digital signature that is sent to the external device together with the object. When an object is requested by a client computer, the archive storage checks the data integrity information before the object is sent to the client. If an integrity violation is detected, both the client computer and an administrator at a management server are notified. The integrity information is updated if a hash algorithm is updated or certificate corresponding to a key used to generate the digital signatures has expired.09-24-2009
20080270439Method for Identifying Sub-Sequences of Interest in a Sequence - The present technique provides for the analysis of a data series to identify sequences of interest within the series. The analysis may be used to iteratively update a grammar used to analyze the data series or updated versions of the data series. Furthermore, the technique provides for the calculation of a minimum description length heuristic, such as a symbol compression ratio, for each sub-sequence of the analyzed data sequence. The technique may then compare a selected heuristic value against one or more reference conditions to determine if additional iteration is to be performed. The grammar and the data sequence may be updated between iterations to include a symbol representing a string corresponding to the selected heuristic value based upon a non-termination result of the comparison. Alternatively, the string corresponding to the selected heuristic value may be identified as a sequence of interest based upon a termination result of the comparison.10-30-2008
20090234871Method, system and computer program for dynamically merging digital files for download to allow for the addition of advertising, promotional material and merging of files to create albums without embedding additional code - Method, system and computer program for dynamically merging digital files for download to allow for the addition of advertising, promotional material and merging of files to create albums without embedding additional code. The digital files are dynamically merged at the time of download, allowing for multiple, different advertisements or files to be served with the same digital file on each download.09-17-2009
20090234869DATABASE MANAGEMENT - A method of operating a database management system for integrating data from a plurality of data sources comprising steps of: 09-17-2009
20090313274Persona management system for communications - A system to apply persona styles to written communications. The system includes a communication analyzer and a modification engine coupled to the communication analyzer. The communication analyzer identifies an element of original content of a written communication and determines that the element of the original content of the written communication is incompatible with a selected persona style. The selected persona style defines a communication style. The modification engine modifies the original content of the written communication to replace the element of the original content with a substitute element that is compatible with the selected persona style.12-17-2009
20100057759Linking of Parent-Child Data Records in a Legacy software Modernization System - A system and method for linking parent and child data records during data migration is disclosed. One embodiment comprises sequentially receiving a plurality of data records from an arbitrary source of records without running a query on the source of records, generating a destination store of records that contains the plurality of data records, and locating any records in the destination store of records that has a dangling key. In this way, the embodiment may correct dangling keys to generate a destination store of records with referential integrity.03-04-2010
20090019067METHOD, APPARATUS, AND PROGRAM FOR INSERTING NODE - A method for inserting a node into a tree data structure is disclosed. An information processing apparatus represents parent-child relationships between the nodes in the tree data structure by means of “child->parent” relationships, which associate node identifiers assigned to parent nodes with the node identifiers assigned to child nodes of the respective parent nodes, identifies descendant nodes of a slave-side specific node in slave-side data, and inserts the descendant nodes included in the slave-side data into master-side data as the descendant nodes of a master-side specific node in the master-side data, the master-side specific node corresponding to the slave-side specific node.01-15-2009
20090012985Transcoder - A transcoder includes transcoder modules 01-08-2009
20090012984Method for Organizing Large Numbers of Documents - A computer product including a data structure for organizing of a plurality of documents, and capable of being utilized by a processor for manipulating data of the data structure and capable of displaying selected data on a display unit. The data structure includes a plurality of directionally interlinked nodes, each node being associated with one or more documents having a header and body text. All the documents are associated with a given node and have identical normalized body text. All documents that have identical normalized body text are associated with the same node. One or more of the nodes is associated with more than one document. For any node that is a descendent of another node, the normalized body text of each document associated with the node is inclusive of the normalized body text of a document that is associated with the other node.01-08-2009
20090012983System and method for federated member-based data integration and reporting - Method and system for integrating data between source data and a target application processing target data. A declarative data integration specification including a lineage information linking a source dimensional member of the source data and a target dimensional member of the target data is defined. A data movement specification using the data integration specification including the lineage information, a source reference to a source data model, a target reference to a target data model and a query specification for extracting source data for the target application is generated and the source data to the target application using the data movement specification is provided. A federated member-based metadata model including a source metadata model, a target metadata model, the lineage information mapping the source dimensional member and the target dimensional member; and a link connecting the source package layer and the target package layer, is also provided.01-08-2009
20090187585COMPARING VERY LARGE XML DATA - Comparing very large XML data. In one embodiment, a first and second XML data received for comparison are stored in the form of respective multiple rows in a database. A first and second set of rows (respectively corresponding to the first and second XML data) having the same value corresponding to a key are retrieved from the database and examined to form a comparison result. The same operations may be performed for each value of the key (and also other keys) present in either of the XML data sets.07-23-2009
20080270436Storing chunks within a file system - A method, apparatus, and system are disclosed for storing chunks within a file system. In one embodiment, the chunks are stored in a file system of a client computer and used to reconstruct the file.10-30-2008
20080294668Storage and Retrieval of Compressed Data in Mixed Mode - Methods of storing and retrieving compressed data and uncompressed data in a mixed mode are described. Generally, the method comprises the steps of compressing a fixed amount of input data within a sequence of frames to provide storage and retrieval in a sequential manner and random manner. The sequence of frames includes at least a first frame and a final frame. Each frame includes a first portion for storing uncompressed data and a second portion for storing compressed data. The uncompressed data is stored within a first portion of the first frame. The compressed data is stored within a second portion of the first frame.11-27-2008
20080294666Processing a Non-XML Document for Storage in a XML Database - A method for processing a non-XML document for storage in a XML database. The method comprises analyzing the non-XML document and extracting metadata from the non-XML document. The method then generates a shadow XML document for the non-XML document in accordance with a predetermined XML schema, wherein the shadow XML document comprises the metadata extracted from the non-XML document. The XML schema comprises a wrapping element adapted to wrap XML content of an at least partly undefined XML structure. The shadow XML document and the non-XML document are then stored in the XML database.11-27-2008
20080294665Methods and Systems for Handling Data in a Storage Area Network - A method for handling data within a storage area network (SAN), the method comprising receiving by an information handling system, the data from a component of the SAN, the data associated with at least one configuration of the component, converting the data into processed data and providing the processed data to a database.11-27-2008
20090138494Deterministic finite automata (DFA) graph compression - An apparatus, and corresponding method, for generating a graph used in performing a search for a match of at least one expression in an input stream is presented. The graph includes a number of interconnected nodes connected solely by valid arcs. A valid arc of a current node represents a character match in an expression of a character associated with the current node. Arcs which are not valid may be pruned. Non-valid arcs may include arcs which point back to a designated node(s), or arcs that point to the same next node as the designated node(s) for the same character. Typically, the majority of arcs associated with a node are non-valid. Therefore, pruning the non-valid arcs may greatly reduce graph storage requirements.05-28-2009
20090043797System And Methods For Clustering Large Database of Documents - In a computerized system, a method of organizing a plurality of documents within a dataset of documents, wherein a plurality of documents within a class of the dataset each includes one or more citations to one or more other documents, comprising creating a set of fingerprints for each respective document in the class, wherein each fingerprint comprises one or more citations contained in the respective document, creating a plurality of clusters for the dataset based on the sets of fingerprints for the documents in the class, assigning each respective document in the dataset to one or more of the clusters, creating a descriptive label for each respective cluster, and presenting one or more of the labeled clusters to a user of the computerized system or providing the user with access to documents in at least one cluster.02-12-2009
20100057760GENERIC DATA RETRIEVAL - A schema builder includes a read service for reading data from a multi-node hierarchical deep schema configured database and a write service for writing data to the multi-node hierarchical deep schema configured database. A transformation module transforms schemas between multi-node hierarchical deep schemas and a flat schema, and stores meta data to record a structure of the multi-node hierarchical deep schema.03-04-2010
20090300042SYSTEM AND METHOD FOR USING METADATA TO CROSS-REFERENCE, SEARCH AND DISPLAY ENTRIES IN A PUBLISHING SYSTEM - The illustrative embodiment of the present invention provides a method for cross-referencing, searching and displaying entries in a document publishing system, such as a web-publishing system or a desktop publishing system. The document publishing system uses input data such as email messages, attachments to emails, web clippings, and directly input text from a user to create new documents. The illustrative embodiment assigns an entry identification number to each new entry, an item identification number to each segment of the entry, and user-assigned labels to user-selected subparts of each entry. The entry identification numbers, item identification numbers and labels are automatically cross-linked by a series of algorithms. The identification numbers and labels are cross-linked with stored references which are used to dynamically generate HTML links. Changes in the content of a entry are saved as updates, where the latest version of a entry is cross-linked to previous versions. The cross-linking of the entries enables a user to search back through time for the content of previous versions or alternatively, to see the latest version of a previous entry.12-03-2009
20090327324METHOD OF REFACTORING A RUNNING DATABASE SYSTEM - A database development system is provided. The system includes a current-state source representation of a database that can be captured in a model of the database and a metadata component that preserves user intentions describing when a user interacts with the system to perform a refactoring operation (or other code enhancement) for use in subsequent operations by the system. A deployment component is provided that utilizes the preserved user intentions to optimize behavioral upgrades to the system, where simulations can be run against the model to facilitate efficient and automated deployments.12-31-2009
20080320023SYSTEM AND METHOD OF TRANSLATING A RELATIONAL DATABASE INTO AN XML DOCUMENT AND VICE VERSA - A method of translating a relational database into an XML document comprises generating an Extended Entity Relationship model from relational schema associated with the relational database and applying a schema translation process to the Extended Entity Relationship model to map the relational schema into a Document Type Definition (DTD) of an XML schema. An XML Tree Model is then generated from the Document Type Definition, the XML Tree Model being representative of one or more data semantics of the relational schema which are preserved as one or more data semantics in the XML document. Relational data from the relational database is then converted into the XML document using the relational schema and the XML schema from the Document Type Definition and/or the XML Tree Model. There is also described a method of translating an XML database into a relational database which comprises the reversal of the steps of the aforementioned method, and a system for implementing both methods.12-25-2008
20090164491Data Modernization System For Legacy Software - A database modernization system and method is disclosed. One example embodiment comprises a method for receiving a record stored as a source physical data model, parsing the source physical data model into a source logical data model, wherein the source logical data model includes semantic information from the record, transforming the source logical data model to a destination logical data model independent of a source or a destination record physical implementation, wherein the destination logical data model includes at least a portion of the semantic information from the record, and storing the destination logical data model in a destination physical data model. In this manner, a destination physical data model may be stored in a relational database management system on a per record basis.06-25-2009
20090282067SYSTEM AND METHOD FOR GENERATING CONTROL SYSTEM DATABASE AND GRAPHICS FROM SCHEMA-BASED INTERMEDIATE DESCRIPTIONS - A method and system for automatically generating process control databases and process graphics for a distributed control system is disclosed herein. Programmed process control database and process graphics generators automatically render output in a target process control system environment (e.g., InFusion Engineering Environment—or IEE) from an intermediate (e.g., XML) representation of process control and process graphics definitions.11-12-2009
20090171999System and Methodology for Parallel Stream Processing - A system and methodology for parallel processing of continuous data streams. In one embodiment, a system for parallel processing of data streams comprises: a converter receiving input streams of data in a plurality of formats and transforming the streams into a standardized data stream format comprising rows and columns in which values in a given column are of a homogeneous type; a storage system that continuously maintains a finite interval of each stream subject to specified space limits for the stream; an interface enabling a user to construct parallel stream programs for processing streams in the standardized data stream format, wherein a parallel stream program comprises a linear sequence of program building blocks for performing operations on a data stream; and a runtime computing system running multiple parallel stream programs continuously on the streams as they flow through the storage system.07-02-2009
20090030921INCREMENTAL PARSING OF HIERARCHICAL FILES - An incremental parser for hierarchical files is provided where the file can be parsed into a tree representation. Changes to the file can effectuate incremental changes to the tree such that the whole hierarchical file need not be reparsed; the incremental change modifies the necessary portions of the tree, not necessarily the entire tree. Moreover, the incremental parser can intelligently handle errors related to modification of the hierarchical file, such as unmatched tags corresponding to unmatched nodes in the tree. Such error handling provides operability with the malformed hierarchical file rather than providing an error and/or rejecting the file as modified.01-29-2009
20090030924Device and Method for Generating a Media Package - A device and method direct towards the packaging, transporting and extracting of essence files, metadata files and service data files are provided. The device and method include receiving content files (e.g., essence and metadata files) and service files, the service files identifying an application to be applied to the content files, combining the content files and the service files into a media package, and transmitting the media package. The device and method also include receiving the media package containing content files and service files and extracting the content files and the service files from the media package. The media package may further include command data that describes how to process the content files and the service files as well as identification data that identifies the content files and service files. The command data, and content and service files may be encrypted.01-29-2009
20100036860DATA MANAGMENT APPARATUS, DATA EDITING APPARATUS, AND DATA READING APPARATUS AND RESPECTIVE METHODS THEREOF - A data file can be efficiently edited by a plurality of users. A source object is created from various data files, such as a structured document file or the like. A plurality of partial objects are created from a source object. A client terminal downloads a partial object corresponding to the data which a user desires to edit or read. When a client terminal which has acquired a right to edit, edits a local partial object, edit information showing an edit content is transmitted to a server apparatus. A source object is updated in accordance with the edit information. Further, while other client terminal is downloading the identical partial object, edit information, which is for reflecting an edit content, is transmitted to a client terminal.02-11-2010
20090150419APPARATUS AND METHOD FOR REMOVING MALICIOUS CODE INSERTED INTO FILE - Provided are an apparatus and method for safely removing a malicious code from a file, or reporting the probable presence of a malicious code when it cannot be removed safely.06-11-2009
20090150421INCREMENTAL CARDINALITY ESTIMATION FOR A SET OF DATA VALUES - A system, an article, and a computer program product for estimating a cardinality value for a set of data values. In one embodiment, the system includes means for initializing a data structure for representing an array of counts; means for obtaining a data value from said set of data values; means for transforming said data value into a transformed string; means for modifying said data structure with said transformed string; means for obtaining a summary statistic value from said modified data structure, wherein the summary statistic value is based on the array of counts; and means for generating said estimated cardinality value using said summary statistic value.06-11-2009
20090049072SECURITY ENCODING UNIT AND IMAGE FORMING APPARATUS INCLUDING SAME - A security encoding unit performs security encoding processing on a plurality of images simultaneously, for example, an image on a front side of the document and an image on a back side of the document. The security encoding unit includes at least a first detector for detecting first security information of a first image based on a first original image data, a second detector for detecting second security information of a second image based on a second original image data, a first security encoding device for performing security encoding processing on the first original image data to generate the first image data, and a second security encoding device for performing security encoding processing on the first original image data to generate the second image data. The first original image data of the first image and the second original image data of the second image are input simultaneously.02-19-2009
20080270440Data Compression for Producing Spectrum Traces - A data compression method for producing spectrum traces may divide signal data into multiple transform frames, produce a spectrum trace for each transform frame using a time domain to frequency domain transform, and combine the multiple frames from the analysis window into a single spectrum trace according to the spectrum amplitude of corresponding points in each frame. A device comprising a port to receive a signal or data set; and circuitry in communication with the port to segment the data record into frames, multiply each frame by a windowing function, transform each frame from a time domain representation to a frequency domain representation, and compress the frames using a detection function to create a single spectrum trace. This data compression provides flexibility to allow users to select analysis length, resolution bandwidth (RBW) and number of trace points independently, eliminating the coupling often found in traditional approaches.10-30-2008
20080270438MEDICAL LABORATORY REPORT MESSAGE GATEWAY - A gateway enables medical (including genetic and genomic) laboratories and health care providers (collectively “clients”) to communicate electronic messages with each other without developing and maintaining an interface for each peer. The gateway translates messages sent between the parties. The gateway receives messages from each sender in a form, and containing diagnostic codes, preferred by the sender. For each received message, the gateway ascertains an intended receiving client. Each client may specify one or more receivers (such as applications) that are to receive messages sent to the client, as well as a separate form, and optionally a set of codes, for each receiver. For each receiver, the gateway generates translated messages, according to the receiver's preferred form and/or codes. The gateway sends the translated messages to each of the designated receivers. The gateway may include a validation component to check incoming messages to ensure the messages include required information and that information values are valid or acceptable. The gateway may include an exception handler that notifies a sending client if a message from the client fails to be translated or sent correctly. The gateway may maintain a repository in which the gateway stores copies of messages the gateway sent or would have sent to clients. The gateway provides an interface, such as a secure web interface, to this repository. Clients may access messages or lists of messages, especially messages the clients are not otherwise capable of receiving, through this interface. The gateway may store copies of some of the data that flows through the gateway in a bioinformatics database, which may be automatically analyzed by the gateway or queried for research or patient care purposes.10-30-2008
20090094266METHOD FOR DATA COMPRESSION AND QUALITY CHECKING - Pricing data from a manufacturer is condensed to remove duplicate data and filtered to detect discrepant data. The non-discrepant data is delivered to a retailer and the discrepant data is delivered to the manufacturer for correction. The condensing is done by hashing the data using a key consisting of the data's price information and a value consisting of the retailer store associated with the data. The filtering is done by using the condensed data and hashing with a key consisting of the stores and a value consisting of the pricing information.04-09-2009
20090287723METHOD FOR STABLE AND LINEAR UNSUPERVISED CLASSIFICATION UPON THE COMMAND ON OBJECTS - A method of linear unsupervised classification allowing a database composed of objects and of descriptors to be structured, which is stable on the order of the objects, comprises an initial step for transformation of the qualitative, quantitative or textual data into presence-absence binary data. A structural threshold α11-19-2009
20090307247DATA BLOCK COMPRESSION USING COALESCION - A method for processing blocks of data in a file is provided. The method includes determining a plurality of blocks of data in the file for a compression process used for compressing data in the file. This process is iterated over all the plurality of blocks of data in the file. A block of data is read into memory, and the offset from which it is read is also stored. A strong collision-resistant cryptographic hash representation, such as a strong collision-resistant cryptographic hash, of the block is determined. The cryptographic hash representation (CHR) of the block of data as well as the data itself, is added to a table with the CHR as a unique index. The offset of the block of data in the source file, as well as the CHR for that block are appended to a separate table.12-10-2009
20090287725Speculative Stream Scanning - A system and method for partitioning a data stream into tokens includes steps or acts of: receiving the data stream; setting a partition scanner to a beginning point in the data stream; identifying likely token boundaries in the data stream using the partition scanner; partitioning the data stream according to the likely token boundaries as determined by the partition scanner, wherein each partition of the partitioned data stream bounded by the likely token boundaries comprises a chunk; and passing the chunk to a next available token scanner, one chunk per token scanner, for identifying at least one actual token within each chunk.11-19-2009
20090083297Apparatus and method of customizable model import and export to and from XML schema formats - In one embodiment the present invention includes a computer-implemented method of converting first metadata to second metadata using a mapping and custom exits. The metadata is at the MI level and the mapping is generated based on information at the M2 level. The custom exits provide programmable mapping rules in addition to the mapping. In this manner, metadata created in one modeling environment may be used in another modeling environment.03-26-2009
20090198714Document processing and management approach for reflecting changes in one representation of a document to another representation - A method of propagating changes from a DOM tree. The method comprising watching a subset of the DOM tree, the subset matching a template. A change is made in the watched subset of the DOM tree. A representation of the DOM tree is automatically updated to reflect the change in the watched subset.08-06-2009
20090144306SYSTEM AND METHOD FOR GENERATING COMMUNICATION SUBSCRIBER DESCRIPTION INFORMATION - A system for generating communication subscriber description information includes an information labeling unit adapted to label original information of a specific communication subscriber, and a subscriber information generating unit adapted to generate communication subscriber description information according to communication records. A method for generating communication subscriber description information applies Ontology in the communication field, so as to obtain subscriber demand information for generating communication subscriber description information by analyzing actual communication records of the subscriber. Moreover, the generated communication subscriber description information truly reflects characteristics and requirements of the communication subscriber, thus ensuring the accuracy of the generated communication subscriber description information. The present invention is applicable to communication behaviors such as voice communication, data communication, and short messages of a subscriber.06-04-2009
20090055423RECORDING/REPRODUCING APPARATUS - A device, including a first storage unit configured to store a first plurality of files and a first management data corresponding to the first files; a connector configured to connect to an external storage device, the external storage being configured to store a second plurality of files and second management data corresponding to the second files; a controller configured to generate new management data by merging the first management data and the second management data, and to store the new management data in a memory; and a display unit configured to display contents of the first and second plurality of files based on the new management data without indicating to the user where the respective files are stored.02-26-2009
20090094265SYSTEMS AND METHODS FOR RIGHTS PROTECTION OF DATASETS WITH DATASET STRUCTURE PRESERVATION - A system and method for rights protection of a dataset that includes multiple trajectory objects includes determining an intensity power for embedding a watermarking key in a data trajectory. The data trajectory is modified to embed a watermarking key at the intensity power such that the intensity power guarantees an original pair-wise relationship between distance-based neighboring objects before and after embedding of the key such that a modified trajectory provides a watermarked version of the data trajectory.04-09-2009
20090254578METHODS AND APPARATUS FOR SEARCHING AND ACCESSING MULTIMEDIA CONTENT - A method of synchronising a multimedia content file with an associated text file includes subdividing the text file into one or more samples, where each sample includes zero or more consecutive characters of the text file. The samples are associated with a corresponding contiguous time interval of the multimedia content file. For each sample, a corresponding consumption rate value is determined, which represents a use ratio of characters of the sample within the associated time interval of the multimedia content file. The consumption rate values are then stored, so that they may subsequently be used to compute time positions within the multimedia content file associated with corresponding text characters within the text file. Additional information, such as time cues and interlude intervals, may also be recorded in order to improve the accuracy of synchronisation. A corresponding method for cueing of playback of a multimedia content file to its associated text is also provided, along with computer-implemented and networked apparatus implementing the synchronisation, cueing and playback methods.10-08-2009
20090144305Dependency management with atomic decay - A dependency is identified between a first component of a distributed computing system and a second component of the distributed computing system if the first component invokes the second component. A dependency map of the distributed computing system that includes the dependency between the first component and the second component is built.06-04-2009
20090276449APPARATUS AND METHOD TO TRANSFORM AN EXTRACT TRANSFORM AND LOAD (ETL) TASK INTO A DELTA LOAD TASK - A computer readable storage medium includes executable instructions to support the definition of an Extract Transform and Load (ETL) task. An evaluation of source table structures, source data change indicators, and target table structures is performed. The ETL task is converted to a delta load task in accordance with the evaluation.11-05-2009
20090089307WRITABLE SHARED DATABASE OBJECTS - A system may include a provider database, a reader database, and a database management system. The provider database may include a provider data area having a plurality of provider block addresses, and the reader database may include a reader data area having a plurality of reader block addresses, and a mapping of provider-specific identifiers to block addresses of the plurality of provider data pages and of reader-specific identifiers to block addresses of the plurality of reader data pages.04-02-2009
20080208883Method And System For A User-Customizable Interactive Physician Recall Message Database - Techniques for analyzing physician pharmaceutical product recall messages are disclosed. In a preferred embodiment, a method is presented which involves receiving physician recall messages and inputting the messages into a searchable database. A computer program allows a user to define customized message categories. The user definitions include full-text search strings for the messages. The messages are then sorted into the customized message categories based on the definitions. Finally, the sorted messages are presented to the user.08-28-2008
20080208880Extended cell information in multidimensional data models - Sharable extended cell information is used by multidimensional data models to enable cell annotations and line item details. Annotations are notes stored with a cell in a multidimensional dataset. Line item details permit levels of numeric detail below the lowest dimensional granularity. When receiving a multidimensional dataset in response to a query, a client application receives indicator information at the cell level, indicating to the client application that extended cell information is retrievable.08-28-2008
20080208884Process for Distributed Production and Peer-To-Peer Consolidation of Subjective Ratings Across Ad-Hoc Networks - A rating program on a mobile computing device communicates with other mobile devices regarding collected ratings. A user enters ratings and requests for information; the mobile computing device will then operate in the background, actively scanning for other users with the same type of short-range communications and a ratings program. The devices are able to exchange and save ratings, providing a mobile, socially-relevant means of collecting information.08-28-2008
20090112900Collaborative Compression - Provided are, among other things, systems, methods and techniques for collaborative compression, in which is obtained a collection of files, with individual ones of the files including a set of ordered data elements (e.g., bit positions), and with individual ones of the data elements having different values in different ones of the files, but with the set of ordered data elements being common across the files. The data elements are partitioned into an identified set of bins based on statistics for the values of the data elements across the collection of files, and a received file is compressed based on the bins of data elements.04-30-2009
20090276451METHOD AND APPARATUS FOR PROCESSING MESSAGES - An apparatus and a method for transforming Simple Object Access Protocol (SOAP) messages is provided. The method comprises receiving and transmitting Extensible Markup Language (XML) format SOAP messages by using an application protocol and TCP/IP, a message comprising message elements and receiving and transmitting binary messages comprising binary message elements. A transformation is performed between an XML format message and a binary message by replacing (11-05-2009
20090276450METHOD AND SYSTEM FOR ESTABLISHING A SPATIAL STREET ADDRESS DATA SET - A method for establishing a spatial street address data set including: (a) in no particular order: (1) providing street address data; (2) providing postal data; (3) providing community translation data; and (4) providing a spatial layer base map; (b) establishing a first data base containing once-translated address entries, each relating to a selected community entry from the street address data or a selected community entry from the community translation data; (c) establishing a second data base containing twice-translated address entries, each relating to a selected street name entry from the postal data or a selected street name entry from the street address data; (d) treating the second data base with a geocoder routine to create geocoded address entries in a geocoded data set; (e) situating the geocoded data set in a spatial layer; and (f) orienting the spatial layer with known loci in the spatial layer base map.11-05-2009
20090276448PARALLEL TRANSFORMATION OF FILES - A message brokering system includes a file input node configured to receive a file and divide the received file into a plurality of file portions for processing in the message brokering system, a plurality of transformation nodes configured to transform the plurality of file portions independently and in parallel, and a collector node configured to collect the plurality of transformed file portions and combine the plurality of transformed file portions into a single combined file based on header information associated with each of the plurality of file portions. The file input node is configured to divide the received file based on at least one user-configurable attribute, and the file input node is configure to associate the header information with the received file or each file portion of the plurality of file portions.11-05-2009
20090282068SEMANTIC PACKAGER - A system includes a storage medium having stored instructions thereon that when executed by a machine result in the following: a semantic modeler component to define relationships between data files in a semantic model; a viewer component coupled to the semantic modeler component to view the semantic model; and a packager component coupled to the semantic modeler component to export the semantic model and the data files.11-12-2009
20090282069ENCODING DATA TO BE SORTED - Key conditioning involves the construction of a byte orderable array from values for a possibly multi-field key concatenated key, for comparison by a sort routine. Byte-orderable sort keys are conditioned prior to execution of a sort routine, to facilitate an accurate and/or efficient sort procedure. For example, key conditioning may be applied to values in one or more columns of a database table, where the column(s) are used as keys for sorting rows of the table. Six factors are considered in encoding the byte array, such as whether nulls compare high or low; whether a field is fixed width or variable width; whether a field is guaranteed to be not null; whether a field is ordered ascending or descending; whether a field is the last field of a multi-field sort key or the only field of a sort key; and whether a field is likely to contain a significant number of zero values.11-12-2009
20090282065METADATA TO TECHNICAL DESIGN REVIEW DOCUMENT PROCESS - A method includes receiving a user input in a design environment indicating at least one software component for which a technical design document is desired, identifying files in which information associated with the component is located, accessing the information, and formatting the information according to a technical design document template. A system has a design environment for development of software components, and a document generator to automatically generate documentation for the software components on demand. A method to design software components includes producing a design of a software component in a design environment residing upon a computer, selecting the software component for design review, and generating a design document according to a template from the design environment.11-12-2009
20090282064ON THE FLY COMPRESSION AND STORAGE DEVICE, SYSTEM AND METHOD - Systems and methods for on the fly compression and storage device for compressing/decompressing data are disclosed. In one embodiment, an on the fly compression and storage system includes a file system for forwarding data for storing, one or more compression drivers, with one of the compression drivers invoked for compressing the data forwarded by the file system into compressed data, and a storage device for storing the compressed data. The compressing of the data and the storing of the compressed data are seamlessly performed. A status of the storage device is dynamically updated to the file system based on the compressing of the data.11-12-2009
20090287724Data Viewer Management - Embodiments described herein are directed to generating a customized data viewer, where the viewer is configured to display data at any level in a data model. In one embodiment, a computer system receives a user request indicating that portions of data are to be displayed in a user-customized manner using a data viewer. The computer system accesses the requested data portions that are to be displayed with the data viewer. The computer system generates a dynamic data viewer configured to display the accessed data portions in the user-customized manner indicated in the received user request. The computer system also applies the generated dynamic data viewer to the accessed data portions, such that the generated viewer displays the requested data portions in the user-customized manner.11-19-2009
20090292715System and Method for Determining Overall Utilization - The present disclosure is directed to a method and system for determining overall utilization. In accordance with a particular embodiment of the present disclosure, utilization metrics are received from at least one entity. Each utilization metric indicates resource availability for the entity. The utilization metrics are converted to mapped values by comparing the utilization metrics to configured thresholds. The mapped values are converted to percentage values. An overall utilization is calculated for the entity by identifying an average value of the percentage values. A graphical representation of the overall utilization is generated.11-26-2009
20090300040TABLE PARTITIONING AND STORAGE IN A DATABASE - To provide efficient table partitioning, a database is described for distributively locating a plurality of sub-tables resulting from partitioning of a table in a database. This includes an acquiring section that monitors access occurrences to each of the sub-tables to acquire a history of access occurrences. Also a deciding section decides a table storage area in which a sub-table is to be located, based on the history of access occurrences to each of the sub-tables.12-03-2009
20090271426Converting between software objects - A computer program product is provided. The product comprises a computer usable medium having a computer readable program code embodied therein, the computer readable program code adapted to be executed to implement a method for converting between data objects constructed according to different software technologies. The method comprises providing a system comprising distinct software modules to perform the converting between data objects and processing a properties file to identify a first class associated with a first software technology based on a second class associated with a second software technology. The method also comprises analyzing the first class to identify a first attribute of the first class. The method also comprises constructing a first object of the first class and assigning a first value to the first attribute of the first object based on a second value of a second attribute of a second object of the second class.10-29-2009
20080275895METHOD, SYSTEM, AND PROGRAM PRODUCT FOR ALIGNING MODELS - The present invention provides a model identity re-alignment algorithm that allows models with similar structures but substantial identity differences to be aligned such that all similar elements have the same identity. This causes the two models to appear to have come from a common ancestor. Once the two models have been aligned with one another, it can be used as a contributor in a two or three way merge and thus, becomes a part of the normal development work flow. This allows any two models to be aligned and then participate in a normal version control work flow. It also helps eliminate massive numbers of trivial differences. It addition, it is simpler and less error prone than manual systems.11-06-2008
20080275897METHOD AND SYSTEM FOR CREATING AN IN-MEMORY PHYSICAL DICTIONARY FOR DATA COMPRESSION - Some aspects of the invention provide methods, systems, and computer program products for creating an in-memory physical dictionary for data compression. To that end, in accordance with aspects of the present invention, a new heuristic is defined for converting each of the plurality of logical nodes into a corresponding physical node forming a plurality of physical nodes; then place each of the physical nodes into the physical dictionary while traversing the dictionary tree in descending visit count order. Each physical node is placed in its nearest ascendant's cache-line with sufficient space. If there is no space in any of the ascendant's cache-line, then the physical node is placed into a new cache-line, unless a pre-defined packing threshold has been reached, in which case the physical node is placed in the first available cache-line.11-06-2008
20080275896PRESERVING USER CODE IN OTT-GENERATED CLASSES - An object type translator (OTT) determines one or more database object types. The one or more database object types are mapped to a first structural language type definition code. After being generated, the user may add user code to the first structural language type definition code. During regeneration of these files, the first structural language type definition code is then parsed to determine the user code that has been added, based on the start and end markers that the user code segments have been marked with. OTT maps these user-code segments to the corresponding database types and keeps track of the mapping and the user code. When the OTT starts generating the second structural language code, the OTT determines a position where the user code should be inserted into the second structural language type definition code using that mapping. The user code is then inserted in the second structural language code in the position determined. Accordingly, the user code that was added is not lost when the structural language type definition code is regenerated from the one or more database object types.11-06-2008
20080275894CONTENT ITEM APPARATUS AND METHOD OF OPERATION THEREFOR - A content item apparatus comprises a content data receiver (11-06-2008
20090037451Attack and Disaster Resilient Cellular Storage Systems and Methods - Systems, methods, and apparatus for providing data storage services storage using self-organizing replica management. In one embodiment, a cellular system operates storage objects, for example, data files, for clients. The system stores the storage objects as generally more than one substitutable replica, with each replica being stored on a separate cell. In some aspects, the system maintains multiple layers of overlapping trees and uses them for managing storage object replicas. In other aspects, a single self specializing substitutable cell performs dynamic specialization of itself in the system, while persistence is provided by the system as a whole. In other aspects, the system gives replicas special status while their storage object is being updated and returns them to a state of being fully substitutable after all changes have been successfully propagated to the replicas.02-05-2009
20090037450DATA GATHER SCATTER - REDISTRIBUTION MACHINE - A method, system, and computer program product to transfer data between two application data structures by copying a data gather scatter program (DGSP) from an exporting process address space where a first data structure is located, to a location in shared memory visible to an importing process address space; assembling a parameter set identifying the data structure; starting a data gather scatter-redistribution machine (DGS-RM) in an importing process space where a second application data structure is located; passing the first parameter set, the DGSP copy, and a second parameter set identifying a second application data structure and a second DGSP to the DGS-RM; and creating master and worker stack machines. The master stack machine identifies a contiguous chunk of the first data structure. The worker stack machine identifies contiguous chunks of the second data structure representing the same number of bytes as the contiguous chunk of the first data structure and transferring to (from) one or more identified chunks of the second data structure from (to) the single chunk of the first application data structure.02-05-2009
20090006435OBJECT IDENTIFIER AWARENESS FOR NETWORK DEVICE NOTIFICATIONS - In one embodiment, a control processor sends unique identifiers to each traffic processor in a multi-processor system of different unique identifiers may be sent for each traffic processor supported Management Information Base (MIB). The traffic processors modify MIB object identifiers to include the unique identifiers and then transmit notifications that include the unique identifiers, MIB object identifiers, and associated traffic processor parameter values. In another embodiment, the control processor handles the task of attaching unique identifiers so each MIB object identifiers are uniquely correlated with a particular traffic processor.01-01-2009
20090006434Container Reputation - A method of creating a reputation for a container that contains data is disclosed. A user reviews a container that is stored on a network and the user posts an opinion rating of the container. The opinion rating is stored along with an user identification. The opinion rating and the user identification are added to a database and the data in the database is used to calculate a reputation for the container.01-01-2009
20080243895DISCOVERING OBJECT DEFINITION INFORMATION IN AN INTEGRATED APPLICATION ENVIRONMENT - Provided is a method, system, and program for providing an object discovery agent (ODA) client. There is one object discovery agent (ODA) client and at least one ODA, wherein each ODA is associated with one application and includes: (i) application programming interfaces (APIs) to communicate with the associated application to discover definition information on objects maintained by the application and (ii) code to communicate with the ODA client. The ODA client communicates with one of the at least one ODA to cause the ODA to gather definition information on at least one object used by one application. The gathered object definition information is provided to an integration server to integrate the object in an environment including heterogeneous objects from different applications.10-02-2008
20080250045METHOD AND SYSTEM FOR GENERATING A MAPPING BETWEEN TYPES OF DATA - A method and system for routing data of an source type to a target type is provided. The system has various routines for converting data in one type into data in another type. In one embodiment, the system receives an indication of a source type and identifies various sequences of routines that can convert the data from the source type to a target type. The system then coordinates the processing of the data by each routines in the sequences to the conversion of the data to the target type. The process of identifying the routines is referred to as “discovery.” The system also provides an aliasing mechanism by which compatible types can be identified. When identifying a sequence of routines, the system may check for routines that support compatible types. When a sequence of routines is identified, the system caches the identity of the sequence to facilitate identifying that sequence when the data of the source type is to be converted to the target type. The system also uses a mechanism for discovering sequences of routines from other computer systems. These other computer systems may broadcast various sequences of routines which are stored at the receiving computer system. A user may use a switchboard mechanism to direct data of a certain source type to one of the broadcasted sequences. This directing of the data to a certain source effects the routing of the data from one computer system to a device or routine on another computer system.10-09-2008
20080250046ANALYSIS OF PERFORMANCE DATA FROM A RELATIONAL DATABASE SYSTEM FOR APPLICATIONS USING STORED PROCEDURES OR SQL - Analyzing performance data from a relational database to discover poorly performing SQL statements includes creating event records of performance data for query statements executed by a relational database management system, and condensing the performance data in the event records. A performance summary can be generated for each condensed event record. The performance summaries can then be analyzed based on performance characteristics to identify poorly performing SQL statements.10-09-2008
20090119321METHODS AND COMPUTER PROGRAM PRODUCTS FOR IMPLEMENTING LOW-COST POINTER COMPRESSION AND DECOMPRESSION - Prior art attempts to provide 32-bit addressing within a 64-bit computing environment lead to other complications. Hardware solutions result in more complicated hardware which, in turn, increases costs and may reduce the functionality of 64-bit computing and significant changes to commercially available 64-bit processors. Alternatively, previous software solutions are computationally expensive, requiring add and subtract routines convert between 32-bit addresses and 64-bit addresses. An additional problem, specific to IBM™ zSeries hardware, is that the only way to provide a heap size larger than 2 GB, even if less than 4 GB, is to employ the 64-bit addressing in combination with a computationally expensive software patch to emulate 32-bit addressing. By contrast, provided by aspects of the present invention there are systems, methods and computer program products for implementing low-cost pointer compression and decompression. In accordance with more specific aspects of the invention, the systems, methods and computer program products for implementing low-cost point compression and decompression can be specifically adapted to compress 64-bit pointers to 32-bit pointers, and conversely convert 32-bit pointers to 64-bit pointers.05-07-2009
20080228798Method and apparatus for deep packet processing - A method and apparatus for deep packet processing including a parsing and a searching method supported by a data structure storing the state-transition rules in the state-transition rule tables of a programmable state machine for parsing. The state-transition rule table is then compressed using the BaRT compression algorithm. Each transition rule comprises a test value, a test mask and a next state field. In a second embodiment the state-transition rule table is split into more than one state-transition rule table corresponding to disjoints state spaces, thus allowing more flexibility in the use of storage space. Finally a parsing and searching method can be implemented using the same hardware. The searching and parsing methods can be implemented alternatively or in any combination at wire-speed.09-18-2008
20080228797Creation of Attribute Combination Databases Using Expanded Attribute Profiles - A method and system for compiling attribute combinations are presented in which expanded attribute profiles associated with a group of query-attribute-positive individuals and expanded attribute profiles associated with a group of query-attribute-negative individuals are accessed, and combinations of attributes having a higher frequency of occurrence in the set of expanded attribute profiles associated with the group of query-attribute-positive individuals are identified. The identified attribute combinations and corresponding statistical results can then be stored to create a compilation of attribute combinations that co-occur with the query attribute.09-18-2008
20100005115METHOD AND SYSTEM FOR GENERATING DOCUMENTS USABLE BY A PLURALITY OF DIFFERING COMPUTER APPLICATIONS - Embodiments of the present invention provide a system, computer-readable medium and a method for maintaining data in a format usable by a plurality of different computer applications. Data is input into a first application document having a first format and received by the system. The data is parsed from the first application document, and the parsed data is converted to a raw data string. A template associated with the raw data string is selected in a second computer application. Based on information related to the association of the template to the raw data string, the raw data string is converted to a second application document having a second format. The second application document is presented on an output device or stored in the second document format.01-07-2010
20080281849DATA INTEGRATION APPARATUS, DATA INTEGRATION METHOD, AND COMPUTER PRODUCT - When collecting and integrating data present in separately managed information sources, data are collected from the information sources through a physical model of the information sources. Integration is executed by a process of converting a data configuration (mapping) into a logical model predefined for each utilization-side application and a process of converting and conforming values (cleansing); and the result thereof is provided as a view (logical model) for each application to the utilization-side application.11-13-2008
20080281844Interactive Data Access Method and Interactive Data Access System - A variable is defined by one engineering device. A tag name is assigned to the variable that the other device accesses, and a corresponding table of the tag name and the variable name is created. Further, a tag object is converted to a tag list in a format that can be interpreted by the other device, and the tag list is downloaded to the other device. The tag name of the access from the other device is converted to the variable name with reference to the corresponding table.11-13-2008
20080281843Distributed Memory Type Information Processing System - It is possible to realize high-speed data processing between processing modules with a small communication amount when performing information processing of a large amount of data employing the parallel computer architecture. Each of the processing modules transmits a first list as a list of values stored in the memory of the local processing module to another processing module in the information processing system and receives at least one second list as a list of values transmitted from the another processing module to the local processing module so as to compare the values in the second list with the values in the first list. When the values in the second list coincide with the values in the first list, counters corresponding to the values in the first list which have coincided are incremented by one.11-13-2008
20080288518CONTENT DATA BLOCK PROCESSING - The present invention provides a method for processing content data. The method comprises buffering a sequence of received compressed content data blocks (11-20-2008
20080288519Format Negotiation for Media Remoting Scenarios - Format negotiation for media remoting involves at least one media data format. In an example embodiment, a media format negotiation for playing media data is begun between a server and a client. The media data format is transferred from the server to the client. A notification that indicates if an attempt at the client to construct a media topology responsive to the media data format was a success or a failure is transferred from the client to the server. Whether and/or how the media data is to be transferred from the server to the client may be impacted by the notification.11-20-2008
20080288520Node Processing of Variable Information Print Jobs - Embodiments herein begin by receiving user input. The embodiments herein create a fixed data file and a text string based on the user input using a process manager located within a system. The embodiments herein also supply the fixed data file and the text string from the process manager to at least one node within the system. The system comprises a plurality of such nodes. The node executes the text string to add variable data to the fixed data and create a variable information print file. More specifically, the node retrieves the variable data from a database within the system. Then, the method can print the variable information print file.11-20-2008
20100023541Universal Data Management Interface - A universal data management interface (UDMI) system includes a processing system generates a visual interface through which a user can access, manage, and manipulate data on plural different types of remote databases. The UDMI connects to multiple standard database management systems and to allow multiple users to access, manage, and manipulate data within each of the multiple standard database management systems. The UDMI also allows multiple virtual databases that reside in a single database to be available as a network service.01-28-2010
20080313202Method and apparatus for semantic keyword clusters generation - A method and apparatus in accordance with the invention which, for any given keyword, generate a semantic keyword cluster of meanings and associated proximity scores.12-18-2008
20080313204METHOD AND APPARATUS FOR DATABASE MAPPING - A computerized stored library of a plurality of database mappings is provided. Each database mapping represents the manner in which fields of a source database maps to fields of a target database. When a source database needs to be mapped to a target database, one or more of the database mappings are selected from the library and used to perform a mapping. Data transformations may be performed on one or more of the fields of the source database during the mapping.12-18-2008
20090319547Compression Using Hashes - A compression algorithm may use a hash function to compress a file. The hash function may be selected to have multiple collisions so that a compressed file may include the hash values and indexes to the collisions. In some cases, a database of data and their hash values may be built during compression, while in other cases a preexisting database may be used. A preexisting database may be used as a shared secret to provide security to the compressed file. In many embodiments, the compression algorithm may be used recursively to reduce the size of the file by using the same or different hash functions.12-24-2009
20080215605Method for Embedding Data - Watermarking schemes are known that embed the watermark directly in the MPEG domain. A requirement for these algorithms is that the watermarked MPEG stream does not increase in size. Therefore, a bit rate controller allows a modification of a DCT coefficient only if such modification does not increase the stream size. It happens frequently that DCT coefficients are skipped because of this requirement. As a direct consequence, the watermark energy is smaller than desired and therefore the watermark is less robust. This invention exploits the fact that stuffing bits have often already been added to the stream by the MPEG encoder. The embedder is arranged to analyse the stream so as to find out how many stuffing bits there are at the end of the slice. The embedder can then embed the watermark immediately at the beginning of a slice. As a direct result, the watermark energy will increase and therefore the watermark will be more robust.09-04-2008
20080270442HIERARCHICAL INHERITED XML DOM - A method for providing processed data definition documents (DDDs) or processed document object models (DOMs) for object oriented programming. The use of these processed data definitions simplifies the data structures and streamlines programming to access the data. A standard DDD/DOM has a hierarchical branched structure having a number of levels each with elements/nodes and attributes. The DDD is written in a platform independent markup language. An element/node is selected and its attributes are identified. All ‘children’ of the selected element/node are identified. The attributes of the selected element/node (parent) are then copied to each child for all children in the DDD/DOM. This is repeated for all elements/nodes in the DDD/DOM to result in a processed DDD/processed DOM which is now structured to allow program access to data in a more direct manner.10-30-2008
20080215603SERIALIZATION OF RUN-TIME STATE - The claimed subject matter provides a system and/or a method that facilitates re-locating a web application associated with a network service utilizing a portion of serialized data. The network service can be any collection of resources that are maintained by a party (e.g., third-party, off-site, etc.) and accessible by an identified user over a network (e.g., WAN, Internet, etc.). An interface component can receive a portion of serialized data with transparent structure related to an application specification. A hydrate component can create a web application independent of a network service based at least in part upon the serialized data, the web application has state within the network service.09-04-2008
20080281845Transforming values dynamically - When altering records in a repository of information to add an attribute that has a non-NULL default value and a corresponding constraint to the records, no update record is issued and instead, the existing records are essentially treated as having a NULL value for the attribute being added. To compute a query over the records to which the attribute has been added, a value is generated for rows that hold NULL values for the attribute in which the value in which the NULL values held therein are translated to the default value.11-13-2008
20080294669Program-Data Combining System - Methods for securing at least one program application and data associated with the program application are herein described. In one embodiment, the method includes compressing the program application and data associated with the program application into a program-data combine having a compressed format and storing the program-data combine on a program-data combine computer.11-27-2008
20080313203Information, transformation and reverse transformation processing - A transformation processing system input data including a data record area for storing target date and a transformation processing identification information record area for storing transformation processing identification information about transformation processing executed upon the target data. The transformation processing system includes: a reverse transformation information recording unit which records a target data pointer indicating the data record area in transformed data, a transformation processing identification information pointer indicating the transformation processing identification information record area, and reverse transformation processing identification information about reverse transformation processing; a target data transformation unit which transforms the target data and records it in the data record area; and a transformation processing identification information recording unit which adds the transformation processing identification information about the transformation processing executed by the target data transformation unit to the transformation processing identification information record area in the input data.12-18-2008
20090119323Method and system for reducing a data set - System and methods are provided for applying a dimensionality reduction process to a data set. The method includes obtaining a data set including a first set of variables and identifying collections of the first set of variables for replacement by a second set of variables. The method also includes replacing the collections of the first set of variables with the second set of variables and eliminating the first set of variables from the data set.05-07-2009
20090030923IDENTIFICATION OF SHARED RESOURCES - A method for identifying relevant shared resources for a requested browser criterion, the method comprising the steps of: receiving browser monitoring data for a shared resource, the browser monitoring data including an identification of a browser criterion; recording the browser monitoring data to a monitoring data store; parsing the monitoring data in the monitoring data store to identify relevant monitoring data for the requested browser criterion; and identifying shared resources associated with the relevant monitoring data.01-29-2009
20090049071Method and Apparatus for Signal Processing and Encoding and Decoding Method, and Apparatus Therefor - An apparatus for processing a signal and method thereof are disclosed. Data coding and entropy coding are performed with interconnection, and grouping is used to enhance coding efficiency. The present invention includes the steps of obtaining index information and entropy-decoding the index information and identifying a content corresponding to the entropy-decoded index information and selecting entropy table.02-19-2009
20090193046MATCH RULES TO IDENTIFY DUPLICATE RECORDS IN INBOUND DATA - Techniques for identifying duplicate records in data to be imported into a data hub. In one set of embodiments, a batch of records to be imported into a data hub is received and a match rule for the batch of records is selected. The match rule includes a set of match criteria for matching records in the inbound batch to records stored in the data hub. A matching process is then carried out, prior to importing the batch of records, to determine whether any of the records in the batch are duplicates of records stored in the data hub. By identifying potential duplicate records before (rather than after) importation, the problems associated with prior art duplicate identification techniques are minimized or avoided. In a particular embodiment, an import workbench application comprising a plurality of user interface screens is provided for aiding a user in managing the matching process.07-30-2009
20090164493APPARATUS AND METHODS FOR EDITING CONTENT ON A WIRELESS DEVICE - Apparatus and methods for enhanced editing comprise displaying content comprising data items and a cursor having a position. The apparatus and method further include applying a predetermined aggregation rule to the displayed data items to generate a list of one or more data aggregations. Additionally, the apparatus and methods include displaying the list of data aggregations, and further generating and displaying a list of one or more functions to perform on the one or more data aggregations. The apparatus and methods further include receiving an indication of a selected data aggregation, as well as a selected function to carry out with respect to the selected data aggregation. Further, the apparatus and methods are operable to perform the selected function on the selected data aggregation.06-25-2009
20090164492Auditing Tool For a Legacy Software Modernization System - A database modernization auditing system and method is disclosed. One embodiment comprises a method for loading a legacy data object, transforming the legacy data object into a modern data object according to a rule set, wherein transforming the legacy data object into the modern data object further includes abstracting at least a portion of the legacy data object into semantic information and transforming the semantic information into the modern data object, and generating an audit log entry corresponding to an error that occurs while transforming the semantic information into the modern data object, wherein the audit log entry contains a unique identifier that relates the audit log entry with the legacy data object.06-25-2009
20090138493METHOD AND SYSTEM FOR MEDIA TRANSFORMATION - Systems and methods have been developed for transforming the format of media objects. More specifically, systems and methods have been developed for transforming the format of media objects associated with a user media locker.05-28-2009
20090049069METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT FOR PRESERVING PRIVACY IN DATA MINING - Privacy in data mining of sparse high dimensional data records is preserved by transforming the data records into anonymized data records. This transformation involves creating a sketch-based private representation of each data record, each data record containing only a small number of non-zero attribute value in relation to the high dimensionality of the data records.02-19-2009
20090271428TRACKING DIGITAL IDENTITY RELATED REPUTATION DATA - Systems and processes of the present invention allow for tracking and publishing digital identity related reputation. In an example embodiment, a Digital Identity Provider maintains a database with reputation data that can be accessed by Requesters. The Digital Identity Provider may update reputation data based on a variety of events related to a digital identity. The reputation data may be tracked regarding the digital identity itself, digital identity purchaser or registrant, or an email address, domain name, URL, or website associated with the digital identity. The reputation data may include various categories, such as email practices, website content, privacy policies and practices, fraudulent activities, domain name related complaints, overall reputation, etc. The reputation data may be published in a publicly-available database, a private database, or via other methods. The Registrant may opt for a reputation service while registering a digital identity. The Requester may decide whether to interact with a digital identity based on the digital identity related reputation.10-29-2009
20090177677Navigation device and method - A method of updating map data stored in one or more files on a portable navigation device (PND) or navigation system is disclosed. The method includes the steps of establishing a wireless communication with a wireless access point WAP of a wide, local, or wireless local area network having internet connectivity, obtaining an Internet Protocol IP address from the WAP to enable the device or system to become a node on the network and to download content from the internet.07-09-2009
20090177678Locating Linear Reference System Events in a Geographic Information System - A method and system are provided for determining the geographic locations of events in a linear referencing system (LRS), such as a LRS for the Department of Transportation. The method and system utilize similarities between a LRS and the postal addressing system used in the United States. A LRS event geocoding database and schema are created from portions of the postal addressing system schema and geographic information system (GIS) schema. LRS data is encoded as postal address data as defined in the postal addressing system. The LRS data and GIS data are conflated to populate the LRS event geocoding database using similar transformation logic as for current postal address geocoding. The geographic location of a given LRS event is generated using geocoding software that utilizes the linear measure implicit in the LRS event identifier and the LRS event geocoding database.07-09-2009
20090177676APPARATUS, SYSTEM, AND METHOD FOR STORING AND RETRIEVING COMPRESSED DATA - An apparatus, system, and method are disclosed for storing and retrieving compressed data. A compression module compresses a data file organized in logical tracks. A ratio module determines a track compression ratio. The track compression ratio is a ratio of an integer value n to one. A destage module destages a single directory entry for the data file to a directory. The directory entry points to a zeroth track on a hard disk drive. The destage module further destages the data file sequentially to tracks of the hard disk drive from the zeroth track with n logical tracks of the data file stored on one physical track of the hard disk drive. A stage module stages a kth logical track from a physical track of the hard disk drive. The physical track is specified by an integer value of k divided by n.07-09-2009
20090327323Integrating Data Resources by Generic Feed Augmentation - Data integration in a data processing system is provided. A data mashup specification is received and an interleaved sequence of operations as defined by the data mashup specification is executed. The interleaved sequence of operations comprises at least one of an import operation, an augment operation, or a publish operation. In executing the interleaved sequence of operations a determination is made as to the next operation to execute. An outer context is formed and added to a binding context of the next operation. If the next operation is an import operation, a data resource is imported from a data source and an input generic feed is generated. If the next operation is an augment operation, a set of augmented generic feeds is produced from a set of input generic feeds. If the next operation is a publish operation, a new data resource is produced from a specified augmented generic feed.12-31-2009
20090063527PROCESSING OF DATABASE STATEMENTS WITH JOIN PREDICATES ON RANGE-PARTITIONED TABLES - A method for processing database statements with join predicates on range-partitioned tables is provided. The method provides for receiving a database statement with a join predicate between a first table and a second table for processing, responsive to the join predicate involving one or more leading columns of a partition key for the first table, a nested-loop join operation being selected to join the first table and the second table, the first table being an outer table of the nested-loop join operation, and data from the second table being piped, calculating maximum and minimum join key values for the second table, creating a partition elimination bitmap for the first table based on the maximum and minimum join key values of the second table, and pushing the partition elimination bitmap onto a scan of the first table to exclude one or more partitions of the first table from the scan.03-05-2009
20090055420METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR IDENTIFYING COMMON FACTORS ASSOCIATED WITH NETWORK ACTIVITY WITH REDUCED RESOURCE UTILIZATION - Disclosed are a method, system, and computer program product for determining a common factor contributing to network activity with reduced computational resource utilization. In some embodiments of the present invention, the method or the system determines one or more factors by examining one or more information transmitted across the network. The method or the system stores a number of information attributable to each of the factors and determines whether the number exceeds a threshold requirement. Where the number for a factor exceeds the threshold requirement, the method or the system then determines a summary statistic for the number of information. Thereafter, the method or the System updates the data structure corresponding to the factor being analyzed based upon the summary statistic. Once the data structure is updated based upon the summary statistic, the method or the system determine one or more common factors for the network activities.02-26-2009
20090055418AUTOMATIC CASCADING COPY OPERATIONS IN A DATABASE WITH REFERENTIAL INTEGRITY - A method and apparatus for performing a cascading copy operation in a database with referential integrity constraints is disclosed. A user may supply (or be prompted to provide) a new key value, a first table, and a primary key value to use in the cascading copy operation. In response, a database engine may be configured to create a new record in the first table, with a primary key equal to the new key value supplied to the cascading copy operation and otherwise duplicate data values from the row identified by the primary key value. The database engine may also duplicate records in the database in tables other than the first table. Specifically, in one embodiment, records in any table that use the primary key value supplied to the cascading copy operation as a foreign key may be duplicated as a new record having the new key value as the foreign key.02-26-2009
20090037448Network content in dictionary-based (DE)compression - Apparatus and methods are described for network content in dictionary-based (de)compression. Content for compression is parsed into discrete constructions, such as phrases, words, etc. The discrete constructions are passed to a searching engine to locate network information at one or more network locator identities, such as URI's (URL's, URNs) that correspond to the discrete constructions. Upon locating the network information, a dictionary of entries corresponding to the content is created. The content is encoded from the dictionary by indicating raw or relative offsets into the network information per each of the network locator identities. Decoding occurs anti-symmetrically to the encoding. In this manner, the vastness of network content, e.g., the world wide web, is leveraged to provide relevant dictionaries for de-/encoding. Searching for candidate dictionaries, scoring same and safeguarding against volatile dictionary content are other noteworthy features. Computer program products and computing network interaction are also defined.02-05-2009
20090012978Method for Reducing Size of a Digital Audio, Image or Video File - The inventive method makes it possible to reduce the size of a digital audio, image and/or video file in such a way that a reduced number of representative data needed for reformatting a file is transmitted to a receiving entity encoder. Said method consists in assigning references of at least one file component value to another value of the same component or in integrating at least one reference of the value group of the same component or another component into a component value group.01-08-2009
20090024643Multi-Level Compressed Look-up Tables Formed by Logical Operations to Compress Selected Index Bits - A lookup is performed using multiple levels of compressed stride tables in a multi-bit Trie structure. An input lookup key is divided into several strides including a current stride of S bits. A valid entry in a current stride table is located by compressing the S bits to form a compressed index of D bits into the current stride table. A compression function logically combines the S bits to generate the D compressed index bits. An entry in a prior-level table points to the current stride table and has a field indicating which compression function and mask to use. Compression functions can include XOR, shifts, rotates, and multi-bit averaging. Rather than store all 201-22-2009
20090083298DOCUMENT ENCODING APPARATUS, DOCUMENT ENCODING METHOD, AND COMPUTER-READABLE STORAGE MEDIUM - Digit counts c′ after the decimal point of attribute values in a structured document are acquired (S03-26-2009
20090198718METHODS AND APPARATUS FOR PARALLEL EXECUTION OF A PROCESS - One embodiment of the invention is directed to executing a computer program that manipulates data stored in a distributed manner on a parallel server. At least one portion of the computer program treats the data from a global perspective, wherein commands to the parallel server are not specific to the manner in which the data is distributed on the parallel server. In addition, at least one portion of the computer program treats the data from a local perspective, wherein commands to the parallel server are specific to the manner in which the data is distributed on the parallel server.08-06-2009
20090198715METHOD AND APPARATUS FOR PSEUDO-CONVERSION OF TABLE OBJECTS - A method for converting a table object from a first partitioning type to a second partitioning type includes steps or acts of gathering information including a definition of a clustering index of the table object; converting the table object of the first partitioning type into a virtual table object of the second partitioning type by virtually applying the information to a clustering index of the table object such that the virtual table object represents how the table object will appear when it is explicitly converted; and presenting the virtual table object to a user for viewing and manipulating as a table of the second partitioning type before generating an explicit conversion to said second partitioning type.08-06-2009
20090063530SYSTEM AND METHOD FOR MOBILE WEB SERVICE - A system and method for a mobile web service is provided. A system for a mobile web service includes: a generator parsing a web page to generate a text formatted first hierarchical structure tree; a converter encoding the generated first hierarchical structure tree to convert the encoded first hierarchical structure tree into a binary formatted second hierarchical structure tree; and a transmitter transmitting the converted second hierarchical structure tree to a mobile terminal.03-05-2009
20090063528DE-DUPLICATION IN A VIRTUALIZED SERVER ENVIRONMENT - A data de-duplication application de-duplicates redundant data on the primary storage read/write pathway of a virtualized server environment. The virtualized server environment comprises one or more server applications operating on a virtualization layer provided on a computer architecture that includes memory (e.g., RAM, cache memory) for temporarily storing data and storage (e.g., disk storage) for persistently storing data. The one or more server applications use the read-write pathway to read data into memory from storage and to write data to storage from memory. The de-duplication application identifies redundant data in memory, storage, or both, and replaces the redundant data with one or more pointers pointing to a single copy of the data. The de-duplication application can operate on fixed or variable size blocks of data and can de-duplicate data either post-process or in-line.03-05-2009
20090063526DYNAMIC DATA COMPACTION FOR DATA REDISTRIBUTION - A method and system for optimizing data redistribution in a database. In one embodiment, the method includes moving, during a first scan, outgoing records from a sending partition to one or more receiving partitions, where free space is created in the sending partition due to the outgoing records leaving the sending partition. The method also includes filling, during the first scan, some of the free space with remaining records that do not leave the sending partition.03-05-2009
20090063525OPTIMIZED RF COVERAGE USING AJAX AND SVG - A method for displaying RF coverage information includes providing formatting data for displaying the radio frequency coverage information on a client. The formatting data is executed on the client. First radio frequency coverage raw data is provided to the client. The first radio frequency coverage raw data is utilized by the formatting data to construct an overall radio frequency coverage representation of a site. Subject to a subsequent request from the client, second radio frequency coverage raw data representative of radio frequency coverage is provided for a portion of the site. The second radio frequency coverage raw data is utilized by the formatting data on a supplemental basis.03-05-2009
20090055422System and Method For Data Compression Using Compression Hardware - A system and method for data compression using compression hardware is disclosed. According to one embodiment, a computer-implemented method comprises receiving a data set in a data stream. The data set includes a set of data descriptor fields. Using the set of data descriptor fields included in the data set, one or more tabular slices and an index are generated. The one or more tabular slices are compressed into a compressed data block by a data compression scheme using a hardware compressor. A compression data file is generated using the compressed data block and stored in a database.02-26-2009
20090055421Migration and transformation of data structures - The invention relates to a functional unit for the migration and transformation of data structures from at least one source system into data structures of at least one target system comprising at least one import filter and at least one export filter. The at least one import filter is for transformation of a data structure prepared by the source system in a source-system dependent format into a universal description format. The at least one export filter is for transformation of the data structure in the universal description format into a target-system dependent format and to provide the same for the target system.02-26-2009
20090240716DATA PROCESSING METHOD, SYSTEM, AND DEVICE FOR MULTIMEDIA DATA RECORDING AND DATA PATCHING METHOD THEREOF - A data processing method is disclosed. A first stream data including a first part and a second part is received. The second part is processed according to the first part of the first stream data. The processed first stream data is transformed into a second stream data.09-24-2009
20090055419METHOD AND SYSTEM FOR CONTENT RESYNDICATION - Methods and systems for providing content. Syndicated content may be received from a content syndication source. The syndicated content may be augmented with metadata. The augmented content may be provided through a target syndication feed.02-26-2009
20090083299METHOD AND APPARATUS FOR MANAGING A CONTACT LIST - A method of managing a contact list in a communication system includes: a) in response to user manipulation, generating a contact identification (ID) representing a contact person in the communication system, and presenting the contact ID on the contact list; b) keeping track of a contact frequency between the user and the contact person; c) selecting an attribute in accordance with the contact frequency; and d) presenting the attribute on the contact list, such that the attribute is associated with the contact ID. An apparatus for managing a contact list in a communication system is also disclosed.03-26-2009
20080288521AUTOMATED MANUFACTURING SYSTEM - An automated manufacturing system comprises a computer processing system and a plurality of consolidation systems. The computer processing system receives information on product subbatches and product packages and consolidation status information to produce consolidation assignment information, each product package comprising one or more product subbatches. The consolidation systems receive the product subbatches in accordance to the consolidation assignment information and consolidate the product subbatches into product packages, wherein the status of the consolidation systems are tracked and the consolidation status information is sent to the computer processing system.11-20-2008
20090063524APPARATUS, SYSTEM, AND METHOD FOR EXECUTING A DISTRIBUTED SPATIAL DATA QUERY - A method for executing a distributed spatial data query. The present invention allows a client to perform spatial queries against spatial data stored in a various formats in various separate databases. A view of the data is created in the relevant databases, wherein the spatial data is converted to WKB and stored as a BLOB. A federated server contains nicknames for the various database views, and also contains views of the data where the BLOB is converted back to a spatial data type. The federated server presents to clients an application view of the distributed heterogeneous spatial data such that the clients can treat the data as if it were a homogenous data source. Also taught is incorporating distributed non-spatial data into the application view by creating a nickname and a view on top of the nickname which derives spatial information from the non-spatial location information.03-05-2009
20090070353Rules engine for warehouse management systems - A novel rules engine which automates many warehouse processes, and provides for efficient management of a warehouse. The rules engine provides a flexible and customizable structure for modeling the many different types of processes governing the function of a warehouse. The rules engine translates business level logic into code for manipulating the warehouse database. The rules engine allows a user to create their own user logic for working with the database, which operates at a level of abstraction more feasible for the user. The rules engine understands the user logic by the way the user decides how to string various restrictions together. The rules engine implements the translation via its internal understanding of the structure of the particular application. Thus, the rules engine allows the user to define logic without understanding how to manipulate a database.03-12-2009
20090198716METHOD OF BUILDING A COMPRESSION DICTIONARY DURING DATA POPULATING OPERATIONS PROCESSING - A system and method for synchronously building a Ziv-Lempel dictionary during online insert processing. In one embodiment the invention includes a method for processing information that includes the steps of initiating a process for adding data to a data object including a table and determining if a predetermined condition exists for triggering the creation of a compression dictionary. The compression dictionary is then created if the predetermined condition exists. Once created, the dictionary may then be inserted into the data object.08-06-2009
20090083296Metadata endpoint for a generic service - A metadata endpoint for a generic service is disclosed. The technology initially defines an endpoint for metadata which was previously combined with a corresponding data endpoint. The metadata and corresponding data endpoint were combined in a first Service Oriented Environment (SOE) in which a combining constraint is not placed upon metadata and corresponding data endpoints. A location for accessing the endpoint for metadata is published for use by a second SOE in which a combining constraint is placed upon metadata and corresponding data.03-26-2009
20080263074DATA CONVERSION SYSTEM AND METHOD - A method and computer program product for receiving a first digital content. The first digital content is processed using a content processing algorithm to generate a second digital content. A value is associated with the processing of the first digital content, thus defining a processing fee.10-23-2008
20080263073DETECTING APPARATUS, SYSTEM, PROGRAM, AND DETECTING METHOD - A detecting apparatus including a cluster storing unit that stores, for each of clusters into which execution time of previously executed monitored tasks are classified, the range of execution times belonging to the cluster, an acquiring unit that acquires an execution time of the monitored task in response to new execution of the monitored task on the information processing apparatus, and a determining unit that determines the occurrence of an extraordinary behavior during the execution of the monitored task if the execution time of the newly executed monitored task does not fall within any of the ranges corresponding to the clusters.10-23-2008
20080263072Methods of Encoding a Combining Integer Lists in a Computer System, and Computer Software Product for Implementing Such Methods - A range covering integers of an input list is divided into subsets according to a predetermined pattern. The encoding produces coding data including, for each subset containing at least one integer of the input list, data representing the position of this subset in the pattern, and data representing the position of each integer of the input list within this subset. This encoding process may be iterated in several coding layers. It supports very efficient methods for combining the coded integer lists.10-23-2008
20080263071SYSTEMS AND METHODS FOR DRIVERLESS IMAGING OF DOCUMENTS - A method for driverless imaging of documents may include a direct imaging application on a client sending an imaging request message to another device, which may be a direct imaging server or a target imaging device. In response to receiving the imaging request message, the device may create an imaging job skeleton that includes contents of a complete imaging job other than document data. The device may send a despooling request to the direct imaging application. The despooling request may indicate where the document data corresponding to the imaging job should be despooled. In response to receiving the despooling request, the direct imaging application may despool the document data in accordance with the despooling request.10-23-2008
20080263070Common drawing objects - A transparent format can be used to store the content of shape objects so that documents authored by different types of applications can uniformly share information related to the shape objects. Shape objects comprise, for example, properties such as geometries, lines, fills, size and the like. The properties can have other subordinate properties. For example, geometries can comprise polygons properties, and fill properties can comprise color properties. The shape objects can be hierarchically represented such that principles of object oriented programming can be applied to the shape object.10-23-2008
20090210438APPARATUS AND METHOD FOR POSITIONING USER-CREATED DATA IN OLAP DATA SOURCES - A computer readable storage medium comprises executable instructions to receive user-created data for user-specified positions in an OLAP hierarchy. The OLAP hierarchy is reorganized according to the user-created data. Data manipulation statements are generated to evaluate a set of members of the OLAP hierarchy according to the user-specified positions.08-20-2009
20090012979METHODS AND SYSTEMS FOR PARTITIONING OF DATASETS FOR RETAIL SALES AND DEMAND CHAIN MANAGEMENT ANALYSIS - A partitioning system that provides a fast, simple and flexible method for partitioning a dataset. The process, executed within a computer system, retrieves product and sales data from a data store. Data items are selected and sorted by a data attribute of interest to a user and a distribution curve is determined for the selected data and data attribute. The total length of the distribution curve is calculated, and then the curve is divided into k equal pieces, where k is the number of the partitions. The selected data is thereafter partitioned into k groups corresponding to the curve divisions.01-08-2009
20090204624METHOD AND SYSTEM FOR PREFERENCES-BASED MAIL DISTRIBUTION AND DIGITAL POSTAL SERVICES - A system and method for collecting and storing communications preferences of recipients and delivering communications to a recipient in accordance with the recipient's preferences is disclosed herein. Preferably, the communications preferences consist of at least one mail formatting preference and at least one sending preference. The system automatically formats a message in accordance with the intended recipient's communications preferences stored in a profile table. In an alternative embodiment, the system provides for a prompting function that can alter the communications preferences in the event that a particular preference must be changed. This prompting function is also useful if recipient does not have a corresponding profile in the profile table.08-13-2009
20090222468METHOD AND SYSTEM FOR USING SEMANTIC INFORMATION TO IMPROVE VIRTUAL MACHINE IMAGE MANAGEMENT - A method for performing software operations on virtual machine images, includes: receiving a first virtual machine image that includes a mapping from a first file name to first file content; reformatting the first virtual machine image by: creating a unique ID for the first file content; and decoupling the mapping of the first virtual machine image by creating an image manifest that maps the first file name to the unique ID, and creating a store that contains the first file content and that maps the unique ID to the first file content; and performing a software operation on the first virtual machine image using the reformatted first virtual machine image.09-03-2009
20090112901Software, Systems and Methods for Modifying XML Data Structures - Methods, systems and software are described for modifying an Extensible Markup Language (XML) file. Initially, an XML file is provided having at least one data node that contains at least one instruction to modify the XML file. This XML file is parsed to identifying the modification instruction(s) and the XML file is modified in accordance with the at least one instruction to generate a modified XML file.04-30-2009
20090112899METHOD AND SYSTEM FOR ADAPTIVE DISK MANAGEMENT - Provided herein are at least one embodiment of systems and methods of adaptive disk management for a recording device employing a memory storage device such as hard disk storage so that memory storage device usage is tracked in the recording device and the memory storage device is controlled based on time-based patterns of user behavior.04-30-2009
20090112902DOCUMENT FIDELITY WITH BINARY XML STORAGE - Techniques are provided for ensuring lexical fidelity when an XML document is stored in a binary format. Operations, on the XML data, that would cause the loss of lexical fidelity between the original XML document and the binary-encoded version of the XML document are not performed. Such operations include the removal of unnecessary whitespace characters, certain data type conversions, CRLF normalization, the “collapsing” of two-tag empty elements into a single tag empty element, and the replacing of entity references or numeric character references with another value. An XML schema, to which the XML document conforms, may indicate that the XML document is to be stored in a lexical fidelity mode. Additionally, or alternatively, the database statement that (when executed) causes the XML document to be stored in a binary format may so indicate.04-30-2009
20090112898Decoding a Hierarchical Multi-Layer Data Package - A hierarchical decoder is operable to decode a hierarchical multi-layer data package. The hierarchical multi-layer data package includes a plurality of layers and one or more subpackages in each layer. To decode the data package, an objective function is created based on parameters for identifying data in the data package most relevant to information of interest. Subpackages in one or more layers are evaluated using the objective function and a subpackage is selected. Information for the selected subpackage, which may include a summary and metadata, is used to determine whether the subpackage satisfies an information need. If the information need is not satisfied, a drill down procedure is performed to evaluate subpackages in a next lower layer of the data package.04-30-2009
20080281846High performant row-level data manipulation using a data layer interface - Performing an operation directly on data stored in a database table provides for avoiding generation and processing of SQL statements. A Data Layer interface, comprising a set of APIs, allows internal database server components to call directly to the Data Layer for making fast row changes to a table. According to an embodiment, before making any row change to a table through this Data Layer interface, a shared state data structure is created to hold the metadata about the table. A single shared state can be used for all DML changes to a particular table regardless of what columns are updated or inserted during each DML operation. When a process needs to change a row, the process uses a mutable state based on the shared state of the table.11-13-2008
20090210439METHOD FOR EFFICIENT DATA TRANSFORMATION - A digraph including a plurality of ordinary nodes, at least one of a composition node and a decomposition node, and a plurality of arcs interconnecting any of said nodes.08-20-2009
20090210436ENCODING A HIERARCHICAL MULTI-LAYER DATA PACKAGE - A hierarchical encoder is operable to create a hierarchical multi-layer data package. The hierarchical multi-layer data package includes a plurality of layers and one or more subpackages in each layer. The layers include one or more subpackages. A subpackage in an outer layer is related to a subpackage in an inner layer. Also, each subpackage includes meta data describing the encoding, a summary of a subset of data in the hierarchical multi-layer data and a link or ID of the subset of data in a compressed form.08-20-2009
20090248726METHOD AND SYSTEM FOR PERFORMING DATA MANIPULATIONS ASSOCIATED WITH BUSINESS PROCESSES AND OPERATIONS - A method and apparatus for accessing, processing and manipulating data in an OLAP database. According to one aspect, the present invention comprises a user interface configured for accessing, processing and manipulating data in an OLAP cube. According to another aspect, the present invention comprises a calculation engine for manipulating and managing data in the OLAP cube.10-01-2009
20090248724Method and Apparatus for Encoding List of Variable Length Structures to Support Bi-Directional Scans - Techniques are disclosed for encoding a variable length structure such that it facilitates forward and reverse scans of a list of such structures as needed. While the techniques are applicable to a wide variety of applications, they are particularly well-suited for use with structures such as those found in compressed database indexes. For example, a computer-implemented method for processing one or more variable length data structures includes the following steps. Each variable length data structure is obtained. Each variable length structure comprises one or more data block. A variable length encoding process is applied to the one or more blocks of each variable length data structure which comprises setting a continuation data value in each block to a first value or a second value, wherein the setting of the continuation data values enables bi-directional scanning of each variable length structure.10-01-2009
20090248725COMPRESSABILITY ESTIMATION OF NON-UNIQUE INDEXES IN A DATABASE MANAGEMENT SYSTEM - A method, information processing system, and computer readable storage product estimate a compression factor. A set of key values within an index are analyzed. Each key value is associated with a record identifier (“RID”) list comprising a set of RIDs. The index is in an uncompressed format and includes a total byte length. A number of RIDs associated with each key value is estimated for each key value in the set of key values. A total byte length for all RID deltas between each at least two consecutive RIDs within a RID list is estimated for each RID list based on the number of RIDs that have been determined. The total byte length estimated for each RID list is accumulated. A compression factor associated with the index is determined by dividing the total byte length that has been accumulated by the byte length of the index.10-01-2009
20090204625ELECTRONIC MANIFEST OF UNDERGROUND FACILITY LOCATE OPERATION - Methods and apparatus for generating a searchable electronic record of a locate operation performed by a locate technician, in which a presence or an absence of at least one underground facility within a dig area is identified. An image of a geographic area comprising the dig area is electronically received, and combined with image-related information so as to generate the searchable electronic record. The image-related information comprises at least a geographic location associated with the dig area, and a timestamp indicative of when the locate operation occurred. The searchable electronic record of the locate operation is electronically transmitted and/or electronically stored so that performance of the location operation is verifiable.08-13-2009
20080320022Federated Management of Content Repositories - A method for integrating a plurality of content repositories into a virtual content repository (VCR), comprising providing credential information to each one of said plurality of content repositories, receiving authorization information from each one of said plurality of content repositories, wherein the authorization information indicates whether or not an authorization procedure succeeded, integrating into the VCR each one of said plurality of content repositories whose authorization information indicates successful authorization, and wherein each one of said plurality of content repositories exposes a first set of services to enable its integration into the VCR.12-25-2008
20090248727TEMPORAL RELATIONAL DATABASE MANAGEMENT SYSTEM - A temporal relational database includes a relational database framework that allows for all the capabilities of a standard relational database with the addition of the concept of time. Transactions, which can be modifications of attribute values or changes to the database schema, can be stored with temporal histories. Through the use of these temporal histories, the temporal database is able to seamlessly respond to queries for times that are in the past, present, or future. Furthermore, transactions can be entered into the temporal relational database that are not effective until some point in the future, thus allowing for seamless migration of the data and schema of a database. Applications that access data in a temporal database may retrieve a time appropriate schema from the temporal database. An exemplary use of a temporal database to manage roles and responsibilities within an organization is described.10-01-2009
20090222469METHOD FOR CREATING GRAPHICAL MATERIALS FOR UNIVERSAL RENDERING FRAMEWORK - Embodiments of the invention provide a renderer-agnostic method for representing materials independently from an underlying rendering engine. Advantageously, materials libraries may be extended with new materials for rendering with an existing rendering engine and implementation. Also, new rendering engines and implementations may be added for existing materials. Thus, at run-time, rather than limiting the rendering to being performed on a pre-determined rendering engine, the rendering application may efficiently and conveniently manage rendering a graphics scene on a plurality of rendering engines or implementations.09-03-2009
20090259676DATA FORMAT CONVERSION METHOD AND EQUIPMENT, AND CONTROLLER MANAGEMENT SYSTEM USING DATA FORMAT CONVERSION EQUIPMENT - The invention contemplates to improve versatility or flexibility of a system for managing a controller. In a data format converter, a computer constitutes reception unit for acquiring input information containing a program, etc, of a first data format and outputted from a programmer unit, direction extract unit for extracting a convert direction of a data format contained in the input information so acquired, data conversion rule acquisition unit for acquiring a conversion rule of a data format corresponding to the convert direction so extracted and convert execution means for converting the program, etc, of the first data format to a second data format. The program, etc, of the second data format converted is outputted to the controller. The program, etc, can be created in this way in an arbitrary data format different from the data format of the controller.10-15-2009
20090259674AGGREGATING INFORMATION SOURCES TO DYNAMICALLY UPDATE A CALENDAR AND TO NOTIFY USERS OF CHANGES - Received information from a set of information sources can be processed. The processing can convert the received information into a standardized form. An effect that the converted information has upon a set of scheduled events of a calendaring application can be determined based upon a set of configurable rules. One or more programmatic action relating to the scheduled events can be taken based upon the determined effect. Programmatic actions can include notifying a user associated with the effected scheduled event and automatically changing an attribute associated with the scheduled event within a database used by the calendaring application.10-15-2009
20090193042SYSTEM AND COMPUTER PROGRAM PRODUCT FOR AUTOMATED DESIGN OF ROW COMPRESSION ON TABLES IN A RELATIONAL DATABASE - A workload specification is obtained for the database. Based on the workload specification, candidate ones of the tables are identified and ranked. Compression impact is evaluated for the candidate ones of the tables. A design for the database is developed, specifying at least one of: (i) which of the tables should be compressed, and (ii) which of the tables should not be compressed.07-30-2009
20090254577METHOD AND SYSTEM FOR GENERATING A MAPPING BETWEEN TYPES OF DATA - A method and system for routing data of an source type to a target type is provided. The system has various routines for converting data in one type into data in another type. In one embodiment, the system receives an indication of a source type and identifies various sequences of routines that can convert the data from the source type to a target type. The system then coordinates the processing of the data by each routines in the sequences to the conversion of the data to the target type. The process of identifying the routines is referred to as “discovery.” The system also provides an aliasing mechanism by which compatible types can be identified. When identifying a sequence of routines, the system may check for routines that support compatible types. When a sequence of routines is identified, the system caches the identity of the sequence to facilitate identifying that sequence when the data of the source type is to be converted to the target type. The system also uses a mechanism for discovering sequences of routines from other computer systems. These other computer systems may broadcast various sequences of routines which are stored at the receiving computer system. A user may use a switchboard mechanism to direct data of a certain source type to one of the broadcasted sequences. This directing of the data to a certain source effects the routing of the data from one computer system to a device or routine on another computer system.10-08-2009
20090254575APPARATUS AND METHOD FOR MANIPULATING NESTED ARCHIVE FILES AND FOLDERS - Methods for packing and unpacking files in a multi-level hierarchy in single actions. The methods operate in memory through using one file pointer for the archive file in recursive calls to the packing and unpacking methods, for accessing files in multiple nested levels. The packing and unpacking are performed in memory, and no temporary files are written to a storage device, thus saving on storage and processing time. A user can also store or retrieve files selectively from an archive file.10-08-2009
20090259675REMOTE DIFFERENTIAL COMPRESSION APPLIED TO STORAGE - Oftentimes, computer files, information packets, and the like share identical data portions that cause duplicate storing. The files and/or packets can be logically divided and checks can be performed to determine if there are shared portions. If shared portions exist, then as opposed to making a duplicate copy of information, a pointer can be produced that identifies where the portion is saved. In addition, pointers can be used in compression of information such that a compressed file can identify an original copy—the original copy can be used to decompress the information.10-15-2009
20080306979EDITING, CREATING, AND VERIFYING REORGANIZATION OF FLOWCHART, AND TRANSFORMING BETWEEN FLOWCHART AND TREE DIAGRAM - Provides methods for transforming a flowchart to an equivalent tree diagram, methods for transforming an equivalent tree diagram to a flowchart, methods for verifying reorganization of a flowchart, methods for editing a flowchart, methods for creating a flowchart and a flowchart editor. A flowchart includes one or more logic structures and one or more processing activities in said one or more logic structures. The method for transforming a flowchart to an equivalent tree diagram comprises: traversing said flowchart; transforming said one or more logic structures in said flowchart to one or more branching nodes in said tree diagram; and transforming one or more processing activities in said logic structures of said flowchart to one or more leaf nodes below corresponding branching nodes in said tree diagram. Further, edition of a flowchart and verification of reorganization of a flowchart are performed by utilizing an equivalent tree diagram.12-11-2008
20080306977SYSTEM, METHOD AND PROGRAM PRODUCT FOR BACKING UP DATA - System, method and program product for backing up a plurality of data files from a first server to a second server via a network. A determination is made that more than one compressed data file at the second server, downloaded by the first server, is waiting to be decompressed. A determination is made whether an amount of available processor resource in the second server exceeds a predetermined threshold. If the amount of available processor resource in the second server exceeds the predetermined threshold, a plurality of data decompression programs are invoked in the second server to decompress the plurality of compressed data files substantially concurrently, and data updates in the decompressed data files are applied to corresponding files in the second server.12-11-2008
20080306978INDEX AGING AND MERGING - Systems and methods for processing an index are described. An index may be merged with another index of comparable age and size into a single index. Since older indexes are less likely to need updating, they are “set aside” to age based on certain adaptive criteria such as the age and size of the index, percentage of deletions, and how long it takes to update the index. An index that has been set aside may be compacted into a format that is optimized for fast searching.12-11-2008
20080306975Method for Copying and Manipulating Data - A method of compiling a series of output data elements to form an output data stream, said output data elements being derived from an input data source, said input data source comprising one or more input data elements, said method being performed by a processor and comprising the steps of: displaying, in a first region of a visual display, a representation of one or more input data elements; receiving input from a user selecting an input data element for inclusion in said series of output data elements; processing the selected input data element to form one or more output data elements; and adding said one or more output data elements to an output data stream.12-11-2008
20090094264Method, Apparatus and Computer Program Product for Providing Improved Data Compression - An apparatus for providing improved data compression may include an encoder comprising a quantizer for encoding input data and a side model. The quantizer may be trained with respect to high priority data among the input data and may be configured to partially encode the input data by encoding the high priority data. The side model may be trained jointly with the training of the quantizer and is configured to model low priority data among the input data.04-09-2009
20080215606FOCAL POINT COMPRESSION METHOD AND APPARATUS - A method for compressing and decompressing files is provided. The method includes creating a list of shift-invariant focal points of neighborhoods in the stream and comparing those focal points to a list of focal points created using the same method on the reference stream. The method of the present invention searches for the longest sequence of focal points that appear in both files. The method of the present invention also verifies that neighborhoods contain the same focal points. The changed data and references to the reference stream are then encoded. The decompression process decodes the encoded stream of data, and using the reference stream recreates the new version of stream.09-04-2008
20080215604Processing Pedigree Data - A device, namely, one of a Field Programmable Gate Array (FPGA) device and an Application Specific Integrated Circuit (ASIC) is described. The FPGA or ASIC is configured to represent one or more pedigree data structures, each structure comprising at least two generations. The device comprises a plurality of logic cells arranged such that one or more of the logic cells model a module of the pedigree data structure, where each module of the pedigree data structure is representative of an individual in a pedigree, input circuitry to receive pedigree data and output circuitry to output processed data; and electrical connections between the logic cells and the input and output circuitry. The arrangement of the logic cells and electrical connections enable parallel processing on a loaded pedigree data structure such that the transmission of pedigree data through at least a subset of the, or each, pedigree data structure occurs in each sampling cycle. A method and data structure are further disclosed.09-04-2008
20090063529METHOD AND STRUCTURE FOR FAST IN-PLACE TRANSFORMATION OF STANDARD FULL AND PACKED MATRIX DATA FORMATS - A computerized method provides for an in-place transformation of matrix A data including a New Data Structure (NDS) format and a transformation T having a compact representation. The NDS represents data of the matrix A in a format other than a row major format or a column major format, such that the data for the matrix A is stored as contiguous sub matrices of size MB by NB in an order predetermined to provide the data for a matrix processing. The transformation T is applied to the MB by NB blocks, using an in-place transformation processing, thereby replacing data of the block A03-05-2009
20090077109HIGH-SPEED DATA COMPRESSION BASED ON SET ASSOCIATIVE CACHE MAPPING TECHNIQUES - A method is provided for compressing data from a stream of values using one or many distinct memory addresses as workspace, each memory address containing one or many values. The method works by reading two contiguous data values, of length K and N bits, from the stream, as a memory address reference (MAR) and a symbol, respectively. If the symbol does not match any of the values in the memory address pointed to by MAR, the symbol replaces one of those values, and a MISS code, followed by the symbol, is appended to the compressed stream; otherwise, a HIT code is appended to the compressed stream, said code representing a function of the location where the matched value was found in the memory address. Advantageously, the workspace behaves analogous to a cache memory used in computer architecture, allowing hardware or software parallel implementations using content addressable memory or associative arrays.03-19-2009
20090077108METHOD AND APPARATUS FOR IMPROVING MEMORY COALESCING IN A VIRTUALIZED HARDWARE ENVIRONMENT - The illustrative embodiments described herein provide a computer implemented method, apparatus, and computer program product for managing memory in a shared environment. Upon receiving a file open event associated with a file, a tag value is generated based on the attributes of the file. Upon receiving a file read or write event associated with the file, a memory object is created to hold data associated with the file. The tag value is associated with the memory object. The tag value and the associated memory object are provided to a virtual hosting platform layer as hints to the underlying page coalescing mechanisms.03-19-2009
20080208882Method of Assisting Users In Detection and Correction of Errors In Complex Databases - A method and system for conflict detection during construction of complex databases, such as a data model for driving or modeling a complex system. Components of a data model may be defined in rules that specify objects of various types and containing various elements. The rules are declarative, and may be stored on a computer-readable storage medium. Rule declarations or assertions include element definitions, values or ranges of values, inclusion requirements, and severity level conditions in the event that conflicts or errors are detected. Conflict checking takes account of compliance with type definitions, as well as a user identity and a phase of construction of the data model.08-28-2008
20090043795Side Effects Prediction Using Co-associating Bioattributes - A bioinformatics method, software, database and system for predicting side effects resulting from predisposition modification are presented in which a set of attributes is used to modify an individual's attribute profile to generate a modified attribute profile. The modified attribute profile is compared against a predetermined set of attribute combinations that are statistically associated with one or more candidate side effect attributes. Attribute combinations from the set that also occur in the modified attribute profile are identified, and those candidate side effect attributes that are statistically associated with the identified attribute combinations are stored as a set of predicted side effect attributes resulting from modification of the individual's attribute profile.02-12-2009
20080294667METHOD OF COMMUNICATION FOR DATA TRANSFER TO AN ELECTRONIC MICRODEVICE - In a method of communication for the transfer of data for an electronic microdevice (11-27-2008
20090271427METHOD FOR DEFRAGMENTING INDEXES IN A RELATIONAL DATABASE AND SYSTEM FOR PERFORMING THE METHOD - A method and a system defragment indexes in a relational database. The relational database contains a set of tables, in which each table contains a set of indexes, in which, for each index, a fragmentation parameter is associated indicating the fragmentation level of the index. The method includes the following steps: getting a list of the set of tables; for each table of the list, getting the fragmentation parameter associated to each index of the table; and depending on the value of the fragmentation parameter, defragmenting the associated index.10-29-2009
20090287727SYSTEM AND METHOD FOR THE LOSS-FREE PROCESSING OF PROCESS VALUES OF A TECHNICAL INSTALLATION OR A TECHNICAL PROCESS - The disclosure relates to a method and a system for the loss-free processing of process values which can be integrated into a process control system of a technical installation or of a technical process. The method and system can include process values acquired as raw data by means of an acquisition unit. A physical unit and a measuring range are associated with the respective process value and the acquired raw data are used to generate archivable data. The archivable data in the predetermined tolerance range can be selected by an archive function and are stored in a history server in a raw data format.11-19-2009
20090254576SYSTEM AND METHOD FOR COLLECTING DATA FROM AN ELECTRONIC DOCUMENT AND STORING THE DATA IN A DYNAMICALLY ORGANIZED DATA STRUCTURE - A method for automatically and dynamically collecting new data entered into an electronic document includes the step of providing a database having initial data and an initial data structure. The new data is retrieved as the new data is entered into the electronic document. The new data includes a data value and one or more data descriptors corresponding to the data value. One of the one or more data descriptors is assigned as a data item. The data item defines a variable the value of which varies based on the data value. One or more dimensions of the data value are determined based on at least one of the one or more data descriptors. The initial data structure is reorganized into a modified data structure based on the at least one or more dimensions and the data item, so that the new data may be stored in the modified data structure in a manner that allows the initial data and the new data to be later retrieved from the modified data structure. The new data is stored in the modified data structure.10-08-2009
20090276452Super-object in administering system - Method and system maintaining “super-objects” in a central administering system, where each super-object is associated with corresponding objects in target systems so that editing of that super-object or of one of its associated objects results in conforming edits for all of the associated objects.11-05-2009
20090327320CLUSTERING AGGREGATOR FOR RSS FEEDS - A method for merging really simple syndication (RSS) feeds. Stories containing one or more terms may be merged into one or more clusters based on one or more links between the stories. A cluster frequency with which the terms occur in each cluster may be determined. A diameter for each cluster may be determined. A cluster that is most similar to one of the clusters may be determined based on the cluster frequency. The most similar cluster with the one of the clusters may be determined based on each diameter, and each cluster frequency.12-31-2009
20080275898LIST UPDATE EMPLOYING NEUTRAL SORT KEYS - A program product for updating a list. A first list associated with a first platform includes a first plurality and a second plurality of keys. A second list associated with a second platform includes a third plurality of keys. The first and second platforms sort a first subset of characters differently. The second plurality and third plurality of keys are formed from a second subset of n characters sorted identically on the first and second platforms. An initial key in the first plurality of keys is converted to a neutral key to be included in the second plurality of keys by converting a character in the initial key to a number represented in a number system having a base b where n≧b. After the first list is updated, the lists are sorted and compared, and the second list is updated.11-06-2008
20090240721METHOD AND SYSTEM FOR ELECTRONICALLY SCHEDULING PLAYBACK OF MEDIA CONTENTS - Methods of electronic scheduling for playback of media contents. Discrete items of content are scheduled for play back based upon a schedule created by the integration of five standard scheduling methods into a single scheduling algorithm. In the first scheduling method, a discrete item of content is assigned a frequency rating relative to other items of content. A second way to schedule is repeating a content item at specific intervals of time. A third scheduling method allows the content to be played at a specific date and time. The fourth scheduling method includes playing a content item upon receipt of a trigger event which is received from a source external to the scheduling system. And lastly, means are provided for selectively determining whether or not particular content is available for play in a particular venue or during a particular period of time.09-24-2009
20090187586SELECTING VARIOUS ALGORITHMS TO COMPRESS COLUMNS OF ANALYTIC DATA IN A READ-ONLY RELATIONAL DATABASE IN A MANNER THAT ALLOWS DECOMPRESSION OF THE COMPRESSED DATA USING MINIMAL SYSTEM RESOURCES - A method, computer program product and system for balancing compression efficiency against access performance. Source data is read from a database row by row and column by column within each row. Algorithm(s) are selected to compress the data read for each column. Algorithms are selected in a manner that closely maximizes the amount of data stored in a given amount of disk space but requires minimal system resources to decompress the compressed data. These algorithms are stored in a control block. Further, parameters that allow the read data to be stored in a compressed manner efficiently are stored in the control block. Upon a second reading of the source data, data is compressed column by column using the appropriate algorithms and parameters. The compressed data may then be decompressed using the appropriate algorithms and parameters. In this manner, a better balance may be realized between compression efficiency and access performance.07-23-2009
20090319549INDEX COMPRESSION - Compressing and decompressing compressed index lists. One or more index lists include at least a portion of the list that is compressed. A method includes reading an entry from a list. The method further includes determining that the entry indicates the start of a compressed block of the list. The compressed block is compressed using a compression algorithm including a plurality of delta pointers. Each of the delta pointers point to data store entries by reference to a difference from a reference in a previous entry in the list. An entry size indicator is referenced. The entry size indicator is configured to indicate a memory storage size for a delta pointer, and the entry size indicator supports indications for all of fixed storage sizes, variable storage sizes, and run length encoding. The compressed block of the list is decompressed according to the entry size indicator.12-24-2009
20090319552SOFTWARE MERGING UTILITY - A method and system merging a file across multiple versions of the file is provided. A file check-in request is identified. A merge candidate associated with the file is automatically identified. A view associated with the identified merge candidate is automatically identified. The file is merged with the merge candidate in the view, resulting in a merge result.12-24-2009
20090319551Occurrence data detection and storage for generalized sensor networks - Methods, devices, and systems that store occurrence-data gathered by a distributed sensor network. In an approach, an exemplary method includes receiving a target-occurrence selection, storing a parameter sensed by a sensor of the network in a sensor data set, and searching the sensor data set for data correlating to the target-occurrence. Data correlating to the target-occurrence is stored, and the sensed parameter is deleted from the data set. In another approach, an exemplary system includes a data storage device, a computing device operable to communication with the distributed sensors, and instructions implementing the above method.12-24-2009
20090319550FAST BULK LOADING AND INCREMENTAL LOADING OF DATA INTO A DATABASE - Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.12-24-2009
20090319548AGGREGATION OF DATA STORED IN MULTIPLE DATA STORES - A data aggregation system is described herein for accessing and viewing information about an entity stored in multiple data stores. The data aggregation system identifies an entry in a primary data store that contains information about an entity. The system receives a request to associate an entry in a secondary data store with the identified entry in the primary data store. Then, the system identifies information in the secondary data store that identifies the entry in the secondary data store and associates the identified information with the entry in the primary data store. When a user requests to view the entry in the primary data store, the system retrieves the information about the entry in the primary data store and uses the stored entry identifier to also retrieve the information about the entry from the secondary data store. Thus, the information remains in the data store in which it originated, but the data aggregation system provides a unified view.12-24-2009
20090319546TECHNIQUES TO EXTRACT AND FLATTEN HIERARCHIES - Techniques for extracting hierarchical data stored in multiple records, flattening the hierarchical data, and storing the flattened data in a data warehouse. The data source may be an online transaction processing (OLTP) system that is designed to perform transaction processing and that stores hierarchy data in the form of multiple parent-child relationship records. The hierarchy data extracted from the data source is flattened and stored in a flattened form in a target system such as a data warehouse. A database function such as the SYS_CONNECT_BY_PATH may be used as part of the flattening process.12-24-2009
20090307246System and Method for a Genetic Integration of a Database into a High Availability Cluster - An interface unit adapted for connecting at least one database to at least one of a plurality of high availability cluster servers (HA cluster servers), wherein each database is adapted to execute a set of database-specific commands and wherein each HA cluster server is adapted to output a set of HA cluster server-specific commands. The interface unit may comprise a first interface layer adapted for receiving each of the set of HA cluster server-specific commands outputted by the HA cluster servers; and a second interface layer adapted for sending each of the set of database-specific commands to the respective databases. The interface unit may be further adapted to map each of the HA cluster server-specific commands to at least one of the database-specific commands.12-10-2009
20090112896Method And Related Device For Hardware-Oriented Conversion Between Arithmetic And Boolean Random Masking - A method for secure conversion between two different random markings used for cryptographic functions, converts a first binary data word, masked by a binary mask word according to a first masking process, into a corresponding second binary data word, masked by said binary mask word according to a second masking process, the first and second binary data words and the binary mask word including corresponding pluralities of bits, wherein each of the pluralities of the bits includes a least significant bit, a first bit, and at least one i-th bit i≧2.04-30-2009
20090012982SYSTEM AND METHOD FOR ENABLING PARALLEL ACCESS TO SERIALLY COMPRESSED FILES - The present invention is directed towards systems and methods for generating a compressed data file providing access to one or more selected portions of data contained within the data file. The file is partitioned into one or more chunks, a given chunk comprising a separate unit of data representing a subset of data from the file. The one or more chunks are compressed through use of a compression algorithm, and the one or more chunks are combined to form a compressed file. Metadata is also generated that indicates a chunk offset of a given chunk, thereby allowing direct parallel access to one or more given chunks. Similarly, legacy applications may ignore the chunk structure in the compressed file and access the file according to techniques know in the art, thereby preserving backwards compatibility with such legacy applications.01-08-2009
20080288522CREATING AND STORING A DATA FIELD ALTERATION DATUM USING AN ANALYTIC PLATFORM - A method for reading the altered data field in accordance with the field alteration data is provided. The method may include altering a data field characteristic of a data field in a data table, saving the field alteration datum associated with the alteration in a data storage facility, submitting a query requiring the use of the data field in the dataset and reading the altered data field in accordance with the field alteration data. The alteration may generate a field alteration datum and a component of the query may consist of reading the field alteration data.11-20-2008
20090112897DATA SEQUENCE COMPRESSION - In a method of compressing a data sequence, the data sequence is parsed into data segments, where at least one of the data segments includes a match. In addition, the match is compressed using at least one context model that depends upon one or more coded data symbols that are available to a decoder. An encoder includes a coding unit configured to code at least one of a match offset and a match length of a data segment using one or more context models that depend on previously decodeable data symbols. A computer readable storage medium having a computer program for implementing the method of compressing the data sequence.04-30-2009
20090106285METHOD, APPARATUS AND COMPUTER PROGRAM FOR MIGRATING RECORDS IN A DATABASE FROM A SOURCE DATABASE SCHEMA TO A TARGET DATABASE SCHEMA - There is disclosed a method, apparatus and computer program for migrating records in a database from a source database schema to a target database schema. A request is received to delete a state from the source schema. The state is marked as the redundant state. A resultant state is identified to which to migrate database records in the redundant state and a valid migration path is calculated between the redundant state and the resultant state.04-23-2009
20090106281ON-LINE TRANSACTION PROCESSING (OLTP) COMPRESSION AND RE-COMPRESSION OF DATABASE DATA - 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.04-23-2009
20090106288METHOD AND SYSTEM FOR SUPPORTING MEDIA DATA OF VARIOUS CODING FORMATS - A method for supporting media data of various coding formats includes converting the received media files of different coding formats into media files of a particular file format where the media files of a particular file format include media data information and index information, determining the corresponding media file according to an operational command from a client, and sending the media data information in the corresponding media file to the client according to the index information in the corresponding media file. The present disclosure may solve a problem in the conventional art that media files of different coding formats have to be stored on different streaming servers which increases the cost of the system and the integration difficulty of the system and cannot realize load balance among the different streaming servers.04-23-2009
20090106287WEB SERVICE INTERFACE FOR ORDER MANAGEMENT SYSTEM - Various techniques for providing a Web Service interface to an order management system are disclosed. In one embodiment, a Web Service interface receives a hierarchical property set, which includes properties being input to an order management system. The Web Service interface accesses mapping information, which associates a variable in a flat property set with a hierarchical property set path. The Web Service interface uses the mapping information to convert the hierarchical property set to the flat property set, based upon the mapping information, and then causes the order management system to process the flat property set. The Web Service interface can also use the same mapping information to convert a flat property set generated by the order management system into a hierarchical property set.04-23-2009
20090106286Method of Hybrid Searching for Extensible Markup Language (XML) Documents - A method of generating a searchable database system for storing and querying Extensible Markup Language (XML) documents is disclosed. A Document Type Description (DTD) associated with one or more XML documents is analyzed to determine a scope of XML documents defined by the DTD. A first set of elements associated with the DTD is identified. The first set of elements is mapped to a relational database. A second set of elements associated with the DTD to be stored in an XML database is identified. A collection of classes is created such that each class defines an object schema. The classes are mapped to a set of corresponding tables, and foreign and primary keys associated with the corresponding tables are identified.04-23-2009
20090106284IMAGE FORMING APPARATUS AND JOB INFORMATION MANAGEMENT METHOD - Disclosed an image forming apparatus including: a first storage section to store job information of a completely executed job; a nonvolatile second storage section to store the job information, the second storage section being larger in capacity than the first storage section; and a control section to compress the job information to store the compressed job information into the second storage section, and to manage the job information.04-23-2009
20090106283Text editing apparatus, recording medium - This disclosure discloses a text editing apparatus comprising a display device; an operation device; a conversion candidate creating portion that creates at least one conversion candidate associated with a character and outputs a signal for displaying the created conversion candidate; a finally-determined character string output portion that outputs a signal for displaying the corresponding conversion candidate; and a learning portion that learns and storing character string data for the next creation of said conversion candidate at the time of an input of a learning instruction different from the time of the input of said selective final determination.04-23-2009
20090070358APPARATUS, METHOD, AND COMPUTER PROGRAM PRODUCT FOR PROCESSING INFORMATION - An information processing apparatus includes a plurality of information reforming modules that reform input information input from each information device to common format information, which is a format common to the respective information devices, and a status-information storage unit that stores status information indicating a status for each of predetermined items of the reformed common format information, for each of the information reforming modules. The apparatus specifies the information reforming module that satisfies a use request condition, from one or a combination of a plurality of pieces of status information stored in the status-information storage unit, acquires the common format information reformed by the specified information reforming module, processes the acquired common format information to use information matched with the use request condition, and outputs the processed use information.03-12-2009
20090070357DATA COMPRESSION APPARATUS AND METHOD - A data compression apparatus and method for improving data compression efficiency are provided. A data compression apparatus of the present invention includes a searcher for calculating costs, by searching domain blocks arranged in forward direction in a search range, between a range block and the domain blocks and for generating distance and difference information, by searching the costs in backward direction, between the range block and the domain block that incurs the lowest cost and a coder for encoding the distance and difference information into compressed data of the range block.03-12-2009
20090070356Method and apparatus for managing data compression and integrity in a computer storage system - A storage system stores discrete data units and corresponding metadata. The storage system receives data for storage, calculates a first hash value for the data, and identifies a set of compression conditions that correspond to a client ID associated with the data. When the compression conditions indicate that the data should be compressed, the data is compressed to create compressed data. Following compression of the data, the storage system calculates a second hash value for the compressed data, and stores the second hash value in the metadata, while also retaining the first hash value in the metadata. The storage system stores the compressed data, and deletes the uncompressed version of the data. An integrity check of the data stored in the storage system can be carried out periodically using the first or second hash values contained in metadata for each discrete data unit.03-12-2009
20090037452System and Method for Synchronizing Applications - Changes made to a first data set in a plurality of data sets are detected, and at least a first subset of the changes is synchronized to a data framework that facilitates data synchronization between the plurality of data sets.02-05-2009
20090037449User configurable quick groups - This invention is directed to defining quick groups for easily associating keywords with an object (e.g., a media objection) accessible using an electronic device. The user of an electronic device may define several keywords that identify attributes of an object accessible using the electronic device. The user may associate keywords with an object to link the attribute of the keyword with the object (e.g., associate a keyword entitled “vacation” to vacation pictures). The user may assign a shortcut key to each of a subset of the keywords, referred to as quick groups, by which the user may rapidly associate the keyword to an object. In some embodiments, the electronic device may select the shortcut key of a quick group from the letters of the quick group to help the user remember the shortcut key.02-05-2009
20090037447Mail Compression Scheme with Individual Message Decompressability - Embodiments of the present inversion relate to a two-pass compression scheme that achieves compression performance on par with existing methods while admitting individual message decompression. These methods provide both storage savings and lower end-user latency. They preserve the advantages of standard text compression in exploiting short-range similarities in data, while introducing a second step to take advantage of long-range similarities often present in certain types of structured data, e.g. email archival files.02-05-2009
20090144304Method for summarizing flow information of network devices - A method for organizing network flow information within a relational database relates to minimizing contention for the network flow information. In particular, data is generally aggregated at certain time intervals and separately organized. In this way, contention is decreased as analysis can occur on the separated existing flow records, which are optionally aggregated, while new raw flow records are stored. In another embodiment, the aggregated data can be re-aggregated at second, larger time intervals.06-04-2009
20090157718System and Method for Editing Cartographic Data - Systems, methods, and computer program products for editing and displaying cartographic data are described. Cartographic source data is retrieved from a first record set and at least one feature of the source data is displayed in a display device. Based on a user's selection of a feature in the display device, source data corresponding to the selected feature is selected. Based on the user's modification of the selected feature in the display device, cartographic edit data, representing the user's modification of the feature, is created. The cartographic edit data is associated with the cartographic source data for the feature and the associated cartographic edit data is stored within a second record set. The source data and edited data may also be displayed by retrieving the cartographic source data for a feature from the first record set and retrieving the cartographic edit data associated with the source data from the second record set. The source data for the feature is merged with the associated cartographic edit data for the feature to create an output record set for display on the display device.06-18-2009
20100023542CONVERTING PHYSICAL ASPECTS OF COMMON WAREHOUSE MODEL TO ELEMENTS OF RELATIONAL DATABASE - A method and a system for converting physical aspects of a common warehouse model (CWM) to corresponding database management system (DBMS) items in a relational database by processing in a hierarchical manner the physical aspects and creating the corresponding DBMS items. The physical aspects comprise relational catalogs. The relational catalogs comprise relational schemas. The corresponding DBMS items comprise DBMS catalogs. The DBMS catalogs comprise DBMS schemas.01-28-2010
20090313276Process and device for data conversion, and computer-readable recording medium storing data conversion program - In a data conversion device for converting data for use in a first-stage service provision unit and a second-stage service provision unit which performs processing in response to a request from the first-stage service provision unit, first converted data is generated by converting one or more special characters included in the input data into one or more neutral characters on basis of neutral-character conversion information stored in a neutral-character conversion storage, and outputted to the first-stage service provision unit; and all or part of one or more neutral characters included in processed data generated by the first-stage service provision unit are each converted into a string of one or more safe characters on the basis of safe-character conversion information stored in a safe-character conversion storage, and outputted to the second-stage service provision unit.12-17-2009
20090089308MAPPING ONLINE CONTACT INFORMATION INTO A CONTACTS LIST - A presence management system may communicate contact information with mapped values. Contact information may be stored in a hierarchical, extensible structure (“hierarchical extensible contact structure”). Devices in a presence management system utilize a mapping scheme to map contact values (e.g., e-mail address, phone number, etc.) to the appropriate field of the hierarchical extensible contact structure. When devices in the presence management system communicate information for thousands of contacts, employing mapped values to navigate the hierarchical extensible contact structure reduces the size of the messages, thus reducing resource consumption (e.g., bandwidth), particularly on the scale of an enterprise.04-02-2009
20090100083METHOD AND APPARATUS FOR ENCODING MEDIA CONTENT AND METADATA THEREOF - Provided is a method of encoding media content and metadata. The method includes generating a scale indicator, which indicates a unit size of information about the media content, in the metadata, and determining data areas in the metadata that have different values based on the generated scale indicator. Accordingly, a range that can be expressed by the data area, that has a limited space in the metadata, can be increased.04-16-2009
20090100082REPLICATION AND MAPPING MECHANISM FOR RECREATING MEMORY DURATIONS - Techniques for migrating duration trees from a source database server (or instance) to a destination database server (or instance) are provided. A duration is a memory management construct that allows database components to group related areas of memory together. A source duration tree is captured at the source database server and combined with a destination duration tree at the destination database server. Any duration identifiers in the source duration tree that conflict with (i.e., are the same as) a duration identifier in the destination duration tree are mapped to new duration identifiers.04-16-2009
20100036862Representing and manipulating RDF data in a relational database management system - Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.02-11-2010
20090307248Method and Apparatus for Representing Multidimensional Data - The present invention relates to methods for representing multidimensional data. The methods of the present invention are well suited but not limited to the representation of multidimensional data in such a way as to enable the comparison and differentiation of data sets. For example, the invention may be applied to the representation of flow cytometric data. The invention further relates to a program storage device having instructions for controlling a computer system to perform the methods, and to a program storage device containing data structures used in the practice of the methods.12-10-2009
20090327325META MODELING IN DECISION SUPPORT SYSTEM - A method, system, and computer program product for providing troubleshooting data for reported fault conditions on equipment is provided. An engineering model is configured for the equipment. The engineering model includes at least one failure scenario and an associated symptom. The engineering model is stored in an equipment model database. A meta model representative of at least one relationship between the engineering model and a reported fault condition for the equipment is instantiated. A user input for the reported fault condition is stored in a decision support system (DSS) database. The DSS database forms a wrapper over the equipment model database based on the user input. The meta model is further instantiated using user input data from the DSS database. An optimal troubleshooting procedure for the equipment is determined based on the meta model as instantiated.12-31-2009
20090043793Parallel Uncompression of a Partially Compressed Database Table - A multiprocessing uncompression mechanism takes advantage of existing multiprocessing capability within a database to perform dynamic uncompression of portions of a partially compressed database table that satisfy a query using processes that may be executed in parallel. Historical information is gathered for each query. Uncompression advice includes user-specified parameters that determine how the multiprocessing uncompression mechanism functions. The multiprocessing uncompression mechanism processes the historical information and uncompression advice to determine an appropriate task count for performing uncompression in parallel processes. The existing multiprocessing capability within the database then processes the tasks that perform the uncompression in parallel.02-12-2009
20090313277SYSTEM AND METHOD FOR 3-D MAP COMPRESSION AND INTERSECTION DETERMINATION - A system and method is presented that provides for efficiently representing coordinate date of objects such as for buildings, excavations, pipelines, sewers, underground objects and the like. Also provided is a process for compressing representation of a coordinate system, for example, GPS coordinates, to minimize data requirements and to significantly increase overall efficiencies to determine if an existing object might overlap or intersect with a proposed new object. For example, the system and method of the invention may be suitable for use by utilities that have underground plant that requires awareness whether or not a proposed new construction might overlap with the plant.12-17-2009
20090313275COMPRESS TRANSACTION DATA USING SERIAL MICRO-TRENDS - Compressing transaction data is provided. A current transaction data point is received. A determination is made as to whether the current transaction data point is a first transaction data point or a subsequent transaction data point of a set of transaction data points for a current variable length aggregation record. A further determination is made as to whether the subsequent transaction data point is within a predetermined tolerance of a predicted transaction data point in response to the current transaction data point being the subsequent transaction data point. The subsequent transaction data point is compressed into the current variable length aggregation record in response to the subsequent transaction data point falling within the predetermined tolerance of the predicted transaction data point.12-17-2009
20100036863METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - A method and system for compressing a raw logical data object (02-11-2010
20100036861Method and System for Implementing Parallel Transformations of Records - An improved approach is described for implementing transformations of data records in high concurrency environments. Each transformation is performed in parallel at the source when the data record is first generated. According to one approach for data integrity validation, record generators compute an integrity checksum for a newly generated record before copying into a data unit in shared memory. Subsequent generators may aggregate integrity checksums for data records into checksums for data units incrementally. This approach achieves end-to-end protection of data records against corruption using an efficient method of maintaining verifiable data integrity. In another approach, compression and encryption data transformations may be performed by themselves, or in combination with an integrity checksum transformation.02-11-2010
20100057762System and Method of Ontological Subject Mapping for Knowledge Processing Applications - The present invention discloses methods, systems, and tools for knowledge processing by building maps of ontological subjects for compositions or the contents accompanying a request for service by a user. In one embodiment of the invention the method assigns and calculates an ontological subject power spectrum to each composition or ontological subject. The resulting power spectrum and the adjacency matrix of the map are used to evaluate the merits of the compositions in the context of reference universes. It is also used as a research guiding tool for knowledge discovery. The invention serves knowledge seekers, knowledge creators, inventors, discoverer, as well as general public by assisting and guiding users to assess their work, identify their unknowns, optimize their research trajectory, and provide higher quality contents. The method and system, thereby, is instrumental in increasing the speed and efficiency of knowledge acquisition, discovery, retrieval, as well as faster learning and problem solving.03-04-2010
20090216789MANAGEMENT OF TIME-VARIANT DATA SCHEMAS IN DATA WAREHOUSES - A system, method, and computer readable medium for preserving information in time variant data schemas are disclosed. The method includes determining if at least one modification request associated with a database schema has been received. In response to the modification request being received, a metadata table associated with the database schema is updated to include at least one entry associated with the modification request. The entry identifies an instance in time when an action associated with the modification request was performed.08-27-2009
20090216788MULTIPLE FILE COMPACTION FOR NETWORK ATTACHED STORAGE - Mechanisms are provided for optimizing multiple files in an efficient format that allows maintenance of the original namespace. Multiple files and associated metadata are written to a suitcase file. The suitcase file includes index information for accessing compressed data associated with compacted files. A hardlink to the suitcase file includes an index number used to access the appropriate index information. A simulated link to a particular file maintains the name of the particular file prior to compaction.08-27-2009
20090216787INDEXING LARGE-SCALE GPS TRACKS - Described is a technology by which uploaded GPS data is indexed according to spatio-temporal relationships to facilitate efficient insertion and retrieval. The indexes may be converted to significantly smaller-sized data structures when new updates to that structure are not likely. GPS data is processed into a track of spatially-partitioned segments such that each segment has a cell. Each cell has an associated temporal index (a compressed start-end tree), into which data for that cell's segments are inserted. The temporal index may include an end time index that relates each segment's end time to a matching start time index. Given query input comprising a spatial predicate and a temporal predicate, tracks may be searched for by determining which spatial candidate cells may contain matching results. For each candidate cell, the search accesses the cell's associated temporal index to find any track or tracks that correspond to the temporal predicate.08-27-2009
20100005114Efficient Delta Handling In Star and Snowflake Schemes - In one aspect there is provided a method for handling deltas being posted to a repository, database, or other Business Information Warehouse (BW). The method includes receiving, at a delta handler, absolute data without an indication of a change between the received absolute data and data posted to a repository including a fact table. Identifiers are created for the received absolute data. The absolute data including the created identifier is written into a temporary table. One or more deltas are determined by performing a join of the temporary table and the fact table of the repository. The deltas correspond to the indication of the change between the received absolute data and the data posted to the repository. The delta handler provides the one or more deltas to be posted to the fact table of the repository. Related systems, apparatus, methods, and/or articles are also described.01-07-2010
20100005113FUNCTION IN A RELATIONAL DATABASE - A method of retrieval and presentation of data in denormalized format may include accessing a relational database of CHARACTER or VARCHAR data types in normal form, applying a database command SUMTEXT(column name, delimiter string) to the relational database, retrieving related sets of text strings from the relational database, truncating leading blanks and trailing blanks in each string, limiting the length of each string to a predetermined value, appending related strings using a delimiter string specified, and presenting denormalized data strings.01-07-2010
20100005112HTML FILE CONVERSION - A computer-implemented method for converting a hypertext markup language (HTML) file to a new file format may include cleaning a source hypertext markup language (HTML) file to produce a modified HTML file, parsing the modified HTML file using one or more rules to mark content within the modified HTML file, and exporting the marked content from the modified HTML file into a template for a new file format.01-07-2010
20090287726METHOD AND SYSTEM FOR SYNCHRONIZATION OF DATABASES - The invention relates to a method for synchronization of source data sets of a source database stored on a source system with representative target data sets in a target database database database stored on a target system, the source data sets being of a first type and the target data sets being of a second type. The source data sets are compared with the previous source data sets to obtain difference source data sets of the first type. The difference source data sets are transformed into transformed data sets of the second type and supplied to the target system to enable updating of the representative target data sets. Preferably, the transformation is performed via data sets of a third type, which allows to implement external business generation. To add fully transparent a new source of target database to a business information system using the method only the conversion from data type of the new source database to data sets of third type and/or conversion from data sets of third type to data type of target database has to be developed.11-19-2009
20090248723Method and Apparatus for Selecting an Optimal Delete-Safe Compression Method on List of Delta Encoded Integers - Techniques are disclosed for selecting a delete-safe compression method for a plurality of delta encoded data values (e.g., delta encoded integers or deltas). For example, a computer-implemented method for selecting an optimal delete-safe compression algorithm from among two or more compression algorithms for use on a plurality of delta encoded data values includes the following steps. The maximum number of data values eliminated by each of the two or more compression algorithms is computed. For the plurality of delta encoded data values to be compressed, the minimum size of the plurality of delta encoded data values before compression thereof is computed. A delete-safe threshold value is computed based on the minimum size of the plurality of delta encoded data values. Then, the compression algorithm is selected from the two or more compression algorithms that achieves the delete-safe threshold value.10-01-2009
20090248722CLUSTERING ANALYTIC FUNCTIONS - A method, system, and computer usable program product for clustering analytic functions are provided in the illustrative embodiments. Information about a set of analytic function instances is received. Information about a set of time series is received. A subset of time series may be a set of input time series to an analytic function instance in the set of analytic function instances. An analytics clustering rule is applied to the information about the set of analytic function instances and the information about the set of time series. A subset of time series is clustered as a group in response to applying the analytics clustering rule. An analytics clustering rule may determine whether all time series in the set of input time series to an analytic function instance are members of a group, and group an output time series of the analytic function instance in the group if all time series in the set of input time series are members of the group.10-01-2009
20090240720Method and system for dynamically controlling functionality of an application program and storage medium for storing instructions which effectuate the method - A method and system for dynamically controlling functionality of an application program and storage medium for storing instructions which effectuate the method are provided The method includes providing a data structure containing modifiable data which indicates current functionality of the application program. The method also includes providing a set of common instructions and first and second sets of optional instructions. The application program has a first functionality when the application program includes the set of common instructions and the first set of optional instructions. The application program has a second functionality different from the first functionality when the application program includes the set of common instructions and the second set of optional instructions. The method further includes modifying the modifiable data if a desired functionality for the application program is different from the current functionality of the application program. The method still further includes causing the application program to include either the first or second set of optional instructions based on the modifiable data to obtain the desired functionality.09-24-2009
20090240719ACCUMULATING STAR KNOWLEDGE IN REPLICATED DATA PROTOCOL - A distributed system includes full and partial replicas of a set of data items that may be inserted, modified, or deleted by any replica. Replicas may occasionally synchronize with other arbitrarily chosen replicas to learn about updates. A replica's knowledge includes of one or more knowledge fragments, where each fragment indicates a set of items. A type of knowledge fragment, called a star knowledge fragment, contains versions associated with all items in the system. Star knowledge fragments are compact because the set of items stored at a replica need not be explicitly listed. Once all replicas know of all updates in the system, partial and full replicas will have the same compact star knowledge fragment.09-24-2009
20090240718DEFLATE FILE DATA OPTIMIZATION - Mechanisms are provided for optimizing file data compressed using deflate mechanisms such as the ZLIB Compressed Data Format Specification and the DEFLATE Compressed Data Format Specification. Deflate mechanisms output different deflate file data depending on specific file data parameters. An optimization tool decompresses the deflate file data and outputs an optimized data stream. When a client application attempts to access the deflate data, the tool deoptimizes the optimized data stream and applies the same deflate algorithm to generate deflate file data. Although the deflate algorithm is applied without using the file data parameters used to generate the original deflate file data, substitute deflate file data is produced.09-24-2009
20090198717METHOD FOR CLUSTERING AUTOMATION AND CLASSIFICATION TECHNIQUES - A method and system for use in an information retrieval system that provides related informational items that can be automatically classified and summarized in a hierarchical manner. The system comprises the steps and means for the presentation and analysis of mined data through the application of four distinct processes, namely, feature selection, clustering, classification and summarization. The implementation of each of these techniques is a single process without regard to order. Individual informational items are analyzed, and relevant features extracted. Individual groups of informational items, otherwise known as clusters, are identified, and rules are determined to allow the assignment of informational items to the previously mentioned groups. Descriptive and meaningful titles are then identified for the groups. Various methods of presenting searched information to an end user are also provided. A method of adaptive clustering is also provided.08-06-2009
20090144303SYSTEM AND COMPUTER PROGRAM PRODUCT FOR AUTOMATED DESIGN OF RANGE PARTITIONED TABLES FOR RELATIONAL DATABASES - A workload specification, detailing specific queries and a frequency of execution of each of the queries, and a set of partitions, are obtained for the database, as inputs. A number of candidate tables are identified for the database, the tables having a plurality of attributes. A chosen attribute is allocated for each of the tables, to obtain a set of tables and a set of appropriate partitions for each of the tables.06-04-2009
20080320020METHOD AND SYSTEM FOR OPTIMIZING XA OPEN AND XA CLOSE OPERATIONS IN A DISTRIBUTED DATABASE SYSTEM - A system and method in accordance with the present invention provides for delaying an xa_close call on a connection and reducing the number of xa_open/xa_close calls. This process improves upon the original method of carrying out the xa_close call. The connection is always in an xa_open stage and will avoid a subsequent costly xa_open/xa_close. The only event which triggers the xa_close is the time out on the connection.12-25-2008
20080320019PLUGGABLE MERGE PATTERNS FOR DATA ACCESS SERVICES - Provided are techniques for storing data. Invocation of a data access service is received, wherein the invocation identifies a data structure storing one or more data elements having a data format. An update handler to be plugged into a data access framework is identified, wherein the update handler processes data elements having the data format. Under control of the update handler, data elements are accessed in the data structure; one or more statements for storing the data elements into the data store are determined; and the one or more statements are forwarded to the data access framework.12-25-2008
20080320021SYSTEMS AND METHODS FOR PRESENTING INFORMATION BASED ON PUBLISHER-SELECTED LABELS - Publishers define relationships between their own content items (e.g., World Wide Web pages) and content items created or maintained by other publishers. A central namespace manager provides grouping labels that publishers insert into their content items. Content items having matching grouping labels are identified as related. Different classes of grouping labels can be used to define different types of relationships, and multiple classes of grouping labels can co-exist. Grouping labels are made available to an information server such as a search server, which uses the labels in identifying content items related to a currently displayed content item.12-25-2008
20090150420GENERATING DEBUG INFORMATION - There is provided a method of generating information for a software system for use in a debug information database, the software system being defined in a low-level program code, the method comprising constructing a representation of the software system from the low-level program code; examining the representation to identify predetermined patterns; and generating a database of debug information for the software system from the results of the step of examining.06-11-2009
20080313201SYSTEM AND METHOD FOR COMPACT REPRESENTATION OF MULTIPLE MARKUP DATA PAGES OF ELECTRONIC DOCUMENT DATA - The subject application is directed to a system and method for compact representation of multiple markup data pages of electronic document data. Parsed electronic page content data is first received representing a plurality of markup pages. Element code data, attribute code data, attribute data type code data and relationship map data are then generated. The received parsed electronic page content data is then compressed using the generated code data and the relationship map data. The compact markup language data is stored based upon the output of the compressed parsed electronic page content data. In addition, the generated element code data, attribute code data, attribute data type code data, and relationship map data are stored. The parsed electronic page data is regenerated in accordance with the stored element code data, the stored attribute code data, the stored attribute data type code data, and the stored relationship map data.12-18-2008
20080281848Method to share and exchange geographic based information - A simplified approach to sharing and exchanging geographic-based information containing the maps and corresponding data and metadata was developed to enable easy sharing of information for decision support tools. Current Geographical Information Systems (GIS) technologies are limited in their ability to share maps and data in the exact format that the user created the information. This technology shares the corresponding data with the map information (not just a ‘picture’ of the data—e.g., a static map) in the exact form that the user wants to provide to other users of the software application. The technology and use of this software application provides the unique ability for users to share the information directly with other users of the software, eliminating process and setup of importing new information into the spatial decision-support software. Users can then utilize the information to explore the map and database information, to add their own data, and to make further decisions, enabling them to modify and change the information and exchange the information with others in the same manner.11-13-2008
20080270441SPARSE-CODED LOOK-UP TABLE - A look-up table (LUT) is arranged as a plurality of rows each indexed by an index value and storing at least a coefficient for each index value for use in processing digital data. The LUT contains repeated sections in which m coefficients stored for successive index values form a cycle. The number m is not an integer power of 2. For example the LUT may be used when converting a digital count to a gain in dB, in which case m may be 6 or 12, the coefficients representing dB or fractional-dB steps in gain. The LUT contains n additional blank rows inserted after every repeated section of m rows storing the cycle of m coefficients, n being 1 or more and (m+n) being an integer power of two (such as 8 or 16). By feeding an initial index value through encoding logic which takes account of the additional rows, it can be ensured that these are never indexed. Thus, a sparse-coded LUT is provided. Although each repeated section is increased in size, the actual size of the LUT in terms of circuit area or programming logic is reduced because the repeating length is now a power of two.10-30-2008
20080270437Session File Divide, Scramble, or Both for Manual or Automated Processing by One or More Processing Nodes - An apparatus comprising a session file and session file editor with main window and one or more document windows and annotation window and divide/merge and scramble/unscramble features. The session file may include text, audio, image, and other bounded divisions with source data divided into segments or other bounded divisions and other bounded divisions associated to original data. The session file may be derived from processing third-party application output. The session file editor displays text and other content, provides text selection capability and plays back audio of session files with audio-linked text as embedded content, and supports entry of text and password-protected document lock/unlock. The session file editor supports selection of a parent session file and divide, scramble, or merge of bounded divisions to create one or more child session files that may be processed at one or more nodes to create one or more processed child session files. The one or more processed child session files may undergo merge, unscramble, or both to create a reassembled session file with the same order of bounded divisions as the parent session file. The apparatus further comprises export of phrase-toned audio from a session file for transcription into delimited text for insert/replace into the original session file.10-30-2008
20080256105Document data creating apparatus, document data creating method and control program of the same - There is described a document data creating apparatus, a document data creating method and a program thereof, which make it possible to improve convenience of both the user and the creator of the document data by effectively utilizing the digital signature. The apparatus for creating document data that include a digital signature, includes: a character recognizing section to recognize a character based on image data inputted; a reliability determining section to determine a reliability degree of the character; a characteristic value calculating section to calculate a characteristic value of the document data; and a digital signature section to attach the characteristic value to the document data. When the reliability determining section determines that the reliability degree of the character is low, the digital signature section attaches a value, which is different from the characteristic value calculated by the characteristic value calculating section, to the document data as the digital signature.10-16-2008
20080222181DATA PROCESSOR, DATA PROCESSING METHOD, AND COMPUTER PRODUCT - A data processor includes a storage unit, a decompressing module, an interface module, and a data retrieving module. The storage unit stores therein a compressed setting data file including setting data files each compressed in a compression format. The decompressing module decompresses a setting data file, in the compressed setting data file, corresponding to a model of a printer selected for printing. The interface module displays a setting screen corresponding to the setting data file decompressed by the decompressing module. The data retrieving module sets print settings based on settings specified on the setting screen.09-11-2008
20080256106Determining the Similarity of Music Using Cultural and Acoustic Information - There is disclosed a method and storage media for determining the similarity between a first music collection and a second music collection. The similarity may be determined by comparing metadata associated with the first music collection and metadata associated with the second music collection. A plurality of comparison algorithms may be used including at least one of a comparison algorithm based on acoustic metadata and a comparison algorithm based on cultural metadata. The result of the plurality of comparison algorithms may be combined.10-16-2008
20080256103Systems and methods of providing possible value ranges - Embodiments of the invention relate generally to incremental computing. Specifically, embodiments of the invention include systems and methods that provide for the concurrent processing of multiple, incremental changes to a data value while at the same time monitoring and/or enforcing threshold values for that data value. For example, a method is provided that determines whether multiple incremental changes to a data field could pass a threshold based on keeping track of a possible value range for the data field.10-16-2008
20080256104Rearranging data sections within a page file - A method for rearranging data sections within a page file associated with an operating system is disclosed. The technology initially accesses a page file which comprises one or more data sections. Data sections within the page file are analyzed. Then, data sections are rearranged such that at least one or more non-contiguous data sections are contiguous within the page file.10-16-2008
20090300039METHOD OF EFFICIENT COMPRESSION FOR MEASUREMENT DATA - A method for compressing measurement data that includes grouping common data elements in common data messages. Sequential data elements in the groups are subtracted from each other to provide difference values. The difference values are compressed using a suitable compression algorithm to provide compressed blocks of data. Time stamp periods associated with each common data message are also subtracted from each other to provide time stamp difference values. The time stamp difference values are also compressed to provide compressed time stamp blocks. The compressed blocks of data and time stamp blocks are then stored.12-03-2009
20090300041Method and System for Training a Text-to-Speech Synthesis System Using a Specific Domain Speech Database - A method and system are disclosed that train a text-to-speech synthesis system for use in speech synthesis. The method includes generating a speech database of audio files comprising domain-specific voices having various prosodies, and training a text-to-speech synthesis system using the speech database by selecting audio segments having a prosody based on at least one dialog state. The system includes a processor, a speech database of audio files, and modules for implementing the method.12-03-2009
20090300038Methods and Apparatus for Reuse Optimization of a Data Storage Process Using an Ordered Structure - Techniques for reducing a number of computations in a data storage process are provided. One or more computational elements are identified in the data storage process. An ordered structure of one or more nodes is generated using the one or more computational elements. Each of the one or more nodes represents one or more computational elements. Further, a weight is assigned to each of the one or more nodes. An ordered structure of one or more reusable nodes is generated by deleting one or more nodes in accordance with the assigned weights. The ordered structure of one or more reusable nodes is utilized to reduce the number of computations in the data storage process. The data storage process converts data from a first format into a second format, and stores the data in the second format on a computer readable medium for data analysis purposes.12-03-2009
20090300037Enhanced database structure configuration - An enhanced data structure configuration that complies with the fundamental rules of the relational database model is disclosed. The data structure configuration comprises a data hub (12-03-2009
20090292717Optimistic Versioning Concurrency Scheme for Database Streams - Aspects of the subject matter described herein relate to versioning for databases. In aspects, two or more users may share the same version of data, such as a report, in a database. One of the users may seek to update the data. In response to a request from the user, a new version of the data is created. For data that is not updated via the request, the new version shares data with the previous version, thus saving space. For data this is updated, new segments within the database are created to store the updated data. Each user is allowed to access the data without blocking other users accessing the data.11-26-2009
20090292716APPARATUS, METHOD AND COMPUTER PROGRAM PRODUCT FOR PROCESSING RESOURCE DESCRIPTION FRAMEWORK STATEMENTS - A method is provided that includes receiving a first triple including a subject, predicate and object, where the object is of a literal-type. For the first triple, then, the method includes identifying a subtype of the object; semantically marking the object with the identified subtype, including generating second and third triples; and storing the second and third triples in a triple store. In this regard, the second triple includes the subject and predicate of the first RDF triple as the subject and predicate thereof, and the third RDF triple includes the object of the first RDF triple or a representation of the object of the first RDF triple as the object thereof.11-26-2009
20090292714ADAPTIVE LAZY MERGING - A query processing method intersects two or more unsorted lists based on a conjunction of predicates. Each list comprises a union of multiple sorted segments. The method performs lazy segment merging and an adaptive n-ary intersecting process. The lazy segment merging comprises starting with each list being a union of completely unmerged segments, such that lookups into a given list involve separate lookups into each segment of the given list. The method intersects the lists according to the predicates while performing the lazy segment merging, such that the lazy segment merging reads in only those portions of each segment that are needed for the intersecting. As the intersecting proceeds and the lookups are performed, the intersecting selectively merges the segments together, based on a cost-benefit analysis of the cost of merging compared to the benefit produced by reducing a number of lookups.11-26-2009
20100030797System for Compression and Storage of Data - According to one embodiment, a data storage system includes a storage medium coupled to a compression appliance. The compression appliance is operable to selectively compress data that is stored on the storage medium. The compression appliance selectively compresses the data according to a lower compression threshold and an upper compression threshold such that a useful compression level is achieved while balancing processor loading.02-04-2010
20100030796EFFICIENT COLUMN BASED DATA ENCODING FOR LARGE-SCALE DATA STORAGE - The subject disclosure relates to column based data encoding where raw data to be compressed is organized by columns, and then, as first and second layers of reduction of the data size, dictionary encoding and/or value encoding are applied to the data as organized by columns, to create integer sequences that correspond to the columns. Next, a hybrid greedy run length encoding and bit packing compression algorithm further compacts the data according to an analysis of bit savings. Synergy of the hybrid data reduction techniques in concert with the column-based organization, coupled with gains in scanning and querying efficiency owing to the representation of the compact data, results in substantially improved data compression at a fraction of the cost of conventional systems.02-04-2010
20100030795Maintaining referential integrity while masking - Systems, methods, and other embodiments associated with maintaining referential integrity while masking database columns are described. One example method includes determining a transitive closure for dependency relationships involving a column to be masked and other columns related to the column to be masked through a dependency relationship. The example method may also include identifying a root column for a column in the transitive closure and creating a mapping table that stores original values and masking values for the root column. The method includes masking the root column and related child columns based on the mapping table in a manner that maintains referential integrity between the root column and the child column. Integrity may be maintained by masking corresponding values in the root column and a child column(s) with identical mask values from the mapping table.02-04-2010
20100023540EDITING DEVICE AND EDITING METHOD USING METADATA - A waiting time until editing starts is shortened. Metadata that are a part of metadata are transferred from an optical disc set in a disc unit to an HDD in an editing device. The metadata are text data including a clip ID and continuing time information of material data, and they are small in information quantity. Thus, a waiting time for waiting for the completion of metadata transfer does not take place, and immediately after the optical disc is set editing processing can start. An editor selects a clip in accordance with a clip ID included in the metadata. Further, the editor selects a used portion of the clip in accordance with the continuing time information included in the metadata. Editing data are generated on the basis of these selected results.01-28-2010
20100023539XML/DATABASE/XML LAYER ANALYSIS - An automated method for testing XML/Database/XML layers. To the extent that XML is the de facto communication standard for today's middleware products, most of the middleware products need to produce/accept XML data at some interfaces. This data either comes from or needs to be persisted into DB (database). Two end points are thus represented by XML input/output and DB. To ensure the accuracy of data at the two end points, the same data are typically converted from one format to another between the end points. Manual verification in this vein is possible for development purposes, but in practice this presents inefficiencies if done repeatedly. Accordingly, there is broadly contemplated herein an automation technique to verify the accuracy of data at the two end points.01-28-2010
20100023538DISCLOSURE BOOTH - Methods, systems, and devices are disclosed for facilitating the disclosure of information from a disclosing party. Such a system may comprise a computing device including an operating system executing within the computing device; a software application operating in conjunction with the operating system, the software application prompting the disclosing party for at least two of audio/visual data, graphic data and textual data in response to the prompt; means for contemporaneously collecting the at least two of audio/visual data, graphic data and textual data from the disclosing party; and means for irrecoverably erasing the least two of the audio/visual data, graphic data and textual data from both the computing device and the means for contemporaneously collecting the at least two of audio/visual data, graphic data and textual data.01-28-2010
20100017424DATA COMPRESSION AND DECOMPRESSION - Data decompression apparatus is disclosed which is arranged to act on compressed data comprising: an ordered stream of references to groups of previously decoded data items; an ordered stream of direct representations of data items to be decoded; and an ordered stream of flags indicating whether each successive decompression operation should act on a reference or a direct representation. The apparatus comprises an output memory area; a detector to detect the number n of consecutive flags indicating that a decompression operation should act on a direct representation; and a data copier for copying to the output memory area either a next referenced group of previously decoded data or a group of n consecutive direct representations from the ordered stream of direct representations.01-21-2010
20100017423METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - A method and system for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Transforming the logical data object comprises creating in the storage device a transformed logical data object comprising a header and one or more allocated accommodation sections with predefined size; sequentially obtaining one or more data chunks corresponding to the transforming logical data object; verifying if obtained data chunks match certain criterion and processing the chunks in accordance with verification results thus giving rise to the processed data chunks, wherein, resulting from said processing, a processed data chunk holds transformed data if the criterion is matched and holds non-transformed data if the criterion is not matches; sequentially accommodating the processed data chunks into said accommodation sections in accordance with an order said chunks received, and facilitating mapping between the data in the logical data object and the data accommodated in the accommodation sections.01-21-2010
20100017422FILE SYSTEM INTERFACE FOR CIM - Systems and methods for managing systems using common information models (CIM) are presented. According to a method embodiment, CIM functions are provided, and a file system interface for the CIM functions is provided. An embodiment of a method receives file operation commands through a client interface and performs CIM functions corresponding to the received file operation commands based on a mapping of the file operation commands to the CIM functions.01-21-2010
20100057761Method, apparatus, computer program and user interface for enabling user input - A method, apparatus, computer program and user interface wherein the method includes: presenting an image on a display; editing the image in response to detection of user input to create an edited image; automatically creating a data file, defining the edited image, in an accessible location such that the data file can be subsequently referenced and retrieved; detecting user selection of a function to be performed in relation to the edited image; and in response to the detection of the user selection of the function, automatically referencing and retrieving the data file of the edited image from the accessible location for use in relation to the selected function.03-04-2010
20090049073METHOD AND APPARATUS FOR ENCODING/DECODING METADATA - Provided are a meta data encoding/decoding method and apparatus. The meta data decoding method includes decoding a media signal containing a media object, and decoding meta data corresponding to the media object. During the decoding of the meta data signal, decoding of the meta data is skipped when the meta data that is to be decoded is identical to already decoded meta data.02-19-2009
20090012980Efficient Query Processing Of Merge Statement - Disclosed are systems and methods for optimization and efficient processing of MERGE statements. MERGE allows performing a mix of inserts, updates, and deletes in a single statement, and introduces new challenges compared to legacy DML statements, where the kind of action to be performed is hard-coded and known at compile time. Such optimizations may include Halloween Protection detection for MERGE statements, optimized prevention of non-deterministic MERGE statements, in-place inserts for MERGE statements scanning the “Read Instance” of the target table, and optimized execution of MERGE statements seeking the “Read Instance” of the target table. Such optimizations may be fundamental in order to ensure proper performance and reliable processing times.01-08-2009
20090070354MINIMAL PERFECT HASH FUNCTIONS USING DOUBLE HASHING - Technologies are described herein for constructing a minimal perfect hash function. According to embodiments, a hash table is constructed by double hashing each of the strings in a set of strings. A computed double hash value is utilized to identify an empty location in the hash table for each string. A signature for each string is stored in the empty location of the hash table identified for the string. In order to obtain a minimal perfect hash value for an input string, the input string is iteratively double hashed until a location is identified in the hash table that contains a signature corresponding to the input string. The minimal perfect hash value is an integer value identifying the location in the hash table that contains the signature corresponding to the input string.03-12-2009
20080208881METHOD AND APPARATUS FOR LOCAL INSERTION OF ADVERTION OF ADVERTISING MEDIA INTO A NETWORKED DIGITAL ADVERTISING SYSTEM - A user, seeking to modify an established content play list will enter an alteration request specifying the desired alterations, which can include the deletion and/or addition of content as well as alteration of the content order. A user profile (08-28-2008
20090172001SYSTEMS AND METHODS FOR PROCESSING REGULAR EXPRESSIONS - A method for reducing the size of a DFA associated with a regular expression separates the functions of locating subexpressions within the DFA and determining if the located subexpressions satisfy a regular expression. For example, the functions of (1) locating subexpressions in a range asserting expression and, (2) determining whether the subexpressions satisfy the range of the range asserting expression are partitioned. In one embodiment, a first component may locate the subexpressions in a data stream using one or more DFAs, while a second component determines if the located subexpressions satisfy the range. In this embodiment, because the DFAs are not configured to determine a relationship between subexpressions, such as a range between subexpressions, the size of the resultant DFA may be significantly reduced.07-02-2009
20090172000Methods and Apparatus for Improving Data Warehouse Performance - Methods and apparatus for improving data warehouse performance are disclosed. An example method to transform a first database into a second database includes analyzing a structure of the first database, generating a hierarchical file path structure reflecting the structure of the first database, and associating a mapping file with a fact table, the mapping file stored in a first hierarchical directory file path of the hierarchical file path structure. The example method also includes copying data from the first database to form the second database, the copied data being accessible from the second database via the mapping file and the fact table, receiving a request to access data in the first database, using the mapping file and the fact table to retrieve the data responsive to the analysis instruction from the second database, and outputting the retrieved data.07-02-2009
20090171998SYSTEM AND METHOD FOR CAPTURING AND STORING HOSPITALITY INFORMATION IN A RELATIONAL DATABASE SYSTEM - A database management system for a hospitality business. The database management system comprises a relational database for storing information concerning customers of the hospitality business and customer activities, activities hosted by the hospitality business, and products and services provided by the hospitality or gaming business. Data is stored and organized within the database in accordance with a logical data model comprising a plurality of entities and relationships organized within subject areas defining the manner in which the information concerning customers, dining services, group activities, room services and charges, and other products and services is stored and organized within the relational database.07-02-2009
20090171995ASSOCIATING AND PRESENTING ALTERNATE MEDIA WITH A MEDIA FILE - Embodiments of a system for selecting a media file comprising a plurality of media, selecting one or more other media as alternate media, generating metadata specifying the one or more alternate media, and associating the metadata and the one or more alternate media to enable the media file to be alternately presented. Other embodiments are described.07-02-2009
20090171997METHOD AND SYSTEM FOR OBTAINING USER DATA HAVING USER-DEFINED DATA TYPES - The present invention relates generally to data retrieval, and more particularly but not exclusively to obtaining referentially converted user data having user-defined data types. In one implementation, the present invention is a method for retrieving user data in a data system using one or more application programs for defining a layout for each user data type, defining one or more conversion routines for non-standard data types, calling a coordination call to map standard and non-standard data types, and retrieve the user data from the data storage device.07-02-2009
20090171994DEVICE, SYSTEM, AND METHOD FOR IMPROVING PROCESSING EFFICIENCY BY COLLECTIVELY APPLYING OPERATIONS - A system and method for generating a single compressed vector including two or more predetermined attribute values. For each of a plurality of data points such as pixels, if a first and a second attribute values of the data point are equal to a first and a second, respectively, of the two or more predetermined attribute values, the compressed vector is used to operate on the data point. Other embodiments are described and claimed.07-02-2009
20090171996ASSOCIATIVE OBJECT MODEL FOR COMPOSITE ENTITY INFORMATION - An associative object model for presenting composite entity information is provided. More particularly, a system and method of linking various data related to an entity from isolated databases in a distributed enterprise is provided. The system and method presents composite information on the entity to different systems within the distributed enterprise. The method includes propagating a change of data of a first entity type to one or more related or associated entity types in an active associative object model (AOM) accessible by a subscribing system and a publishing system in an enterprise.07-02-2009
20090248721System And Method for Stack Crawl Testing and Caching - A method for extracting static information from user code, analyzing the static information to determine location expressions for program information and comparing the location expressions to reference location expressions of the user code. In addition, a system having a reading module configured to read and extract static information from user code, an analyzing module configured to analyze the static information to determine location expressions for program information and a comparison module configured to compare the location expressions to reference location expressions of the user code.10-01-2009
20090006436Automated yield analysis system - Systems and methods associated with automated semiconductor fabrication device yield analysis are described. One embodiment includes a computing system that includes a working file storage system that stores files corresponding to semiconductor fabrication test devices. The working file storage system may include working directories and executable flows corresponding to working directories. The computing system also includes a data controller that may select a working directory, transfer an input file to the selected working directory, and execute a flow to process an input file and to produce an output file. The output file may include a yield analysis based on data provided by a semiconductor fabrication test device.01-01-2009
20090132568DATA CLASSIFICATION BY KERNEL DENSITY SHAPE INTERPOLATION OF CLUSTERS - A method for representing a dataset comprises clustering the dataset using an unsupervised, non-parametric clustering method to generate a set of clusters each comprising a set of data points in an image; clustering the data points of each cluster using a supervised, partitional clustering method to partition each cluster into a specified number of sub-clusters; generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each sub-cluster using a kernel density function; identifying a maximum density estimate value and a sub-cluster associated with the maximum density estimate value for the grid point; adding each grid point for which the maximum density estimate value exceeds a specified threshold to the sub-cluster associated with the maximum density estimate value; and, for each cluster, merging the sub-clusters of the cluster into a corresponding cluster region in the image.05-21-2009
20090132569DATA COMPRESSION APPARATUS, DATA DECOMPRESSION APPARATUS, AND METHOD FOR COMPRESSING DATA - A data compression apparatus for compressing structured data is provided. The data compression apparatus includes an input unit configured to input a plurality of structured data items to be compressed and a plurality of schema files each corresponding to one of the structured data items, an index data generating unit configured to derive a common vocabulary set from a combination of at least two of the schema files among the input schema files and generate index data for associating an index with each of vocabulary items included in the common vocabulary set, and a replacement unit configured to replace the vocabulary included in the structured data item with a corresponding index on the basis of the index data for each of the structured data items corresponding to the schema files included in the combination of schema files.05-21-2009
20090132567COMPRESSED DATA STORAGE TO PROVIDE RECENT AND SUMMARY DATA - The present invention is related to data storage and transmission. Data is compressed and stored by a controller computer instead of having a client computer gather, compress and store the data. This allows for data to be retrieved from the data stores and displayed for user retrieval, even when communication failures have occurred.05-21-2009
20080320018CUBE-BASED PERCENTILE CALCULATION - By dividing data entries among multiple data collections, a data collection comprising a data entry associated with a requested percentile can be determined with reference to the number of data entries within each collection. Initially, the range of values corresponding to the identified data collection can be presented as the value of the requested percentile. Should further detail be required, the value for a requested percentile can be refined by averaging the range, linearly, or otherwise, extrapolating estimated values for the data entries within the identified data collection, or sorting the actual entries according to their values. A relational database can maintain the data entries, each comprising values along one or more dimensions, and an OLAP engine component can maintain a counting of the data entries within the defined data collections.12-25-2008
20100049728INTERACTIVE GENERATION OF INTEGRATED SCHEMAS - Methods, systems and computer program products for interactive generation of integrated schemas. Exemplary embodiments include a method for schema integration, the method including recasting a first source schema into a first graph of concepts with HasA relationships, recasting a second source schema into a second graph of concepts with HasA relationships, identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts of the first and second graphs, producing an integrated schema, based on a fixed specification of matching concepts to merge, and generating a mapping from the first source schema to the integrated schema and from the second source schema to the integrated schema.02-25-2010
20100049729TRANSFORMING A HIERARCHICAL DATA STRUCTURE ACCORDING TO REQUIREMENTS SPECIFIED IN A TRANSFORMATION TEMPLATE - Method for transforming an input data structure to an output data structure according to requirements specified in a transformation template. The method includes translating an input data structure in an input container format to an output data structure in a different output container format and converting an input data structure to an output data structure where the structures have the same container format. During transformation, modifications to the structure and/or content of the input data structure may be made. The resulting output data structure is dynamically determined based on the structure and content of the input data structure. The input data structure is represented by a data structure tree, each node of the tree having an associated scope dictionary containing zero or more key-value pairs. The tree is traversed downwards as scope dictionaries are created and/or modified and traversed upwards as data of the output data structure tree is created.02-25-2010
20100049727COMPRESSING XML DOCUMENTS USING STATISTICAL TREES GENERATED FROM THOSE DOCUMENTS - Compressing data from a markup language document such as an XML document includes the steps of creating from the document a path based statistical tree built according to a given set of rules, and compressing the document by using the statistical tree. In an embodiment, the statistical tree includes a multitude of paths, and a single bit represents each of said paths. Also, the document may include both enumerated data and non-enumerated data, and the enumerated data is compressed by using the statistical tree. In an embodiment, the document includes a multitude of document nodes, and the step of creating the path based statistical tree includes the step of forming said tree with a multitude of tree nodes, each of the tree nodes representing one of the document nodes.02-25-2010
20100049726SYSTEM AND METHOD FOR COMPRESSION OF PARTIALLY ORDERED DATA SETS - A system and method for compression of partially ordered data sets is provided. A first record of the data set is compressed by encoding the record using a Fibonacci encoding technique. Thereafter, for each subsequent record N, the N−102-25-2010
20090012981Method and System for System Migration - A system transition support system guides design of a new system comprised of merged items from a source system and a destination system. The configuration management database (CMDB) provides hardware and software configuration information inherent to each system. A system configuration optimization module is in communication with the CMDB and generates work items required for the system transition and a recommended hardware and software configuration for the new system.01-08-2009
20100011015SIMPLIFYING COMPLEX DATA STREAM PROBLEMS INVOLVING FEATURE EXTRACTION FROM NOISY DATA - Methods, systems and computer program products for simplifying complex data stream problems involving feature extraction from noisy data. Exemplary embodiments include a method for processing a data stream, including applying multiple operators to the data stream, wherein an operation by each of the multiple operators includes retrieving the next chunk for each of set of input parameters, performing digital processing operations on a respective next chunk, producing sets of output parameters and adding data to one or more internal data stores, each internal data store acting as a data stream source.01-14-2010
20100011014Adaptive Storage System Transcoder - A system and method are disclosed for the transcoding of data from a first format to a second format. A data format transcoder receives a request for data from a requester. The desired format of the requested data is determined. A descriptor file containing formatting information describing the requested format is loaded into the data format transcoder. The requested data is retrieved in its native format along with its corresponding common descriptor. The requested data is read in its native format, using the formatting information from its associated common descriptor. The data format transcoder then uses the formatting information in the common descriptor of the requested format to perform transcoding operations to convert the requested data from its native format into the requested format.01-14-2010
20100011013Operations on Multi-Level Nested Data Structure - Multiple sets of data are obtained from different sources. Each data set is represented using a different format having a different syntax and organized in a multi-level nested data structure. Each data set is reformatted into a standardized table format using a depth-first recursive algorithm without relying on the syntax schema of the original format of the data set. Various operations are performed on the tables corresponding to the data sets, including but not limited to joining multiple tables, grouping selected rows of a table, ranking rows of a table, adding or deleting fields from selected rows of a table, etc. Optionally, inferred namespace and text normalization are utilized for selected table operations. One or more templates are provided for converting the data set of a table to a format that may be presented to a user.01-14-2010
20100011012Selective Compression Based on Data Type and Client Capability - A method and apparatus are provided for generating virtual channels to selectively compress and deliver different data streams over a communication medium to a thin client receiving device by selecting a compression technique for each data stream that takes into account the data stream type, the bandwidth/latency characteristics of the communication channel, and the processing capabilities of the thin client that is the target or source of the data. By selectively compressing data streams within multiple virtual channels that are aggregated into a combined data stream to the receiving device, each individual data stream is individually compressed and packetized within its virtual channel based on the specific different delivery, bandwidth, latency and data fidelity requirements for that data stream, as well as the processing capability of the receiving device.01-14-2010
20090019073SYSTEM AND METHOD FOR TRANSCODING DIGITAL CONTENT - A system and method for transcoding digital content (e.g. web content) by correctly employing one annotation for multiple digital contents. This can efficiently reduce the workloads required for the addition of annotation data during the transcoding process. A transcoding system comprises an annotation database system for storing annotation data to be used for the transcoding of contents, and a transcoder for transcoding the contents based on annotation data stored in the annotation database system. Upon receiving an inquiry from the transcoder, a correlation between elements in the contents and descriptions of the annotation data is checked to select one annotation that can be employed for transcoding the content. The correlation is specifically determined based on XPath information.01-15-2009
20090019074IMAGE PROCESSING APPARATUS AND IMAGE PROCESSING METHOD - An image processing apparatus including: a correspondence determination unit configured to refer to respective additional information data included in a file and another file and determine whether identical additional information data exists; a size determination unit configured to compare a combined size of the two files with a reference size when judged that identical additional data exists; a flag addition unit configured to add a flag indicating data exempt from search target to identical additional information data included in either one of the two files when judged that the combined size is smaller than the reference size; a deletion unit configured to delete identical additional information data included in either one of the two files when judged that the combined size is equal to or greater than the reference size; and a storing unit configured to store a combined file.01-15-2009
20090019071BLOCKING FOR COMBINATORIAL CODING/DECODING FOR ELECTRICAL COMPUTERS AND DIGITAL DATA PROCESSING SYSTEMS - Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.01-15-2009
20090019072INTEROPERABLE RETRIEVAL AND DEPOSIT USING ANNOTATED SCHEMA TO INTERFACE BETWEEN INDUSTRIAL DOCUMENT SPECIFICATION LANGUAGES - In order to achieve interoperability between diverse types of computer systems for the purpose of e-commerce, a system and method are provided for retrieving data from multiple relational databases into an XEDI document. First, a DTDSA is used to create an intermediate format for the data. Then, an annotated interoperable (universal) DTD is used to create the XEDI document. For depositing data from an XEDI document into multiple relational databases, a reverse process is used. The universal DTD is used to create the intermediate format. Then the DTDSA is used to create the relational database format. The deposit process requires analysis of join unions of data sought to be deposited, and also a static reversibility check for the DTDSA. A GUI interface is provided for generating annotations.01-15-2009
20090019070DATA COMPRESSION FOR COMMUNICATION BETWEEN TWO OR MORE COMPONENTS IN A SYSTEM - Briefly, within a computer or digital data processing system, embodiments describe a method, article and apparatus for compressing data is described, which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communicating between two or more computers or digital data processing systems via an interconnection medium such as a network.01-15-2009
20090019069DATA CODING/DECODING FOR ELECTRICAL COMPUTERS AND DIGITAL DATA PROCESSING SYSTEMS - Embodiments of methods, systems and/or devices for data coding are disclosed. Briefly, in accordance with one embodiment, data is coded and transmitted via an input/output portion of a computing platform to one or more other portions of the computing platform. An interconnect is employed to facilitate transmitting the coded data.01-15-2009
20090019068DECODER WITH REDUCED MEMORY REQUIREMENTS DECODING OF VIDEO SIGNALS - A decoder decoding at a block level provided. The decoder comprises: a down-scalar receiving a multiplicity of blocks of data and down-scaling the blocks of data at the block level and storing the down-scaled data in a memory; and an output device for outputting the down-scaled blocks of data at the block level.01-15-2009
20090006438SYSTEM AND METHOD FOR MEASURING THE QUALITY OF DOCUMENT SETS - Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.01-01-2009
20090006437Multi-Processor - A multi-processor according to an example of the invention comprises a first control unit which stores first compressed data acquired externally in a first memory, a hardware decoding unit which decodes the first compressed data stored in the first memory and storing the decoded data in a second memory, an encoding processor element which includes at least one of a plurality of processor elements, encodes the decoded data stored in the second memory in accordance with encoding software stored in a third memory, and stores second compressed data obtained by encoding the decoded data in a fourth memory, and a second control unit which outputs the second compressed data stored in the fourth memory to the outside.01-01-2009
20080306976PROCESS FOR DYNAMIC TABLE CONVERSION - A method and system are disclosed for converting data from a source table having a multitude of source fields to a target table having a multitude of target fields, the method comprising the steps of extracting data from the source table, downloading the extracted data into a flat file, and dynamically creating a conversion program to convert said data in the flat file, said conversion program including a custom table name of the target table and a plurality of input parameters. The method comprises the further step of using the conversion program to convert the data in the flat file, including the step of specifying each field of the source table to be converted by providing the name of said each field, and new and old values for said each field. The converted data are then uploaded into the target table.12-11-2008
20080301165APPARATUS FOR PROCESSING TIME-BASE DATA AND METHOD THEREOF - A data processing apparatus and a method for displaying time-based data are provided. The data processing apparatus includes a storage unit for storing data processed by the data processing apparatus and identification information for sorting the data. The data processing apparatus also includes a display unit having a first display section for displaying one or more data sort functions and a second display section for displaying data according to a data sort function selected from the first display section. Finally, the data processing apparatus includes a control unit for sorting the data stored in the storage unit and controlling the display unit to display the data in a life data mode. Therefore, a user may quickly identify data stored in a terminal by displaying the data by data generation dates, and by further sorting the data according to a data sort function selected by the user, thereby enabling easy finding of desired data.12-04-2008
20080301164STORAGE SYSTEM, STORAGE CONTROLLER AND DATA COMPRESSION METHOD - Provided are a storage system, a storage controller and a data compression method that will not deteriorate the performance of a storage system by adjusting the compression processing time required for compressing data. This storage controller includes a statistical information management unit for managing a throughput value decided based on statistical information of previously compressed file data as a system performance value, a mode setting unit for setting a compression mode of either a system performance priority mode that terminates compression of the file data and gives priority to system performance or a compression priority mode that gives priority to compression of the file data based on a comparison between a system performance target value preset as a target value and the system performance value, and a compression controller for compressing the file data based on the compression mode set with the mode setting unit.12-04-2008
20080301163DYNAMIC MEMORY MANAGEMENT SYSTEM AND METHOD - A data expression is created to be executed on a computer. At least one of the at least two objects is tagged as temporary. A first non-assignment operator is executed to instruct the computer to perform a mathematical operation on object data corresponding to the one of the at least two objects and thereby creating resultant object data corresponding to the one of the at least two objects. The object data corresponding to the one of the at least two objects is overwritten with the resultant object data corresponding to the one of the at least two objects. A first assignment operator is executed to instruct the computer to assign the one of the at least two objects to the second of the at least two objects thereby copying correspondence of the resultant object data to the second of the at least two objects. The overwriting is performed after the executing a first non-assignment operator and prior to the executing a first assignment operator.12-04-2008
20080301162DATA CONVERSION ENVIRONMENT - Converting data from a first format to a second format may be used to merge two databases having different formatting. Conversion maps may be defined for pairs of formats and may be used to convert data between the pair of formats. Data may further be transformed from one information type or format into another information type or format. In one example, a first format may allow storage of a social security number while a second format might not. Thus, a social security number stored in the first format may be converted to an employee number for storage in the second format. Collisions between pieces of data may be detected and managed by generating an identifier for the pieces of data (e.g., data records) and merging the pieces of data into a single piece or portion of data (e.g., a single data record) corresponding to the assigned identifier.12-04-2008
20080250044Verification of Semantic Constraints in Multimedia Data and in its Announcement, Signaling and Interchange - A collection of well-formed, but possibly semantically invalid, binary encoded multimedia data components or packages as well as the binary encoded announcement, signaling, and interchange protocols used in their transmission are converted into one or more well-formed extensible markup language (XML) files. Such XML files may then be validated according to one or more pre-defined XML schemas, or similar schema languages, in order to verify that the data and protocol structures and substructures adhere to prior defined semantic constraints.10-09-2008
20080243894MEDICAL IMAGE FILE OUTPUT APPARATUS, MEDICAL IMAGE DIAGNOSTIC APPARATUS AND METHOD FOR OUTPUTTING MEDICAL IMAGE FILE - A medical image file output apparatus includes: a second-image input device which inputs a second image obtained by adding personal information in a human-readable manner to a first image obtained by scanning a subject; a third-image generating device which converts an area in the second image where the personal information is added, into a human-unreadable manner to generate a third image; and an image file output device which prepares an image file in a general image file format from the third image for output.10-02-2008
20080243893IMAGE MANAGING SYSTEM, DIGITAL CAMERA, IMAGE MANAGING METHOD, AND COMPUTER READABLE MEDIUM STORING AN IMAGE MANAGING PROGRAM - In an image managing system, a digital camera has a photographing section, a first memory, a display, an importance degree acquiring section and an outputting section, and an information processing device has an inputting section, a second memory, and a controller. The first memory of the digital camera stores image information acquired by the photographing section. The importance degree acquiring section acquires importance degree information expressing a degree of importance of a photographed subject image expressed by stored image information. The stored image information and the importance degree information are outputted, and are inputted to the inputting section of the information processing device. The second memory stores inputted image information. The controller effects control such that, among the image information stored in the first memory, at least image information whose importance degree information is less than or equal to a predetermined value is deleted from the first memory, and at least deleted image information is stored in the second memory.10-02-2008
20080243892Automatic file conversion to a target format - A conversion tool that is automatically launched enables file formats not understood by a given application to be opened by that application. The converter registers for file types that are not already associated with an application used by the system. When a file that is not supported by another application is opened, the converter automatically converts the file to the target format and then opens the file causing the application that is registered for the target format to be launched.10-02-2008
20080243891Mapping Data on a Network - Described are computer-based methods and apparatuses, including computer program products, for mapping data on a network. Input files including information files and schema files are utilized to generate platform independent runtime files. The processing of the runtime files generates one or more business service applications. The runtime files map data between a standard format and an internal format.10-02-2008
20080243890AUTOMATED TWO AND THREE DIMENSIONAL TECHNICAL DATA PACKAGING - Production of two and three dimensional technical data packages is automated by a computer that receives and stores one or more customer defined data submittal rules for formatting a technical data package. The computer then executes one or more of the rules to create a linked set of output data files comprising the technical data package. The computer creates a hierarchical product data tree structure comprising one or more nodes and one or more product attribute data fields for each node. The computer creates the technical data package file by linking parts files together in accordance with the product data tree structure. The technical data package created by the computer may be compressed and sent electronically to the customer avoiding the requirement of using cumbersome technology such as aperture cards.10-02-2008
20080228796System and method for web services packaging - A system and method for Web services packaging. In one embodiment, binding and portType templates are created from an existing WSDL file. One or more of these templates are packaged into a Web services archive file.09-18-2008
20080228795TRANSACTION TIME INDEXING WITH VERSION COMPRESSION - A system and method that facilitates and effectuates transaction time indexing with version compression. The system includes an indexing component that partitions a database page containing multiple temporally related versions of a record into a historical page and a current page based at least in part on a time or a key. The system includes a compression component that constructs backward deltas for compressing earlier (historical) versions of records that are stored on the page. Because there is always an uncompressed version for each record on each page, decompression can be done based solely on information stored on the record's page.09-18-2008
20090049070Web-based social network badges - Web-based social network badges according to various exemplary embodiments are customizable displays which allow computer users who are members of a web-based social network to share personal information on various third-party web sites. A template is used for selecting user information from a profile on the social network to appear on the badge. A dynamic script accesses and renders the selected user information on the badge, and a URL is used to embed the badge as an image-based display on the third-party web site. The badge is dynamically updated when a user updates the user information. Additonally, the badge on the third-party web site includes a link to the profile stored on the server for the web-based social network.02-19-2009
20080222182Method for Fast Deletion of Physically Clustered Data - A computer implemented method, apparatus, and computer usable program code for deleting rows in a multidimensional clustering database. A multidimensional clustering processor receives a request to delete a set of multidimensionally clustered data. The multidimensional clustering processor determines whether all multidimensionally clustered data is located in a block. Responsive to all multidimensionally clustered data qualifying for deletion, the multidimensional clustering processor deletes all data in the block to delete the set of multidimensionally clustered data.09-11-2008
20080222180Recording medium containing sample data and reproducing thereof - The present invention provides according to an embodiment a method of reproducing digital content, comprising the steps of: (a) reading a position information where a sample data is present, the sample data being same as a portion of digital content and not encrypted; and (b) reproducing the sample data based on the read position information without a key information, the key information required for decrypting an encrypted digital content.09-11-2008
20080222179APPARATUS AND METHOD FOR SHARING AND REUSE OF STRUCTURED KNOWLEDGE ARTIFACTS - In areas that require repetitive data collection and entry, an efficient way to reuse data that is already available in the system is proposed. This technique involves the reuse of data artifact fields, validation and categorization of data artifacts, and computerized filling in of “inheritable” data into reports such as aircraft maintenance reports.09-11-2008
20080222178Bursting Multiple Elements in a Single Object in a Content Management System - A content management system (CMS) allows defining multi-element burst rules that allow multiple elements to be bursted to a single object. A multi-element burst mechanism performs the bursting of multiple elements when a multi-element burst rule is processed. A multi-element burst policy allows a user to specify conditions that govern the function of the multi-element burst mechanism. The result is a CMS that includes multiple elements in a single object, thereby enhancing reusability of content in the CMS.09-11-2008
20080222177METHOD, SYSTEM AND PROGRAM PRODUCT FOR MAXIMIZING VIRUS CHECK COVERAGE WHILE MINIMIZING REDUNDANCY IN VIRUS CHECKING - A method, system and program product for maximizing virus check coverage, while minimizing redundancy in virus checking. The method includes evaluating, using an audit checking tool, whether or not a file in a working directory to be virus checked is a compressed file and, if the file is evaluated as being a compressed file, decompressing the compressed file evaluated using a decompression tool. Further, the method includes iterating the evaluating and decompressing steps to decompress any other files contained therein using the decompression tool and deleting a respective compressed file that is fully decompressed by the decompression tool without any errors from the working directory, while saving a respective compressed file that is not fully decompressed by the decompression tool. Furthermore, the method includes virus checking the working directory, such that, the virus checking does not virus check the respective compressed file that is deleted from the working directory.09-11-2008
20090327319HYBRID DATA MODEL AND USER INTERACTION FOR DATA SETS IN A USER INTERFACE - A first data model in which a large dataset is stored is maintained, wherein a first set of operations is allowed to be performed on the first data model. The first data model is reduced to a second data model that is of a smaller size than the first data model. Selected operations of the first set of operations are restricted from being performed on the second data model. A second set of operations is performed on the second data model, wherein the second set of operations is a subset of the first set of operations, and wherein the second set of operations does not include the selected operations that have been restricted from being performed on the second data model.12-31-2009
20080215602"Methods and Apparatus for Fusing Databases" - Methods and apparatus for fusing multiple databases into a single database are disclosed. A disclosed method determines a ranking of a plurality of matching variables associated with first and second datasets and generates a hierarchical matching grid including a plurality of levels based on the ranking of the plurality of matching variables. The example method identifies first and second sets of match candidates from the first and second datasets based on successive levels of the hierarchical matching grid and fuses records in the first and second sets of match candidates based on probabilities associated with the records.09-04-2008
20080201348TAG-MEDIATED REVIEW SYSTEM FOR ELECTRONIC CONTENT - A tag-mediated review system for electronic content that ranks content based upon several ascertainable factors, including the implicit engagement with the content by users (typically online viewers); the expertise and success in the topical domain by reviewers; and the review activity of users or viewers. The system extends implicit metrics to tracking of user interaction including the receipt of video and audio content over the web. Document ranking is mediated by tags that identify the subject matter addressed by an associated document as the ranking mediators for computing content quality scores values for user and reviewer activity. The tag-mediated content quality scores, which are content quality scores for the subject matter area identified by the associated tags, can be exposed to end-users and used directly or indirectly to complement search engine retrieval algorithms.08-21-2008
20080201347Structural formula display system, method, and program storage medium storing program thereof - Character string divider divides a targeted character string into a plurality of groups at each bonding sites on a main chain. In the character string dividing process, the character string divider adds starting/ending symbols to the targeted character string, inserts a delimiter between adjacent characters, changes a notation related to oxo acids, reconstructs an atomic symbol consisting of two characters, changes a notation regarding a subscript or superscript, links hydrogen to another element, reconstructs a set of side chains, reconstructs a character string consisting of one group, reconstructs a back-end group, reconstructs a double bond in a group, and removes the starting/ending symbols. Character string reverser reverses the alignment of the groups.08-21-2008
20080201346HIERARCHICAL UPDATE SCHEME FOR EXTREMUM LOCATION WITH INDIRECT ADDRESSING - Implementations related to hierarchical update schemes for extremum location with indirect addressing are disclosed.08-21-2008
20090070355TRANSITIONING BETWEEN HISTORICAL AND REAL TIME DATA STREAMS IN THE PROCESSING OF DATA CHANGE MESSAGES - Provided are techniques for data stream switching. While accepting data change messages from a historical data stream, in response to determining that the end of the historical data stream is approaching, consumption from a real time data stream is resumed. In accepting data change messages from one of a historical data stream and a real time data stream, a data change message identifier (DCMID) for a data change message is obtained. Then, it is determined whether the data change message is from the real time data stream. In response to determining that the data change message is from the real time data stream, the DCMID is processed against a historical data structure to determine whether the related data change message has been seen in the historical data stream. In response to determining that the data change message is from the historical data stream, the DCMID is processed against a real time data structure to determine whether the related data change message has been seen in the real time data stream. It is determined whether a threshold for a number of DCMIDs that correspond to each other in the real time data stream and the historical data stream has been met. In response to determining that the threshold has been met, there is a switch from capturing data change messages in the historical data stream to capturing data change messages in the real time data stream.03-12-2009

Patent applications in class Manipulating data structure (e.g., compression, compaction, compilation)