Abstract: Disclosed are methods and apparatus for processing correlated metadata (e.g. programmatic metadata relating to one or more episodes of a television show). Mappings, or correlations, between chunks of metadata that originated from a particular data source and metadata clusters may be determined. Inconsistencies in the correlated metadata may then be detected by a processor. An inconsistency may be an incorrect mapping, the mapping of more than one of the metadata chunks that originated from the same data source to the same metadata cluster, or that one or more of the metadata chunk have not been mapped to a metadata cluster. The mappings may then be edited so as to remove detected inconsistencies by the processor.

Abstract: Disclosed are methods and apparatus for processing correlated metadata (e.g., programmatic metadata relating to one or more episodes of a television show). Mappings, or correlations, between chunks of the metadata that originated from a particular data source and the metadata clusters may be determined and displayed, e.g., on a graphical user interface. Using this display, a user (i.e., a human operator) may detect inconsistencies in the correlated metadata. An inconsistency may be an incorrect mapping, the mapping of more than one of the metadata chunks that originated from the same data source to the same metadata cluster, or that one or more of the metadata chunks have not been mapped to a metadata cluster. The mappings may then be edited so as to remove detected inconsistencies.

Abstract: Provided are techniques for locating one or more genome patterns. One or more lexical annotators that each identify a sequence of nucleotides are created. One or more parsing rule annotators are created using at least one of (1) one or more of the lexical annotators, (2) one or more dictionary entries, and (3) one or more previously-defined parsing rule annotators. The one or more parsing rule annotators are used to discover the one or more genome patterns comprising a combination of the lexical annotators and the parsing rule annotators.

Abstract: A map update data supply device and method includes an update map database of per section versions of an update data file, and a request update data extraction unit for extracting a request update section and an update data file. A safeguard update data extraction unit extracts a safeguard update section to safeguard a road network connection between adjacent sections. An integrated data generation unit integrates all versions of the update data file for each extracted request update section and generates a request update integrated data file. The integrated data generation unit integrates, per safeguard update section, versions of the update data file up to the update safeguard version for each extracted safeguard update section, and generates a safeguard update integrated data file. An integrated data supply unit supplies the generated request update integrated data file and the safeguard update integrated data file to a navigation device.

Abstract: A method, system and computer program product for creating a subject annotator. A user input query is accepted and specifies a target subject to be annotated. Based on the query, a search for similar words to the target subject is conducted and creates a set of related terms. The set of related terms are used to search for and identify further related terms. Both the related terms and further related terms are added to a master word list. The master word list is used to annotate the target subject.

Abstract: A method, non-transitory computer readable medium and apparatus for ranking an application are disclosed. For example, the method collects meta-data from the application, determines a reputation of a developer of the application using the meta-data, and computes an initial ranking of the application based upon the reputation of the developer.

Abstract: The invention relates to a method for copying data from a source server to a target server, wherein the data is associated with a metadata. The method comprises mapping the metadata of the data to the metadata structure of the target server, where the mapping comprises determining common names for properties being comprised in the metadata; determining if the determined common names exist in the metadata structure of the target server; and if so, copying—together with the data—such properties of the metadata that have matching common names in the metadata structure of the target server. The invention also relates to a hybrid content management system.

Abstract: Systems and techniques of the management of the metadata of a database are presented. A provider is in communication with a database and a set of consumers of the database. Data may be changed by addition, editing or deletion from the database and such changes are recorded and/or maintained by the provider on a list of changes. The changes on this list may be associated with a sync token. The provider may also maintain a list of consumers and associate with each consumer a last sync token which describes when the last sync request and update on the database was made with the consumer. Data which is deleted from the database is recorded with a tombstone. The tombstone is maintained on the list of changes until all consumers have been made aware of the deletion—then the tombstone may be deleted from the list of changes.

Abstract: A method for replaying a simulation workload is provided. The simulation workload identifies a plurality of workload parts. Each workload part is at least a portion of a respective captured workload. In an embodiment, a first workload part is a portion of a first workload executed relative to a first capture database server and a second workload part is a portion of a second workload executed relative to a second capture database server. A portion of the first workload part and a portion of the second workload part may be replayed concurrently.

Abstract: Systems and methods for monitoring, logging, and managing data transformations and data streams of energy management (EM) data energy data sources.

Abstract: User profiles of remote desktops are managed in a crash-consistent manner. When a user logs into a remote desktop, metadata of the user profile is loaded from persistent storage while registry settings and files of the user profile are loaded asynchronously with respect to the login. During the remote desktop session, snapshots of the remote desktop image in persistent storage are generated periodically, and a change log that indicates changes to the user profile is created therefrom. The user profile stored in persistent storage is updated lazily using the change log at opportunistic times after snapshot generation. When the user logs out of the remote desktop, the user profile stored in the persistent storage is updated with any additional changes to the user profile by extracting the changes from the copy-on-write cache associated with the most recent snapshot.

Abstract: The invention relates to a method for controlling state transition of an electronic object in a workflow. The method comprises receiving a request for a state transition for an electronic object from a user; determining the current state of the object from a metadata of the electronic object; determining the next state after the state transition from the request; determining one or more pseudo-users that are allowed to perform a state transition from the current state to the next state; retrieving at least one person identity by utilizing at least one property in a metadata of the electronic object, which person identity is retrieved from a value of a property corresponding to the determined one or more pseudo-users; comparing the identity of the requesting user to the retrieved person identity, and if they match; performing a state transition according to the request.

Abstract: A computer system maintains a repository of software products. The software products include a plurality of business processes, and each business process includes a business object. The system maintains a plurality of archiving objects, and further maintains a mapping of each business process to at least one business object, a mapping of each business object to at least one related database table, and a mapping of each database table to at least one related archiving object. The system receives a selection of a business process for which data is to be archived, and uses the mapping of the each business process to the at least one business object, the mapping of the each business object to the at least one database table, and the mapping of the each database table to the at least one archiving object to determine the database tables to transmit to the archiving objects.

Abstract: In a method for reporting data loaded to a database that does not adhere to referential constraints of the database that are not enforced, a computer receives a file of Data Definition Language (DDL) statements for creating a database. The computer identifies statements from the DDL statements that comprise text indicating the statements are referential constraints that are not to be enforced. The computer converts indentified statements to create view statements. The computer generates a file comprising the create view statements. Create view statements are used to generate database views during database build. The computer generates a file, comprising the received DDL statements without the statements that comprise the text indicating the one or more DDL statements are referential constraints not to be enforced in the database. The computer, responsive to new data being loaded to the database, creates a report comprising data from the database views.

Abstract: A functional description is of a report to be formulated and then run against a database. Report keywords and relationships among the report keywords are extracted from the functional description of the report, using an ontology related to data contained in the database. The report keywords and the relationships among the report keywords are processed or profiled against a data dictionary of the database, such as by performing text mining, to identify particular tables and columns of the database that contain the data needed for the report. The particular tables and columns are a technical description of the report that facilitates formulation of the report. The technical description can also include representative structured query language (SQL) statements and relationships among the identified tables.

Abstract: The system is a database-driven web-application system that includes a task-based data-driven language that provides: strict naming rules for objects in the system specifically designed SQL views of database tables a view-maintenance executable that maintains all of said SQL views and is executed after each change to the databases software functions that implement all accesses to the databases following strict rules and audit procedures executables to perform jobs requested by end-users or on schedules a task system and database for centralizing all user interactions from any source web application that translates the task database into a web-based user interface a set of executables that use the task system to export and import relationally sound data to disconnected formats such as spreadsheets meta-function databases that enable the addition of various functions to each row in the database on an as-needed basis

Abstract: Systems and methods are disclosed for offloading collection of monitored data. A data collector is associated with a plurality of monitored data sources and with a plurality of monitored data recipients. The data collector collects a cycle of monitored data from each of the sources of monitored data and persistently stores each of the cycles of monitored data in a separate monitored data package. The data collector provides the monitored data packages to the associated monitored data recipients in a manner that is asynchronous to the collection of the monitored data.

Abstract: A method and system for streaming dynamically generated Zip archive file content using a standard, non-streaming Zip archive format. In response to a request from a client to receive one or more files, a Zip archive file is dynamically generated that includes at least one file that is altered while servicing the request, wherein the size of the altered file is unknown prior to completion of the alteration operation. For a Zip file entry corresponding to an altered file, a local file header including an overestimated file size and predetermined CRC32 value is generated. After alteration, the file entry content is adjusted using padding and a CRC32 adjustment such that the length and CRC32 values for the resulting Zip file entry match the overestimated file size and predetermined CRC32 value. Examples of file alteration operations include watermarking, compressing, and/or encrypting the file content.

Abstract: A computer-implemented method for determining whether a target text-string is correctly spelled is provided. The target text-string is compared to a corpus to determine a set of contexts which each include an occurrence of the target text-string. Using heuristics, each context of the set is characterized based on occurrences in the corpus of the target text-string and a reference text-string. Contexts are characterized as including a correct spelling of the target text-string, an incorrect spelling of the reference text-string, or including an indeterminate usage of the target text-string. A likelihood that the target text-string is a misspelling of the reference text-string is computed as a function of the quantity of contexts including a correct spelling of the target text-string and the quantity of contexts including an incorrect spelling of a reference text-string. In one application, the target text-string is received in a search query, the search executed following a spell-check.

Abstract: De-duplication of immutable data items at runtime may include identifying a set of potentially duplicate immutable data items in use by one or more applications. The applications may access the immutable data items through pointers of respective objects corresponding to the immutable data items. A de-duplication component executing distinctly from the applications may analyze the identified set of potentially duplicate immutable data items to determine two or more that have identical content and may then modify one or more pointers of the corresponding objects so that at least two of the pointers point to a single immutable data item.

Abstract: Apparatuses, computer readable media, methods, and systems are described for accessing table layout data identifying a plurality of fields included in a table stored in a database, accessing log data identifying a number of times each of the fields of the table has been queried, ranking the fields based on the number of times each of the fields of the table has been queried, determining a first subset of the fields that have not been queried at least a predetermined number of times, and generating an update to the table by removing the first subset of the fields from the table.

Abstract: A cloud computing infrastructure administration system can track use of cloud computing resources by customer, hardware utilization, and geographical location in a unified manner, the cloud may be administered much more efficiently. A cloud computing visualization tool can use the tracked data to provide multiple visualization options to aid in cloud computing management. For instance, usage can be tracked and information displayed on a per-customer, per-machine, per-location, and/or other basis. Thus, administrators can, for example view a particular customer's use of resources regardless of location but also view a location's allocation of resources regardless of customer. The tool can be configured to restrict access by login, and thus customers or other parties other than administrators may view data.

Abstract: Systems and methods are provided for associating structured tags with files in a computer system. In one method, the method includes requesting a user, by the computer system, to provide the structured tag for the file, where the structured tag includes a tag type, a value type, and a tag value. The method can further include receiving the structured tag from the user, associating the structured tag and the file, and storing the association of the structured tag and the file in a non-transitory storage medium.

Abstract: Database processing using columns to present to a processing unit decompressed column data without changing the underlying row-based database architecture. For some embodiments, a database accelerator is used to efficiently process the columns of a database and output tuples to a processing unit's memory, such that the columns can be quickly processed (with the advantages of a column-based architecture) to create tuples of requested data, but without having to depart from a row-based architecture at the processing unit level or having decompressed data scattered throughout the processing unit's memory.

Abstract: Provided are a computer program product, system, and method for restoring objects in a client-server environment. An entry is added to an index for each chunk identifier. Each index entry includes one of the chunk identifiers and a reference to the chunk of data in the target storage from which the chunk identifier was calculated. A request is transmitted to a server recovery agent to recover an object from the storage server. Chunk identifiers of chunks of data in the requested object to recover are received from the server recovery agent. A determination is made from the index of whether the received chunk identifiers for the requested object matches the chunk identifiers indicated in the index. A request is made of the chunks from the server recovery agent for the received chunk identifiers not matching chunk identifiers in the index entries.

Abstract: An existing primary data copy can be maintained on an existing primary front end server node. One or more existing secondary data copies can be maintained on one or more existing secondary front end server nodes to minor the existing primary data copy (such as by making synchronous changes to the secondary data copies). One or more existing backup data copies can be maintained on an existing backend server node to mirror the existing primary data copy (such as by making asynchronous changes to the one or more backup data copies). The existing backend server node can be accessible by one or more of the front end nodes. In response to detecting a failure of the existing primary data copy, one of the one or more secondary data copies can be designated as a new primary data copy in place of the existing primary data copy.

Abstract: An approach is provided in which an equivalence class generator selects a configurable module that includes control points and configuration parameters. The configuration parameters define a parameter state space of the configurable module. The equivalence class generator utilizes the control points to generate equivalence classes, which include class representatives that indicate values for the configuration parameters. Next, one of the class representatives are selected and verified from each of the equivalence classes. In turn, the verification of the class representatives verifies the parameter state space of the configurable module.

Abstract: A synchronization system is described herein that synchronizes resource objects in an order based on their dependency relationships so that a referenced object is available by the time an object that references it is synchronized. Reference attributes present in resources define the dependency relationship among resources. Using these relationships, the system builds a dependency tree and orders synchronization operations for environment reconciliation by precedence so that referential integrity is preserved while still synchronizing reference attributes. The system can deterministically create a change list that guarantees referential integrity, and perform change list processing in parallel. The synchronization system attempts to order the synchronization based on references available to ensure that the system creates and updates dependent resources before their parent resources. Thus, the synchronization system provides a fast, reliable update mechanism for synchronizing two related data environments.

Abstract: Disclosed herein are techniques for archiving data objects. It is determined whether a data object was rejected by an archiving module due to an information field thereof violating a protocol. If it is determined that the data object was rejected due to violation of the protocol, a compliant information field that complies with the protocol is generated such that the compliant information field causes the archiving module to permit archiving of the data object violating the protocol.

Abstract: A transaction is initiated via a transaction begin instruction. During execution of the transaction, the transaction may abort. If the transaction aborts, a determination is made as to the type of transaction. Based on the transaction being a first type of transaction, resuming execution at the transaction begin instruction, and based on the transaction being a second type, resuming execution at an instruction following the transaction begin instruction. Regardless of transaction type, resuming execution includes restoring one or more registers specified in the transaction begin instruction and discarding transactional stores. For one type of transaction, the nonconstrained transaction, the resuming includes storing information in a transaction diagnostic block.

Abstract: A high availability DAS system uses a solid state cache to provide near active-active performance in a DAS duster, while retaining the implementation simplicity of active-passive or dual active system. Each node in the duster may include a solid state cache that stores hot I/O in an active-active mode, which allows the data to be read from or written to the underlying dual-active or active/passive DAS RAID system only when access to the “hot Region” cools down or in the case of Cache Miss. The hot I/O data includes hot read data that accumulated dynamically regardless of ownership of the drives where the hot read data is permanently stored. The hot I/O data also includes hot write data that is mirrored across the solid state cache memories to avoid potential dirty write data conflicts and also to provide High Availability in case of server failures.

Abstract: A TRANSACTION BEGIN instruction and a TRANSACTION END instruction are provided. The TRANSACTION BEGIN instruction causes either a constrained or nonconstrained transaction to be initiated, depending on a field of the instruction. A constrained transaction has one or more restrictions associated therewith, while a nonconstrained transaction is not limited in the manner of a constrained transaction. The TRANSACTION END instruction ends the transaction started by the TRANSACTION BEGIN instruction.

Abstract: A database management system can receive, from a user interface, a first data object, a second data object, and a relationship relating the first data object and the second data object. The system can determine, based on a database schema, that a database table does not exist for the first data object, the second data object, and the relationship. The system can create a database table having a first data field for the first data object, a second data field for the second data object, and the relationship. The system can then store the first data object and the second data object in the created table according to the relationship.

Abstract: Processing of transactions within a computing environment is facilitated by taking actions to increase the chances of successfully executing a transaction. A counter is maintained that provides a count of how often a transaction has aborted. The counter increments the count each time the transaction is aborted, and it is reset to zero upon successful completion of the transaction or an interruption leading to no more re-executions of the transaction. If the count reaches a threshold value, then an interrupt is presented and transaction execution is unsuccessful. However, before the count reaches the threshold, a number of actions may be taken to increase the chances of successfully executing the transaction. These actions include actions to be performed within the processor executing the transaction, and/or actions to be performed against conflicting processors.

Abstract: Digital objects within a fixed-content storage cluster use a page mapping table and a hash-to-UID table to store a representation of each object. For each object stored within the cluster, a record in the hash-to-UID table stores the object's hash value and its unique identifier (or portions thereof). To detect a duplicate of an object, a portion of its hash value is used as a key into the page mapping table. The page mapping table indicates a node holding a hash-to-UID table indicating currently stored objects in a particular page range. Finding the same hash value but with a different unique identifier in the table indicates that a duplicate of an object exists. Portions of the hash value and unique identifier may be used in the hash-to-UID table. Unneeded duplicate objects are deleted by copying their metadata to a manifest and then redirecting their unique identifiers to point at the manifest.

Abstract: A plurality of operations are executed on tables of a database with at least a portion of the operations being executed in parallel. A constraint check is performed for each operation subsequent to its execution to determine whether data stored in the database affected by the operation is valid, during this constraint checking additional operations and/or constraint checks on the same table are allowed to run in parallel. Based on this constraint checking, operations for which the constraint check determines that the data is not valid are invalidated. Related apparatus, systems, techniques and articles are also described.

Abstract: Methods and systems for utilizing a database are disclosed. The methods and systems determine a key representative of a storage location of first RDF data in a NoSQL database. In addition, the methods and systems read the first RDF data in the NoSQL database using the key. The methods and systems also write second RDF data derived from the first RDF data into a second database stored in memory. The methods and systems may also modify the second RDF data, and write third RDF data derived from the modified second RDF data into the NoSQL database.

Abstract: Embodiments associated with configurable, repeatable, data generation are described. One example method includes manipulating a redundancy parameter that controls data redundancy in binary large objects (BLOBs) to be included in a generated data set. The redundancy parameters may control variations in repeatable variable length sequences included in BLOBs. The example method also includes manipulating a parameter(s) that controls custom designed sequences included in BLOBs. With the redundancy and custom designed sequences described, the example method then generates BLOBs based, at least in part, on the redundancy parameters and the custom-designed sequences. BLOBs may include byte sequences repeated at different frequencies and configurable user-designed sequences. Manipulating the redundancy parameter, manipulating the custom-designed sequences, generating the BLOBs, and providing the BLOBS may be performed by separate processes acting in parallel.

Abstract: A computer-implemented method for processing data in a database using a data cube is discussed and involves interacting with a user of a computing device, using a computer application, to obtain meta data about a database and obtain user-defined selections of options concerning the database; creating a data cube definition by using the selected options to identify characteristics of columns in the database; publishing to an OLAP engine a definition of a data cube that corresponds to the data base; generating a simplified flat-file model of the data in the data cube; and providing the simplified flat-file model in a form that can be reviewed and directly manipulated by the user.

Abstract: Calendar repair using a standard message may be provided. Calendar events, such as appointments and meetings, may be created and copied to a plurality of attendee calendars. A first copy of the event may be compared to a second copy of the event to determine whether properties between the events are out-of-sync. If so, a standard meeting request message comprising the correct value may be sent to update the out-of-sync property.

Abstract: Electronic-based systems and methods for enhancing a user's experience when shopping for components of a mechanical or electrical device or apparatus, which include downloadable software (i.e., a mobile device application) that provides access to component information/data using the mobile device, in particular component information/data provided by a manufacturer from its personal database, electronic devices that include such software, and methods of accessing the component information and optionally, acting upon the information to order the component.

Abstract: Convenient approach for managing records with respect to entities based on file plans. In an embodiment, historical data representing policies previously selected is maintained. The historical data is then used to generate custom file plans containing policies most likely to be used by a corresponding user. A list in such custom file plan may have more relevant policies prioritized higher. A user may thus conveniently select a desired policy, and associate the selected policy with a set of entities to cause the selected policies to be applied against management of the set of entities.

Abstract: The subject disclosure is directed towards defragmenting one or more ranges of a database index based upon actual usage statistics and policy. A range tracker tracks and uses statistics corresponding to actual I/O operations to determine whether the benefit of defragmenting a range sufficiently (based upon the policy) exceeds its cost. If so, the online range defragmenter automatically defragments the range in an online manner. The range tracker may be configurable to monitor less than all ranges of the index.

Abstract: The present invention relates to data cleansing, and in particular performing the semantic standardization process within a database before the transform portion of the extract-transform-load (ETL) process. Provided are a method, system and computer program product for standardizing data within a database engine, configuring the standardization function to determine at least one standardized value for at least one data value by applying the standardization table in a context of at least one data value, receiving a database query identifying the standardization function, at least one database value and the context of the data, and invoking the standardization function.

Abstract: A system and method for just in time compilation for hash table probing are disclosed. In one implementation, the method of using just-in-time compilation is used to combine the stages of hash value computation and initial lookup into a single compound operation. In another implementation, the method of using just-in-time compilation is used to combine the stages of a hash table record and input record checking to detect if these records are equal, and if not, fetching the next possible record in the linked list of the per-bucket records.

Abstract: Systems and methods are disclosed for creating a read-access log. A business application may send a request for data to a backend system using a communication protocol. At the backend system, the request may be observed and a determination made as to whether the request for data is log-relevant. The determination may be based on a log configuration record associated with the business application making the request. A record may be written in a read-access log when it is determined that the request for data is log-relevant. The log record may include information used to map entity information from the retrieved data to a semantic entity.

Abstract: Embodiments are directed to, for a database comprising a set of transactions, with each transaction including an itemset comprising one or more individual items, obtaining a set of all closed frequent itemsets by checking frequencies of transaction sets, wherein a given itemset, I, is frequent where at least some threshold number (?) of transactions contain I, and wherein the given itemset I is closed wherein it is impossible to add any item to I without changing the frequency thereof.

Abstract: A data lineage tracking system may include a memory storing a module comprising machine readable instructions to obtain trace log entries representing an interaction with, a manipulation of, and/or a creation of a data value. The data lineage tracking system may further include machine readable instructions to select the trace log entries that are associated with commands performed by an application, cluster similar trace log entries from the selected trace log entries, and analyze mappings between the clustered trace log entries to determine data lineage flow associated with the data value.

Abstract: A rating system provides a mechanism whereby users can submit objects to be rated (ROs), and whereby users can submit ratings (ARs) regarding the ROs of other users. In a first novel aspect, each AR is multiplied by a weighting factor to determine a corresponding effective rating (ER). The weighting factor that is used to determine an ER from an AR is a function of the reputation RPT of the user who submitted the AR. In a second novel aspect, the weighting factor is also a function of a crowd voting probability value PT. In a third novel aspect, the weighting factor is also a function of the freshness RF of the AR. In a fourth novel aspect, a decay value D is employed in determining a user's reputation. ERs are used to determine a ranking of ROs. User reputation is used to determine a ranking of users.

Abstract: Parallel certification of transactions on shared data stored in database partitions included in an approximate database partitioning arrangement may be initiated, based on initiating a plurality of certification algorithm executions in parallel, and providing a sequential certifier effect. Logging operations associated with a plurality of log partitions configured to store transaction objects associated with each respective transaction may be initiated, each respective database partition included in the approximate database partitioning being associated with one or more of the log partitions. A scheduler may assign each of the transactions to a selected one of the certification algorithm executions.