Abstract: The present invention is directed to a system and process for electronic paper file generation from a report format and metafile such that a user may readily navigate the report objects within an enhanced electronic paper file. An electronic paper file is created based on a selected data source and report format. The initial electronic paper file is parsed and a metafile including identifier and position information for report objects contained therein is created. The metafile is parsed to generate the relationships between the report objects and a data tree representing the relationships is created. The relationship information is parsed and internal links to related report objects are created, facilitating navigation among the report objects.

Abstract: An information processing device, comprises: a link information obtaining part that obtains link information to a file corresponding to a selected web content in response to detecting a select of at least one of web contents from a first contents screen on which the web contents obtained from a first storage server are laid out; a storage information obtaining part that obtains storage information of a second storage server corresponding to a designated display area in response to detecting a designating operation of the display area of the web content on a second contents screen after the link information is obtained; a file obtaining part that obtains the file corresponding to the selected web content from the first storage server based on the link information; and a file transmitting part that sends the file obtained by the file obtaining part to the second storage server based on the storage information.

Abstract: Techniques for utilizing flash storage as an extension of hard disk (HDD) storage are provided. In one embodiment, a computer system stores a subset of blocks of a logical file in a first physical file, associated with a first data structure that represents a filesystem object, on flash storage and a subset of blocks, associated with a second data structure that represents a filesystem object comprising tiering configuration information that includes an identifier of the first physical file, in a second physical file on HDD storage. The computer system processes an I/O request directed to the logical file by directing it to either the physical file on the flash storage or the HDD storage by verifying that the tiering configuration information exists in the data structure and determining whether the one or more blocks are part of the first subset of blocks or the second subset of blocks.

Abstract: A system and method of optimizing the performance of an information handling system is disclosed herein. One or more data samples are generated by identifying one or more files accessed during the user application experience while in a sampling interval. An identifier and access frequency for each of the identified files are stored in a data sample. One or more data samples are merged into a merged data sample. A compression ratio is calculated for each of the identified files. One or more of the files identified in the merged data sample are selected for uncompression. The files selected for uncompression are uncompressed.

Abstract: A content alignment system according to certain embodiments aligns a sliding window at the beginning of a data segment. The content alignment system performs a block alignment function on the data within the sliding window. A deduplication block is established if the output of the block alignment function meets a predetermined criteria. At least part of a gap is established if the output of the block alignment function does not meet the predetermined criteria. The predetermined criteria is changed if a threshold number of outputs fail to meet the predetermined criteria.

Abstract: Techniques and mechanisms described herein facilitate the transmission of a data stream to a networked storage system. According to various embodiments, a determination may be made as to whether an amount of available computing resources at a client device meets or exceeds a computing resource availability threshold at the client device. A processing operation on a data stream may be performed at the client device to produce a pre-processed data stream when the amount of available computing resources meets or exceeds the computing resource availability threshold. The pre-processed data stream may be transmitted to a networked storage system for storage via a network. The networked storage system may be operable to store deduplicated data for retrieval via the network.

Abstract: As information becomes more accessible to the public, the ability to predict and estimate sensitive data from the data already available to the general public becomes easier. The existing privacy-preserving data mining approaches only consider the information the user is querying and do not consider the information the user already has, and how the user can use that information in combination with the query information to create sensitive data that the user should not have access to. Some embodiments of the present invention provide a query analysis (QA) program that solves the aforementioned problem by taking into account data that a user may already have, whether it is private data or data that is available to the public, and then using that data, along with the data that would be returned in the query, to determine if sensitive data could be recreated.

Abstract: Disclosed herein are systems and methods of facilities location, in which a customer activates an application and that application determines, from the GPS device, a location and the locations of the various cables or equipment buried in their yard. The customer may mark the service location using the supplied information on the device application. In an example embodiment, if the customer has further questions, he may call into the center, for example, by pressing a voice button, to talk to a person regarding the questions. In this embodiment, a two way communication is enabled to provide the customer with additional assistance in locating the facilities.

Abstract: A method of operating a vehicle navigation system includes enabling a user to enter and store in the system a destination address in association with a name and/or telephone number. The user is enabled to enter the name and/or telephone number in free form and without format restrictions. The user is enabled to later retrieve the destination address based on the name and/or telephone number being used as a search term.

Abstract: A method and a device for providing reference information for a scan protocol are provided. The method includes: obtaining first basic information and a first pilot image of a patient to be scanned as index information; retrieving a second pilot image that matches the index information from a preset scan protocol database; and outputting a second pilot image, and a second reconstructed image and a second scan protocol in the preset scan protocol database which correspond to the second pilot image as reference information. If the second pilot image matches the index information, the physical condition of a scanned patient corresponding to the second pilot image is similar to that of the patient to be scanned, and the second pilot image, and the second reconstructed image and the second scan protocol in the preset scan protocol database which correspond to the second pilot image are outputted as reference information.

Abstract: Systems and methods for performing dimension widening on a data element are provided. A described method includes receiving a set of dimension widening rules, and receiving a data element having one or more dimensions. The method further includes determining if any of the dimension widening rules are applicable to the data element. The data element may be stored in either a first database or second database based on a result of the determination. Data elements stored in the first database may be processed by applying the dimension widening rules to the data elements.

Abstract: Provided are methods and systems for implementing a distributed database in a data network. The method comprises receiving node data associated with one or more nodes of a plurality of nodes, updating the distributed database and replicating the distributed database to each of the plurality of nodes. The plurality of nodes comprises one or more cluster device, a cluster master, a traffic classification engine, a service node, and an orchestrator. The node data comprises node health, a number of total connections, node processing unit utilization, node memory status, destination server address, destination server capacity, destination server network connectivity, node dynamic state, node responsiveness. The distributed database comprises tables containing traffic map, node health information, traffic classification mapping, and service policy.

Abstract: Techniques for activity information schema discovery, schema change detection, and notification. In one embodiment, for example, a computer-implemented method for activity information schema discovery and schema change detection and notification comprises: analyzing a first set of related activity messages obtained during a first sample period; determining first schema counters for uniquely named properties identified in the first set of messages based on the analyzing of the first set of activity messages; after the first sample period, inferring a first schema from the first schema counters; analyzing a second set of related activity messages obtained during a second sample period; determining second schema counters for uniquely named properties identified in the second set of messages based on the analyzing of the second set of activity messages; after the second sample period, inferring a second schema from the second schema counters; comparing the first schema and the second schema for any differences.

Abstract: Deleting a data record from the second level storage or main store is disclosed. A look-up is performed for the data record in the first level storage, where the data record is defined by a row identifier. If the row identifier is found in the first level storage, a look-up is performed for an updated row identifier representing an update of the data record in the second level storage and the main store, the update of the data record being defined by an updated row identifier. If the updated row identifier is found in the second level storage, an undo log is generated from the first level storage to invalidate a row identifier of the row identifier. A flag is generated representing an invalid updated row identifier, and a redo log is generated to restore the data record in the first level storage.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate parameters and utilizing formulas used for the delinking decisions.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for providing a team object in association with an object. These mechanisms and methods for providing a team object in association with an object can allow for centralized management of a team in association with an object. For example, members of the team may be automatically identified (e.g. without manual intervention) for receiving notifications in association with an object.

Abstract: Methods, systems, and computer-readable media of columnar storage of a database index are disclosed. A particular columnar index includes a column store that stores rows of the columnar index in a column-wise fashion and a delta store that stores rows of the columnar index in a row-wise fashion. The column store also includes an absence flag array. The absence flag array includes entries that indicate whether certain rows have been logically deleted from the column store.

Abstract: Systems and related methods utilizing one or more mote-related content indexes.

Abstract: The rendering of hierarchical data having large number of nodes, such as organizational charts, can present challenges based upon the browser technology utilized. Rendering of thousands of nodes can be memory intensive and provide poor performance when rendered in a browser. A method of rendering hierarchical data in a browser is provided. Node data from a datastore associated with human resources management software is retrieved. Each item of node data is associated with an employee of the associated organization. A viewport for the hierarchical data structure is determined based upon the computing device used for viewing the hierarchical data structure. Coordinates for nodes in the hierarchical structure based upon their relative position in the hierarchy and a configuration of the view port can then be determined and rendered.

Abstract: A data coordination support apparatus is provided to efficiently detect between which table and a table being a coordination destination there is a reference relation, in data coordination. The data coordination support apparatus identifies, with respect to each table other than the table being the coordination destination, a first column designated as the primary key and a second column not designated as the primary key, from a plurality of columns included in a table concerned. The data coordination support apparatus extracts such a table that a third column similar to the first column is included in the table being the coordination destination, and a fourth column similar to the second column is included the table being the coordination destination, from tables other than the table being the coordination destination.

Abstract: A system for executing a plurality of transactions comprises a first processor and a memory. The first processor is configured to execute a first transaction comprising: providing a plurality of indications to make a plurality of first changes to a plurality of first records of a database; and committing the first transaction by updating the status of the first transaction in a transaction table while not providing an indication to update the status of the first records from pending. The memory is coupled to the first processor and configured to store the transaction table.

Abstract: A method of verifying data integrity comprising, storing data in a data storage system, scheduling an integrity check of at least a portion the data, wherein, scheduling the integrity check comprises determining when to perform the integrity check by accounting for a load on the storage system and taking into account any previous integrity checks of the at least a portion of the data. The method further comprises one of creating and updating an integrity status of the at least a portion of the data, with the integrity status comprising a reference to when the any previous integrity checks were performed on the at least a portion of the data and the integrity check was performed on the at least a portion of the data. The method further comprises providing the integrity status to a storage system user.

Abstract: An apparatus for data configuration and manipulation is provided. The apparatus may include a receiver. The receiver may be configured to receive a trigger. The trigger may include a field, a qualifier and a value. The receiver may also be configured to receive an executable. The executable may include an action, a parameter and a location. The apparatus may include a database. The database may include a plurality of transactions. The apparatus may include a processor. The processor may be configured to determine, using the trigger, from among the plurality of transactions, all relevant transactions. Each relevant transaction may be selected because the relevant transaction includes the value qualified by the qualifier. The processor may also be configured to alter each relevant transaction by executing the executable, wherein the parameter may be passed to the actions, and the actions may be executed in the location of each relevant transaction.

Abstract: 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.

Abstract: A method, article of manufacture, and apparatus for managing a computing environment, such as a cloud data repository. In some embodiments, this includes modifying an object or a component of an object at runtime and storing the modified object or modified component of an object in a storage device. In some embodiments, the component of an object modified may include traits. In some embodiments, objects or traits may have more than one version.

Abstract: A system and method of logless atomic data movement. An internal transaction is started within a multi-level storage architecture, the internal transaction to merge data from the first level storage structure to the second level storage structure. Committed data is read from a first level storage structure of the multi-level storage architecture as specified by the internal transaction. The committed data from the first level storage structure is inserted into a second level storage structure in a bulk insertion process, and the committed data is marked as being deleted from the first level storage. The internal transaction is then committed to the multi-level storage architecture when the committed data has been inserted into the second level storage structure.

Abstract: Concepts and technologies are disclosed herein for managing a distributed database. A data management application can obtain a query. The data management application can analyze the query to determine a number of data structures relevant to the query. The data management application also can analyze data stores storing the data structures and move or assign data structures to other data stores within a distributed database. The movement of the data structures within the distributed database can be based upon greedy algorithms for moving data and/or executing queries.

Abstract: Systems, methods, and computer program products to tag objects in a cloud computing environment, by tagging an object with a first tag, of a plurality of tags, wherein each of the plurality of tags specifies a respective criterion for objects tagged by each tag, and upon determining that the object not satisfy the criterion of the first tag, performing an action associated with the first tag to modify the object to meet the criterion of the first tag.

Abstract: Methods to tag objects in a cloud computing environment, by tagging an object with a first tag, of a plurality of tags, wherein each of the plurality of tags specifies a respective criterion for objects tagged by each tag, and upon determining that the object not satisfy the criterion of the first tag, performing an action associated with the first tag to modify the object to meet the criterion of the first tag.

Abstract: A method used to authenticate an item using an identification tag is provided. At the time of manufacture, the tags are created with various hardware attributes (HA), including a unique identifier (UID); and encoded with a signature of a message that includes a URL, and optionally a serial number associated with a product to which the tag is to be attached. The URL embeds various data such as one or more of the HAs, a serial number, etc., which can be used to verify the authenticity of the tag when verifying the signature. When a tag is read, the message including the URL is recovered and the signature is verified by the processor of the reader. This can be done to ensure that the URL in the message is one designated by the signer. The data in the signature can then be used to verify the authenticity of the tag and/or to detect tampering. The results of the verification can also be displayed to a user, e.g., using an available display on the electronic device including or otherwise acting as the tag reader.

Abstract: The present invention relates to an apparatus and method for executing a query, and a system for processing data by using the same. Provided is an apparatus for executing a query including: a processor receiving a query and returning a result value; and a storage storing data on the query, wherein the storage includes: a first storage temporarily storing data required for the execution of the query; and a second storage constructing a DB and storing data, and wherein the processor combines a plurality of primitives in the query to configure a composite primitive, generates a binary code for the composite primitive in run time, and executes a generated code.

Abstract: Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for providing content. A set of k requests is identified, each request being associated with a request for content. Candidate content items are identified for one or more of the requests in the set. Identified candidate content items are ranked based at least in part on their respective associated bids, expected value or long-term value. Top K candidate content items are determined based on the ranking. A price is assigned to each of the top K candidate content items based on the ranking and the associated bids. One or more of the top K candidate content items are provided responsive to the requests in the set.

Abstract: Receiving a search request by a computer. Parsing text-based search terms from the search request. Searching documents in a document index based on the text-based search terms. Transmitting to a user device a list of documents identified by the search. Receiving, from the user device, a selection of one of the identified documents. Parsing executable-based search terms from the search request. Identifying content defining an executable in the selected document. Forming a display element from the executable. Identifying and associating variable names and variable values in the search query with variable names and variable values in the executable. Forming a statement to solve from the search query. Solving the statement to solve. Substituting the variable values and the statement solution for corresponding variable names in the display element. Embedding the display element in the selected document, and transmitting the selected document with the embedded display element to the user device.

Abstract: A method for joining records from database tables is proposed. Join attributes are ordered into a sequence S0, and a scope C is initialized to empty. Tables including a join attribute A that is first in S0 are identified. A new sequence S? omits A from S0. Iteration through each identified table proceeds in join attribute A order. The iteration utilizes a tree index structure for each identified table where the index key includes all join attributes in the identified table in S0 order. For each matched value v of the join attribute located during the iterating, a new scope Cv is created by appending “A=v” to the scope C. If S? is empty, a tuple corresponding to the scope Cv is output. Otherwise, S0 is set to S? and for each scope Cv, C is set to Cv and the steps beginning with the identifying step are recursively invoked.

Abstract: A method is provided for compressing results of a join query. A join order of a result set is determined from the join query, where the result set includes a plurality of tuples. A plurality of dictionary entries for the result set is received. A nested hierarchy of dictionaries is created based on the join order and the dictionary entries. A plurality of encoded tuples is received. The nested hierarchy of dictionaries is used by a processor to decode the plurality of encoded tuples so as to produce the plurality of tuples of the result set.

Abstract: Systems and methods for providing animal information related to at least one animal may sense, with at least one sensor of at least one device on the animal or in the animal's environment, information related to the animal. At least one device processor may automatically transform the sensed information into descriptive information describing a condition of the animal or related to the animal. The at least one device processor and/or at least one remote processor in communication with the at least one device processor may compare the descriptive information to known information relevant to the condition. The at least one device processor and/or at least one mobile device in communication with the at least one device processor may report information about the animal utilizing the descriptive information and the database information.

Abstract: Partitioning of temporal databases can implement distributed storage of temporal data via time-based or space-based techniques to improve performance of operators on the database. A variety of operators can be supported for the partitioned tables, including temporal aggregation, time travel, and temporal join. The use of checkpoints can greatly increase performance in a variety of scenarios. The described partitioning techniques can be applied in a parallel execution context to great benefit. The partitioning can also reduce local memory footprint, facilitating in-memory database processing.

Abstract: Method to display the status of tags applied to objects in a cloud computing environment, by comparing an attribute of an object to a criterion of a tag applied to the object, wherein the object is part of the cloud computing environment, and outputting for display a graphical representation of the tag, wherein the graphical representation comprises a text of the tag and an indication of a result of the comparison.

Abstract: In embodiments of customized and automated dynamic infographics, an infographic template is received at a cloud-based service from a computing device, where a user at the computing device creates the infographic template in a graphics application to display data obtained from data sources. The cloud-based service assigns an identifier to associate the infographic template and the data sources of the data, and posts the infographic template making it available for cloud-based access by other computing devices that request to display the posted infographic template. The cloud-based service can receive a request from one of the computing devices to update the displayed data, and then query the data sources for current data, where the query is based on the identifier that is associated with the posted infographic template. The cloud-based service can then transform the current data to generate updated data, and update the posted infographic template with the updated data.

Abstract: A method determines the connectivity components defined by a set of relations over a set of data elements. For each first data element of a selected subset of data elements, a second data element that is linked to the first data element by a path of relations is selected as its representative, using a randomization process. A new set of relations is created by replacing each first data element of the subset by its representative in at least part of the set of relations.

Abstract: Providing messages for Java message service (JMS) is disclosed. A described method includes determining timestamp information associated with a first Java™ message service (JMS) message. The timestamp information represents a time when the JMS message is either generated or received by a processing device. The method also includes determining destination information associated with the JMS message. The method further includes converting the JMS message into a first key-value data pair having a key data and a value data. The key data includes the timestamp information and the value data includes the destination information of the first JMS message.

Abstract: A method and system are provided for the transfer and/or aggregation of data and, in particular, integrating data used in managing a professional services practice. The invention preferably transfers and/or aggregates data relating to the identity of clients and matters for whom professional services are being rendered with data relating to the work which data may be maintained in inconsistent, proprietary formats, comprising one or more of the following types of information: accounting; budgeting; docketing; time and billing: work product; word processing; records; project management; and/or other information relating to the professional services. The system of the present invention preferably comprises data storage and data processing means adapted to use the data in substantially portable and/or application-independent format, and/or and transfer or aggregate data between common, and/or proprietary data formats.

Abstract: Disclosed are various embodiments for synchronizing application state information across devices. More specifically, embodiments of the disclosure are related to resolving conflicts between application state information. A synchronization rule, an event name and/or event value are embedded within application state information obtained from devices associated with a user, from which conflicts can be resolved by an application synchronization service.

Abstract: Systems and methods are disclosed for backing up a computer with a distributed meta data store by splitting meta data from file data; storing the meta data for each file in a separate file; mapping the file data and meta data to an arbitrary file system; and reconstructing files for the arbitrary file system.

Abstract: Responsive to an instruction to collapse a derivative version of an ancestor data volume into the ancestor data volume, it is determined if a characteristic of the derivative version of the ancestor data volume satisfies a criteria relative to a characteristic of the ancestor data volume. If the characteristic of the derivative version satisfies the criteria, the ancestor data volume is merged into the derivative version of the underlying data to form an updated derivative version. The updated derivative version is established as the ancestor data volume.

Abstract: Embodiments disclosed herein relate to systems, methods, and computer program products for transforming an unstructured database into a structured database. In some embodiments, the system and method imports an unstructured database comprising entities and a hierarchy associated with the entities. The system and method analyze the unstructured database, flatten the database so that a recursive database is converted into a database that fully expands all entities into lower levels, and identifies instances of unbalanced or ragged hierarchies. The system populates the database according to predetermined rules to address the unbalanced or ragged hierarchies and outputs a structured database that can be used for accurate analysis of the hierarchy and entities stored therein, such as corporate structure hierarchies or stock inventory hierarchies.

Abstract: Aspects of the subject technology relate to a system that analyzes customers' AMI load curves, identifies evening peak users as defined by their load curves, and provides Energy Efficiency (EE) advice related to their periods of high use. For example, identified high evening users can be sent an email with normative comparisons on evening load use, along with tips to reduce energy usage. Other aspects relate to additional targets/communications. Aspects of the subject technology relate to categorizing a user's energy consumption tendencies based on a user's load curve and providing customized content based on the user's category. By taking into consideration the user's actual energy consumption patterns, the system may be able to provide more relevant content to the user.

Abstract: A method includes receiving a request from a user device executing a native application. The request indicates an accessed state of the native application to which the native application is set. The method includes identifying one or more categories of the accessed state of the native application and recommended application resource identifiers based on features of the accessed state. Each of the recommended application resource identifiers references a different state of a native application, When a native application is selected by the user, the method includes setting the native application to the different state. For each of the application resource identifiers, the method includes identifying one or more recommended categories of the state referenced by the recommended application resource identifier and determining whether to recommend the different state referenced by the recommended application resource identifier based on features of the accessed state and features of the state of the application.

Abstract: Methods are provided for clustering events. Data is received at an extraction engine from managed infrastructure. Events are converted into alerts and the alerts mapped to a matrix M. One or more common steps are determined from the events and clusters of events are produced relating to the alerts and or events.

Abstract: A method is disclosed for characterizing a first data set of digital values and a second data set of digital values. The method includes determining a first similarity measure indicating a similarity of the digital values within the first data set; determining a second similarity measure indicating a similarity of the digital values within the second data set; determining a correlation value on the basis of the first data set and the second data set; and electronically outputting the correlation value, the first similarity measure and the second similarity measure.