Abstract: Techniques described herein relate to a method for performing data protection of file system data on a host. The method includes identifying, by a data protection agent, a backup access event associated with a backup of a file system stored on a backup storage; in response to identifying the backup access event: obtaining backup metadata associated with the backup from a data protection manager; generating a placeholder file system using the backup metadata and storing the placeholder file in a virtual hard disk file; and performing backup access services using the placeholder file and the backup metadata to facilitate transfer of file system data of the backup to an application associated with the backup.

Abstract: Introduced here are approaches to determining causal relationships in mixed datasets containing data related to continuous variables and discrete variables. To accomplish this, a marketing insight and intelligence platform may employ a multi-phase approach in which dependency is established before the data related to continuous variables is discretized. Such an approach ensures that information regarding dependence is not lost through discretization.

Abstract: Introduced here are approaches to determining causal relationships in mixed datasets containing data related to continuous variables and discrete variables. To accomplish this, a marketing insight and intelligence platform may employ a multi-phase approach in which dependency is established before the data related to continuous variables is discretized. Such an approach ensures that information regarding dependence is not lost through discretization.

Abstract: To improve the technological process of programming a computer using a dynamic programming language, generate a first portion of training data which maps types in the dynamic programming language to corresponding functions and methods by performing information retrieval on documentation libraries in the dynamic programming language and/or generate a second portion of training data which maps program variables to the corresponding functions and methods by performing data flow analysis on a plurality of pre-existing programs written in the dynamic programming language. Train a neural network on the first and/or second portions of training data to infer unknown types in the dynamic programming language. Carry out inference with the trained neural network to infer the unknown types. Facilitate programming in the dynamic programming language based on the inferred unknown types. Optionally, execute a resulting program.

Abstract: A data store system includes a storage device and a processor in communication with the storage device. The processor may receive data from a source and generate a plurality of rows from the data. The processor may further apply row reduction criteria to the buffered plurality of rows. The processor may further, in response to application of the row reduction criteria, determine at least one resultant row. A number of the at least one resultant row is less than a number of the plurality of rows. The processor may further store the at least one resultant row in the storage device. A method and computer-readable medium is also disclosed.

Abstract: A method estimates counts of distinct items. A system allocates a matrix B in memory and receives a data stream including many data items. Each item includes a set of query fields and a set of identifier fields. For each item, the system computes a row for the data item by hashing data values of the identifier fields. The system also computes a column for the data item by hashing a combination of data values of the query fields and the row. The system computes a bin value for the item by hashing data values of the identifier fields. The system updates the matrix B by computing B[r,c]=max(v, B[r,c]). Subsequently, the system receives a query key value. For each row in the matrix B, the system computes a column, and estimates the number of data items from the data stream matching the query key.

Abstract: Disclosed are an apparatus and method of performing a data file migration to a cloud source. One example method of operation may include establishing via a transmitter an application programming interface (API) connection to an enterprise network, identifying via a processor one or more present allocation parameters being utilized by one or more virtual machines operating on the enterprise network. The method may also provide requesting via the transmitter a directory file structure and identifying via the processor at least one data file for data migration to a remote cloud storage server based on predetermined criteria.

Abstract: Embodiments of the present invention relate to the database field, and in particular, to a data transmission method and apparatus, so as to reduce overheads for data transmission between nodes in a distributed database and lighten network load. In the embodiments of the present invention, a DN determines a column that has a distribution rule of parameters in the column; the DN determines, according to a data type of the parameters of the column and the distribution rule of the parameters in the column, a compression algorithm corresponding to the column; the DN compresses the column using the compression algorithm; and the DN sends a compressed column to a target node. In this way, the overheads for the data transmission between the nodes are reduced, and the network load is lightened.

Abstract: A computer-implemented method for indexing metadata which corresponds to data stored in a storage system, according to one embodiment, includes: identifying a subset of metadata stored in a first data store to archive in response to determining that an amount of metadata stored in the first data store has reached a threshold, identifying an index for storing information about the subset of the metadata, executing a sort operation on the subset of the metadata, generating index information corresponding to the subset of the metadata, writing the subset of the metadata to an archive medium, and recording the index information in the identified index. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: In one aspect, a method includes storing a database on a storage array, determining a plurality of most used values in the database, forming a table using the plurality of most used values and compressing data in the database according to the table. In another aspect, an apparatus includes electronic hardware circuitry configured to store a database on a storage array, determine a plurality of most used values in the database, form a table using the plurality of most used values and compress data in the database according to the table. In a further aspect, an article includes a computer-readable medium that stores computer-executable instructions. The instructions cause a machine to store a database on a storage array, determine a plurality of most used values in the database, form a table using the plurality of most used values and compress data in the database according to the table.

Abstract: A data compression apparatus generates a global symbol table for an overlapping data using a part of the entire data to be compressed and a local symbol table that is not overlapped with the global symbol table and compressing data with a block as a unit. The apparatus increase compression efficiency.

Abstract: A bloom filter is generated for efficient query processing for unsorted data in a column of a columnar database. Bloom filters represented as bitmaps are generated for data blocks storing data for a column of a columnar database table. An indication of a query directed toward the column is received and the bloom filter for each data block is examined to determine which ones of the data blocks do not need to be read in order to service the query for the select data. Data is then read from the data blocks storing data for the column excepting the ones which do not need to be read.

Abstract: A computer-implemented method for archiving files in distributed replication environments may include 1) identifying a distributed file system replication environment, the distributed file system replication environment including a plurality of computing systems configured to replicate changes made to files within each computing system in the plurality of computing system to each other computing system in the plurality of computing systems, 2) identifying a request to archive a file located on a computing system within the distributed file system replication environment, and, in response to the request 3) identifying a virtual storage layer mapped to a location of the file and 4) archiving the file by creating a placeholder file for the file in the virtual storage layer mapped to a location of the file on the computing system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed is a system allowing to query data warehouses using SPARQL. An aspect of the system may support the representation of multidimensional data as virtual graphs. Another aspect of the system may provide mapping of SPARQL queries directed against multidimensional data vis-à-vis the graphs to native queries directed against the multidimensional data. Responses from the native queries may then be translated to a SPARQL response format.

Abstract: Information point having a provider for providing a data structure having entries about different objects, wherein a limited geographical area is associated to every object, and wherein object information is associated to every object, a determiner for determining a geographical position of the information point, an examiner for examining whether the geographical position of the information point lies in the geographical area associated to an object, and a provider for providing object information associated to an object, if the examiner has determined that the information point lies in the geographical area of the object.

Abstract: A computer executed method of exploiting correlations between original and desired data sequences during run generation comprises, with a processor, adding a number of data values from a data source to a first memory device, the first memory device defining a workspace, determining whether the data values within the workspace should be output in ascending or descending order for a number of runs, and writing a number of the data values as a run to a second memory device in the determined order.

Abstract: A method, apparatus, and computer program product for assigning data to columnar storage is disclosed. In one aspect of the invention, a computer implemented method is provided comprising analyzing, on one or more computers, a database stored in a storage system accessible from the one or more computers. The method also comprises determining, on one or more computers, one or more database elements from the database to be assigned to a columnar storage in the database and assigning, on one or more computers, the one or more database elements to the columnar storage in the database. The one or more database elements to be assigned to the columnar storage is determined based on at least one of a table dimension, entity relationship, compatibility with a specified schema structure, relational data structure of the database, access statistics of the database element or incoming query workload of the database element.

Abstract: Disclosed is a system allowing to query data warehouses using SPARQL. An aspect of the system may support the representation of multidimensional data as virtual graphs. Another aspect of the system may provide mapping of SPARQL queries directed against multidimensional data vis-à-vis the graphs to native queries directed against the multidimensional data. Responses from the native queries may then be translated to a SPARQL response format.

Abstract: A method for creating a data warehousing scheme having optimally selected components. A mathematical model of a goal for the data warehousing scheme is input into an optimization engine. At least one constraint on the data warehousing scheme is input into the optimization engine. A mathematical optimization algorithm is performed using the optimization engine, wherein an output of the optimization engine is an optimized data warehousing scheme having optimally selected components. The optimized data warehousing scheme can be stored.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to arbitrating polling results and provide a novel and non-obvious method, system and computer program product for collaborative arbitration of polling results in a collaborative environment. In an embodiment of the invention, a method for collaborative arbitration of polling results in a collaborative environment can be provided. The method can include placing a poll within a message and sending the message to a select group of collaborators in the collaborative environment. The method further can include receiving poll results from a collaborator in the select group in a reply to the message, extracting the poll results from the reply and placing the poll within a new message along with the extracted poll results. Thereafter, the new message can be sent to the select group.

Abstract: A transformation engine is disclosed that retrieves source data from a plurality of disparate data sources and provides source data that is consistent and normalized. the transformation engine comprises a plurality of interfaces that receive source data from a plurality of disparate databases. The source data comprises a plurality of data elements. The transformation engine further comprises a converter that aggregates and converts the received source data so that the plurality of data elements are recognizable as being substantially equivalent; a data processor that formats the received source data by merging and preparing the received source data; and a business rule applicator that filters the received source data.

Abstract: A computer program product comprises a computer useable medium. The computer useable medium has a computer readable program such that when the computer readable medium is executed on a computer, the computer is caused to provide a data interface between an adapter component and one or more application interface components for a runtime application. Further, the computer is caused to establish a cursor that iterates over a plurality of data objects within a data set of the runtime application. In addition, the computer is caused to establish an accessor that provides access to a data element of the data object. The computer is also caused to provide the cursor and the accessor to the adapter component so that the adapter component accesses data through the one or more application interface components of the runtime application.

Abstract: Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed.

Abstract: The present application provides a PeopleFinder system, a related method and a PeopleFinder device for enabling smart and more efficient contacting for enterprise professionals. The present application enables building a multi-stage search query with one or more combinations of possible search fields in a contact record or resource information records such as conference rooms, special purpose rooms, copiers or printers, and the like. Upon retrieving the search results from a server that is connected to an enterprise directory server the search results are presented on a mobile device along with adaptation of the results using location information. The invention enables the search results to display enterprise contact or resource records based on employees or resources that may be near the user performing the search.

Abstract: An aspect of the present invention simplifies generating a star schema from a snowflake schema. In an embodiment, a user first specifies fact tables to be included in a star schema, and a synchronization tool inspects the snowflake schema to determine the dimension tables linked to the specified fact tables. The determined dimension tables are included in the star schema sought to be generated.

Abstract: A computer implemented method and system provide for automatic selection and extraction of metadata and media content from projects in a craft tool. Automated identification, classification and management of such metadata and content is provided using including techniques such as pattern recognition for audio and visual content. The automatic tracking and centralised storage of metadata and content for compliance purposes can be facilitated, and can enable querying of organized metadata stored in a central database. In an example, metadata and media content are extracted automatically from a project in a craft tool at a client system and are forwarded to a host system for the creation of a cue sheet including timings for media files from timing metadata in a project file to create the timings on the cue sheet.

Abstract: In one example embodiment, a method can include determining resource time data for an update contact data record corresponding to a state of a given resource in a distributed contact center system. A repository can be queried for conflicting data records associated with the given resource based on the resource time data. Any inconsistency for the resource time data can be resolved based on results to the querying and the update contact data record.

Abstract: A system, method, and computer program product are provided for permitting an upgrade of extract, transform, and load (ETL) processes, independent of a customization performed by a user. In operation, one or more ETL processes are identified. Additionally, a user is permitted to customize the one or more ETL processes. Further, an upgrade of the one or more ETL processes is permitted and enabled.

Abstract: A method for enhancing computer data backup includes storing identifications and corresponding functionalities for a plurality of storage devices in a database. A storage device that is in data communication with a computer that is to be backed up is selected. An identification of the storage device selected for use in the backup is determined. If functionalities for the selected storage device are contained in the database, then at least one of the functionalities for the selected storage device is used to enhance a data backup to the selected storage device. If functionalities for the selected storage device are not contained in the database, then the selected storage device can be queried in an attempt to match it to one of the storage devices contained in the database, so that functionalities for the storage device contained within the database can be used to enhance data backup.

Abstract: A method for producing a summary A of data points in an unaggregated data stream wherein the data points are in the form of weighted keys (a, w) where a is a key and w is a weight, and the summary is a sample of k keys a with adjusted weights wa. A first reservoir L includes keys having adjusted weights which are additions of weights of individual data points of included keys and a second reservoir T includes keys having adjusted weights which are each equal to a threshold value ? whose value is adjusted based upon tests of new data points arriving in the data stream. The summary combines the keys and adjusted weights of the first reservoir L with the keys and adjusted weights of the second reservoir T to form the sample representing the data stream upon which further analysis may be performed.

Abstract: The subject disclosure pertains to databases as well as generation and utilization of keys. A desired or default number of values can be requested from a domain and allocated for use. These values can be utilized to generate surrogate keys. Subsequently or concurrently, the keys can be employed with respect to operations such as single pass loading of databases and/or data warehouses. Any unused keys can be returned and made available for use by other users or processes. Furthermore, the key generation functionality can be provided outside a database thereby relieving a database system of this burden.

Abstract: An inventory control system for a digital signage network is provided that uses a denormalized relational database to maintain a record of each of a plurality of screen zones for displays of the network. An inventory column in the database may be used to track scheduling assignments for each day of a calendar year. A screen zone may be given a collective duration limit that prevents assignment of media content items to that screen zone if the assignment would cause the limit to be exceeded for any of the days in the scheduling request. A screen zone may also be designated as overbookable to allow a scheduling assignment even if the limit is exceeded, or may be designated as partially bookable to allow the assignment of media content items for only those days specified in the request for which the limit would not be exceeded.

Abstract: Various embodiments of the present invention relate to oblivious transfer protocols and to system for performing oblivious transfer. Embodiments of the present invention include a private data sampling protocol that is designed to balance the competing privacy interest of a database user and a database owner. Protocol embodiments enable the database user to obtain a fixed size random sample of the available data held by the database owner without the database owner learning which bits of data were accessed.

Abstract: A sequence online analytical processing (S-OLAP) system 50 for analysing an event database (41) storing events (12), the system (50) comprising: an S-OLAP engine (53) to compute an S-cuboid (49) for a query on the event database (41); a sequence query engine (54) to form part of the S-cuboid (49) by performing the steps of: selection, clustering, sequence formation and sequence grouping; a cuboid repository (52) to store computed S-cuboids (49) and to be searched by the S-OLAP engine (53) for an S-cuboid query to determine whether an S-cuboid has previously been computed; and a sequence cache (56) to cache constructed sequence groups.

Abstract: A system, method, and computer-readable medium that facilitate in-database supervised discretisation mechanisms which improve data classification are provided. The disclosed mechanisms provide an efficient, automatic, and repeatable way to perform data discretisation without human intervention. Efficient processing of large and complex unknown data is provided that advantageously does not require the data being analyzed to be processed outside the database. The disclosed mechanisms may use an External Stored Procedure to avoid multiple joins of large tables and minimize the number of full table scans and, consequently, provide better performance than contemporary mechanisms. The disclosed system produces intermediate results in tables which may be conveyed to a visualization subsystem thereby providing users a better understanding of the data distribution in each category.

Abstract: A method to prepare an Extensible Business Reporting Language (XBRL) document in a web-hosted server includes authenticating a user, uploading financial information from a spreadsheet, storing the information, and processing the data into an XBRL compliant document for transmittal to a financial regulatory agency. The process takes an input from an Excel™ spreadsheet and produces a financial statement in XBRL format while providing a full audit trail for the document conversion and authorization including manual inputs to the final-form submission.

Abstract: A minimized journaling mechanism stores minimized journal data in a format that allows for display and outputting the journal data in human-readable form. When a change to a record occurs, instead of writing only the changed bytes, all of the bytes in each field that changed are written to the journal, along with all of the bytes in each field selected to be always journaled. A default object is created with default data in all of the fields. When the journal entry needs to be output in human-readable form, the default object is read, and the minimized journal entry is then overlaid on the default object. The result is an object that contains default data in all non-selected fields that were not changed, with the journal data in all fields and that did change and in all fields that were selected to always be journaled.

Abstract: A firmware repository includes an Extensible Markup Language (XML) description file. A system and method for managing the repository is described.

Abstract: A system, method, and computer-readable medium that facilitate in-database supervised discretization mechanisms which improve data classification are provided. The disclosed mechanisms provide an efficient, automatic, and repeatable way to perform data discretization without human intervention. Efficient processing of large and complex unknown data is provided that advantageously does not require the data being analyzed to be processed outside the database. The disclosed mechanisms may use an External Stored Procedure to avoid multiple joins of large tables and minimize the number of full table scans and, consequently, provide better performance than contemporary mechanisms. The disclosed system produces intermediate results in tables which may be conveyed to a visualization subsystem thereby providing users a better understanding of the data distribution in each category.

Abstract: A system and methodology that provide schema inferencing at runtime. An inference component receives as an input an input data stream, and processes the input data stream at runtime to develop a schema based on actual values thereof. The inferred schema is then used to create an inferred output data that is a specialized representation of the input stream data, which can then be accessed efficiently and conveniently.

Abstract: A system, method, and computer readable medium that facilitate operation of a file system capable of dividing an existing homogeneous file system into a series of regions, with each region accommodating storage devices having compatible characteristics are provided. The file system is divided into logical regions, with each region containing a particular class of storage devices possessing a particular set of common storage traits. The regionalization of the file system provides for all cylinders of storage devices sharing a common storage characteristic to be contained within a single region, and dedicated file system logic can be written to service that region. A master index configuration implemented in accordance with disclosed embodiments includes a region descriptor construct that enables cylinder index descriptors associated with cylinders of storage devices sharing a common storage characteristic to be grouped into regions.

Abstract: One or more databases may be created through an array of onomastic convolutions performed on lists of names. The creation of one or more databases may result in an array correlating individual onomastic elements and normalized probabilities that the onomastic elements belong to various categorizations. A software program preferably determines all possible onomastic elements within a selected name that may be useful in determining a selected name's categorization. The software program preferably takes the onomastic elements from the selected name and compares the onomastic elements to the one or more databases. The software program preferably executes the one or more algorithms and selects categorizations with the highest probability of matching the onomastic elements. The results of the matching process preferably are displayed to the user in one or more formats depending upon the user's preferences.

Abstract: Methods and apparatus are provided for mapping XML source documents to target documents using schema embeddings. According to one aspect of the invention, one or more edges in the one or more source schemas are mapped to one or more paths in at least one target schema. The disclosed mapping techniques ensure that (i) one or more source documents that conform to one or more of the source schemas can be recovered from one or more target documents that conform to the at least one target schema, if a mapping exists between the one or more of the source schemas and the at least one target schema; (ii) queries on one or more source documents that conform to one or more of the source schemas in a given query language can be answered on one or more target documents that conform to the at least one target schema; and (iii) the one or more target documents conform to a target schema.

Abstract: An embodiment of the present invention is a technique to localize content management of media content assets. A local content is received at a regional media center. The local content corresponds to an event localized within a locality. The local content is prepared into an asset using a media content management system. An asset package containing the asset is propagated to a head-end for distribution to a subscriber in the locality. In another embodiment of the invention, an asset package containing an asset and asset attributes is received from a propagation unit. The asset is created from a local content corresponding to an event localized within a locality. The asset is distributed to a subscriber in the locality.

Abstract: A minimized journaling mechanism stores minimized journal data in a format that allows for display and outputting the journal data in human-readable form. When a change to a record occurs, instead of writing only the changed bytes, all of the bytes in each field that changed are written to the journal, along with all of the bytes in each field selected to be always journaled. A default object is created with default data in all of the fields. When the journal entry needs to be output in human-readable form, the default object is read, and the minimized journal entry is then overlaid on the default object. The result is an object that contains default data in all non-selected fields that were not changed, with the journal data in all fields and that did change and in all fields that were selected to always be journaled.

Abstract: A data extraction tool is provided for cataloging information in an information source for searching by a user. The tool mines information from the information source and organizes the information, or the locations of that information, within a database. A user may then query the tool for a desired type of information. The tool filters the database to provide a set of pinpoint site locations with information of the type requested in the query. These pinpoint site locations are presented to a user and indexed for future reference. The index of site locations may be updated automatically by the tool. A context system is provided for manually or automatically determining the proper context for a user's query. Thus, the data extraction tool provides information with a high probability of relevance to the user. The user obtains the information without expending much effort to refine the search.

Abstract: In at least one embodiment of the invention, a primary storage facility is managed in an HSM system. Data is relocated from the primary storage facility to a secondary storage facility. A request is received from a client for only a portion of the relocated data. In response to the request, the requested portion of the data is obtained from the secondary storage facility and stored in the primary storage facility as a sparse file. The requested portion of the data is then provided to the client from the sparse file.

Abstract: A local search engine geographically indexes information for searching by identifying a geocoded web page of a web site and identifying at least one geocodable web page of the web site. The system identifies a geocode contained within content of the geocoded web page of the web site. The geocode indicates a physical location of an entity associated with the web site. The system indexes content of the geocoded web page and content of the geocodable web page. The indexing including associating the geocode contained within content of the geocoded web page to the indexed content of the geocoded web page and the geocodable web page to allow geographical searching of the content of the web pages.

Abstract: To provide services according to preference of a user by a computer even when the user reproduces content data by using a portable player as a reproduction apparatus; the portable player generates a reproduction history data of reproduction of a content data in a state of not connected to a charger, while when the portable player is connected to the charger, the reproduction history data is output from the portable player to the personal computer via the charger.

Abstract: The subject disclosure pertains to databases as well as generation and utilization of keys. A desired or default number of values can be requested from a domain and allocated for use. These values can be utilized to generate surrogate keys. Subsequently or concurrently, the keys can be employed with respect to operations such as single pass loading of databases and/or data warehouses. Any unused keys can be returned and made available for use by other users or processes. Furthermore, the key generation functionality can be provided outside a database thereby relieving a database system of this burden.